./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-11.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-11.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 44f3c78866341606a725ec4495ab49b41e658d35c89f21a87499e7ecc600588e --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 23:27:16,454 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:27:16,510 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 23:27:16,514 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:27:16,514 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:27:16,533 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:27:16,534 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:27:16,535 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:27:16,535 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:27:16,536 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:27:16,537 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:27:16,537 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:27:16,537 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:27:16,538 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:27:16,539 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:27:16,539 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:27:16,539 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:27:16,540 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:27:16,540 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 23:27:16,540 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:27:16,540 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:27:16,540 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:27:16,541 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:27:16,541 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:27:16,541 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:27:16,541 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:27:16,541 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:27:16,542 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:27:16,542 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:27:16,542 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:27:16,542 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:27:16,542 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:27:16,542 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:27:16,543 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:27:16,543 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:27:16,543 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:27:16,543 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 23:27:16,543 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 23:27:16,544 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:27:16,544 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:27:16,544 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:27:16,544 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:27:16,545 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 44f3c78866341606a725ec4495ab49b41e658d35c89f21a87499e7ecc600588e [2024-11-08 23:27:16,749 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:27:16,771 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:27:16,774 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:27:16,775 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:27:16,775 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:27:16,776 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-11.i [2024-11-08 23:27:17,976 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:27:18,135 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:27:18,135 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-11.i [2024-11-08 23:27:18,146 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b2101a45/1d03ba07f869419f82fbb92a0bff6bb8/FLAG4eb0d9498 [2024-11-08 23:27:18,156 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b2101a45/1d03ba07f869419f82fbb92a0bff6bb8 [2024-11-08 23:27:18,158 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:27:18,159 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:27:18,160 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:27:18,160 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:27:18,163 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:27:18,164 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:27:18" (1/1) ... [2024-11-08 23:27:18,165 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d7a47b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:27:18, skipping insertion in model container [2024-11-08 23:27:18,165 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:27:18" (1/1) ... [2024-11-08 23:27:18,190 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:27:18,328 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-11.i[916,929] [2024-11-08 23:27:18,387 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:27:18,397 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:27:18,408 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-11.i[916,929] [2024-11-08 23:27:18,468 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:27:18,482 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:27:18,482 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:27:18 WrapperNode [2024-11-08 23:27:18,482 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:27:18,483 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:27:18,483 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:27:18,483 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:27:18,488 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:27:18" (1/1) ... [2024-11-08 23:27:18,497 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:27:18" (1/1) ... [2024-11-08 23:27:18,532 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 292 [2024-11-08 23:27:18,532 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:27:18,533 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:27:18,533 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:27:18,533 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:27:18,541 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:27:18" (1/1) ... [2024-11-08 23:27:18,541 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:27:18" (1/1) ... [2024-11-08 23:27:18,545 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:27:18" (1/1) ... [2024-11-08 23:27:18,559 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 23:27:18,560 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:27:18" (1/1) ... [2024-11-08 23:27:18,560 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:27:18" (1/1) ... [2024-11-08 23:27:18,570 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:27:18" (1/1) ... [2024-11-08 23:27:18,573 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:27:18" (1/1) ... [2024-11-08 23:27:18,577 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:27:18" (1/1) ... [2024-11-08 23:27:18,580 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:27:18" (1/1) ... [2024-11-08 23:27:18,584 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:27:18,585 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:27:18,585 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:27:18,585 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:27:18,586 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:27:18" (1/1) ... [2024-11-08 23:27:18,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:27:18,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:27:18,610 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 23:27:18,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 23:27:18,647 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:27:18,648 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:27:18,648 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:27:18,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 23:27:18,649 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:27:18,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:27:18,735 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:27:18,737 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:27:19,221 INFO L? ?]: Removed 35 outVars from TransFormulas that were not future-live. [2024-11-08 23:27:19,222 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:27:19,234 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:27:19,235 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:27:19,235 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:27:19 BoogieIcfgContainer [2024-11-08 23:27:19,235 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:27:19,236 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:27:19,236 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:27:19,239 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:27:19,239 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:27:18" (1/3) ... [2024-11-08 23:27:19,240 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54c0a9e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:27:19, skipping insertion in model container [2024-11-08 23:27:19,240 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:27:18" (2/3) ... [2024-11-08 23:27:19,240 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54c0a9e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:27:19, skipping insertion in model container [2024-11-08 23:27:19,240 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:27:19" (3/3) ... [2024-11-08 23:27:19,242 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-11.i [2024-11-08 23:27:19,253 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:27:19,253 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:27:19,298 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:27:19,302 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@70826ea4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:27:19,303 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:27:19,306 INFO L276 IsEmpty]: Start isEmpty. Operand has 115 states, 92 states have (on average 1.5108695652173914) internal successors, (139), 93 states have internal predecessors, (139), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-08 23:27:19,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-08 23:27:19,315 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:27:19,316 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:27:19,316 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:27:19,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:27:19,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1791764808, now seen corresponding path program 1 times [2024-11-08 23:27:19,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:27:19,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482803691] [2024-11-08 23:27:19,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:27:19,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:27:19,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:19,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:27:19,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:19,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:27:19,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:19,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:27:19,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:19,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:27:19,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:19,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 23:27:19,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:19,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:27:19,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:19,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:27:19,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:19,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 23:27:19,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:19,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:27:19,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:19,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 23:27:19,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:19,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:27:19,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:19,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 23:27:19,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:19,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 23:27:19,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:19,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 23:27:19,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:19,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 23:27:19,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:19,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 23:27:19,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:19,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 23:27:19,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:19,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 23:27:19,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:19,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 23:27:19,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:19,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 23:27:19,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:19,702 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-08 23:27:19,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:27:19,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482803691] [2024-11-08 23:27:19,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482803691] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:27:19,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:27:19,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:27:19,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881294144] [2024-11-08 23:27:19,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:27:19,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:27:19,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:27:19,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:27:19,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:27:19,766 INFO L87 Difference]: Start difference. First operand has 115 states, 92 states have (on average 1.5108695652173914) internal successors, (139), 93 states have internal predecessors, (139), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-08 23:27:19,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:27:19,825 INFO L93 Difference]: Finished difference Result 223 states and 372 transitions. [2024-11-08 23:27:19,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:27:19,831 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 148 [2024-11-08 23:27:19,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:27:19,839 INFO L225 Difference]: With dead ends: 223 [2024-11-08 23:27:19,840 INFO L226 Difference]: Without dead ends: 111 [2024-11-08 23:27:19,844 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:27:19,847 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:27:19,848 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:27:19,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-08 23:27:19,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-11-08 23:27:19,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 89 states have (on average 1.4831460674157304) internal successors, (132), 89 states have internal predecessors, (132), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-08 23:27:19,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 172 transitions. [2024-11-08 23:27:19,891 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 172 transitions. Word has length 148 [2024-11-08 23:27:19,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:27:19,893 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 172 transitions. [2024-11-08 23:27:19,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-08 23:27:19,894 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 172 transitions. [2024-11-08 23:27:19,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-08 23:27:19,897 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:27:19,897 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:27:19,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 23:27:19,897 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:27:19,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:27:19,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1571453376, now seen corresponding path program 1 times [2024-11-08 23:27:19,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:27:19,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529634650] [2024-11-08 23:27:19,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:27:19,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:27:19,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:20,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:27:20,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:20,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:27:20,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:20,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:27:20,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:20,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:27:20,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:20,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 23:27:20,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:20,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:27:20,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:20,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:27:20,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:20,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 23:27:20,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:20,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:27:20,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:20,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 23:27:20,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:20,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:27:20,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:20,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 23:27:20,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:20,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 23:27:20,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:20,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 23:27:20,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:20,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 23:27:20,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:20,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 23:27:20,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:20,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 23:27:20,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:20,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 23:27:20,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:20,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 23:27:20,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:20,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 23:27:20,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:20,226 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-08 23:27:20,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:27:20,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529634650] [2024-11-08 23:27:20,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529634650] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:27:20,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:27:20,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 23:27:20,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444908514] [2024-11-08 23:27:20,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:27:20,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 23:27:20,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:27:20,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 23:27:20,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 23:27:20,232 INFO L87 Difference]: Start difference. First operand 111 states and 172 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-08 23:27:20,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:27:20,268 INFO L93 Difference]: Finished difference Result 220 states and 343 transitions. [2024-11-08 23:27:20,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 23:27:20,269 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 148 [2024-11-08 23:27:20,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:27:20,272 INFO L225 Difference]: With dead ends: 220 [2024-11-08 23:27:20,272 INFO L226 Difference]: Without dead ends: 112 [2024-11-08 23:27:20,273 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 23:27:20,275 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 4 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:27:20,276 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 334 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:27:20,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-08 23:27:20,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-11-08 23:27:20,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 90 states have (on average 1.4777777777777779) internal successors, (133), 90 states have internal predecessors, (133), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-08 23:27:20,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 173 transitions. [2024-11-08 23:27:20,291 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 173 transitions. Word has length 148 [2024-11-08 23:27:20,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:27:20,292 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 173 transitions. [2024-11-08 23:27:20,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-08 23:27:20,292 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 173 transitions. [2024-11-08 23:27:20,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-08 23:27:20,295 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:27:20,295 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:27:20,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 23:27:20,295 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:27:20,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:27:20,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1900778094, now seen corresponding path program 1 times [2024-11-08 23:27:20,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:27:20,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353552979] [2024-11-08 23:27:20,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:27:20,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:27:20,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:20,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:27:20,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:20,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:27:20,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:20,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:27:20,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:20,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:27:20,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:20,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 23:27:20,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:20,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:27:20,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:20,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:27:20,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:20,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 23:27:20,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:20,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:27:20,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:20,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 23:27:20,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:20,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:27:20,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:20,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 23:27:20,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:20,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 23:27:20,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:20,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 23:27:20,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:20,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 23:27:20,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:20,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 23:27:20,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:20,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 23:27:20,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:20,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 23:27:20,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:20,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 23:27:20,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:20,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 23:27:20,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:20,468 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-08 23:27:20,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:27:20,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353552979] [2024-11-08 23:27:20,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353552979] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:27:20,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:27:20,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 23:27:20,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408287256] [2024-11-08 23:27:20,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:27:20,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 23:27:20,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:27:20,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 23:27:20,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 23:27:20,473 INFO L87 Difference]: Start difference. First operand 112 states and 173 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-08 23:27:20,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:27:20,518 INFO L93 Difference]: Finished difference Result 261 states and 401 transitions. [2024-11-08 23:27:20,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 23:27:20,519 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 149 [2024-11-08 23:27:20,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:27:20,521 INFO L225 Difference]: With dead ends: 261 [2024-11-08 23:27:20,523 INFO L226 Difference]: Without dead ends: 152 [2024-11-08 23:27:20,524 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 23:27:20,525 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 58 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:27:20,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 372 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:27:20,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-08 23:27:20,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 119. [2024-11-08 23:27:20,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 97 states have (on average 1.4845360824742269) internal successors, (144), 97 states have internal predecessors, (144), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-08 23:27:20,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 184 transitions. [2024-11-08 23:27:20,542 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 184 transitions. Word has length 149 [2024-11-08 23:27:20,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:27:20,545 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 184 transitions. [2024-11-08 23:27:20,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-08 23:27:20,545 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 184 transitions. [2024-11-08 23:27:20,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-08 23:27:20,548 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:27:20,548 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:27:20,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 23:27:20,549 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:27:20,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:27:20,553 INFO L85 PathProgramCache]: Analyzing trace with hash -312430192, now seen corresponding path program 1 times [2024-11-08 23:27:20,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:27:20,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448931151] [2024-11-08 23:27:20,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:27:20,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:27:20,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:20,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:27:20,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:20,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:27:20,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:20,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:27:20,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:20,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:27:20,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:20,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 23:27:20,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:20,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:27:20,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:20,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:27:20,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:20,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 23:27:20,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:20,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:27:20,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:20,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 23:27:20,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:20,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:27:20,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:20,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 23:27:20,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:20,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 23:27:20,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:20,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 23:27:20,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:21,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 23:27:21,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:21,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 23:27:21,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:21,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 23:27:21,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:21,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 23:27:21,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:21,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 23:27:21,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:21,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 23:27:21,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:21,033 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-08 23:27:21,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:27:21,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448931151] [2024-11-08 23:27:21,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448931151] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:27:21,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:27:21,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 23:27:21,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875987545] [2024-11-08 23:27:21,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:27:21,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 23:27:21,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:27:21,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 23:27:21,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 23:27:21,036 INFO L87 Difference]: Start difference. First operand 119 states and 184 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-08 23:27:21,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:27:21,405 INFO L93 Difference]: Finished difference Result 573 states and 887 transitions. [2024-11-08 23:27:21,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 23:27:21,406 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 149 [2024-11-08 23:27:21,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:27:21,410 INFO L225 Difference]: With dead ends: 573 [2024-11-08 23:27:21,412 INFO L226 Difference]: Without dead ends: 457 [2024-11-08 23:27:21,413 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-08 23:27:21,414 INFO L432 NwaCegarLoop]: 340 mSDtfsCounter, 457 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 949 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 23:27:21,416 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 949 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 23:27:21,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2024-11-08 23:27:21,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 312. [2024-11-08 23:27:21,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 269 states have (on average 1.5315985130111525) internal successors, (412), 269 states have internal predecessors, (412), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-08 23:27:21,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 492 transitions. [2024-11-08 23:27:21,439 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 492 transitions. Word has length 149 [2024-11-08 23:27:21,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:27:21,439 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 492 transitions. [2024-11-08 23:27:21,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-08 23:27:21,440 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 492 transitions. [2024-11-08 23:27:21,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-08 23:27:21,441 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:27:21,441 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:27:21,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 23:27:21,442 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:27:21,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:27:21,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1007012684, now seen corresponding path program 1 times [2024-11-08 23:27:21,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:27:21,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590219614] [2024-11-08 23:27:21,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:27:21,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:27:21,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:21,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:27:21,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:21,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:27:21,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:21,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:27:21,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:21,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:27:21,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:21,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 23:27:21,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:21,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:27:21,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:21,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:27:21,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:21,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 23:27:21,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:21,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:27:21,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:21,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 23:27:21,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:21,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:27:21,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:21,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 23:27:21,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:21,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 23:27:21,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:21,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 23:27:21,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:21,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 23:27:21,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:21,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 23:27:21,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:21,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 23:27:21,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:21,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 23:27:21,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:21,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 23:27:21,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:21,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 23:27:21,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:21,779 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-08 23:27:21,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:27:21,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590219614] [2024-11-08 23:27:21,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590219614] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:27:21,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:27:21,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 23:27:21,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010225316] [2024-11-08 23:27:21,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:27:21,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 23:27:21,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:27:21,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 23:27:21,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 23:27:21,782 INFO L87 Difference]: Start difference. First operand 312 states and 492 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-08 23:27:22,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:27:22,078 INFO L93 Difference]: Finished difference Result 625 states and 965 transitions. [2024-11-08 23:27:22,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 23:27:22,079 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 150 [2024-11-08 23:27:22,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:27:22,082 INFO L225 Difference]: With dead ends: 625 [2024-11-08 23:27:22,082 INFO L226 Difference]: Without dead ends: 509 [2024-11-08 23:27:22,083 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-11-08 23:27:22,083 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 693 mSDsluCounter, 688 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 693 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 23:27:22,084 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [693 Valid, 835 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 23:27:22,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2024-11-08 23:27:22,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 454. [2024-11-08 23:27:22,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 386 states have (on average 1.505181347150259) internal successors, (581), 386 states have internal predecessors, (581), 60 states have call successors, (60), 7 states have call predecessors, (60), 7 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-08 23:27:22,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 701 transitions. [2024-11-08 23:27:22,109 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 701 transitions. Word has length 150 [2024-11-08 23:27:22,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:27:22,109 INFO L471 AbstractCegarLoop]: Abstraction has 454 states and 701 transitions. [2024-11-08 23:27:22,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-08 23:27:22,109 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 701 transitions. [2024-11-08 23:27:22,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-08 23:27:22,111 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:27:22,111 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:27:22,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 23:27:22,111 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:27:22,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:27:22,111 INFO L85 PathProgramCache]: Analyzing trace with hash -584310858, now seen corresponding path program 1 times [2024-11-08 23:27:22,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:27:22,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818317917] [2024-11-08 23:27:22,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:27:22,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:27:22,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:22,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:27:22,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:22,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:27:22,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:22,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:27:22,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:22,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:27:22,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:22,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 23:27:22,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:22,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:27:22,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:22,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:27:22,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:22,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 23:27:22,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:22,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:27:22,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:22,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 23:27:22,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:22,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:27:22,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:22,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 23:27:22,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:22,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 23:27:22,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:22,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 23:27:22,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:22,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 23:27:22,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:22,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 23:27:22,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:22,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 23:27:22,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:22,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 23:27:22,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:22,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 23:27:22,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:22,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 23:27:22,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:22,418 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-08 23:27:22,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:27:22,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818317917] [2024-11-08 23:27:22,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818317917] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:27:22,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:27:22,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 23:27:22,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856924909] [2024-11-08 23:27:22,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:27:22,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 23:27:22,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:27:22,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 23:27:22,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 23:27:22,420 INFO L87 Difference]: Start difference. First operand 454 states and 701 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-08 23:27:22,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:27:22,639 INFO L93 Difference]: Finished difference Result 1201 states and 1854 transitions. [2024-11-08 23:27:22,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 23:27:22,640 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 150 [2024-11-08 23:27:22,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:27:22,643 INFO L225 Difference]: With dead ends: 1201 [2024-11-08 23:27:22,643 INFO L226 Difference]: Without dead ends: 750 [2024-11-08 23:27:22,644 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-08 23:27:22,645 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 176 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 23:27:22,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 691 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 23:27:22,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2024-11-08 23:27:22,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 523. [2024-11-08 23:27:22,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 432 states have (on average 1.4907407407407407) internal successors, (644), 432 states have internal predecessors, (644), 80 states have call successors, (80), 10 states have call predecessors, (80), 10 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2024-11-08 23:27:22,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 804 transitions. [2024-11-08 23:27:22,687 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 804 transitions. Word has length 150 [2024-11-08 23:27:22,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:27:22,688 INFO L471 AbstractCegarLoop]: Abstraction has 523 states and 804 transitions. [2024-11-08 23:27:22,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-08 23:27:22,688 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 804 transitions. [2024-11-08 23:27:22,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-08 23:27:22,690 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:27:22,691 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:27:22,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 23:27:22,691 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:27:22,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:27:22,692 INFO L85 PathProgramCache]: Analyzing trace with hash -633232886, now seen corresponding path program 1 times [2024-11-08 23:27:22,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:27:22,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27870251] [2024-11-08 23:27:22,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:27:22,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:27:22,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:23,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:27:23,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:23,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:27:23,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:23,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:27:23,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:23,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:27:23,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:23,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 23:27:23,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:23,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:27:23,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:23,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:27:23,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:23,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 23:27:23,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:23,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:27:23,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:23,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 23:27:23,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:23,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:27:23,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:23,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 23:27:23,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:23,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 23:27:23,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:23,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 23:27:23,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:23,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 23:27:23,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:23,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 23:27:23,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:23,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 23:27:23,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:23,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 23:27:23,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:23,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 23:27:23,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:23,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 23:27:23,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:23,092 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-08 23:27:23,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:27:23,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27870251] [2024-11-08 23:27:23,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27870251] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:27:23,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:27:23,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 23:27:23,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085116548] [2024-11-08 23:27:23,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:27:23,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 23:27:23,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:27:23,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 23:27:23,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 23:27:23,094 INFO L87 Difference]: Start difference. First operand 523 states and 804 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-08 23:27:23,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:27:23,330 INFO L93 Difference]: Finished difference Result 1735 states and 2688 transitions. [2024-11-08 23:27:23,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 23:27:23,330 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 150 [2024-11-08 23:27:23,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:27:23,335 INFO L225 Difference]: With dead ends: 1735 [2024-11-08 23:27:23,335 INFO L226 Difference]: Without dead ends: 1267 [2024-11-08 23:27:23,336 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 23:27:23,336 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 235 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 23:27:23,337 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 538 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 23:27:23,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1267 states. [2024-11-08 23:27:23,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1267 to 1145. [2024-11-08 23:27:23,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1145 states, 987 states have (on average 1.502532928064843) internal successors, (1483), 987 states have internal predecessors, (1483), 140 states have call successors, (140), 17 states have call predecessors, (140), 17 states have return successors, (140), 140 states have call predecessors, (140), 140 states have call successors, (140) [2024-11-08 23:27:23,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1145 states to 1145 states and 1763 transitions. [2024-11-08 23:27:23,407 INFO L78 Accepts]: Start accepts. Automaton has 1145 states and 1763 transitions. Word has length 150 [2024-11-08 23:27:23,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:27:23,407 INFO L471 AbstractCegarLoop]: Abstraction has 1145 states and 1763 transitions. [2024-11-08 23:27:23,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-08 23:27:23,408 INFO L276 IsEmpty]: Start isEmpty. Operand 1145 states and 1763 transitions. [2024-11-08 23:27:23,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-08 23:27:23,409 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:27:23,409 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:27:23,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 23:27:23,410 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:27:23,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:27:23,410 INFO L85 PathProgramCache]: Analyzing trace with hash -89615343, now seen corresponding path program 1 times [2024-11-08 23:27:23,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:27:23,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662257625] [2024-11-08 23:27:23,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:27:23,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:27:23,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:23,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:27:23,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:23,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:27:23,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:23,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:27:23,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:23,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:27:23,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:23,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 23:27:23,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:23,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:27:23,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:23,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:27:23,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:23,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 23:27:23,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:23,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:27:23,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:23,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 23:27:23,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:23,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:27:23,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:23,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 23:27:23,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:23,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 23:27:23,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:23,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 23:27:23,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:23,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 23:27:23,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:23,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 23:27:23,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:23,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 23:27:23,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:23,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 23:27:23,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:23,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 23:27:23,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:23,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 23:27:23,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:23,575 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-08 23:27:23,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:27:23,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662257625] [2024-11-08 23:27:23,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662257625] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:27:23,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:27:23,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 23:27:23,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384669740] [2024-11-08 23:27:23,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:27:23,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 23:27:23,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:27:23,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 23:27:23,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 23:27:23,577 INFO L87 Difference]: Start difference. First operand 1145 states and 1763 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-08 23:27:23,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:27:23,786 INFO L93 Difference]: Finished difference Result 3058 states and 4732 transitions. [2024-11-08 23:27:23,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 23:27:23,787 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 152 [2024-11-08 23:27:23,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:27:23,793 INFO L225 Difference]: With dead ends: 3058 [2024-11-08 23:27:23,794 INFO L226 Difference]: Without dead ends: 1968 [2024-11-08 23:27:23,796 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 23:27:23,796 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 238 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 23:27:23,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 559 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 23:27:23,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1968 states. [2024-11-08 23:27:23,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1968 to 1862. [2024-11-08 23:27:23,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1862 states, 1637 states have (on average 1.5088576664630422) internal successors, (2470), 1637 states have internal predecessors, (2470), 200 states have call successors, (200), 24 states have call predecessors, (200), 24 states have return successors, (200), 200 states have call predecessors, (200), 200 states have call successors, (200) [2024-11-08 23:27:23,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1862 states to 1862 states and 2870 transitions. [2024-11-08 23:27:23,886 INFO L78 Accepts]: Start accepts. Automaton has 1862 states and 2870 transitions. Word has length 152 [2024-11-08 23:27:23,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:27:23,887 INFO L471 AbstractCegarLoop]: Abstraction has 1862 states and 2870 transitions. [2024-11-08 23:27:23,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-08 23:27:23,887 INFO L276 IsEmpty]: Start isEmpty. Operand 1862 states and 2870 transitions. [2024-11-08 23:27:23,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-08 23:27:23,888 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:27:23,889 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:27:23,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 23:27:23,889 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:27:23,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:27:23,889 INFO L85 PathProgramCache]: Analyzing trace with hash -579403484, now seen corresponding path program 1 times [2024-11-08 23:27:23,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:27:23,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922518979] [2024-11-08 23:27:23,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:27:23,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:27:23,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:24,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:27:24,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:24,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:27:24,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:24,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:27:24,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:24,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:27:24,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:24,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 23:27:24,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:24,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:27:24,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:24,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:27:24,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:24,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 23:27:24,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:24,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:27:24,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:24,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 23:27:24,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:24,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:27:24,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:24,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 23:27:24,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:24,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 23:27:24,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:24,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 23:27:24,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:24,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 23:27:24,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:24,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 23:27:24,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:24,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 23:27:24,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:24,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 23:27:24,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:24,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 23:27:24,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:24,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 23:27:24,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:24,218 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-08 23:27:24,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:27:24,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922518979] [2024-11-08 23:27:24,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922518979] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:27:24,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:27:24,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 23:27:24,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66814615] [2024-11-08 23:27:24,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:27:24,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 23:27:24,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:27:24,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 23:27:24,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 23:27:24,220 INFO L87 Difference]: Start difference. First operand 1862 states and 2870 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-08 23:27:24,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:27:24,480 INFO L93 Difference]: Finished difference Result 4302 states and 6596 transitions. [2024-11-08 23:27:24,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 23:27:24,481 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 154 [2024-11-08 23:27:24,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:27:24,489 INFO L225 Difference]: With dead ends: 4302 [2024-11-08 23:27:24,489 INFO L226 Difference]: Without dead ends: 2520 [2024-11-08 23:27:24,492 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 23:27:24,492 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 162 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 23:27:24,492 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 433 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 23:27:24,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2520 states. [2024-11-08 23:27:24,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2520 to 2399. [2024-11-08 23:27:24,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2399 states, 2174 states have (on average 1.499540018399264) internal successors, (3260), 2174 states have internal predecessors, (3260), 200 states have call successors, (200), 24 states have call predecessors, (200), 24 states have return successors, (200), 200 states have call predecessors, (200), 200 states have call successors, (200) [2024-11-08 23:27:24,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2399 states to 2399 states and 3660 transitions. [2024-11-08 23:27:24,634 INFO L78 Accepts]: Start accepts. Automaton has 2399 states and 3660 transitions. Word has length 154 [2024-11-08 23:27:24,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:27:24,635 INFO L471 AbstractCegarLoop]: Abstraction has 2399 states and 3660 transitions. [2024-11-08 23:27:24,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-08 23:27:24,635 INFO L276 IsEmpty]: Start isEmpty. Operand 2399 states and 3660 transitions. [2024-11-08 23:27:24,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-08 23:27:24,637 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:27:24,637 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:27:24,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 23:27:24,637 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:27:24,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:27:24,637 INFO L85 PathProgramCache]: Analyzing trace with hash -2101533465, now seen corresponding path program 1 times [2024-11-08 23:27:24,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:27:24,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524226948] [2024-11-08 23:27:24,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:27:24,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:27:24,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:24,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:27:24,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:24,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:27:24,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:24,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:27:24,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:24,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:27:24,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:24,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 23:27:24,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:24,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:27:24,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:24,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:27:24,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:24,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 23:27:24,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:24,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:27:24,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:24,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 23:27:24,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:24,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:27:24,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:24,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 23:27:24,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:24,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 23:27:24,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:24,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 23:27:24,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:24,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 23:27:24,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:24,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 23:27:24,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:24,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 23:27:24,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:24,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 23:27:24,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:24,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 23:27:24,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:24,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 23:27:24,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:24,829 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-08 23:27:24,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:27:24,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524226948] [2024-11-08 23:27:24,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524226948] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:27:24,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:27:24,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 23:27:24,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391759968] [2024-11-08 23:27:24,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:27:24,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 23:27:24,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:27:24,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 23:27:24,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 23:27:24,830 INFO L87 Difference]: Start difference. First operand 2399 states and 3660 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-08 23:27:24,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:27:24,934 INFO L93 Difference]: Finished difference Result 4792 states and 7313 transitions. [2024-11-08 23:27:24,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 23:27:24,935 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 156 [2024-11-08 23:27:24,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:27:24,942 INFO L225 Difference]: With dead ends: 4792 [2024-11-08 23:27:24,942 INFO L226 Difference]: Without dead ends: 2449 [2024-11-08 23:27:24,945 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 23:27:24,946 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 2 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:27:24,946 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 502 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:27:24,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2449 states. [2024-11-08 23:27:25,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2449 to 2449. [2024-11-08 23:27:25,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2449 states, 2224 states have (on average 1.4923561151079137) internal successors, (3319), 2224 states have internal predecessors, (3319), 200 states have call successors, (200), 24 states have call predecessors, (200), 24 states have return successors, (200), 200 states have call predecessors, (200), 200 states have call successors, (200) [2024-11-08 23:27:25,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2449 states to 2449 states and 3719 transitions. [2024-11-08 23:27:25,040 INFO L78 Accepts]: Start accepts. Automaton has 2449 states and 3719 transitions. Word has length 156 [2024-11-08 23:27:25,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:27:25,041 INFO L471 AbstractCegarLoop]: Abstraction has 2449 states and 3719 transitions. [2024-11-08 23:27:25,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-08 23:27:25,041 INFO L276 IsEmpty]: Start isEmpty. Operand 2449 states and 3719 transitions. [2024-11-08 23:27:25,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-08 23:27:25,042 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:27:25,043 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:27:25,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 23:27:25,043 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:27:25,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:27:25,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1349428329, now seen corresponding path program 1 times [2024-11-08 23:27:25,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:27:25,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166904655] [2024-11-08 23:27:25,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:27:25,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:27:25,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:25,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:27:25,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:25,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:27:25,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:25,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:27:25,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:25,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:27:25,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:25,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 23:27:25,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:25,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:27:25,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:25,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:27:25,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:25,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 23:27:25,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:25,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:27:25,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:25,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 23:27:25,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:25,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:27:25,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:25,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 23:27:25,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:25,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 23:27:25,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:25,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 23:27:25,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:25,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 23:27:25,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:25,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 23:27:25,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:25,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 23:27:25,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:25,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 23:27:25,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:25,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 23:27:25,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:25,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 23:27:25,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:25,253 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 12 proven. 45 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-08 23:27:25,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:27:25,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166904655] [2024-11-08 23:27:25,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166904655] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 23:27:25,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1045288418] [2024-11-08 23:27:25,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:27:25,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:27:25,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:27:25,255 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 23:27:25,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 23:27:25,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:25,387 INFO L255 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-08 23:27:25,394 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:27:25,516 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 267 proven. 45 refuted. 0 times theorem prover too weak. 448 trivial. 0 not checked. [2024-11-08 23:27:25,516 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 23:27:25,626 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 12 proven. 45 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-08 23:27:25,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1045288418] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 23:27:25,626 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 23:27:25,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-08 23:27:25,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843105751] [2024-11-08 23:27:25,627 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 23:27:25,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 23:27:25,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:27:25,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 23:27:25,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 23:27:25,628 INFO L87 Difference]: Start difference. First operand 2449 states and 3719 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 2 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2024-11-08 23:27:25,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:27:25,844 INFO L93 Difference]: Finished difference Result 4886 states and 7387 transitions. [2024-11-08 23:27:25,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 23:27:25,845 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 2 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 156 [2024-11-08 23:27:25,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:27:25,853 INFO L225 Difference]: With dead ends: 4886 [2024-11-08 23:27:25,853 INFO L226 Difference]: Without dead ends: 2493 [2024-11-08 23:27:25,857 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 349 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-08 23:27:25,858 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 234 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 23:27:25,858 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 364 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 23:27:25,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2493 states. [2024-11-08 23:27:25,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2493 to 2439. [2024-11-08 23:27:25,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2439 states, 2204 states have (on average 1.471869328493648) internal successors, (3244), 2204 states have internal predecessors, (3244), 200 states have call successors, (200), 34 states have call predecessors, (200), 34 states have return successors, (200), 200 states have call predecessors, (200), 200 states have call successors, (200) [2024-11-08 23:27:25,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2439 states to 2439 states and 3644 transitions. [2024-11-08 23:27:25,970 INFO L78 Accepts]: Start accepts. Automaton has 2439 states and 3644 transitions. Word has length 156 [2024-11-08 23:27:25,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:27:25,970 INFO L471 AbstractCegarLoop]: Abstraction has 2439 states and 3644 transitions. [2024-11-08 23:27:25,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 2 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2024-11-08 23:27:25,970 INFO L276 IsEmpty]: Start isEmpty. Operand 2439 states and 3644 transitions. [2024-11-08 23:27:25,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-08 23:27:25,972 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:27:25,972 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:27:25,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 23:27:26,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-08 23:27:26,177 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:27:26,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:27:26,178 INFO L85 PathProgramCache]: Analyzing trace with hash -514338169, now seen corresponding path program 1 times [2024-11-08 23:27:26,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:27:26,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474715913] [2024-11-08 23:27:26,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:27:26,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:27:26,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:27:26,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [291264270] [2024-11-08 23:27:26,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:27:26,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:27:26,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:27:26,320 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 23:27:26,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 23:27:26,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:27:26,441 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 23:27:26,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:27:26,587 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 23:27:26,588 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 23:27:26,589 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 23:27:26,606 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 23:27:26,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-08 23:27:26,793 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:27:26,893 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 23:27:26,896 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 11:27:26 BoogieIcfgContainer [2024-11-08 23:27:26,897 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 23:27:26,897 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 23:27:26,897 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 23:27:26,897 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 23:27:26,898 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:27:19" (3/4) ... [2024-11-08 23:27:26,899 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 23:27:26,900 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 23:27:26,900 INFO L158 Benchmark]: Toolchain (without parser) took 8741.88ms. Allocated memory was 197.1MB in the beginning and 413.1MB in the end (delta: 216.0MB). Free memory was 126.6MB in the beginning and 285.4MB in the end (delta: -158.8MB). Peak memory consumption was 59.2MB. Max. memory is 16.1GB. [2024-11-08 23:27:26,901 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 197.1MB. Free memory is still 153.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:27:26,901 INFO L158 Benchmark]: CACSL2BoogieTranslator took 322.93ms. Allocated memory is still 197.1MB. Free memory was 126.4MB in the beginning and 164.7MB in the end (delta: -38.2MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. [2024-11-08 23:27:26,901 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.11ms. Allocated memory is still 197.1MB. Free memory was 164.7MB in the beginning and 158.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 23:27:26,901 INFO L158 Benchmark]: Boogie Preprocessor took 51.96ms. Allocated memory is still 197.1MB. Free memory was 158.4MB in the beginning and 150.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-08 23:27:26,902 INFO L158 Benchmark]: RCFGBuilder took 649.90ms. Allocated memory is still 197.1MB. Free memory was 150.0MB in the beginning and 108.0MB in the end (delta: 41.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-11-08 23:27:26,902 INFO L158 Benchmark]: TraceAbstraction took 7660.30ms. Allocated memory was 197.1MB in the beginning and 413.1MB in the end (delta: 216.0MB). Free memory was 107.0MB in the beginning and 285.4MB in the end (delta: -178.5MB). Peak memory consumption was 37.4MB. Max. memory is 16.1GB. [2024-11-08 23:27:26,902 INFO L158 Benchmark]: Witness Printer took 3.12ms. Allocated memory is still 413.1MB. Free memory is still 285.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:27:26,903 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 197.1MB. Free memory is still 153.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 322.93ms. Allocated memory is still 197.1MB. Free memory was 126.4MB in the beginning and 164.7MB in the end (delta: -38.2MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.11ms. Allocated memory is still 197.1MB. Free memory was 164.7MB in the beginning and 158.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.96ms. Allocated memory is still 197.1MB. Free memory was 158.4MB in the beginning and 150.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 649.90ms. Allocated memory is still 197.1MB. Free memory was 150.0MB in the beginning and 108.0MB in the end (delta: 41.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 7660.30ms. Allocated memory was 197.1MB in the beginning and 413.1MB in the end (delta: 216.0MB). Free memory was 107.0MB in the beginning and 285.4MB in the end (delta: -178.5MB). Peak memory consumption was 37.4MB. Max. memory is 16.1GB. * Witness Printer took 3.12ms. Allocated memory is still 413.1MB. Free memory is still 285.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 189, overapproximation of bitwiseOr at line 189, overapproximation of bitwiseAnd at line 86. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 4.75; [L23] unsigned char var_1_2 = 0; [L24] signed long int var_1_6 = -4; [L25] double var_1_7 = 49.8; [L26] double var_1_8 = 255.625; [L27] unsigned short int var_1_9 = 10; [L28] unsigned short int var_1_11 = 10000; [L29] signed char var_1_12 = 100; [L30] signed char var_1_13 = 16; [L31] unsigned long int var_1_14 = 4; [L32] signed short int var_1_15 = -16; [L33] unsigned char var_1_17 = 5; [L34] double var_1_18 = 64.75; [L35] double var_1_19 = 99.5; [L36] unsigned long int var_1_20 = 32; [L37] unsigned long int var_1_22 = 32; [L38] unsigned long int var_1_23 = 2461517415; [L39] unsigned long int var_1_24 = 1399914902; [L40] unsigned char var_1_25 = 2; [L41] signed long int var_1_26 = 4; [L42] unsigned char var_1_27 = 0; [L43] unsigned short int var_1_28 = 32; [L44] unsigned short int var_1_29 = 36457; [L45] double last_1_var_1_1 = 4.75; [L46] unsigned short int last_1_var_1_9 = 10; [L47] unsigned short int last_1_var_1_11 = 10000; [L48] unsigned long int last_1_var_1_14 = 4; [L49] signed short int last_1_var_1_15 = -16; [L50] unsigned char last_1_var_1_17 = 5; [L51] double last_1_var_1_18 = 64.75; [L52] unsigned long int last_1_var_1_20 = 32; [L53] unsigned long int last_1_var_1_22 = 32; [L54] unsigned char last_1_var_1_25 = 2; [L55] signed long int last_1_var_1_26 = 4; [L56] unsigned short int last_1_var_1_28 = 32; VAL [isInitial=0, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=-4, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L193] isInitial = 1 [L194] FCALL initially() [L195] COND TRUE 1 [L196] CALL updateLastVariables() [L175] last_1_var_1_1 = var_1_1 [L176] last_1_var_1_9 = var_1_9 [L177] last_1_var_1_11 = var_1_11 [L178] last_1_var_1_14 = var_1_14 [L179] last_1_var_1_15 = var_1_15 [L180] last_1_var_1_17 = var_1_17 [L181] last_1_var_1_18 = var_1_18 [L182] last_1_var_1_20 = var_1_20 [L183] last_1_var_1_22 = var_1_22 [L184] last_1_var_1_25 = var_1_25 [L185] last_1_var_1_26 = var_1_26 [L186] last_1_var_1_28 = var_1_28 VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=-4, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L196] RET updateLastVariables() [L197] CALL updateVariables() [L142] var_1_2 = __VERIFIER_nondet_uchar() [L143] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_6=-4, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_6=-4, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L143] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_6=-4, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L144] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=-4, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=-4, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L144] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=-4, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L145] var_1_6 = __VERIFIER_nondet_long() [L146] CALL assume_abort_if_not(var_1_6 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L146] RET assume_abort_if_not(var_1_6 >= -2147483648) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L147] CALL assume_abort_if_not(var_1_6 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L147] RET assume_abort_if_not(var_1_6 <= 2147483647) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L148] CALL assume_abort_if_not(var_1_6 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L148] RET assume_abort_if_not(var_1_6 != 0) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L149] var_1_7 = __VERIFIER_nondet_double() [L150] CALL assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_8=2045/8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_8=2045/8, var_1_9=10] [L150] RET assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_8=2045/8, var_1_9=10] [L151] var_1_8 = __VERIFIER_nondet_double() [L152] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L152] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L153] var_1_12 = __VERIFIER_nondet_char() [L154] CALL assume_abort_if_not(var_1_12 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L154] RET assume_abort_if_not(var_1_12 >= -1) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L155] CALL assume_abort_if_not(var_1_12 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L155] RET assume_abort_if_not(var_1_12 <= 127) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L156] var_1_13 = __VERIFIER_nondet_char() [L157] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L157] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L158] CALL assume_abort_if_not(var_1_13 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L158] RET assume_abort_if_not(var_1_13 <= 127) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L159] var_1_19 = __VERIFIER_nondet_double() [L160] CALL assume_abort_if_not((var_1_19 >= -922337.2036854765600e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 9223372.036854765600e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L160] RET assume_abort_if_not((var_1_19 >= -922337.2036854765600e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 9223372.036854765600e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L161] var_1_23 = __VERIFIER_nondet_ulong() [L162] CALL assume_abort_if_not(var_1_23 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L162] RET assume_abort_if_not(var_1_23 >= 2147483647) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L163] CALL assume_abort_if_not(var_1_23 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L163] RET assume_abort_if_not(var_1_23 <= 4294967294) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L164] var_1_24 = __VERIFIER_nondet_ulong() [L165] CALL assume_abort_if_not(var_1_24 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L165] RET assume_abort_if_not(var_1_24 >= 1073741823) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L166] CALL assume_abort_if_not(var_1_24 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L166] RET assume_abort_if_not(var_1_24 <= 2147483647) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L167] var_1_27 = __VERIFIER_nondet_uchar() [L168] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L168] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L169] CALL assume_abort_if_not(var_1_27 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L169] RET assume_abort_if_not(var_1_27 <= 1) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L170] var_1_29 = __VERIFIER_nondet_ushort() [L171] CALL assume_abort_if_not(var_1_29 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=-32769, var_1_2=0, var_1_6=10000, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=-32769, var_1_2=0, var_1_6=10000, var_1_9=10] [L171] RET assume_abort_if_not(var_1_29 >= 32767) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=-32769, var_1_2=0, var_1_6=10000, var_1_9=10] [L172] CALL assume_abort_if_not(var_1_29 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=-32769, var_1_2=0, var_1_6=10000, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=-32769, var_1_2=0, var_1_6=10000, var_1_9=10] [L172] RET assume_abort_if_not(var_1_29 <= 65534) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=-32769, var_1_2=0, var_1_6=10000, var_1_9=10] [L197] RET updateVariables() [L198] CALL step() [L60] EXPR var_1_6 & 10000 VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=-32769, var_1_2=0, var_1_6=10000, var_1_9=10] [L60] signed long int stepLocal_0 = var_1_6 & 10000; [L61] EXPR (last_1_var_1_20 + last_1_var_1_15) | last_1_var_1_9 VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, stepLocal_0=10000, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=-32769, var_1_2=0, var_1_6=10000, var_1_9=10] [L61] COND TRUE ((last_1_var_1_20 + last_1_var_1_15) | last_1_var_1_9) < stepLocal_0 [L62] var_1_1 = var_1_7 VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=2, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=-32769, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_9=10] [L66] COND TRUE last_1_var_1_14 <= last_1_var_1_15 VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=2, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=-32769, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_9=10] [L67] COND TRUE ((last_1_var_1_26 % var_1_6) * (last_1_var_1_17 / 1000000000u)) >= ((((10u) < (var_1_13)) ? (10u) : (var_1_13))) [L68] var_1_14 = var_1_13 VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=2, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=-32769, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_9=10] [L75] COND FALSE !(last_1_var_1_20 > last_1_var_1_15) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=2, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=-32769, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_9=10] [L80] COND TRUE last_1_var_1_14 <= 16 [L81] var_1_9 = last_1_var_1_25 VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=2, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=-32769, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_9=2] [L84] unsigned long int stepLocal_5 = (3423867512u - var_1_13) - var_1_24; [L85] signed long int stepLocal_4 = 8; VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, stepLocal_4=8, stepLocal_5=2350125689, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=2, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=-32769, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_9=2] [L86] EXPR last_1_var_1_17 & ((((last_1_var_1_25) < 0 ) ? -(last_1_var_1_25) : (last_1_var_1_25))) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, stepLocal_4=8, stepLocal_5=2350125689, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=2, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=-32769, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_9=2] [L86] COND TRUE stepLocal_4 > (last_1_var_1_17 & ((((last_1_var_1_25) < 0 ) ? -(last_1_var_1_25) : (last_1_var_1_25)))) [L87] COND FALSE !(var_1_8 >= last_1_var_1_18) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, stepLocal_5=2350125689, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=2, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=-32769, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_9=2] [L95] EXPR last_1_var_1_11 >> var_1_14 VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, stepLocal_5=2350125689, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=2, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=-32769, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_9=2] [L95] COND FALSE !(! ((var_1_12 - var_1_13) <= (last_1_var_1_11 >> var_1_14))) [L98] signed char stepLocal_1 = var_1_13; VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, stepLocal_1=0, stepLocal_5=2350125689, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=2, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=-32769, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_9=2] [L99] COND TRUE (var_1_9 + var_1_25) >= stepLocal_1 [L100] var_1_18 = ((((var_1_7) > (((((var_1_8) > (var_1_19)) ? (var_1_8) : (var_1_19))))) ? (var_1_7) : (((((var_1_8) > (var_1_19)) ? (var_1_8) : (var_1_19)))))) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, stepLocal_5=2350125689, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-16, var_1_17=5, var_1_18=2, var_1_19=0, var_1_1=2, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=-32769, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_8=0, var_1_9=2] [L102] var_1_17 = var_1_13 VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, stepLocal_5=2350125689, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-16, var_1_17=0, var_1_18=2, var_1_19=0, var_1_1=2, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=-32769, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_8=0, var_1_9=2] [L103] COND TRUE ! var_1_2 [L104] var_1_22 = (var_1_23 - var_1_25) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, stepLocal_5=2350125689, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-16, var_1_17=0, var_1_18=2, var_1_19=0, var_1_1=2, var_1_20=32, var_1_22=-2147483651, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=-32769, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_8=0, var_1_9=2] [L108] COND TRUE var_1_7 >= 4.5 [L109] var_1_15 = (((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17))) - ((((var_1_13) > (var_1_25)) ? (var_1_13) : (var_1_25)))) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, stepLocal_5=2350125689, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-2, var_1_17=0, var_1_18=2, var_1_19=0, var_1_1=2, var_1_20=32, var_1_22=-2147483651, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=-32769, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_8=0, var_1_9=2] [L111] var_1_28 = (var_1_29 - (var_1_13 + ((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15))))) [L112] unsigned long int stepLocal_3 = var_1_22; [L113] signed char stepLocal_2 = var_1_13; VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, stepLocal_2=0, stepLocal_3=-2147483651, stepLocal_5=2350125689, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-2, var_1_17=0, var_1_18=2, var_1_19=0, var_1_1=2, var_1_20=32, var_1_22=-2147483651, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32765, var_1_29=-32769, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_8=0, var_1_9=2] [L114] COND TRUE stepLocal_2 == (var_1_6 * (var_1_12 - 64)) [L115] var_1_20 = var_1_17 VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, stepLocal_3=-2147483651, stepLocal_5=2350125689, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-2, var_1_17=0, var_1_18=2, var_1_19=0, var_1_1=2, var_1_20=0, var_1_22=-2147483651, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32765, var_1_29=-32769, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_8=0, var_1_9=2] [L125] unsigned long int stepLocal_7 = var_1_14; [L126] unsigned long int stepLocal_6 = var_1_23; VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, stepLocal_3=-2147483651, stepLocal_5=2350125689, stepLocal_6=-2147483649, stepLocal_7=0, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-2, var_1_17=0, var_1_18=2, var_1_19=0, var_1_1=2, var_1_20=0, var_1_22=-2147483651, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32765, var_1_29=-32769, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_8=0, var_1_9=2] [L127] COND FALSE !(\read(var_1_2)) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, stepLocal_3=-2147483651, stepLocal_5=2350125689, stepLocal_6=-2147483649, stepLocal_7=0, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-2, var_1_17=0, var_1_18=2, var_1_19=0, var_1_1=2, var_1_20=0, var_1_22=-2147483651, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32765, var_1_29=-32769, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_8=0, var_1_9=2] [L198] RET step() [L199] CALL, EXPR property() [L189] EXPR (last_1_var_1_20 + last_1_var_1_15) | last_1_var_1_9 VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-2, var_1_17=0, var_1_18=2, var_1_19=0, var_1_1=2, var_1_20=0, var_1_22=-2147483651, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32765, var_1_29=-32769, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_8=0, var_1_9=2] [L189] EXPR var_1_6 & 10000 VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-2, var_1_17=0, var_1_18=2, var_1_19=0, var_1_1=2, var_1_20=0, var_1_22=-2147483651, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32765, var_1_29=-32769, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_8=0, var_1_9=2] [L189] EXPR (((((last_1_var_1_20 + last_1_var_1_15) | last_1_var_1_9) < (var_1_6 & 10000)) ? (var_1_1 == ((double) var_1_7)) : (var_1_1 == ((double) ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8)))))) && ((last_1_var_1_20 > last_1_var_1_15) ? ((last_1_var_1_1 < var_1_7) ? (var_1_9 == ((unsigned short int) last_1_var_1_25)) : 1) : ((last_1_var_1_14 <= 16) ? (var_1_9 == ((unsigned short int) last_1_var_1_25)) : 1))) && ((! ((var_1_12 - var_1_13) <= (last_1_var_1_11 >> var_1_14))) ? (var_1_11 == ((unsigned short int) var_1_13)) : 1) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-2, var_1_17=0, var_1_18=2, var_1_19=0, var_1_1=2, var_1_20=0, var_1_22=-2147483651, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32765, var_1_29=-32769, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_8=0, var_1_9=2] [L189] EXPR ((((((((((((last_1_var_1_20 + last_1_var_1_15) | last_1_var_1_9) < (var_1_6 & 10000)) ? (var_1_1 == ((double) var_1_7)) : (var_1_1 == ((double) ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8)))))) && ((last_1_var_1_20 > last_1_var_1_15) ? ((last_1_var_1_1 < var_1_7) ? (var_1_9 == ((unsigned short int) last_1_var_1_25)) : 1) : ((last_1_var_1_14 <= 16) ? (var_1_9 == ((unsigned short int) last_1_var_1_25)) : 1))) && ((! ((var_1_12 - var_1_13) <= (last_1_var_1_11 >> var_1_14))) ? (var_1_11 == ((unsigned short int) var_1_13)) : 1)) && ((last_1_var_1_14 <= last_1_var_1_15) ? ((((last_1_var_1_26 % var_1_6) * (last_1_var_1_17 / 1000000000u)) >= ((((10u) < (var_1_13)) ? (10u) : (var_1_13)))) ? (var_1_14 == ((unsigned long int) var_1_13)) : (var_1_14 == ((unsigned long int) last_1_var_1_22))) : (var_1_14 == ((unsigned long int) last_1_var_1_26)))) && ((var_1_7 >= 4.5) ? (var_1_15 == ((signed short int) (((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17))) - ((((var_1_13) > (var_1_25)) ? (var_1_13) : (var_1_25)))))) : 1)) && (var_1_17 == ((unsigned char) var_1_13))) && (((var_1_9 + var_1_25) >= var_1_13) ? (var_1_18 == ((double) ((((var_1_7) > (((((var_1_8) > (var_1_19)) ? (var_1_8) : (var_1_19))))) ? (var_1_7) : (((((var_1_8) > (var_1_19)) ? (var_1_8) : (var_1_19)))))))) : 1)) && ((var_1_13 == (var_1_6 * (var_1_12 - 64))) ? (var_1_20 == ((unsigned long int) var_1_17)) : ((! (var_1_7 <= (var_1_1 * var_1_8))) ? ((var_1_28 < var_1_22) ? (var_1_20 == ((unsigned long int) var_1_9)) : (var_1_20 == ((unsigned long int) var_1_9))) : 1))) && ((! var_1_2) ? (var_1_22 == ((unsigned long int) (var_1_23 - var_1_25))) : (var_1_22 == ((unsigned long int) (var_1_17 + (var_1_24 - var_1_9)))))) && ((8 > (last_1_var_1_17 & ((((last_1_var_1_25) < 0 ) ? -(last_1_var_1_25) : (last_1_var_1_25))))) ? ((var_1_8 >= last_1_var_1_18) ? ((((last_1_var_1_28 | last_1_var_1_25) + last_1_var_1_11) < ((3423867512u - var_1_13) - var_1_24)) ? (var_1_25 == ((unsigned char) var_1_13)) : 1) : 1) : (var_1_25 == ((unsigned char) var_1_13))) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-2, var_1_17=0, var_1_18=2, var_1_19=0, var_1_1=2, var_1_20=0, var_1_22=-2147483651, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32765, var_1_29=-32769, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_8=0, var_1_9=2] [L189-L190] return ((((((((((((((last_1_var_1_20 + last_1_var_1_15) | last_1_var_1_9) < (var_1_6 & 10000)) ? (var_1_1 == ((double) var_1_7)) : (var_1_1 == ((double) ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8)))))) && ((last_1_var_1_20 > last_1_var_1_15) ? ((last_1_var_1_1 < var_1_7) ? (var_1_9 == ((unsigned short int) last_1_var_1_25)) : 1) : ((last_1_var_1_14 <= 16) ? (var_1_9 == ((unsigned short int) last_1_var_1_25)) : 1))) && ((! ((var_1_12 - var_1_13) <= (last_1_var_1_11 >> var_1_14))) ? (var_1_11 == ((unsigned short int) var_1_13)) : 1)) && ((last_1_var_1_14 <= last_1_var_1_15) ? ((((last_1_var_1_26 % var_1_6) * (last_1_var_1_17 / 1000000000u)) >= ((((10u) < (var_1_13)) ? (10u) : (var_1_13)))) ? (var_1_14 == ((unsigned long int) var_1_13)) : (var_1_14 == ((unsigned long int) last_1_var_1_22))) : (var_1_14 == ((unsigned long int) last_1_var_1_26)))) && ((var_1_7 >= 4.5) ? (var_1_15 == ((signed short int) (((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17))) - ((((var_1_13) > (var_1_25)) ? (var_1_13) : (var_1_25)))))) : 1)) && (var_1_17 == ((unsigned char) var_1_13))) && (((var_1_9 + var_1_25) >= var_1_13) ? (var_1_18 == ((double) ((((var_1_7) > (((((var_1_8) > (var_1_19)) ? (var_1_8) : (var_1_19))))) ? (var_1_7) : (((((var_1_8) > (var_1_19)) ? (var_1_8) : (var_1_19)))))))) : 1)) && ((var_1_13 == (var_1_6 * (var_1_12 - 64))) ? (var_1_20 == ((unsigned long int) var_1_17)) : ((! (var_1_7 <= (var_1_1 * var_1_8))) ? ((var_1_28 < var_1_22) ? (var_1_20 == ((unsigned long int) var_1_9)) : (var_1_20 == ((unsigned long int) var_1_9))) : 1))) && ((! var_1_2) ? (var_1_22 == ((unsigned long int) (var_1_23 - var_1_25))) : (var_1_22 == ((unsigned long int) (var_1_17 + (var_1_24 - var_1_9)))))) && ((8 > (last_1_var_1_17 & ((((last_1_var_1_25) < 0 ) ? -(last_1_var_1_25) : (last_1_var_1_25))))) ? ((var_1_8 >= last_1_var_1_18) ? ((((last_1_var_1_28 | last_1_var_1_25) + last_1_var_1_11) < ((3423867512u - var_1_13) - var_1_24)) ? (var_1_25 == ((unsigned char) var_1_13)) : 1) : 1) : (var_1_25 == ((unsigned char) var_1_13)))) && (var_1_2 ? ((var_1_23 >= var_1_25) ? (((var_1_25 - 10) <= var_1_14) ? (var_1_27 ? (var_1_26 == ((signed long int) (((((((((var_1_25) < (var_1_22)) ? (var_1_25) : (var_1_22)))) < (var_1_17)) ? (((((var_1_25) < (var_1_22)) ? (var_1_25) : (var_1_22)))) : (var_1_17))) + var_1_17))) : 1) : (var_1_26 == ((signed long int) ((((var_1_12) < (var_1_17)) ? (var_1_12) : (var_1_17)))))) : (var_1_26 == ((signed long int) ((-32 + var_1_22) + var_1_14)))) : 1)) && (var_1_28 == ((unsigned short int) (var_1_29 - (var_1_13 + ((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15))))))) ; [L199] RET, EXPR property() [L199] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-2, var_1_17=0, var_1_18=2, var_1_19=0, var_1_1=2, var_1_20=0, var_1_22=-2147483651, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32765, var_1_29=-32769, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_8=0, var_1_9=2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-2, var_1_17=0, var_1_18=2, var_1_19=0, var_1_1=2, var_1_20=0, var_1_22=-2147483651, var_1_23=-2147483649, var_1_24=1073741823, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32765, var_1_29=-32769, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_8=0, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 115 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.5s, OverallIterations: 12, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2261 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2259 mSDsluCounter, 5749 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3616 mSDsCounter, 539 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 885 IncrementalHoareTripleChecker+Invalid, 1424 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 539 mSolverCounterUnsat, 2133 mSDtfsCounter, 885 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 851 GetRequests, 805 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2449occurred in iteration=10, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 11 MinimizatonAttempts, 863 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 2134 NumberOfCodeBlocks, 2134 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1961 ConstructedInterpolants, 0 QuantifiedInterpolants, 5747 SizeOfPredicates, 0 NumberOfNonLiveVariables, 413 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 13 InterpolantComputations, 10 PerfectInterpolantSequences, 9745/9880 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-08 23:27:26,935 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-11.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 44f3c78866341606a725ec4495ab49b41e658d35c89f21a87499e7ecc600588e --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 23:27:28,691 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:27:28,757 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 23:27:28,763 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:27:28,764 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:27:28,785 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:27:28,788 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:27:28,788 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:27:28,789 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:27:28,790 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:27:28,790 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:27:28,791 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:27:28,791 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:27:28,791 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:27:28,793 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:27:28,794 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:27:28,794 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:27:28,794 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:27:28,794 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:27:28,794 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:27:28,794 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:27:28,795 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:27:28,795 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:27:28,796 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 23:27:28,796 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 23:27:28,796 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:27:28,796 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 23:27:28,796 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:27:28,796 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:27:28,796 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:27:28,796 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:27:28,796 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:27:28,797 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:27:28,797 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:27:28,797 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:27:28,797 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:27:28,797 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:27:28,797 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:27:28,797 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 23:27:28,797 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 23:27:28,798 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:27:28,799 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:27:28,799 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:27:28,799 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:27:28,800 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 44f3c78866341606a725ec4495ab49b41e658d35c89f21a87499e7ecc600588e [2024-11-08 23:27:29,040 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:27:29,059 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:27:29,061 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:27:29,062 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:27:29,063 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:27:29,063 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-11.i [2024-11-08 23:27:30,346 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:27:30,529 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:27:30,531 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-11.i [2024-11-08 23:27:30,543 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7670e09dd/efb43bd13b47465394056fb70d7ac9d6/FLAGc3b1be7f5 [2024-11-08 23:27:30,557 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7670e09dd/efb43bd13b47465394056fb70d7ac9d6 [2024-11-08 23:27:30,559 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:27:30,560 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:27:30,562 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:27:30,562 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:27:30,566 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:27:30,566 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:27:30" (1/1) ... [2024-11-08 23:27:30,567 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f035d4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:27:30, skipping insertion in model container [2024-11-08 23:27:30,567 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:27:30" (1/1) ... [2024-11-08 23:27:30,594 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:27:30,730 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-11.i[916,929] [2024-11-08 23:27:30,806 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:27:30,829 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:27:30,840 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-11.i[916,929] [2024-11-08 23:27:30,883 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:27:30,905 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:27:30,906 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:27:30 WrapperNode [2024-11-08 23:27:30,906 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:27:30,907 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:27:30,907 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:27:30,907 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:27:30,911 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:27:30" (1/1) ... [2024-11-08 23:27:30,923 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:27:30" (1/1) ... [2024-11-08 23:27:30,948 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 184 [2024-11-08 23:27:30,949 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:27:30,953 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:27:30,954 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:27:30,954 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:27:30,963 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:27:30" (1/1) ... [2024-11-08 23:27:30,964 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:27:30" (1/1) ... [2024-11-08 23:27:30,968 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:27:30" (1/1) ... [2024-11-08 23:27:30,979 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 23:27:30,979 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:27:30" (1/1) ... [2024-11-08 23:27:30,979 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:27:30" (1/1) ... [2024-11-08 23:27:30,987 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:27:30" (1/1) ... [2024-11-08 23:27:30,992 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:27:30" (1/1) ... [2024-11-08 23:27:31,001 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:27:30" (1/1) ... [2024-11-08 23:27:31,002 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:27:30" (1/1) ... [2024-11-08 23:27:31,005 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:27:31,006 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:27:31,006 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:27:31,006 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:27:31,007 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:27:30" (1/1) ... [2024-11-08 23:27:31,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:27:31,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:27:31,034 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 23:27:31,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 23:27:31,067 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:27:31,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 23:27:31,068 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:27:31,068 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:27:31,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:27:31,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:27:31,134 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:27:31,137 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:27:35,078 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-08 23:27:35,078 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:27:35,087 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:27:35,087 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:27:35,087 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:27:35 BoogieIcfgContainer [2024-11-08 23:27:35,087 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:27:35,089 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:27:35,089 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:27:35,092 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:27:35,092 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:27:30" (1/3) ... [2024-11-08 23:27:35,093 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@267200be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:27:35, skipping insertion in model container [2024-11-08 23:27:35,093 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:27:30" (2/3) ... [2024-11-08 23:27:35,094 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@267200be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:27:35, skipping insertion in model container [2024-11-08 23:27:35,094 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:27:35" (3/3) ... [2024-11-08 23:27:35,096 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-11.i [2024-11-08 23:27:35,108 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:27:35,108 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:27:35,152 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:27:35,158 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4eebdec0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:27:35,159 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:27:35,162 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 52 states have (on average 1.4807692307692308) internal successors, (77), 53 states have internal predecessors, (77), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-08 23:27:35,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-08 23:27:35,175 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:27:35,175 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:27:35,176 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:27:35,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:27:35,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1600914285, now seen corresponding path program 1 times [2024-11-08 23:27:35,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:27:35,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1111633566] [2024-11-08 23:27:35,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:27:35,192 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:27:35,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:27:35,195 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 23:27:35,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 23:27:35,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:35,528 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 23:27:35,534 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:27:35,573 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 350 proven. 0 refuted. 0 times theorem prover too weak. 410 trivial. 0 not checked. [2024-11-08 23:27:35,573 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:27:35,574 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:27:35,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1111633566] [2024-11-08 23:27:35,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1111633566] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:27:35,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:27:35,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:27:35,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200421281] [2024-11-08 23:27:35,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:27:35,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:27:35,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:27:35,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:27:35,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:27:35,601 INFO L87 Difference]: Start difference. First operand has 75 states, 52 states have (on average 1.4807692307692308) internal successors, (77), 53 states have internal predecessors, (77), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-08 23:27:35,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:27:35,627 INFO L93 Difference]: Finished difference Result 143 states and 248 transitions. [2024-11-08 23:27:35,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:27:35,630 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 136 [2024-11-08 23:27:35,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:27:35,636 INFO L225 Difference]: With dead ends: 143 [2024-11-08 23:27:35,636 INFO L226 Difference]: Without dead ends: 71 [2024-11-08 23:27:35,640 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:27:35,646 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:27:35,646 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:27:35,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-08 23:27:35,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-11-08 23:27:35,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 49 states have internal predecessors, (70), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-08 23:27:35,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 110 transitions. [2024-11-08 23:27:35,687 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 110 transitions. Word has length 136 [2024-11-08 23:27:35,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:27:35,687 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 110 transitions. [2024-11-08 23:27:35,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-08 23:27:35,688 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 110 transitions. [2024-11-08 23:27:35,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-08 23:27:35,691 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:27:35,692 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:27:35,706 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-08 23:27:35,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:27:35,893 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:27:35,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:27:35,894 INFO L85 PathProgramCache]: Analyzing trace with hash 97337611, now seen corresponding path program 1 times [2024-11-08 23:27:35,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:27:35,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2118010706] [2024-11-08 23:27:35,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:27:35,895 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:27:35,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:27:35,896 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 23:27:35,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 23:27:36,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:36,233 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 23:27:36,237 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:27:37,920 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-08 23:27:37,921 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:27:37,921 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:27:37,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2118010706] [2024-11-08 23:27:37,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2118010706] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:27:37,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:27:37,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 23:27:37,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594302466] [2024-11-08 23:27:37,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:27:37,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 23:27:37,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:27:37,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 23:27:37,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 23:27:37,926 INFO L87 Difference]: Start difference. First operand 71 states and 110 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-08 23:27:40,126 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 23:27:41,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 23:27:41,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:27:41,641 INFO L93 Difference]: Finished difference Result 208 states and 325 transitions. [2024-11-08 23:27:41,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 23:27:41,669 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 136 [2024-11-08 23:27:41,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:27:41,675 INFO L225 Difference]: With dead ends: 208 [2024-11-08 23:27:41,676 INFO L226 Difference]: Without dead ends: 140 [2024-11-08 23:27:41,676 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 23:27:41,677 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 69 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-08 23:27:41,677 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 292 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-08 23:27:41,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-08 23:27:41,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 113. [2024-11-08 23:27:41,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 70 states have (on average 1.3428571428571427) internal successors, (94), 70 states have internal predecessors, (94), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-08 23:27:41,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 174 transitions. [2024-11-08 23:27:41,738 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 174 transitions. Word has length 136 [2024-11-08 23:27:41,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:27:41,740 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 174 transitions. [2024-11-08 23:27:41,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-08 23:27:41,740 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 174 transitions. [2024-11-08 23:27:41,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-08 23:27:41,742 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:27:41,743 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:27:41,757 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-08 23:27:41,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:27:41,943 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:27:41,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:27:41,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1118152020, now seen corresponding path program 1 times [2024-11-08 23:27:41,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:27:41,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1118286241] [2024-11-08 23:27:41,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:27:41,945 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:27:41,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:27:41,947 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 23:27:41,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-08 23:27:42,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:42,235 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 23:27:42,238 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:27:43,717 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-08 23:27:43,717 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:27:43,718 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:27:43,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1118286241] [2024-11-08 23:27:43,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1118286241] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:27:43,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:27:43,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 23:27:43,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168097436] [2024-11-08 23:27:43,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:27:43,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 23:27:43,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:27:43,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 23:27:43,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 23:27:43,721 INFO L87 Difference]: Start difference. First operand 113 states and 174 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-08 23:27:46,520 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.61s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 23:27:48,942 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 23:27:48,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:27:48,976 INFO L93 Difference]: Finished difference Result 264 states and 409 transitions. [2024-11-08 23:27:48,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 23:27:48,977 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 137 [2024-11-08 23:27:48,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:27:48,979 INFO L225 Difference]: With dead ends: 264 [2024-11-08 23:27:48,979 INFO L226 Difference]: Without dead ends: 196 [2024-11-08 23:27:48,979 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 23:27:48,980 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 107 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2024-11-08 23:27:48,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 324 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2024-11-08 23:27:48,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-11-08 23:27:49,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 177. [2024-11-08 23:27:49,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 113 states have (on average 1.3628318584070795) internal successors, (154), 113 states have internal predecessors, (154), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-08 23:27:49,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 274 transitions. [2024-11-08 23:27:49,011 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 274 transitions. Word has length 137 [2024-11-08 23:27:49,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:27:49,013 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 274 transitions. [2024-11-08 23:27:49,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-08 23:27:49,013 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 274 transitions. [2024-11-08 23:27:49,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-08 23:27:49,018 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:27:49,018 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:27:49,033 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-08 23:27:49,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:27:49,220 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:27:49,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:27:49,220 INFO L85 PathProgramCache]: Analyzing trace with hash -326916524, now seen corresponding path program 1 times [2024-11-08 23:27:49,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:27:49,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [564705789] [2024-11-08 23:27:49,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:27:49,221 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:27:49,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:27:49,223 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 23:27:49,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-08 23:27:49,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:49,492 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 23:27:49,495 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:27:50,024 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-08 23:27:50,024 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:27:50,025 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:27:50,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [564705789] [2024-11-08 23:27:50,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [564705789] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:27:50,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:27:50,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 23:27:50,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422757009] [2024-11-08 23:27:50,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:27:50,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 23:27:50,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:27:50,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 23:27:50,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 23:27:50,026 INFO L87 Difference]: Start difference. First operand 177 states and 274 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-08 23:27:52,730 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 23:27:52,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:27:52,732 INFO L93 Difference]: Finished difference Result 348 states and 542 transitions. [2024-11-08 23:27:52,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 23:27:52,762 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 137 [2024-11-08 23:27:52,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:27:52,764 INFO L225 Difference]: With dead ends: 348 [2024-11-08 23:27:52,764 INFO L226 Difference]: Without dead ends: 216 [2024-11-08 23:27:52,765 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-08 23:27:52,766 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 75 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-08 23:27:52,767 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 366 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-08 23:27:52,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-11-08 23:27:52,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 179. [2024-11-08 23:27:52,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 115 states have (on average 1.3565217391304347) internal successors, (156), 115 states have internal predecessors, (156), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-08 23:27:52,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 276 transitions. [2024-11-08 23:27:52,793 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 276 transitions. Word has length 137 [2024-11-08 23:27:52,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:27:52,794 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 276 transitions. [2024-11-08 23:27:52,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-08 23:27:52,794 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 276 transitions. [2024-11-08 23:27:52,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-08 23:27:52,797 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:27:52,797 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:27:52,811 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-08 23:27:52,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:27:52,998 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:27:52,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:27:52,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1469543727, now seen corresponding path program 1 times [2024-11-08 23:27:52,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:27:52,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [185823873] [2024-11-08 23:27:52,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:27:52,999 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:27:52,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:27:53,000 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 23:27:53,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-08 23:27:53,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:53,292 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 23:27:53,295 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:27:54,729 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 397 proven. 30 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked. [2024-11-08 23:27:54,730 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 23:27:55,256 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:27:55,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [185823873] [2024-11-08 23:27:55,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [185823873] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 23:27:55,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [592386819] [2024-11-08 23:27:55,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:27:55,257 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-08 23:27:55,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-08 23:27:55,258 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-08 23:27:55,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2024-11-08 23:27:55,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:55,907 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 23:27:55,910 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:27:58,256 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-08 23:27:58,256 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:27:58,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [592386819] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:27:58,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 23:27:58,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2024-11-08 23:27:58,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467351704] [2024-11-08 23:27:58,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:27:58,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 23:27:58,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:27:58,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 23:27:58,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2024-11-08 23:27:58,258 INFO L87 Difference]: Start difference. First operand 179 states and 276 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-08 23:28:04,127 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.36s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 23:28:06,966 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.62s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 23:28:08,255 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 23:28:13,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.42s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 23:28:14,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:28:14,869 INFO L93 Difference]: Finished difference Result 626 states and 967 transitions. [2024-11-08 23:28:14,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 23:28:14,874 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 138 [2024-11-08 23:28:14,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:28:14,877 INFO L225 Difference]: With dead ends: 626 [2024-11-08 23:28:14,877 INFO L226 Difference]: Without dead ends: 494 [2024-11-08 23:28:14,877 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2024-11-08 23:28:14,878 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 247 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.9s IncrementalHoareTripleChecker+Time [2024-11-08 23:28:14,878 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 372 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 15.9s Time] [2024-11-08 23:28:14,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2024-11-08 23:28:14,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 415. [2024-11-08 23:28:14,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 289 states have (on average 1.4186851211072664) internal successors, (410), 291 states have internal predecessors, (410), 118 states have call successors, (118), 7 states have call predecessors, (118), 7 states have return successors, (118), 116 states have call predecessors, (118), 118 states have call successors, (118) [2024-11-08 23:28:14,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 646 transitions. [2024-11-08 23:28:14,923 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 646 transitions. Word has length 138 [2024-11-08 23:28:14,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:28:14,923 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 646 transitions. [2024-11-08 23:28:14,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-08 23:28:14,924 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 646 transitions. [2024-11-08 23:28:14,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-08 23:28:14,925 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:28:14,926 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:28:14,941 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2024-11-08 23:28:15,140 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-08 23:28:15,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:28:15,327 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:28:15,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:28:15,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1211378289, now seen corresponding path program 1 times [2024-11-08 23:28:15,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:28:15,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [432917691] [2024-11-08 23:28:15,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:28:15,328 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:28:15,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:28:15,329 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 23:28:15,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-08 23:28:15,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:15,605 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 23:28:15,608 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:28:17,334 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 397 proven. 30 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked. [2024-11-08 23:28:17,334 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 23:28:17,920 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:28:17,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [432917691] [2024-11-08 23:28:17,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [432917691] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 23:28:17,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [802844070] [2024-11-08 23:28:17,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:28:17,920 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-08 23:28:17,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-08 23:28:17,921 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-08 23:28:17,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2024-11-08 23:28:18,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:18,567 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-08 23:28:18,570 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:28:21,781 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-08 23:28:21,781 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:28:21,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [802844070] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:28:21,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 23:28:21,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2024-11-08 23:28:21,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393285551] [2024-11-08 23:28:21,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:28:21,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 23:28:21,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:28:21,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 23:28:21,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2024-11-08 23:28:21,783 INFO L87 Difference]: Start difference. First operand 415 states and 646 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-08 23:28:26,965 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.43s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 23:28:29,997 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.97s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 23:28:33,260 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.39s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 23:28:36,098 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 23:28:37,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:28:37,469 INFO L93 Difference]: Finished difference Result 1129 states and 1756 transitions. [2024-11-08 23:28:37,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 23:28:37,474 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 138 [2024-11-08 23:28:37,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:28:37,481 INFO L225 Difference]: With dead ends: 1129 [2024-11-08 23:28:37,481 INFO L226 Difference]: Without dead ends: 765 [2024-11-08 23:28:37,482 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 285 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2024-11-08 23:28:37,483 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 317 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 100 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.1s IncrementalHoareTripleChecker+Time [2024-11-08 23:28:37,483 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 428 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 277 Invalid, 2 Unknown, 0 Unchecked, 15.1s Time] [2024-11-08 23:28:37,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2024-11-08 23:28:37,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 647. [2024-11-08 23:28:37,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 459 states have (on average 1.4291938997821352) internal successors, (656), 463 states have internal predecessors, (656), 176 states have call successors, (176), 11 states have call predecessors, (176), 11 states have return successors, (176), 172 states have call predecessors, (176), 176 states have call successors, (176) [2024-11-08 23:28:37,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 1008 transitions. [2024-11-08 23:28:37,547 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 1008 transitions. Word has length 138 [2024-11-08 23:28:37,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:28:37,547 INFO L471 AbstractCegarLoop]: Abstraction has 647 states and 1008 transitions. [2024-11-08 23:28:37,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-08 23:28:37,548 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 1008 transitions. [2024-11-08 23:28:37,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-08 23:28:37,548 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:28:37,549 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:28:37,561 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Ended with exit code 0 [2024-11-08 23:28:37,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-08 23:28:37,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:28:37,950 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:28:37,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:28:37,950 INFO L85 PathProgramCache]: Analyzing trace with hash 200261039, now seen corresponding path program 1 times [2024-11-08 23:28:37,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:28:37,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [257862053] [2024-11-08 23:28:37,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:28:37,951 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:28:37,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:28:37,953 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 23:28:37,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-08 23:28:38,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:38,254 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-08 23:28:38,265 INFO L278 TraceCheckSpWp]: Computing forward predicates...