./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-43.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-43.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 7e66f2766686731553c198a13682fe7d31c9aeab700c26b7283920d0b82d9f8b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 03:46:53,496 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 03:46:53,570 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 03:46:53,574 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 03:46:53,574 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 03:46:53,605 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 03:46:53,607 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 03:46:53,608 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 03:46:53,609 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 03:46:53,610 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 03:46:53,610 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 03:46:53,611 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 03:46:53,611 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 03:46:53,612 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 03:46:53,612 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 03:46:53,614 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 03:46:53,615 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 03:46:53,615 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 03:46:53,615 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 03:46:53,619 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 03:46:53,620 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 03:46:53,620 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 03:46:53,620 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 03:46:53,621 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 03:46:53,621 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 03:46:53,621 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 03:46:53,621 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 03:46:53,622 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 03:46:53,622 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 03:46:53,622 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 03:46:53,622 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 03:46:53,623 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 03:46:53,623 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:46:53,623 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 03:46:53,623 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 03:46:53,624 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 03:46:53,624 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 03:46:53,624 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 03:46:53,624 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 03:46:53,625 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 03:46:53,625 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 03:46:53,625 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 03:46:53,626 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 -> 7e66f2766686731553c198a13682fe7d31c9aeab700c26b7283920d0b82d9f8b [2024-10-13 03:46:53,964 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 03:46:53,994 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 03:46:53,998 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 03:46:53,999 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 03:46:54,000 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 03:46:54,001 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-43.i [2024-10-13 03:46:55,466 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 03:46:55,702 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 03:46:55,705 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-43.i [2024-10-13 03:46:55,716 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/707b9afc8/0a9d659a74a64430acf9b2700c17c46e/FLAG1a4d4350c [2024-10-13 03:46:56,040 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/707b9afc8/0a9d659a74a64430acf9b2700c17c46e [2024-10-13 03:46:56,043 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 03:46:56,044 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 03:46:56,045 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 03:46:56,046 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 03:46:56,055 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 03:46:56,056 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:46:56" (1/1) ... [2024-10-13 03:46:56,057 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1df829d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:46:56, skipping insertion in model container [2024-10-13 03:46:56,057 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:46:56" (1/1) ... [2024-10-13 03:46:56,108 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 03:46:56,294 WARN L248 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-1loop_file-43.i[916,929] [2024-10-13 03:46:56,416 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:46:56,428 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 03:46:56,439 WARN L248 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-1loop_file-43.i[916,929] [2024-10-13 03:46:56,486 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:46:56,510 INFO L204 MainTranslator]: Completed translation [2024-10-13 03:46:56,515 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:46:56 WrapperNode [2024-10-13 03:46:56,515 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 03:46:56,516 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 03:46:56,516 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 03:46:56,517 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 03:46:56,526 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:46:56" (1/1) ... [2024-10-13 03:46:56,550 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:46:56" (1/1) ... [2024-10-13 03:46:56,594 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 285 [2024-10-13 03:46:56,595 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 03:46:56,596 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 03:46:56,596 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 03:46:56,596 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 03:46:56,610 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:46:56" (1/1) ... [2024-10-13 03:46:56,610 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:46:56" (1/1) ... [2024-10-13 03:46:56,616 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:46:56" (1/1) ... [2024-10-13 03:46:56,639 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-10-13 03:46:56,640 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:46:56" (1/1) ... [2024-10-13 03:46:56,640 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:46:56" (1/1) ... [2024-10-13 03:46:56,657 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:46:56" (1/1) ... [2024-10-13 03:46:56,665 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:46:56" (1/1) ... [2024-10-13 03:46:56,672 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:46:56" (1/1) ... [2024-10-13 03:46:56,677 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:46:56" (1/1) ... [2024-10-13 03:46:56,685 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 03:46:56,688 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 03:46:56,688 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 03:46:56,688 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 03:46:56,689 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:46:56" (1/1) ... [2024-10-13 03:46:56,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:46:56,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 03:46:56,728 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-10-13 03:46:56,735 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-10-13 03:46:56,806 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 03:46:56,807 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 03:46:56,807 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 03:46:56,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 03:46:56,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 03:46:56,807 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 03:46:56,962 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 03:46:56,964 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 03:46:57,547 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2024-10-13 03:46:57,550 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 03:46:57,594 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 03:46:57,594 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 03:46:57,595 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:46:57 BoogieIcfgContainer [2024-10-13 03:46:57,595 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 03:46:57,598 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 03:46:57,598 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 03:46:57,601 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 03:46:57,601 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 03:46:56" (1/3) ... [2024-10-13 03:46:57,602 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@351bbd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:46:57, skipping insertion in model container [2024-10-13 03:46:57,602 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:46:56" (2/3) ... [2024-10-13 03:46:57,603 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@351bbd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:46:57, skipping insertion in model container [2024-10-13 03:46:57,603 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:46:57" (3/3) ... [2024-10-13 03:46:57,604 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-43.i [2024-10-13 03:46:57,619 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 03:46:57,619 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 03:46:57,701 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 03:46:57,710 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;@6a832d01, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 03:46:57,711 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 03:46:57,715 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 81 states have (on average 1.4814814814814814) internal successors, (120), 82 states have internal predecessors, (120), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-13 03:46:57,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-10-13 03:46:57,730 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:46:57,731 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 03:46:57,731 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:46:57,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:46:57,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1932969705, now seen corresponding path program 1 times [2024-10-13 03:46:57,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:46:57,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423871508] [2024-10-13 03:46:57,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:46:57,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:46:57,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:46:58,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:46:58,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:46:58,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:46:58,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:46:58,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:46:58,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:46:58,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:46:58,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:46:58,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:46:58,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:46:58,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 03:46:58,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:46:58,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 03:46:58,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:46:58,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 03:46:58,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:46:58,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 03:46:58,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:46:58,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 03:46:58,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:46:58,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 03:46:58,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:46:58,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 03:46:58,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:46:58,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 03:46:58,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:46:58,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 03:46:58,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:46:58,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 03:46:58,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:46:58,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 03:46:58,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:46:58,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 03:46:58,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:46:58,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 03:46:58,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:46:58,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 03:46:58,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:46:58,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-13 03:46:58,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:46:58,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-13 03:46:58,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:46:58,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 03:46:58,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:46:58,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-13 03:46:58,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:46:58,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 03:46:58,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:46:58,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-13 03:46:58,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:46:58,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-13 03:46:58,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:46:58,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-13 03:46:58,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:46:58,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423871508] [2024-10-13 03:46:58,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423871508] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:46:58,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:46:58,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 03:46:58,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033228106] [2024-10-13 03:46:58,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:46:58,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 03:46:58,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:46:58,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 03:46:58,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 03:46:58,390 INFO L87 Difference]: Start difference. First operand has 110 states, 81 states have (on average 1.4814814814814814) internal successors, (120), 82 states have internal predecessors, (120), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-13 03:46:58,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:46:58,465 INFO L93 Difference]: Finished difference Result 219 states and 369 transitions. [2024-10-13 03:46:58,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 03:46:58,468 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 177 [2024-10-13 03:46:58,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:46:58,479 INFO L225 Difference]: With dead ends: 219 [2024-10-13 03:46:58,480 INFO L226 Difference]: Without dead ends: 108 [2024-10-13 03:46:58,485 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 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-10-13 03:46:58,488 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 03:46:58,489 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 162 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 03:46:58,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-10-13 03:46:58,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-10-13 03:46:58,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 80 states have (on average 1.4125) internal successors, (113), 80 states have internal predecessors, (113), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-13 03:46:58,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 165 transitions. [2024-10-13 03:46:58,551 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 165 transitions. Word has length 177 [2024-10-13 03:46:58,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:46:58,554 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 165 transitions. [2024-10-13 03:46:58,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-13 03:46:58,555 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 165 transitions. [2024-10-13 03:46:58,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-10-13 03:46:58,562 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:46:58,562 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 03:46:58,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 03:46:58,563 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:46:58,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:46:58,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1624913803, now seen corresponding path program 1 times [2024-10-13 03:46:58,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:46:58,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243288206] [2024-10-13 03:46:58,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:46:58,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:46:58,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:46:59,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:46:59,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:46:59,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:46:59,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:46:59,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:46:59,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:46:59,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:46:59,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:46:59,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:46:59,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:46:59,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 03:46:59,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:46:59,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 03:46:59,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:46:59,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 03:46:59,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:46:59,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 03:46:59,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:46:59,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 03:46:59,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:46:59,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 03:46:59,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:46:59,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 03:46:59,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:46:59,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 03:46:59,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:46:59,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 03:46:59,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:46:59,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 03:46:59,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:46:59,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 03:46:59,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:46:59,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 03:46:59,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:46:59,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 03:46:59,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:46:59,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 03:46:59,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:46:59,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-13 03:46:59,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:46:59,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-13 03:46:59,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:46:59,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 03:46:59,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:46:59,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-13 03:46:59,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:46:59,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 03:46:59,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:46:59,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-13 03:46:59,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:46:59,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-13 03:46:59,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:46:59,330 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-13 03:46:59,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:46:59,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243288206] [2024-10-13 03:46:59,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243288206] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:46:59,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:46:59,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 03:46:59,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072953853] [2024-10-13 03:46:59,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:46:59,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 03:46:59,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:46:59,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 03:46:59,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 03:46:59,339 INFO L87 Difference]: Start difference. First operand 108 states and 165 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-13 03:46:59,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:46:59,597 INFO L93 Difference]: Finished difference Result 323 states and 494 transitions. [2024-10-13 03:46:59,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 03:46:59,597 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 177 [2024-10-13 03:46:59,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:46:59,601 INFO L225 Difference]: With dead ends: 323 [2024-10-13 03:46:59,601 INFO L226 Difference]: Without dead ends: 216 [2024-10-13 03:46:59,603 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 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-10-13 03:46:59,604 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 132 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 03:46:59,604 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 469 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 03:46:59,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-10-13 03:46:59,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 193. [2024-10-13 03:46:59,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 138 states have (on average 1.4057971014492754) internal successors, (194), 138 states have internal predecessors, (194), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-13 03:46:59,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 298 transitions. [2024-10-13 03:46:59,658 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 298 transitions. Word has length 177 [2024-10-13 03:46:59,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:46:59,659 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 298 transitions. [2024-10-13 03:46:59,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-13 03:46:59,659 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 298 transitions. [2024-10-13 03:46:59,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-10-13 03:46:59,664 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:46:59,664 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 03:46:59,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 03:46:59,665 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:46:59,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:46:59,665 INFO L85 PathProgramCache]: Analyzing trace with hash -954377203, now seen corresponding path program 1 times [2024-10-13 03:46:59,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:46:59,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748308579] [2024-10-13 03:46:59,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:46:59,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:46:59,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:46:59,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:46:59,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:46:59,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:46:59,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:46:59,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:46:59,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:46:59,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:46:59,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:46:59,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:46:59,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:46:59,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 03:46:59,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:46:59,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 03:46:59,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:46:59,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 03:46:59,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:46:59,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 03:46:59,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:46:59,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 03:46:59,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:46:59,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 03:46:59,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:46:59,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 03:46:59,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:46:59,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 03:46:59,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:46:59,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 03:46:59,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:46:59,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 03:46:59,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:46:59,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 03:46:59,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:46:59,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 03:46:59,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:00,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 03:47:00,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:00,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 03:47:00,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:00,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-13 03:47:00,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:00,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-13 03:47:00,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:00,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 03:47:00,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:00,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-13 03:47:00,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:00,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 03:47:00,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:00,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-13 03:47:00,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:00,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-13 03:47:00,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:00,037 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-13 03:47:00,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:47:00,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748308579] [2024-10-13 03:47:00,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748308579] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:47:00,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:47:00,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 03:47:00,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159755068] [2024-10-13 03:47:00,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:47:00,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 03:47:00,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:47:00,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 03:47:00,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 03:47:00,044 INFO L87 Difference]: Start difference. First operand 193 states and 298 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, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-13 03:47:00,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:47:00,116 INFO L93 Difference]: Finished difference Result 452 states and 699 transitions. [2024-10-13 03:47:00,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 03:47:00,119 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, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 179 [2024-10-13 03:47:00,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:47:00,127 INFO L225 Difference]: With dead ends: 452 [2024-10-13 03:47:00,127 INFO L226 Difference]: Without dead ends: 324 [2024-10-13 03:47:00,129 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 55 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-10-13 03:47:00,132 INFO L432 NwaCegarLoop]: 251 mSDtfsCounter, 159 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 03:47:00,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 405 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 03:47:00,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2024-10-13 03:47:00,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 197. [2024-10-13 03:47:00,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 142 states have (on average 1.3943661971830985) internal successors, (198), 142 states have internal predecessors, (198), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-13 03:47:00,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 302 transitions. [2024-10-13 03:47:00,179 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 302 transitions. Word has length 179 [2024-10-13 03:47:00,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:47:00,180 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 302 transitions. [2024-10-13 03:47:00,180 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, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-13 03:47:00,180 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 302 transitions. [2024-10-13 03:47:00,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-10-13 03:47:00,186 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:47:00,186 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 03:47:00,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 03:47:00,187 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:47:00,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:47:00,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1006064093, now seen corresponding path program 1 times [2024-10-13 03:47:00,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:47:00,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416628609] [2024-10-13 03:47:00,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:47:00,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:47:00,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:00,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:47:00,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:00,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:47:00,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:00,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:47:00,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:00,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:47:00,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:00,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:47:00,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:00,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 03:47:00,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:00,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 03:47:00,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:00,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 03:47:00,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:00,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 03:47:00,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:00,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 03:47:00,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:00,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 03:47:00,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:00,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 03:47:00,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:00,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 03:47:00,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:00,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 03:47:00,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:00,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 03:47:00,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:00,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 03:47:00,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:00,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 03:47:00,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:00,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 03:47:00,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:00,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 03:47:00,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:00,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-13 03:47:00,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:00,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-13 03:47:00,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:00,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 03:47:00,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:00,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-13 03:47:00,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:00,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 03:47:00,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:00,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-13 03:47:00,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:00,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-13 03:47:00,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:00,602 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-13 03:47:00,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:47:00,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416628609] [2024-10-13 03:47:00,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416628609] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:47:00,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:47:00,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 03:47:00,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32014504] [2024-10-13 03:47:00,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:47:00,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 03:47:00,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:47:00,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 03:47:00,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 03:47:00,606 INFO L87 Difference]: Start difference. First operand 197 states and 302 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, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-13 03:47:00,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:47:00,794 INFO L93 Difference]: Finished difference Result 516 states and 791 transitions. [2024-10-13 03:47:00,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 03:47:00,795 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, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 180 [2024-10-13 03:47:00,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:47:00,801 INFO L225 Difference]: With dead ends: 516 [2024-10-13 03:47:00,801 INFO L226 Difference]: Without dead ends: 371 [2024-10-13 03:47:00,802 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 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-10-13 03:47:00,803 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 200 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 03:47:00,803 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 525 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 03:47:00,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2024-10-13 03:47:00,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 347. [2024-10-13 03:47:00,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 265 states have (on average 1.4264150943396225) internal successors, (378), 265 states have internal predecessors, (378), 78 states have call successors, (78), 3 states have call predecessors, (78), 3 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2024-10-13 03:47:00,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 534 transitions. [2024-10-13 03:47:00,840 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 534 transitions. Word has length 180 [2024-10-13 03:47:00,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:47:00,840 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 534 transitions. [2024-10-13 03:47:00,841 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, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-13 03:47:00,841 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 534 transitions. [2024-10-13 03:47:00,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-10-13 03:47:00,843 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:47:00,844 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 03:47:00,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 03:47:00,844 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:47:00,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:47:00,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1704119206, now seen corresponding path program 1 times [2024-10-13 03:47:00,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:47:00,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338555001] [2024-10-13 03:47:00,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:47:00,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:47:00,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:01,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:47:01,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:01,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:47:01,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:01,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:47:01,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:01,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:47:01,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:01,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:47:01,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:01,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 03:47:01,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:01,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 03:47:01,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:01,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 03:47:01,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:01,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 03:47:01,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:01,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 03:47:01,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:01,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 03:47:01,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:01,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 03:47:01,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:01,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 03:47:01,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:01,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 03:47:01,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:01,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 03:47:01,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:01,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 03:47:01,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:01,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 03:47:01,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:01,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 03:47:01,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:01,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 03:47:01,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:01,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-13 03:47:01,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:01,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-13 03:47:01,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:01,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 03:47:01,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:01,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-13 03:47:01,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:01,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 03:47:01,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:01,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-13 03:47:01,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:01,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-13 03:47:01,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:01,362 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-13 03:47:01,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:47:01,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338555001] [2024-10-13 03:47:01,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338555001] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:47:01,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:47:01,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 03:47:01,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040511230] [2024-10-13 03:47:01,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:47:01,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 03:47:01,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:47:01,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 03:47:01,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 03:47:01,367 INFO L87 Difference]: Start difference. First operand 347 states and 534 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-13 03:47:01,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:47:01,658 INFO L93 Difference]: Finished difference Result 775 states and 1178 transitions. [2024-10-13 03:47:01,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 03:47:01,659 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 182 [2024-10-13 03:47:01,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:47:01,665 INFO L225 Difference]: With dead ends: 775 [2024-10-13 03:47:01,666 INFO L226 Difference]: Without dead ends: 485 [2024-10-13 03:47:01,668 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-13 03:47:01,669 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 194 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 684 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 03:47:01,670 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 684 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 03:47:01,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2024-10-13 03:47:01,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 429. [2024-10-13 03:47:01,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 347 states have (on average 1.440922190201729) internal successors, (500), 347 states have internal predecessors, (500), 78 states have call successors, (78), 3 states have call predecessors, (78), 3 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2024-10-13 03:47:01,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 656 transitions. [2024-10-13 03:47:01,727 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 656 transitions. Word has length 182 [2024-10-13 03:47:01,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:47:01,728 INFO L471 AbstractCegarLoop]: Abstraction has 429 states and 656 transitions. [2024-10-13 03:47:01,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-13 03:47:01,728 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 656 transitions. [2024-10-13 03:47:01,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-10-13 03:47:01,731 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:47:01,731 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 03:47:01,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 03:47:01,732 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:47:01,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:47:01,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1726751460, now seen corresponding path program 1 times [2024-10-13 03:47:01,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:47:01,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794191327] [2024-10-13 03:47:01,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:47:01,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:47:01,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:02,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:47:02,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:02,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:47:02,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:02,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:47:02,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:02,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:47:02,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:02,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:47:02,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:02,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 03:47:02,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:02,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 03:47:02,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:02,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 03:47:02,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:02,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 03:47:02,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:02,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 03:47:02,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:02,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 03:47:02,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:02,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 03:47:02,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:02,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 03:47:02,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:02,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 03:47:02,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:02,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 03:47:02,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:02,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 03:47:02,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:02,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 03:47:02,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:02,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 03:47:02,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:02,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 03:47:02,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:02,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-13 03:47:02,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:02,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-13 03:47:02,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:02,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 03:47:02,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:02,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-13 03:47:02,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:02,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 03:47:02,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:02,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-13 03:47:02,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:02,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-13 03:47:02,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:02,279 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-13 03:47:02,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:47:02,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794191327] [2024-10-13 03:47:02,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794191327] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:47:02,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:47:02,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 03:47:02,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325828049] [2024-10-13 03:47:02,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:47:02,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 03:47:02,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:47:02,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 03:47:02,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 03:47:02,284 INFO L87 Difference]: Start difference. First operand 429 states and 656 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, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-13 03:47:02,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:47:02,496 INFO L93 Difference]: Finished difference Result 683 states and 1040 transitions. [2024-10-13 03:47:02,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 03:47:02,497 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, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 182 [2024-10-13 03:47:02,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:47:02,501 INFO L225 Difference]: With dead ends: 683 [2024-10-13 03:47:02,501 INFO L226 Difference]: Without dead ends: 393 [2024-10-13 03:47:02,502 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 55 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-10-13 03:47:02,503 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 118 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 03:47:02,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 449 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 03:47:02,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-10-13 03:47:02,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 375. [2024-10-13 03:47:02,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 293 states have (on average 1.4095563139931742) internal successors, (413), 293 states have internal predecessors, (413), 78 states have call successors, (78), 3 states have call predecessors, (78), 3 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2024-10-13 03:47:02,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 569 transitions. [2024-10-13 03:47:02,541 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 569 transitions. Word has length 182 [2024-10-13 03:47:02,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:47:02,541 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 569 transitions. [2024-10-13 03:47:02,541 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, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-13 03:47:02,542 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 569 transitions. [2024-10-13 03:47:02,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-10-13 03:47:02,543 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:47:02,543 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 03:47:02,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 03:47:02,543 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:47:02,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:47:02,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1741486616, now seen corresponding path program 1 times [2024-10-13 03:47:02,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:47:02,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733853883] [2024-10-13 03:47:02,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:47:02,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:47:02,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:02,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:47:02,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:02,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:47:02,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:02,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:47:02,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:02,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:47:02,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:02,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:47:02,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:02,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 03:47:02,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:02,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 03:47:02,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:02,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 03:47:02,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:02,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 03:47:02,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:02,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 03:47:02,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:02,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 03:47:02,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:02,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 03:47:02,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:02,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 03:47:02,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:02,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 03:47:02,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:02,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 03:47:02,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:02,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 03:47:02,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:02,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 03:47:02,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:02,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 03:47:02,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:02,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 03:47:02,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:02,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-13 03:47:02,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:02,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-13 03:47:02,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:02,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 03:47:02,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:02,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-13 03:47:02,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:02,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 03:47:02,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:02,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-13 03:47:02,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:02,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-13 03:47:02,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:02,944 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-13 03:47:02,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:47:02,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733853883] [2024-10-13 03:47:02,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733853883] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:47:02,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:47:02,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 03:47:02,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974021321] [2024-10-13 03:47:02,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:47:02,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 03:47:02,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:47:02,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 03:47:02,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 03:47:02,946 INFO L87 Difference]: Start difference. First operand 375 states and 569 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-13 03:47:03,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:47:03,184 INFO L93 Difference]: Finished difference Result 721 states and 1088 transitions. [2024-10-13 03:47:03,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 03:47:03,185 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 183 [2024-10-13 03:47:03,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:47:03,187 INFO L225 Difference]: With dead ends: 721 [2024-10-13 03:47:03,188 INFO L226 Difference]: Without dead ends: 399 [2024-10-13 03:47:03,189 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 03:47:03,192 INFO L432 NwaCegarLoop]: 216 mSDtfsCounter, 196 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 03:47:03,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 738 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 03:47:03,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2024-10-13 03:47:03,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 375. [2024-10-13 03:47:03,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 293 states have (on average 1.4027303754266212) internal successors, (411), 293 states have internal predecessors, (411), 78 states have call successors, (78), 3 states have call predecessors, (78), 3 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2024-10-13 03:47:03,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 567 transitions. [2024-10-13 03:47:03,226 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 567 transitions. Word has length 183 [2024-10-13 03:47:03,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:47:03,226 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 567 transitions. [2024-10-13 03:47:03,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-13 03:47:03,227 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 567 transitions. [2024-10-13 03:47:03,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-10-13 03:47:03,229 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:47:03,229 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 03:47:03,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 03:47:03,229 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:47:03,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:47:03,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1039886742, now seen corresponding path program 1 times [2024-10-13 03:47:03,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:47:03,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703522530] [2024-10-13 03:47:03,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:47:03,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:47:03,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:03,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:47:03,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:03,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:47:03,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:03,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:47:03,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:03,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:47:03,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:03,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:47:03,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:03,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 03:47:03,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:03,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 03:47:03,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:03,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 03:47:03,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:03,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 03:47:03,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:03,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 03:47:03,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:03,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 03:47:03,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:03,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 03:47:03,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:03,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 03:47:03,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:03,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 03:47:03,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:03,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 03:47:03,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:03,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 03:47:03,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:03,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 03:47:03,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:03,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 03:47:03,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:03,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 03:47:03,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:03,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-13 03:47:03,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:03,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-13 03:47:03,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:03,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 03:47:03,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:03,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-13 03:47:03,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:03,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 03:47:03,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:03,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-13 03:47:03,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:03,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-13 03:47:03,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:03,754 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-13 03:47:03,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:47:03,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703522530] [2024-10-13 03:47:03,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703522530] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:47:03,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:47:03,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 03:47:03,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785510167] [2024-10-13 03:47:03,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:47:03,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 03:47:03,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:47:03,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 03:47:03,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 03:47:03,757 INFO L87 Difference]: Start difference. First operand 375 states and 567 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-13 03:47:04,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:47:04,000 INFO L93 Difference]: Finished difference Result 709 states and 1070 transitions. [2024-10-13 03:47:04,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 03:47:04,001 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 183 [2024-10-13 03:47:04,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:47:04,004 INFO L225 Difference]: With dead ends: 709 [2024-10-13 03:47:04,004 INFO L226 Difference]: Without dead ends: 391 [2024-10-13 03:47:04,005 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 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-10-13 03:47:04,006 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 112 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 03:47:04,006 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 453 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 03:47:04,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2024-10-13 03:47:04,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 377. [2024-10-13 03:47:04,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 295 states have (on average 1.3966101694915254) internal successors, (412), 295 states have internal predecessors, (412), 78 states have call successors, (78), 3 states have call predecessors, (78), 3 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2024-10-13 03:47:04,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 568 transitions. [2024-10-13 03:47:04,046 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 568 transitions. Word has length 183 [2024-10-13 03:47:04,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:47:04,047 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 568 transitions. [2024-10-13 03:47:04,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-13 03:47:04,048 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 568 transitions. [2024-10-13 03:47:04,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-10-13 03:47:04,049 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:47:04,050 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 03:47:04,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 03:47:04,050 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:47:04,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:47:04,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1670534719, now seen corresponding path program 1 times [2024-10-13 03:47:04,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:47:04,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176697398] [2024-10-13 03:47:04,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:47:04,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:47:04,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:04,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:47:04,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:04,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:47:04,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:04,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:47:04,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:04,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:47:04,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:04,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:47:04,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:04,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 03:47:04,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:04,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 03:47:04,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:04,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 03:47:04,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:04,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 03:47:04,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:04,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 03:47:04,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:04,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 03:47:04,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:04,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 03:47:04,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:04,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 03:47:04,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:04,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 03:47:04,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:04,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 03:47:04,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:04,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 03:47:04,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:04,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 03:47:04,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:04,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 03:47:04,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:04,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 03:47:04,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:04,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-13 03:47:04,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:04,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-13 03:47:04,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:04,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 03:47:04,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:04,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-13 03:47:04,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:04,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 03:47:04,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:04,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-13 03:47:04,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:04,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-13 03:47:04,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:04,617 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-13 03:47:04,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:47:04,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176697398] [2024-10-13 03:47:04,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176697398] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:47:04,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:47:04,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 03:47:04,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016191980] [2024-10-13 03:47:04,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:47:04,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 03:47:04,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:47:04,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 03:47:04,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 03:47:04,620 INFO L87 Difference]: Start difference. First operand 377 states and 568 transitions. Second operand has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-13 03:47:04,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:47:04,969 INFO L93 Difference]: Finished difference Result 697 states and 1045 transitions. [2024-10-13 03:47:04,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 03:47:04,970 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 184 [2024-10-13 03:47:04,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:47:04,973 INFO L225 Difference]: With dead ends: 697 [2024-10-13 03:47:04,973 INFO L226 Difference]: Without dead ends: 389 [2024-10-13 03:47:04,974 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-13 03:47:04,974 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 230 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 733 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 03:47:04,975 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 733 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 03:47:04,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2024-10-13 03:47:05,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 375. [2024-10-13 03:47:05,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 293 states have (on average 1.3686006825938566) internal successors, (401), 293 states have internal predecessors, (401), 78 states have call successors, (78), 3 states have call predecessors, (78), 3 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2024-10-13 03:47:05,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 557 transitions. [2024-10-13 03:47:05,019 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 557 transitions. Word has length 184 [2024-10-13 03:47:05,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:47:05,020 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 557 transitions. [2024-10-13 03:47:05,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-13 03:47:05,020 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 557 transitions. [2024-10-13 03:47:05,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-10-13 03:47:05,023 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:47:05,023 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 03:47:05,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 03:47:05,025 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:47:05,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:47:05,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1052989697, now seen corresponding path program 1 times [2024-10-13 03:47:05,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:47:05,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453494992] [2024-10-13 03:47:05,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:47:05,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:47:05,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 03:47:05,159 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 03:47:05,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 03:47:05,422 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 03:47:05,422 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 03:47:05,424 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 03:47:05,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 03:47:05,429 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:47:05,585 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 03:47:05,588 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 03:47:05 BoogieIcfgContainer [2024-10-13 03:47:05,588 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 03:47:05,590 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 03:47:05,590 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 03:47:05,590 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 03:47:05,591 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:46:57" (3/4) ... [2024-10-13 03:47:05,593 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 03:47:05,595 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 03:47:05,595 INFO L158 Benchmark]: Toolchain (without parser) took 9551.13ms. Allocated memory was 144.7MB in the beginning and 251.7MB in the end (delta: 107.0MB). Free memory was 105.0MB in the beginning and 173.8MB in the end (delta: -68.8MB). Peak memory consumption was 37.2MB. Max. memory is 16.1GB. [2024-10-13 03:47:05,596 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 100.7MB. Free memory was 68.2MB in the beginning and 68.1MB in the end (delta: 40.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 03:47:05,596 INFO L158 Benchmark]: CACSL2BoogieTranslator took 469.92ms. Allocated memory is still 144.7MB. Free memory was 105.0MB in the beginning and 86.1MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-13 03:47:05,596 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.88ms. Allocated memory is still 144.7MB. Free memory was 86.1MB in the beginning and 81.0MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 03:47:05,597 INFO L158 Benchmark]: Boogie Preprocessor took 89.50ms. Allocated memory is still 144.7MB. Free memory was 81.0MB in the beginning and 73.4MB in the end (delta: 7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-13 03:47:05,597 INFO L158 Benchmark]: RCFGBuilder took 907.45ms. Allocated memory is still 144.7MB. Free memory was 73.4MB in the beginning and 76.8MB in the end (delta: -3.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-13 03:47:05,597 INFO L158 Benchmark]: TraceAbstraction took 7990.97ms. Allocated memory was 144.7MB in the beginning and 251.7MB in the end (delta: 107.0MB). Free memory was 76.2MB in the beginning and 174.8MB in the end (delta: -98.6MB). Peak memory consumption was 119.2MB. Max. memory is 16.1GB. [2024-10-13 03:47:05,598 INFO L158 Benchmark]: Witness Printer took 4.94ms. Allocated memory is still 251.7MB. Free memory was 174.8MB in the beginning and 173.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 03:47:05,599 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.10ms. Allocated memory is still 100.7MB. Free memory was 68.2MB in the beginning and 68.1MB in the end (delta: 40.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 469.92ms. Allocated memory is still 144.7MB. Free memory was 105.0MB in the beginning and 86.1MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.88ms. Allocated memory is still 144.7MB. Free memory was 86.1MB in the beginning and 81.0MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 89.50ms. Allocated memory is still 144.7MB. Free memory was 81.0MB in the beginning and 73.4MB in the end (delta: 7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 907.45ms. Allocated memory is still 144.7MB. Free memory was 73.4MB in the beginning and 76.8MB in the end (delta: -3.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 7990.97ms. Allocated memory was 144.7MB in the beginning and 251.7MB in the end (delta: 107.0MB). Free memory was 76.2MB in the beginning and 174.8MB in the end (delta: -98.6MB). Peak memory consumption was 119.2MB. Max. memory is 16.1GB. * Witness Printer took 4.94ms. Allocated memory is still 251.7MB. Free memory was 174.8MB in the beginning and 173.8MB in the end (delta: 1.0MB). 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 someBinaryFLOATComparisonOperation at line 155, overapproximation of bitwiseOr at line 64, overapproximation of bitwiseAnd at line 69, overapproximation of someBinaryDOUBLEComparisonOperation at line 200. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_4 = 10; [L24] unsigned char var_1_5 = 4; [L25] unsigned char var_1_6 = 1; [L26] float var_1_7 = 127.25; [L27] float var_1_8 = 128.5; [L28] unsigned char var_1_11 = 0; [L29] unsigned char var_1_12 = 0; [L30] signed long int var_1_13 = -10; [L31] unsigned char var_1_14 = 1; [L32] signed char var_1_16 = -1; [L33] signed char var_1_17 = -5; [L34] signed char var_1_18 = 2; [L35] double var_1_19 = 256.7; [L36] double var_1_20 = 256.5; [L37] double var_1_21 = 5.058; [L38] double var_1_22 = 2.4; [L39] double var_1_23 = 5.875; [L40] signed long int var_1_24 = -128; [L41] unsigned long int var_1_25 = 128; [L42] unsigned char var_1_26 = 128; [L43] unsigned long int var_1_27 = 4189380979; [L44] unsigned char var_1_28 = 0; [L45] unsigned char var_1_29 = 0; [L46] unsigned long int var_1_30 = 2; [L47] unsigned long int var_1_31 = 1701266831; [L48] unsigned long int var_1_32 = 1169870883; [L49] double var_1_33 = 4.3; [L50] double var_1_34 = 7.25; [L51] unsigned short int var_1_35 = 32; [L52] unsigned char last_1_var_1_1 = 1; [L53] unsigned char last_1_var_1_6 = 1; [L54] signed char last_1_var_1_16 = -1; [L55] double last_1_var_1_19 = 256.7; [L56] signed long int last_1_var_1_24 = -128; [L57] unsigned long int last_1_var_1_25 = 128; [L58] unsigned long int last_1_var_1_30 = 2; [L59] double last_1_var_1_33 = 4.3; [L204] isInitial = 1 [L205] FCALL initially() [L206] int k_loop; [L207] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=10, var_1_5=4, var_1_6=1, var_1_7=509/4, var_1_8=257/2] [L207] COND TRUE k_loop < 1 [L208] CALL updateLastVariables() [L190] last_1_var_1_1 = var_1_1 [L191] last_1_var_1_6 = var_1_6 [L192] last_1_var_1_16 = var_1_16 [L193] last_1_var_1_19 = var_1_19 [L194] last_1_var_1_24 = var_1_24 [L195] last_1_var_1_25 = var_1_25 [L196] last_1_var_1_30 = var_1_30 [L197] last_1_var_1_33 = var_1_33 [L208] RET updateLastVariables() [L209] CALL updateVariables() [L146] var_1_4 = __VERIFIER_nondet_uchar() [L147] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_5=4, var_1_6=1, var_1_7=509/4, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_5=4, var_1_6=1, var_1_7=509/4, var_1_8=257/2] [L147] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_5=4, var_1_6=1, var_1_7=509/4, var_1_8=257/2] [L148] CALL assume_abort_if_not(var_1_4 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=4, var_1_6=1, var_1_7=509/4, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=4, var_1_6=1, var_1_7=509/4, var_1_8=257/2] [L148] RET assume_abort_if_not(var_1_4 <= 127) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=4, var_1_6=1, var_1_7=509/4, var_1_8=257/2] [L149] var_1_5 = __VERIFIER_nondet_uchar() [L150] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_6=1, var_1_7=509/4, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_6=1, var_1_7=509/4, var_1_8=257/2] [L150] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_6=1, var_1_7=509/4, var_1_8=257/2] [L151] CALL assume_abort_if_not(var_1_5 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1, var_1_7=509/4, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1, var_1_7=509/4, var_1_8=257/2] [L151] RET assume_abort_if_not(var_1_5 <= 254) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1, var_1_7=509/4, var_1_8=257/2] [L152] var_1_7 = __VERIFIER_nondet_float() [L153] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427387900e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1, var_1_8=257/2] [L153] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427387900e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1, var_1_8=257/2] [L154] var_1_8 = __VERIFIER_nondet_float() [L155] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L155] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L156] var_1_11 = __VERIFIER_nondet_uchar() [L157] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L157] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L158] CALL assume_abort_if_not(var_1_11 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L158] RET assume_abort_if_not(var_1_11 <= 0) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L159] var_1_12 = __VERIFIER_nondet_uchar() [L160] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L160] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L161] CALL assume_abort_if_not(var_1_12 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L161] RET assume_abort_if_not(var_1_12 <= 0) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L162] var_1_17 = __VERIFIER_nondet_char() [L163] CALL assume_abort_if_not(var_1_17 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L163] RET assume_abort_if_not(var_1_17 >= -63) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L164] CALL assume_abort_if_not(var_1_17 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L164] RET assume_abort_if_not(var_1_17 <= 63) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L165] var_1_18 = __VERIFIER_nondet_char() [L166] CALL assume_abort_if_not(var_1_18 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L166] RET assume_abort_if_not(var_1_18 >= -63) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L167] CALL assume_abort_if_not(var_1_18 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L167] RET assume_abort_if_not(var_1_18 <= 63) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L168] var_1_20 = __VERIFIER_nondet_double() [L169] CALL assume_abort_if_not((var_1_20 >= -230584.3009213691390e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 2305843.009213691390e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L169] RET assume_abort_if_not((var_1_20 >= -230584.3009213691390e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 2305843.009213691390e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L170] var_1_21 = __VERIFIER_nondet_double() [L171] CALL assume_abort_if_not((var_1_21 >= -230584.3009213691390e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 2305843.009213691390e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L171] RET assume_abort_if_not((var_1_21 >= -230584.3009213691390e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 2305843.009213691390e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L172] var_1_22 = __VERIFIER_nondet_double() [L173] CALL assume_abort_if_not((var_1_22 >= -230584.3009213691390e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 2305843.009213691390e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L173] RET assume_abort_if_not((var_1_22 >= -230584.3009213691390e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 2305843.009213691390e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L174] var_1_23 = __VERIFIER_nondet_double() [L175] CALL assume_abort_if_not((var_1_23 >= -230584.3009213691390e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 2305843.009213691390e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L175] RET assume_abort_if_not((var_1_23 >= -230584.3009213691390e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 2305843.009213691390e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L176] var_1_27 = __VERIFIER_nondet_ulong() [L177] CALL assume_abort_if_not(var_1_27 >= 3221225471) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=-5368709121, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=-5368709121, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L177] RET assume_abort_if_not(var_1_27 >= 3221225471) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=-5368709121, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L178] CALL assume_abort_if_not(var_1_27 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=-5368709121, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=-5368709121, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L178] RET assume_abort_if_not(var_1_27 <= 4294967295) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=-5368709121, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L179] var_1_29 = __VERIFIER_nondet_uchar() [L180] CALL assume_abort_if_not(var_1_29 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=-5368709121, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=-5368709121, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L180] RET assume_abort_if_not(var_1_29 >= 1) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=-5368709121, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L181] CALL assume_abort_if_not(var_1_29 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=-5368709121, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=-5368709121, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L181] RET assume_abort_if_not(var_1_29 <= 1) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=-5368709121, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L182] var_1_31 = __VERIFIER_nondet_ulong() [L183] CALL assume_abort_if_not(var_1_31 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=-5368709121, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=6442450943, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=-5368709121, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=6442450943, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L183] RET assume_abort_if_not(var_1_31 >= 1073741823) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=-5368709121, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=6442450943, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L184] CALL assume_abort_if_not(var_1_31 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=-5368709121, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=6442450943, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=-5368709121, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=6442450943, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L184] RET assume_abort_if_not(var_1_31 <= 2147483647) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=-5368709121, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=6442450943, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L185] var_1_32 = __VERIFIER_nondet_ulong() [L186] CALL assume_abort_if_not(var_1_32 >= 1073741824) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=-5368709121, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=6442450943, var_1_32=-3137011584, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=-5368709121, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=6442450943, var_1_32=-3137011584, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L186] RET assume_abort_if_not(var_1_32 >= 1073741824) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=-5368709121, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=6442450943, var_1_32=-3137011584, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L187] CALL assume_abort_if_not(var_1_32 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=-5368709121, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=6442450943, var_1_32=-3137011584, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=-5368709121, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=6442450943, var_1_32=-3137011584, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L187] RET assume_abort_if_not(var_1_32 <= 2147483647) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=-5368709121, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=6442450943, var_1_32=-3137011584, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L209] RET updateVariables() [L210] CALL step() [L63] COND TRUE last_1_var_1_6 || last_1_var_1_6 VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=-5368709121, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=6442450943, var_1_32=-3137011584, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L64] EXPR last_1_var_1_16 | ((((var_1_5) > (128)) ? (var_1_5) : (128))) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=-5368709121, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=6442450943, var_1_32=-3137011584, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L64] COND FALSE !((last_1_var_1_16 | ((((var_1_5) > (128)) ? (var_1_5) : (128)))) < last_1_var_1_25) [L68] unsigned long int stepLocal_6 = (var_1_27 - last_1_var_1_1) - var_1_4; VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, stepLocal_6=-5368709248, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=-5368709121, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=6442450943, var_1_32=-3137011584, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L69] EXPR last_1_var_1_30 & last_1_var_1_25 VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, stepLocal_6=-5368709248, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=-5368709121, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=6442450943, var_1_32=-3137011584, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L69] COND TRUE stepLocal_6 > (last_1_var_1_30 & last_1_var_1_25) [L70] var_1_26 = (var_1_4 + 4) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=130, var_1_27=-5368709121, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=6442450943, var_1_32=-3137011584, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L74] COND TRUE last_1_var_1_33 > last_1_var_1_33 [L75] var_1_28 = (! ((var_1_4 != last_1_var_1_24) || var_1_29)) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=130, var_1_27=-5368709121, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=6442450943, var_1_32=-3137011584, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L77] var_1_30 = ((((((var_1_31 + var_1_32)) < ((3305479224u - var_1_5))) ? ((var_1_31 + var_1_32)) : ((3305479224u - var_1_5)))) - ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4)))) [L78] var_1_33 = var_1_20 [L79] var_1_34 = var_1_22 [L80] var_1_35 = var_1_30 VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_20=6442450949, var_1_22=6442450948, var_1_24=-128, var_1_25=128, var_1_26=130, var_1_27=-5368709121, var_1_28=0, var_1_29=1, var_1_30=3305439233, var_1_31=6442450943, var_1_32=-3137011584, var_1_33=6442450949, var_1_34=6442450948, var_1_35=3305439233, var_1_4=126, var_1_5=989488257, var_1_6=1] [L81] COND FALSE !(((var_1_7 + 100000.5f) - var_1_8) > (var_1_33 + var_1_34)) [L88] var_1_6 = 0 VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_20=6442450949, var_1_22=6442450948, var_1_24=-128, var_1_25=128, var_1_26=130, var_1_27=-5368709121, var_1_28=0, var_1_29=1, var_1_30=3305439233, var_1_31=6442450943, var_1_32=-3137011584, var_1_33=6442450949, var_1_34=6442450948, var_1_35=3305439233, var_1_4=126, var_1_5=989488257, var_1_6=0] [L90] unsigned char stepLocal_2 = var_1_14; VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, stepLocal_2=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_20=6442450949, var_1_22=6442450948, var_1_24=-128, var_1_25=128, var_1_26=130, var_1_27=-5368709121, var_1_28=0, var_1_29=1, var_1_30=3305439233, var_1_31=6442450943, var_1_32=-3137011584, var_1_33=6442450949, var_1_34=6442450948, var_1_35=3305439233, var_1_4=126, var_1_5=989488257, var_1_6=0] [L91] COND FALSE !(stepLocal_2 && var_1_6) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_20=6442450949, var_1_22=6442450948, var_1_24=-128, var_1_25=128, var_1_26=130, var_1_27=-5368709121, var_1_28=0, var_1_29=1, var_1_30=3305439233, var_1_31=6442450943, var_1_32=-3137011584, var_1_33=6442450949, var_1_34=6442450948, var_1_35=3305439233, var_1_4=126, var_1_5=989488257, var_1_6=0] [L94] COND FALSE !(\read(var_1_28)) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_20=6442450949, var_1_22=6442450948, var_1_24=-128, var_1_25=128, var_1_26=130, var_1_27=-5368709121, var_1_28=0, var_1_29=1, var_1_30=3305439233, var_1_31=6442450943, var_1_32=-3137011584, var_1_33=6442450949, var_1_34=6442450948, var_1_35=3305439233, var_1_4=126, var_1_5=989488257, var_1_6=0] [L98] COND FALSE !(var_1_18 <= (~ var_1_4)) [L105] var_1_24 = var_1_18 VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_20=6442450949, var_1_22=6442450948, var_1_24=0, var_1_25=128, var_1_26=130, var_1_27=-5368709121, var_1_28=0, var_1_29=1, var_1_30=3305439233, var_1_31=6442450943, var_1_32=-3137011584, var_1_33=6442450949, var_1_34=6442450948, var_1_35=3305439233, var_1_4=126, var_1_5=989488257, var_1_6=0] [L107] unsigned char stepLocal_0 = var_1_14; VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, stepLocal_0=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_20=6442450949, var_1_22=6442450948, var_1_24=0, var_1_25=128, var_1_26=130, var_1_27=-5368709121, var_1_28=0, var_1_29=1, var_1_30=3305439233, var_1_31=6442450943, var_1_32=-3137011584, var_1_33=6442450949, var_1_34=6442450948, var_1_35=3305439233, var_1_4=126, var_1_5=989488257, var_1_6=0] [L108] COND FALSE !(var_1_28 && stepLocal_0) [L111] var_1_1 = ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=129, var_1_20=6442450949, var_1_22=6442450948, var_1_24=0, var_1_25=128, var_1_26=130, var_1_27=-5368709121, var_1_28=0, var_1_29=1, var_1_30=3305439233, var_1_31=6442450943, var_1_32=-3137011584, var_1_33=6442450949, var_1_34=6442450948, var_1_35=3305439233, var_1_4=126, var_1_5=989488257, var_1_6=0] [L113] unsigned char stepLocal_1 = var_1_5; VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, stepLocal_1=989488257, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=129, var_1_20=6442450949, var_1_22=6442450948, var_1_24=0, var_1_25=128, var_1_26=130, var_1_27=-5368709121, var_1_28=0, var_1_29=1, var_1_30=3305439233, var_1_31=6442450943, var_1_32=-3137011584, var_1_33=6442450949, var_1_34=6442450948, var_1_35=3305439233, var_1_4=126, var_1_5=989488257, var_1_6=0] [L114] COND FALSE !(var_1_7 > var_1_33) [L121] var_1_13 = var_1_4 VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, stepLocal_1=989488257, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=129, var_1_20=6442450949, var_1_22=6442450948, var_1_24=0, var_1_25=128, var_1_26=130, var_1_27=-5368709121, var_1_28=0, var_1_29=1, var_1_30=3305439233, var_1_31=6442450943, var_1_32=-3137011584, var_1_33=6442450949, var_1_34=6442450948, var_1_35=3305439233, var_1_4=126, var_1_5=989488257, var_1_6=0] [L123] signed char stepLocal_3 = var_1_18; VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, stepLocal_1=989488257, stepLocal_3=0, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=129, var_1_20=6442450949, var_1_22=6442450948, var_1_24=0, var_1_25=128, var_1_26=130, var_1_27=-5368709121, var_1_28=0, var_1_29=1, var_1_30=3305439233, var_1_31=6442450943, var_1_32=-3137011584, var_1_33=6442450949, var_1_34=6442450948, var_1_35=3305439233, var_1_4=126, var_1_5=989488257, var_1_6=0] [L124] COND FALSE !((var_1_16 ^ 1) >= stepLocal_3) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, stepLocal_1=989488257, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=129, var_1_20=6442450949, var_1_22=6442450948, var_1_24=0, var_1_25=128, var_1_26=130, var_1_27=-5368709121, var_1_28=0, var_1_29=1, var_1_30=3305439233, var_1_31=6442450943, var_1_32=-3137011584, var_1_33=6442450949, var_1_34=6442450948, var_1_35=3305439233, var_1_4=126, var_1_5=989488257, var_1_6=0] [L133] signed long int stepLocal_5 = var_1_13; VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, stepLocal_1=989488257, stepLocal_5=126, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=129, var_1_20=6442450949, var_1_22=6442450948, var_1_24=0, var_1_25=128, var_1_26=130, var_1_27=-5368709121, var_1_28=0, var_1_29=1, var_1_30=3305439233, var_1_31=6442450943, var_1_32=-3137011584, var_1_33=6442450949, var_1_34=6442450948, var_1_35=3305439233, var_1_4=126, var_1_5=989488257, var_1_6=0] [L134] EXPR var_1_24 | var_1_35 VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, stepLocal_1=989488257, stepLocal_5=126, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=129, var_1_20=6442450949, var_1_22=6442450948, var_1_24=0, var_1_25=128, var_1_26=130, var_1_27=-5368709121, var_1_28=0, var_1_29=1, var_1_30=3305439233, var_1_31=6442450943, var_1_32=-3137011584, var_1_33=6442450949, var_1_34=6442450948, var_1_35=3305439233, var_1_4=126, var_1_5=989488257, var_1_6=0] [L134] signed long int stepLocal_4 = var_1_24 | var_1_35; [L135] COND TRUE (10000 / 64) >= stepLocal_4 [L136] var_1_25 = ((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4))) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, stepLocal_1=989488257, stepLocal_5=126, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=129, var_1_20=6442450949, var_1_22=6442450948, var_1_24=0, var_1_25=129, var_1_26=130, var_1_27=-5368709121, var_1_28=0, var_1_29=1, var_1_30=3305439233, var_1_31=6442450943, var_1_32=-3137011584, var_1_33=6442450949, var_1_34=6442450948, var_1_35=3305439233, var_1_4=126, var_1_5=989488257, var_1_6=0] [L210] RET step() [L211] CALL, EXPR property() [L200] EXPR ((((var_1_28 && var_1_14) ? (var_1_1 == ((unsigned char) (var_1_4 + 5))) : (var_1_1 == ((unsigned char) ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))))) && ((((var_1_7 + 100000.5f) - var_1_8) > (var_1_33 + var_1_34)) ? ((var_1_8 > var_1_33) ? (var_1_6 == ((unsigned char) (var_1_11 || var_1_12))) : (var_1_6 == ((unsigned char) var_1_11))) : (var_1_6 == ((unsigned char) 0)))) && ((var_1_7 > var_1_33) ? ((var_1_5 < var_1_26) ? (var_1_13 == ((signed long int) (var_1_4 - 1))) : (var_1_13 == ((signed long int) var_1_5))) : (var_1_13 == ((signed long int) var_1_4)))) && ((last_1_var_1_6 || last_1_var_1_6) ? (((last_1_var_1_16 | ((((var_1_5) > (128)) ? (var_1_5) : (128)))) < last_1_var_1_25) ? (var_1_14 == ((unsigned char) (var_1_11 || var_1_12))) : 1) : 1) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=129, var_1_20=6442450949, var_1_22=6442450948, var_1_24=0, var_1_25=129, var_1_26=130, var_1_27=-5368709121, var_1_28=0, var_1_29=1, var_1_30=3305439233, var_1_31=6442450943, var_1_32=-3137011584, var_1_33=6442450949, var_1_34=6442450948, var_1_35=3305439233, var_1_4=126, var_1_5=989488257, var_1_6=0] [L200] EXPR ((((((((var_1_28 && var_1_14) ? (var_1_1 == ((unsigned char) (var_1_4 + 5))) : (var_1_1 == ((unsigned char) ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))))) && ((((var_1_7 + 100000.5f) - var_1_8) > (var_1_33 + var_1_34)) ? ((var_1_8 > var_1_33) ? (var_1_6 == ((unsigned char) (var_1_11 || var_1_12))) : (var_1_6 == ((unsigned char) var_1_11))) : (var_1_6 == ((unsigned char) 0)))) && ((var_1_7 > var_1_33) ? ((var_1_5 < var_1_26) ? (var_1_13 == ((signed long int) (var_1_4 - 1))) : (var_1_13 == ((signed long int) var_1_5))) : (var_1_13 == ((signed long int) var_1_4)))) && ((last_1_var_1_6 || last_1_var_1_6) ? (((last_1_var_1_16 | ((((var_1_5) > (128)) ? (var_1_5) : (128)))) < last_1_var_1_25) ? (var_1_14 == ((unsigned char) (var_1_11 || var_1_12))) : 1) : 1)) && ((var_1_14 && var_1_6) ? (var_1_16 == ((signed char) (((((var_1_17 + var_1_18)) < (-5)) ? ((var_1_17 + var_1_18)) : (-5))))) : (var_1_28 ? (var_1_16 == ((signed char) var_1_17)) : 1))) && (((var_1_16 ^ 1) >= var_1_18) ? (var_1_28 ? ((var_1_8 <= ((((var_1_33) > (last_1_var_1_19)) ? (var_1_33) : (last_1_var_1_19)))) ? (var_1_19 == ((double) ((((var_1_7) > (((var_1_20 + var_1_21) + (var_1_22 + var_1_23)))) ? (var_1_7) : (((var_1_20 + var_1_21) + (var_1_22 + var_1_23))))))) : (var_1_19 == ((double) var_1_21))) : 1) : 1)) && ((var_1_18 <= (~ var_1_4)) ? (var_1_28 ? (var_1_24 == ((signed long int) ((((256) < (((var_1_26 + var_1_18) + ((((last_1_var_1_24) < (var_1_5)) ? (last_1_var_1_24) : (var_1_5)))))) ? (256) : (((var_1_26 + var_1_18) + ((((last_1_var_1_24) < (var_1_5)) ? (last_1_var_1_24) : (var_1_5))))))))) : (var_1_24 == ((signed long int) -5))) : (var_1_24 == ((signed long int) var_1_18)))) && (((10000 / 64) >= (var_1_24 | var_1_35)) ? (var_1_25 == ((unsigned long int) ((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4))))) : ((var_1_13 < ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4)))) ? (var_1_25 == ((unsigned long int) var_1_26)) : (var_1_25 == ((unsigned long int) var_1_26)))) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=129, var_1_20=6442450949, var_1_22=6442450948, var_1_24=0, var_1_25=129, var_1_26=130, var_1_27=-5368709121, var_1_28=0, var_1_29=1, var_1_30=3305439233, var_1_31=6442450943, var_1_32=-3137011584, var_1_33=6442450949, var_1_34=6442450948, var_1_35=3305439233, var_1_4=126, var_1_5=989488257, var_1_6=0] [L200] EXPR (((((((((var_1_28 && var_1_14) ? (var_1_1 == ((unsigned char) (var_1_4 + 5))) : (var_1_1 == ((unsigned char) ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))))) && ((((var_1_7 + 100000.5f) - var_1_8) > (var_1_33 + var_1_34)) ? ((var_1_8 > var_1_33) ? (var_1_6 == ((unsigned char) (var_1_11 || var_1_12))) : (var_1_6 == ((unsigned char) var_1_11))) : (var_1_6 == ((unsigned char) 0)))) && ((var_1_7 > var_1_33) ? ((var_1_5 < var_1_26) ? (var_1_13 == ((signed long int) (var_1_4 - 1))) : (var_1_13 == ((signed long int) var_1_5))) : (var_1_13 == ((signed long int) var_1_4)))) && ((last_1_var_1_6 || last_1_var_1_6) ? (((last_1_var_1_16 | ((((var_1_5) > (128)) ? (var_1_5) : (128)))) < last_1_var_1_25) ? (var_1_14 == ((unsigned char) (var_1_11 || var_1_12))) : 1) : 1)) && ((var_1_14 && var_1_6) ? (var_1_16 == ((signed char) (((((var_1_17 + var_1_18)) < (-5)) ? ((var_1_17 + var_1_18)) : (-5))))) : (var_1_28 ? (var_1_16 == ((signed char) var_1_17)) : 1))) && (((var_1_16 ^ 1) >= var_1_18) ? (var_1_28 ? ((var_1_8 <= ((((var_1_33) > (last_1_var_1_19)) ? (var_1_33) : (last_1_var_1_19)))) ? (var_1_19 == ((double) ((((var_1_7) > (((var_1_20 + var_1_21) + (var_1_22 + var_1_23)))) ? (var_1_7) : (((var_1_20 + var_1_21) + (var_1_22 + var_1_23))))))) : (var_1_19 == ((double) var_1_21))) : 1) : 1)) && ((var_1_18 <= (~ var_1_4)) ? (var_1_28 ? (var_1_24 == ((signed long int) ((((256) < (((var_1_26 + var_1_18) + ((((last_1_var_1_24) < (var_1_5)) ? (last_1_var_1_24) : (var_1_5)))))) ? (256) : (((var_1_26 + var_1_18) + ((((last_1_var_1_24) < (var_1_5)) ? (last_1_var_1_24) : (var_1_5))))))))) : (var_1_24 == ((signed long int) -5))) : (var_1_24 == ((signed long int) var_1_18)))) && (((10000 / 64) >= (var_1_24 | var_1_35)) ? (var_1_25 == ((unsigned long int) ((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4))))) : ((var_1_13 < ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4)))) ? (var_1_25 == ((unsigned long int) var_1_26)) : (var_1_25 == ((unsigned long int) var_1_26))))) && ((((var_1_27 - last_1_var_1_1) - var_1_4) > (last_1_var_1_30 & last_1_var_1_25)) ? (var_1_26 == ((unsigned char) (var_1_4 + 4))) : (var_1_26 == ((unsigned char) (4 + ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))))) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=129, var_1_20=6442450949, var_1_22=6442450948, var_1_24=0, var_1_25=129, var_1_26=130, var_1_27=-5368709121, var_1_28=0, var_1_29=1, var_1_30=3305439233, var_1_31=6442450943, var_1_32=-3137011584, var_1_33=6442450949, var_1_34=6442450948, var_1_35=3305439233, var_1_4=126, var_1_5=989488257, var_1_6=0] [L200-L201] return ((((((((((((((var_1_28 && var_1_14) ? (var_1_1 == ((unsigned char) (var_1_4 + 5))) : (var_1_1 == ((unsigned char) ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))))) && ((((var_1_7 + 100000.5f) - var_1_8) > (var_1_33 + var_1_34)) ? ((var_1_8 > var_1_33) ? (var_1_6 == ((unsigned char) (var_1_11 || var_1_12))) : (var_1_6 == ((unsigned char) var_1_11))) : (var_1_6 == ((unsigned char) 0)))) && ((var_1_7 > var_1_33) ? ((var_1_5 < var_1_26) ? (var_1_13 == ((signed long int) (var_1_4 - 1))) : (var_1_13 == ((signed long int) var_1_5))) : (var_1_13 == ((signed long int) var_1_4)))) && ((last_1_var_1_6 || last_1_var_1_6) ? (((last_1_var_1_16 | ((((var_1_5) > (128)) ? (var_1_5) : (128)))) < last_1_var_1_25) ? (var_1_14 == ((unsigned char) (var_1_11 || var_1_12))) : 1) : 1)) && ((var_1_14 && var_1_6) ? (var_1_16 == ((signed char) (((((var_1_17 + var_1_18)) < (-5)) ? ((var_1_17 + var_1_18)) : (-5))))) : (var_1_28 ? (var_1_16 == ((signed char) var_1_17)) : 1))) && (((var_1_16 ^ 1) >= var_1_18) ? (var_1_28 ? ((var_1_8 <= ((((var_1_33) > (last_1_var_1_19)) ? (var_1_33) : (last_1_var_1_19)))) ? (var_1_19 == ((double) ((((var_1_7) > (((var_1_20 + var_1_21) + (var_1_22 + var_1_23)))) ? (var_1_7) : (((var_1_20 + var_1_21) + (var_1_22 + var_1_23))))))) : (var_1_19 == ((double) var_1_21))) : 1) : 1)) && ((var_1_18 <= (~ var_1_4)) ? (var_1_28 ? (var_1_24 == ((signed long int) ((((256) < (((var_1_26 + var_1_18) + ((((last_1_var_1_24) < (var_1_5)) ? (last_1_var_1_24) : (var_1_5)))))) ? (256) : (((var_1_26 + var_1_18) + ((((last_1_var_1_24) < (var_1_5)) ? (last_1_var_1_24) : (var_1_5))))))))) : (var_1_24 == ((signed long int) -5))) : (var_1_24 == ((signed long int) var_1_18)))) && (((10000 / 64) >= (var_1_24 | var_1_35)) ? (var_1_25 == ((unsigned long int) ((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4))))) : ((var_1_13 < ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4)))) ? (var_1_25 == ((unsigned long int) var_1_26)) : (var_1_25 == ((unsigned long int) var_1_26))))) && ((((var_1_27 - last_1_var_1_1) - var_1_4) > (last_1_var_1_30 & last_1_var_1_25)) ? (var_1_26 == ((unsigned char) (var_1_4 + 4))) : (var_1_26 == ((unsigned char) (4 + ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4)))))))) && ((last_1_var_1_33 > last_1_var_1_33) ? (var_1_28 == ((unsigned char) (! ((var_1_4 != last_1_var_1_24) || var_1_29)))) : 1)) && (var_1_30 == ((unsigned long int) ((((((var_1_31 + var_1_32)) < ((3305479224u - var_1_5))) ? ((var_1_31 + var_1_32)) : ((3305479224u - var_1_5)))) - ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))))) && (var_1_33 == ((double) var_1_20))) && (var_1_34 == ((double) var_1_22))) && (var_1_35 == ((unsigned short int) var_1_30)) ; [L211] RET, EXPR property() [L211] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=129, var_1_20=6442450949, var_1_22=6442450948, var_1_24=0, var_1_25=129, var_1_26=130, var_1_27=-5368709121, var_1_28=0, var_1_29=1, var_1_30=3305439233, var_1_31=6442450943, var_1_32=-3137011584, var_1_33=6442450949, var_1_34=6442450948, var_1_35=3305439233, var_1_4=126, var_1_5=989488257, var_1_6=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=129, var_1_20=6442450949, var_1_22=6442450948, var_1_24=0, var_1_25=129, var_1_26=130, var_1_27=-5368709121, var_1_28=0, var_1_29=1, var_1_30=3305439233, var_1_31=6442450943, var_1_32=-3137011584, var_1_33=6442450949, var_1_34=6442450948, var_1_35=3305439233, var_1_4=126, var_1_5=989488257, var_1_6=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 110 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.8s, OverallIterations: 10, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1341 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1341 mSDsluCounter, 4618 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2939 mSDsCounter, 641 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 426 IncrementalHoareTripleChecker+Invalid, 1067 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 641 mSolverCounterUnsat, 1679 mSDtfsCounter, 426 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 544 GetRequests, 515 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=429occurred in iteration=5, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 9 MinimizatonAttempts, 300 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 1811 NumberOfCodeBlocks, 1811 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1618 ConstructedInterpolants, 0 QuantifiedInterpolants, 5086 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 11700/11700 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-10-13 03:47:05,645 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/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-43.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 7e66f2766686731553c198a13682fe7d31c9aeab700c26b7283920d0b82d9f8b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 03:47:08,057 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 03:47:08,147 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 03:47:08,156 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 03:47:08,157 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 03:47:08,193 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 03:47:08,194 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 03:47:08,194 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 03:47:08,195 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 03:47:08,195 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 03:47:08,196 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 03:47:08,196 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 03:47:08,198 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 03:47:08,203 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 03:47:08,203 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 03:47:08,204 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 03:47:08,204 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 03:47:08,204 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 03:47:08,204 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 03:47:08,205 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 03:47:08,205 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 03:47:08,206 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 03:47:08,206 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 03:47:08,206 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 03:47:08,206 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 03:47:08,207 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 03:47:08,207 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 03:47:08,207 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 03:47:08,207 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 03:47:08,208 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 03:47:08,208 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 03:47:08,208 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 03:47:08,208 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 03:47:08,209 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 03:47:08,209 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:47:08,211 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 03:47:08,212 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 03:47:08,212 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 03:47:08,213 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 03:47:08,213 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 03:47:08,213 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 03:47:08,214 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 03:47:08,214 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 03:47:08,214 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 03:47:08,215 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 03:47:08,215 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 -> 7e66f2766686731553c198a13682fe7d31c9aeab700c26b7283920d0b82d9f8b [2024-10-13 03:47:08,591 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 03:47:08,620 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 03:47:08,624 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 03:47:08,625 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 03:47:08,626 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 03:47:08,629 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-43.i [2024-10-13 03:47:10,172 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 03:47:10,426 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 03:47:10,427 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-43.i [2024-10-13 03:47:10,441 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b45599d4/2e43e8fc2f26411c90f0720b3a2eca58/FLAG46b7f727d [2024-10-13 03:47:10,456 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b45599d4/2e43e8fc2f26411c90f0720b3a2eca58 [2024-10-13 03:47:10,459 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 03:47:10,460 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 03:47:10,463 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 03:47:10,463 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 03:47:10,470 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 03:47:10,471 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:47:10" (1/1) ... [2024-10-13 03:47:10,472 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e54b9c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:47:10, skipping insertion in model container [2024-10-13 03:47:10,472 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:47:10" (1/1) ... [2024-10-13 03:47:10,508 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 03:47:10,696 WARN L248 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-1loop_file-43.i[916,929] [2024-10-13 03:47:10,818 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:47:10,841 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 03:47:10,874 WARN L248 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-1loop_file-43.i[916,929] [2024-10-13 03:47:10,935 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:47:10,967 INFO L204 MainTranslator]: Completed translation [2024-10-13 03:47:10,968 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:47:10 WrapperNode [2024-10-13 03:47:10,968 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 03:47:10,970 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 03:47:10,970 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 03:47:10,970 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 03:47:10,977 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:47:10" (1/1) ... [2024-10-13 03:47:10,997 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:47:10" (1/1) ... [2024-10-13 03:47:11,043 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 210 [2024-10-13 03:47:11,047 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 03:47:11,048 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 03:47:11,048 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 03:47:11,049 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 03:47:11,063 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:47:10" (1/1) ... [2024-10-13 03:47:11,063 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:47:10" (1/1) ... [2024-10-13 03:47:11,069 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:47:10" (1/1) ... [2024-10-13 03:47:11,097 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-10-13 03:47:11,097 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:47:10" (1/1) ... [2024-10-13 03:47:11,098 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:47:10" (1/1) ... [2024-10-13 03:47:11,108 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:47:10" (1/1) ... [2024-10-13 03:47:11,114 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:47:10" (1/1) ... [2024-10-13 03:47:11,120 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:47:10" (1/1) ... [2024-10-13 03:47:11,126 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:47:10" (1/1) ... [2024-10-13 03:47:11,132 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 03:47:11,133 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 03:47:11,133 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 03:47:11,134 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 03:47:11,134 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:47:10" (1/1) ... [2024-10-13 03:47:11,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:47:11,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 03:47:11,174 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-10-13 03:47:11,177 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-10-13 03:47:11,217 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 03:47:11,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 03:47:11,217 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 03:47:11,218 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 03:47:11,219 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 03:47:11,219 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 03:47:11,325 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 03:47:11,328 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 03:47:23,665 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2024-10-13 03:47:23,666 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 03:47:23,742 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 03:47:23,742 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 03:47:23,742 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:47:23 BoogieIcfgContainer [2024-10-13 03:47:23,743 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 03:47:23,744 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 03:47:23,745 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 03:47:23,752 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 03:47:23,752 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 03:47:10" (1/3) ... [2024-10-13 03:47:23,753 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b1d50bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:47:23, skipping insertion in model container [2024-10-13 03:47:23,753 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:47:10" (2/3) ... [2024-10-13 03:47:23,753 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b1d50bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:47:23, skipping insertion in model container [2024-10-13 03:47:23,753 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:47:23" (3/3) ... [2024-10-13 03:47:23,757 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-43.i [2024-10-13 03:47:23,772 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 03:47:23,772 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 03:47:23,834 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 03:47:23,843 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;@7cfd7599, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 03:47:23,843 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 03:47:23,850 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 51 states have (on average 1.4509803921568627) internal successors, (74), 52 states have internal predecessors, (74), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-13 03:47:23,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-13 03:47:23,882 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:47:23,883 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 03:47:23,884 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:47:23,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:47:23,890 INFO L85 PathProgramCache]: Analyzing trace with hash 279280051, now seen corresponding path program 1 times [2024-10-13 03:47:23,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 03:47:23,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [594209021] [2024-10-13 03:47:23,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:47:23,908 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-10-13 03:47:23,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 03:47:23,912 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-10-13 03:47:23,913 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-10-13 03:47:24,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:24,445 INFO L255 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 03:47:24,459 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 03:47:24,505 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 666 proven. 0 refuted. 0 times theorem prover too weak. 634 trivial. 0 not checked. [2024-10-13 03:47:24,506 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 03:47:24,506 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 03:47:24,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [594209021] [2024-10-13 03:47:24,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [594209021] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:47:24,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:47:24,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 03:47:24,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669779677] [2024-10-13 03:47:24,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:47:24,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 03:47:24,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 03:47:24,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 03:47:24,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 03:47:24,549 INFO L87 Difference]: Start difference. First operand has 80 states, 51 states have (on average 1.4509803921568627) internal successors, (74), 52 states have internal predecessors, (74), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-13 03:47:28,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 03:47:28,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:47:28,836 INFO L93 Difference]: Finished difference Result 159 states and 277 transitions. [2024-10-13 03:47:28,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 03:47:28,838 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 168 [2024-10-13 03:47:28,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:47:28,845 INFO L225 Difference]: With dead ends: 159 [2024-10-13 03:47:28,845 INFO L226 Difference]: Without dead ends: 78 [2024-10-13 03:47:28,847 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 167 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-10-13 03:47:28,850 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-10-13 03:47:28,851 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 117 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2024-10-13 03:47:28,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-13 03:47:28,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-10-13 03:47:28,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 50 states have (on average 1.36) internal successors, (68), 50 states have internal predecessors, (68), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-13 03:47:28,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 120 transitions. [2024-10-13 03:47:28,901 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 120 transitions. Word has length 168 [2024-10-13 03:47:28,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:47:28,902 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 120 transitions. [2024-10-13 03:47:28,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-13 03:47:28,903 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 120 transitions. [2024-10-13 03:47:28,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-13 03:47:28,910 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:47:28,910 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 03:47:28,933 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 (2)] Ended with exit code 0 [2024-10-13 03:47:29,111 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-10-13 03:47:29,111 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:47:29,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:47:29,112 INFO L85 PathProgramCache]: Analyzing trace with hash -404731225, now seen corresponding path program 1 times [2024-10-13 03:47:29,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 03:47:29,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [693600767] [2024-10-13 03:47:29,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:47:29,114 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-10-13 03:47:29,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 03:47:29,116 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-10-13 03:47:29,117 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-10-13 03:47:29,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:29,600 INFO L255 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 03:47:29,606 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 03:47:31,631 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-13 03:47:31,631 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 03:47:31,631 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 03:47:31,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [693600767] [2024-10-13 03:47:31,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [693600767] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:47:31,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:47:31,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 03:47:31,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044312483] [2024-10-13 03:47:31,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:47:31,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 03:47:31,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 03:47:31,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 03:47:31,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 03:47:31,635 INFO L87 Difference]: Start difference. First operand 78 states and 120 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-13 03:47:37,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 03:47:41,166 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 03:47:45,390 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 03:47:49,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 03:47:53,402 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 03:47:53,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:47:53,465 INFO L93 Difference]: Finished difference Result 233 states and 359 transitions. [2024-10-13 03:47:53,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 03:47:53,466 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 168 [2024-10-13 03:47:53,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:47:53,470 INFO L225 Difference]: With dead ends: 233 [2024-10-13 03:47:53,470 INFO L226 Difference]: Without dead ends: 156 [2024-10-13 03:47:53,471 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 165 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-10-13 03:47:53,472 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 75 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 53 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.7s IncrementalHoareTripleChecker+Time [2024-10-13 03:47:53,474 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 340 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 15 Invalid, 5 Unknown, 0 Unchecked, 21.7s Time] [2024-10-13 03:47:53,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-10-13 03:47:53,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 126. [2024-10-13 03:47:53,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 71 states have (on average 1.2535211267605635) internal successors, (89), 71 states have internal predecessors, (89), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-13 03:47:53,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 193 transitions. [2024-10-13 03:47:53,518 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 193 transitions. Word has length 168 [2024-10-13 03:47:53,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:47:53,519 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 193 transitions. [2024-10-13 03:47:53,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-13 03:47:53,520 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 193 transitions. [2024-10-13 03:47:53,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-13 03:47:53,524 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:47:53,525 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 03:47:53,546 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 (3)] Forceful destruction successful, exit code 0 [2024-10-13 03:47:53,726 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-10-13 03:47:53,726 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:47:53,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:47:53,727 INFO L85 PathProgramCache]: Analyzing trace with hash -418055870, now seen corresponding path program 1 times [2024-10-13 03:47:53,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 03:47:53,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [428060005] [2024-10-13 03:47:53,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:47:53,728 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-10-13 03:47:53,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 03:47:53,732 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-10-13 03:47:53,733 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-10-13 03:47:54,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:54,177 INFO L255 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 03:47:54,182 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 03:47:54,249 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-13 03:47:54,251 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 03:47:54,252 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 03:47:54,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [428060005] [2024-10-13 03:47:54,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [428060005] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:47:54,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:47:54,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 03:47:54,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790346513] [2024-10-13 03:47:54,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:47:54,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 03:47:54,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 03:47:54,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 03:47:54,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 03:47:54,255 INFO L87 Difference]: Start difference. First operand 126 states and 193 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-13 03:47:58,632 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 03:48:02,635 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 03:48:06,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 03:48:06,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:48:06,961 INFO L93 Difference]: Finished difference Result 280 states and 431 transitions. [2024-10-13 03:48:06,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 03:48:06,966 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 169 [2024-10-13 03:48:06,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:48:06,969 INFO L225 Difference]: With dead ends: 280 [2024-10-13 03:48:06,970 INFO L226 Difference]: Without dead ends: 203 [2024-10-13 03:48:06,971 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 167 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-10-13 03:48:06,972 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 114 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.7s IncrementalHoareTripleChecker+Time [2024-10-13 03:48:06,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 337 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 3 Unknown, 0 Unchecked, 12.7s Time] [2024-10-13 03:48:06,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-10-13 03:48:06,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 128. [2024-10-13 03:48:06,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 73 states have (on average 1.2465753424657535) internal successors, (91), 73 states have internal predecessors, (91), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-13 03:48:07,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 195 transitions. [2024-10-13 03:48:07,001 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 195 transitions. Word has length 169 [2024-10-13 03:48:07,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:48:07,002 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 195 transitions. [2024-10-13 03:48:07,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-13 03:48:07,003 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 195 transitions. [2024-10-13 03:48:07,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-13 03:48:07,005 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:48:07,005 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 03:48:07,028 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 (4)] Ended with exit code 0 [2024-10-13 03:48:07,206 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-10-13 03:48:07,206 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:48:07,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:48:07,207 INFO L85 PathProgramCache]: Analyzing trace with hash -877301121, now seen corresponding path program 1 times [2024-10-13 03:48:07,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 03:48:07,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1940379203] [2024-10-13 03:48:07,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:48:07,208 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-10-13 03:48:07,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 03:48:07,212 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-10-13 03:48:07,214 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-10-13 03:48:07,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:48:07,708 INFO L255 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 03:48:07,712 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 03:48:11,386 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 629 proven. 99 refuted. 0 times theorem prover too weak. 572 trivial. 0 not checked. [2024-10-13 03:48:11,387 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 03:48:13,971 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 45 proven. 102 refuted. 0 times theorem prover too weak. 1153 trivial. 0 not checked. [2024-10-13 03:48:13,971 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 03:48:13,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1940379203] [2024-10-13 03:48:13,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1940379203] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 03:48:13,973 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 03:48:13,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2024-10-13 03:48:13,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733098606] [2024-10-13 03:48:13,974 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 03:48:13,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-13 03:48:13,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 03:48:13,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-13 03:48:13,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-10-13 03:48:13,977 INFO L87 Difference]: Start difference. First operand 128 states and 195 transitions. Second operand has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 3 states have call successors, (44), 3 states have call predecessors, (44), 7 states have return successors, (45), 3 states have call predecessors, (45), 3 states have call successors, (45) [2024-10-13 03:48:21,005 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []