./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-while_file-43.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-43.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 d82b18cd242e9ca49d0125d9760f9ce4d46eda4589890d58c3d3555645b3c016 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 11:17:14,386 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 11:17:14,473 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 11:17:14,478 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 11:17:14,478 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 11:17:14,500 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 11:17:14,501 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 11:17:14,501 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 11:17:14,502 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 11:17:14,502 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 11:17:14,503 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 11:17:14,503 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 11:17:14,504 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 11:17:14,504 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 11:17:14,504 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 11:17:14,505 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 11:17:14,505 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 11:17:14,506 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 11:17:14,506 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 11:17:14,506 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 11:17:14,507 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 11:17:14,507 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 11:17:14,508 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 11:17:14,508 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 11:17:14,509 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 11:17:14,509 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 11:17:14,509 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 11:17:14,510 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 11:17:14,513 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 11:17:14,514 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 11:17:14,514 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 11:17:14,514 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 11:17:14,515 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:17:14,515 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 11:17:14,515 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 11:17:14,515 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 11:17:14,516 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 11:17:14,516 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 11:17:14,516 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 11:17:14,516 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 11:17:14,516 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 11:17:14,517 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 11:17:14,517 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-clean/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-clean/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 -> d82b18cd242e9ca49d0125d9760f9ce4d46eda4589890d58c3d3555645b3c016 [2024-10-11 11:17:14,808 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 11:17:14,845 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 11:17:14,850 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 11:17:14,851 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 11:17:14,852 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 11:17:14,853 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-43.i [2024-10-11 11:17:16,506 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 11:17:16,742 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 11:17:16,743 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-43.i [2024-10-11 11:17:16,761 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6787f606d/619ed502308d4532a44c80b029a18ade/FLAGd5c1cbea6 [2024-10-11 11:17:16,778 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6787f606d/619ed502308d4532a44c80b029a18ade [2024-10-11 11:17:16,781 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 11:17:16,783 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 11:17:16,785 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 11:17:16,785 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 11:17:16,790 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 11:17:16,791 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:17:16" (1/1) ... [2024-10-11 11:17:16,792 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d79e56f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:17:16, skipping insertion in model container [2024-10-11 11:17:16,793 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:17:16" (1/1) ... [2024-10-11 11:17:16,833 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 11:17:17,021 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-while_file-43.i[916,929] [2024-10-11 11:17:17,112 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:17:17,137 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 11:17:17,147 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-while_file-43.i[916,929] [2024-10-11 11:17:17,203 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:17:17,226 INFO L204 MainTranslator]: Completed translation [2024-10-11 11:17:17,227 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:17:17 WrapperNode [2024-10-11 11:17:17,227 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 11:17:17,228 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 11:17:17,229 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 11:17:17,229 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 11:17:17,237 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:17:17" (1/1) ... [2024-10-11 11:17:17,261 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:17:17" (1/1) ... [2024-10-11 11:17:17,313 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 280 [2024-10-11 11:17:17,314 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 11:17:17,314 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 11:17:17,315 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 11:17:17,315 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 11:17:17,325 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:17:17" (1/1) ... [2024-10-11 11:17:17,325 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:17:17" (1/1) ... [2024-10-11 11:17:17,334 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:17:17" (1/1) ... [2024-10-11 11:17:17,361 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-11 11:17:17,362 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:17:17" (1/1) ... [2024-10-11 11:17:17,362 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:17:17" (1/1) ... [2024-10-11 11:17:17,377 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:17:17" (1/1) ... [2024-10-11 11:17:17,381 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:17:17" (1/1) ... [2024-10-11 11:17:17,386 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:17:17" (1/1) ... [2024-10-11 11:17:17,390 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:17:17" (1/1) ... [2024-10-11 11:17:17,421 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 11:17:17,422 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 11:17:17,422 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 11:17:17,422 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 11:17:17,423 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:17:17" (1/1) ... [2024-10-11 11:17:17,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:17:17,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:17:17,459 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 11:17:17,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 11:17:17,551 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 11:17:17,552 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 11:17:17,553 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 11:17:17,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 11:17:17,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 11:17:17,553 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 11:17:17,675 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 11:17:17,678 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 11:17:18,291 INFO L? ?]: Removed 33 outVars from TransFormulas that were not future-live. [2024-10-11 11:17:18,291 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 11:17:18,343 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 11:17:18,344 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 11:17:18,345 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:17:18 BoogieIcfgContainer [2024-10-11 11:17:18,345 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 11:17:18,349 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 11:17:18,349 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 11:17:18,353 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 11:17:18,354 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:17:16" (1/3) ... [2024-10-11 11:17:18,355 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2331df9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:17:18, skipping insertion in model container [2024-10-11 11:17:18,355 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:17:17" (2/3) ... [2024-10-11 11:17:18,355 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2331df9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:17:18, skipping insertion in model container [2024-10-11 11:17:18,355 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:17:18" (3/3) ... [2024-10-11 11:17:18,357 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-43.i [2024-10-11 11:17:18,377 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 11:17:18,378 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 11:17:18,459 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 11:17:18,466 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;@7b9bf195, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 11:17:18,470 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 11:17:18,478 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-11 11:17:18,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-10-11 11:17:18,499 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:17:18,500 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-11 11:17:18,501 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:17:18,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:17:18,506 INFO L85 PathProgramCache]: Analyzing trace with hash -272031461, now seen corresponding path program 1 times [2024-10-11 11:17:18,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:17:18,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027943021] [2024-10-11 11:17:18,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:17:18,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:17:18,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:18,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:17:18,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:18,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:17:18,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:18,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:17:18,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:18,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:17:18,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:18,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:17:18,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:18,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 11:17:18,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:18,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 11:17:18,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:18,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 11:17:18,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:18,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 11:17:18,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:18,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 11:17:18,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:18,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 11:17:18,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:18,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 11:17:18,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:18,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 11:17:18,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:18,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 11:17:18,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:19,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 11:17:19,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:19,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 11:17:19,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:19,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 11:17:19,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:19,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 11:17:19,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:19,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 11:17:19,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:19,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 11:17:19,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:19,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 11:17:19,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:19,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 11:17:19,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:19,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 11:17:19,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:19,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 11:17:19,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:19,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 11:17:19,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:19,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 11:17:19,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:19,078 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-11 11:17:19,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:17:19,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027943021] [2024-10-11 11:17:19,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027943021] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:17:19,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:17:19,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 11:17:19,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317534357] [2024-10-11 11:17:19,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:17:19,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 11:17:19,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:17:19,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 11:17:19,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:17:19,134 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-11 11:17:19,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:17:19,190 INFO L93 Difference]: Finished difference Result 217 states and 368 transitions. [2024-10-11 11:17:19,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 11:17:19,196 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-11 11:17:19,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:17:19,206 INFO L225 Difference]: With dead ends: 217 [2024-10-11 11:17:19,206 INFO L226 Difference]: Without dead ends: 108 [2024-10-11 11:17:19,210 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-11 11:17:19,217 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:17:19,218 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 162 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:17:19,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-10-11 11:17:19,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-10-11 11:17:19,280 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-11 11:17:19,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 165 transitions. [2024-10-11 11:17:19,288 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 165 transitions. Word has length 177 [2024-10-11 11:17:19,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:17:19,293 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 165 transitions. [2024-10-11 11:17:19,293 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-11 11:17:19,293 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 165 transitions. [2024-10-11 11:17:19,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-10-11 11:17:19,298 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:17:19,298 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-11 11:17:19,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 11:17:19,299 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:17:19,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:17:19,299 INFO L85 PathProgramCache]: Analyzing trace with hash 465052327, now seen corresponding path program 1 times [2024-10-11 11:17:19,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:17:19,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652596192] [2024-10-11 11:17:19,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:17:19,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:17:19,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:19,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:17:19,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:19,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:17:19,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:19,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:17:19,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:19,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:17:19,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:19,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:17:19,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:19,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 11:17:19,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:20,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 11:17:20,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:20,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 11:17:20,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:20,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 11:17:20,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:20,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 11:17:20,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:20,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 11:17:20,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:20,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 11:17:20,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:20,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 11:17:20,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:20,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 11:17:20,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:20,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 11:17:20,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:20,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 11:17:20,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:20,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 11:17:20,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:20,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 11:17:20,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:20,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 11:17:20,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:20,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 11:17:20,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:20,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 11:17:20,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:20,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 11:17:20,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:20,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 11:17:20,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:20,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 11:17:20,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:20,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 11:17:20,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:20,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 11:17:20,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:20,169 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-11 11:17:20,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:17:20,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652596192] [2024-10-11 11:17:20,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652596192] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:17:20,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:17:20,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 11:17:20,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045821614] [2024-10-11 11:17:20,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:17:20,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 11:17:20,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:17:20,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 11:17:20,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 11:17:20,178 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-11 11:17:20,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:17:20,467 INFO L93 Difference]: Finished difference Result 323 states and 494 transitions. [2024-10-11 11:17:20,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 11:17:20,468 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-11 11:17:20,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:17:20,473 INFO L225 Difference]: With dead ends: 323 [2024-10-11 11:17:20,476 INFO L226 Difference]: Without dead ends: 216 [2024-10-11 11:17:20,477 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-11 11:17:20,479 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 132 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 11:17:20,479 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 472 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 11:17:20,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-10-11 11:17:20,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 193. [2024-10-11 11:17:20,527 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-11 11:17:20,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 298 transitions. [2024-10-11 11:17:20,534 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 298 transitions. Word has length 177 [2024-10-11 11:17:20,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:17:20,535 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 298 transitions. [2024-10-11 11:17:20,535 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-11 11:17:20,538 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 298 transitions. [2024-10-11 11:17:20,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-10-11 11:17:20,541 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:17:20,541 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-11 11:17:20,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 11:17:20,541 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:17:20,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:17:20,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1755191647, now seen corresponding path program 1 times [2024-10-11 11:17:20,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:17:20,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22284109] [2024-10-11 11:17:20,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:17:20,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:17:20,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:20,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:17:20,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:20,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:17:20,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:20,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:17:20,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:20,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:17:20,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:20,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:17:20,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:20,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 11:17:20,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:20,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 11:17:20,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:20,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 11:17:20,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:20,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 11:17:20,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:20,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 11:17:20,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:20,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 11:17:20,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:20,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 11:17:20,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:20,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 11:17:20,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:20,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 11:17:20,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:20,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 11:17:20,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:20,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 11:17:20,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:20,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 11:17:20,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:20,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 11:17:20,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:20,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 11:17:20,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:20,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 11:17:20,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:20,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 11:17:20,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:20,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 11:17:20,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:20,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 11:17:20,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:20,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 11:17:20,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:20,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 11:17:20,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:20,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 11:17:20,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:20,963 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-11 11:17:20,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:17:20,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22284109] [2024-10-11 11:17:20,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22284109] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:17:20,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:17:20,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 11:17:20,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908329390] [2024-10-11 11:17:20,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:17:20,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 11:17:20,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:17:20,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 11:17:20,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 11:17:20,969 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-11 11:17:21,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:17:21,038 INFO L93 Difference]: Finished difference Result 452 states and 699 transitions. [2024-10-11 11:17:21,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 11:17:21,039 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-11 11:17:21,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:17:21,045 INFO L225 Difference]: With dead ends: 452 [2024-10-11 11:17:21,045 INFO L226 Difference]: Without dead ends: 324 [2024-10-11 11:17:21,047 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-11 11:17:21,048 INFO L432 NwaCegarLoop]: 252 mSDtfsCounter, 159 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:17:21,051 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 407 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:17:21,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2024-10-11 11:17:21,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 197. [2024-10-11 11:17:21,085 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-11 11:17:21,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 302 transitions. [2024-10-11 11:17:21,089 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 302 transitions. Word has length 179 [2024-10-11 11:17:21,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:17:21,090 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 302 transitions. [2024-10-11 11:17:21,090 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-11 11:17:21,090 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 302 transitions. [2024-10-11 11:17:21,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-10-11 11:17:21,097 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:17:21,099 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-11 11:17:21,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 11:17:21,100 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:17:21,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:17:21,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1386249294, now seen corresponding path program 1 times [2024-10-11 11:17:21,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:17:21,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386968926] [2024-10-11 11:17:21,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:17:21,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:17:21,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:21,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:17:21,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:21,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:17:21,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:21,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:17:21,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:21,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:17:21,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:21,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:17:21,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:21,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 11:17:21,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:21,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 11:17:21,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:21,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 11:17:21,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:21,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 11:17:21,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:21,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 11:17:21,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:21,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 11:17:21,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:21,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 11:17:21,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:21,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 11:17:21,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:21,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 11:17:21,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:21,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 11:17:21,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:21,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 11:17:21,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:21,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 11:17:21,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:21,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 11:17:21,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:21,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 11:17:21,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:21,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 11:17:21,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:21,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 11:17:21,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:21,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 11:17:21,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:21,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 11:17:21,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:21,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 11:17:21,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:21,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 11:17:21,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:21,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 11:17:21,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:21,462 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-11 11:17:21,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:17:21,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386968926] [2024-10-11 11:17:21,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386968926] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:17:21,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:17:21,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 11:17:21,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774561158] [2024-10-11 11:17:21,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:17:21,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 11:17:21,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:17:21,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 11:17:21,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 11:17:21,465 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-11 11:17:21,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:17:21,644 INFO L93 Difference]: Finished difference Result 516 states and 791 transitions. [2024-10-11 11:17:21,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 11:17:21,645 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-11 11:17:21,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:17:21,649 INFO L225 Difference]: With dead ends: 516 [2024-10-11 11:17:21,649 INFO L226 Difference]: Without dead ends: 371 [2024-10-11 11:17:21,650 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-11 11:17:21,651 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 200 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 11:17:21,651 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 529 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 11:17:21,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2024-10-11 11:17:21,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 347. [2024-10-11 11:17:21,697 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-11 11:17:21,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 534 transitions. [2024-10-11 11:17:21,702 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 534 transitions. Word has length 180 [2024-10-11 11:17:21,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:17:21,703 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 534 transitions. [2024-10-11 11:17:21,704 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-11 11:17:21,704 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 534 transitions. [2024-10-11 11:17:21,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-10-11 11:17:21,708 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:17:21,709 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-11 11:17:21,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 11:17:21,709 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:17:21,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:17:21,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1383341391, now seen corresponding path program 1 times [2024-10-11 11:17:21,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:17:21,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009641640] [2024-10-11 11:17:21,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:17:21,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:17:21,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:22,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:17:22,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:22,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:17:22,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:22,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:17:22,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:22,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:17:22,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:22,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:17:22,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:22,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 11:17:22,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:22,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 11:17:22,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:22,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 11:17:22,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:22,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 11:17:22,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:22,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 11:17:22,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:22,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 11:17:22,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:22,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 11:17:22,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:22,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 11:17:22,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:22,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 11:17:22,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:22,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 11:17:22,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:22,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 11:17:22,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:22,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 11:17:22,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:22,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 11:17:22,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:22,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 11:17:22,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:22,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 11:17:22,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:22,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 11:17:22,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:22,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 11:17:22,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:22,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 11:17:22,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:22,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 11:17:22,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:22,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 11:17:22,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:22,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 11:17:22,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:22,290 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-11 11:17:22,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:17:22,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009641640] [2024-10-11 11:17:22,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009641640] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:17:22,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:17:22,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 11:17:22,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345135967] [2024-10-11 11:17:22,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:17:22,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 11:17:22,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:17:22,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 11:17:22,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 11:17:22,293 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-11 11:17:22,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:17:22,562 INFO L93 Difference]: Finished difference Result 775 states and 1178 transitions. [2024-10-11 11:17:22,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 11:17:22,563 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-11 11:17:22,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:17:22,567 INFO L225 Difference]: With dead ends: 775 [2024-10-11 11:17:22,567 INFO L226 Difference]: Without dead ends: 485 [2024-10-11 11:17:22,569 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-11 11:17:22,571 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 203 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 11:17:22,571 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 686 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 11:17:22,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2024-10-11 11:17:22,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 429. [2024-10-11 11:17:22,619 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-11 11:17:22,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 656 transitions. [2024-10-11 11:17:22,622 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 656 transitions. Word has length 182 [2024-10-11 11:17:22,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:17:22,622 INFO L471 AbstractCegarLoop]: Abstraction has 429 states and 656 transitions. [2024-10-11 11:17:22,623 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-11 11:17:22,623 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 656 transitions. [2024-10-11 11:17:22,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-10-11 11:17:22,624 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:17:22,625 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-11 11:17:22,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 11:17:22,625 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:17:22,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:17:22,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1360709137, now seen corresponding path program 1 times [2024-10-11 11:17:22,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:17:22,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018497462] [2024-10-11 11:17:22,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:17:22,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:17:22,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:23,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:17:23,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:23,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:17:23,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:23,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:17:23,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:23,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:17:23,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:23,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:17:23,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:23,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 11:17:23,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:23,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 11:17:23,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:23,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 11:17:23,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:23,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 11:17:23,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:23,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 11:17:23,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:23,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 11:17:23,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:23,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 11:17:23,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:23,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 11:17:23,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:23,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 11:17:23,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:23,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 11:17:23,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:23,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 11:17:23,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:23,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 11:17:23,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:23,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 11:17:23,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:23,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 11:17:23,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:23,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 11:17:23,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:23,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 11:17:23,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:23,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 11:17:23,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:23,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 11:17:23,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:23,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 11:17:23,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:23,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 11:17:23,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:23,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 11:17:23,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:23,244 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-11 11:17:23,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:17:23,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018497462] [2024-10-11 11:17:23,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018497462] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:17:23,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:17:23,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 11:17:23,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075720296] [2024-10-11 11:17:23,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:17:23,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 11:17:23,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:17:23,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 11:17:23,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 11:17:23,249 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-11 11:17:23,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:17:23,467 INFO L93 Difference]: Finished difference Result 683 states and 1040 transitions. [2024-10-11 11:17:23,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 11:17:23,467 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-11 11:17:23,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:17:23,470 INFO L225 Difference]: With dead ends: 683 [2024-10-11 11:17:23,470 INFO L226 Difference]: Without dead ends: 393 [2024-10-11 11:17:23,471 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-11 11:17:23,472 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 118 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 11:17:23,473 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 452 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 11:17:23,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-10-11 11:17:23,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 375. [2024-10-11 11:17:23,530 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-11 11:17:23,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 569 transitions. [2024-10-11 11:17:23,533 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 569 transitions. Word has length 182 [2024-10-11 11:17:23,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:17:23,536 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 569 transitions. [2024-10-11 11:17:23,536 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-11 11:17:23,537 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 569 transitions. [2024-10-11 11:17:23,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-10-11 11:17:23,538 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:17:23,539 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-11 11:17:23,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 11:17:23,539 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:17:23,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:17:23,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1331540346, now seen corresponding path program 1 times [2024-10-11 11:17:23,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:17:23,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973717582] [2024-10-11 11:17:23,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:17:23,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:17:23,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:23,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:17:23,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:23,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:17:23,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:23,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:17:23,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:23,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:17:23,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:23,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:17:23,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:23,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 11:17:23,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:23,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 11:17:23,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:23,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 11:17:23,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:23,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 11:17:23,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:23,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 11:17:23,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:23,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 11:17:23,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:23,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 11:17:23,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:23,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 11:17:23,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:23,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 11:17:23,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:23,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 11:17:23,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:23,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 11:17:23,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:23,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 11:17:23,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:23,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 11:17:23,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:23,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 11:17:23,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:23,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 11:17:23,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:23,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 11:17:23,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:23,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 11:17:23,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:23,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 11:17:23,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:23,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 11:17:23,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:23,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 11:17:23,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:23,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 11:17:23,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:23,926 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-11 11:17:23,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:17:23,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973717582] [2024-10-11 11:17:23,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973717582] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:17:23,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:17:23,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 11:17:23,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446294164] [2024-10-11 11:17:23,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:17:23,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 11:17:23,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:17:23,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 11:17:23,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 11:17:23,929 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-11 11:17:24,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:17:24,163 INFO L93 Difference]: Finished difference Result 721 states and 1088 transitions. [2024-10-11 11:17:24,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 11:17:24,164 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-11 11:17:24,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:17:24,166 INFO L225 Difference]: With dead ends: 721 [2024-10-11 11:17:24,167 INFO L226 Difference]: Without dead ends: 399 [2024-10-11 11:17:24,168 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-11 11:17:24,169 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 196 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 11:17:24,169 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 744 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 11:17:24,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2024-10-11 11:17:24,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 375. [2024-10-11 11:17:24,202 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-11 11:17:24,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 567 transitions. [2024-10-11 11:17:24,205 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 567 transitions. Word has length 183 [2024-10-11 11:17:24,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:17:24,208 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 567 transitions. [2024-10-11 11:17:24,208 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-11 11:17:24,209 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 567 transitions. [2024-10-11 11:17:24,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-10-11 11:17:24,211 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:17:24,211 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-11 11:17:24,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 11:17:24,211 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:17:24,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:17:24,212 INFO L85 PathProgramCache]: Analyzing trace with hash 2033140220, now seen corresponding path program 1 times [2024-10-11 11:17:24,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:17:24,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967923331] [2024-10-11 11:17:24,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:17:24,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:17:24,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:24,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:17:24,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:24,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:17:24,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:24,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:17:24,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:24,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:17:24,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:24,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:17:24,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:24,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 11:17:24,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:24,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 11:17:24,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:24,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 11:17:24,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:24,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 11:17:24,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:24,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 11:17:24,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:24,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 11:17:24,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:24,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 11:17:24,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:24,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 11:17:24,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:24,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 11:17:24,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:24,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 11:17:24,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:24,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 11:17:24,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:24,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 11:17:24,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:24,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 11:17:24,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:24,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 11:17:24,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:24,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 11:17:24,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:24,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 11:17:24,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:24,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 11:17:24,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:24,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 11:17:24,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:24,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 11:17:24,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:24,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 11:17:24,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:24,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 11:17:24,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:24,744 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-11 11:17:24,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:17:24,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967923331] [2024-10-11 11:17:24,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967923331] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:17:24,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:17:24,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 11:17:24,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384895995] [2024-10-11 11:17:24,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:17:24,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 11:17:24,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:17:24,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 11:17:24,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 11:17:24,750 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-11 11:17:25,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:17:25,024 INFO L93 Difference]: Finished difference Result 709 states and 1070 transitions. [2024-10-11 11:17:25,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 11:17:25,025 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-11 11:17:25,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:17:25,028 INFO L225 Difference]: With dead ends: 709 [2024-10-11 11:17:25,028 INFO L226 Difference]: Without dead ends: 391 [2024-10-11 11:17:25,030 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-11 11:17:25,030 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 112 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 11:17:25,031 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 456 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 11:17:25,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2024-10-11 11:17:25,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 377. [2024-10-11 11:17:25,074 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-11 11:17:25,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 568 transitions. [2024-10-11 11:17:25,077 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 568 transitions. Word has length 183 [2024-10-11 11:17:25,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:17:25,078 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 568 transitions. [2024-10-11 11:17:25,078 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-11 11:17:25,078 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 568 transitions. [2024-10-11 11:17:25,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-10-11 11:17:25,080 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:17:25,080 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-11 11:17:25,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 11:17:25,080 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:17:25,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:17:25,081 INFO L85 PathProgramCache]: Analyzing trace with hash -895921748, now seen corresponding path program 1 times [2024-10-11 11:17:25,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:17:25,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243504193] [2024-10-11 11:17:25,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:17:25,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:17:25,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:25,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:17:25,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:25,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:17:25,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:25,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:17:25,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:25,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:17:25,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:25,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:17:25,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:25,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 11:17:25,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:25,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 11:17:25,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:25,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 11:17:25,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:25,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 11:17:25,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:25,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 11:17:25,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:25,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 11:17:25,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:25,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 11:17:25,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:25,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 11:17:25,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:25,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 11:17:25,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:25,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 11:17:25,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:25,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 11:17:25,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:25,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 11:17:25,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:25,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 11:17:25,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:25,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 11:17:25,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:25,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 11:17:25,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:25,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 11:17:25,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:25,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 11:17:25,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:25,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 11:17:25,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:25,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 11:17:25,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:25,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 11:17:25,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:25,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 11:17:25,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:25,650 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-11 11:17:25,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:17:25,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243504193] [2024-10-11 11:17:25,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243504193] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:17:25,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:17:25,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 11:17:25,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167288972] [2024-10-11 11:17:25,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:17:25,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 11:17:25,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:17:25,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 11:17:25,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 11:17:25,653 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-11 11:17:25,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:17:25,995 INFO L93 Difference]: Finished difference Result 697 states and 1045 transitions. [2024-10-11 11:17:25,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 11:17:25,996 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-11 11:17:25,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:17:25,999 INFO L225 Difference]: With dead ends: 697 [2024-10-11 11:17:25,999 INFO L226 Difference]: Without dead ends: 389 [2024-10-11 11:17:26,000 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-11 11:17:26,003 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 230 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 11:17:26,003 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 738 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 11:17:26,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2024-10-11 11:17:26,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 375. [2024-10-11 11:17:26,044 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-11 11:17:26,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 557 transitions. [2024-10-11 11:17:26,047 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 557 transitions. Word has length 184 [2024-10-11 11:17:26,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:17:26,048 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 557 transitions. [2024-10-11 11:17:26,048 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-11 11:17:26,048 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 557 transitions. [2024-10-11 11:17:26,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-10-11 11:17:26,051 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:17:26,051 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-11 11:17:26,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 11:17:26,051 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:17:26,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:17:26,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1827602668, now seen corresponding path program 1 times [2024-10-11 11:17:26,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:17:26,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849252722] [2024-10-11 11:17:26,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:17:26,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:17:26,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 11:17:26,178 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 11:17:26,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 11:17:26,390 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 11:17:26,391 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 11:17:26,392 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 11:17:26,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 11:17:26,397 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:17:26,550 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 11:17:26,554 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 11:17:26 BoogieIcfgContainer [2024-10-11 11:17:26,554 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 11:17:26,555 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 11:17:26,555 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 11:17:26,555 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 11:17:26,556 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:17:18" (3/4) ... [2024-10-11 11:17:26,558 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 11:17:26,559 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 11:17:26,559 INFO L158 Benchmark]: Toolchain (without parser) took 9776.65ms. Allocated memory was 148.9MB in the beginning and 333.4MB in the end (delta: 184.5MB). Free memory was 93.1MB in the beginning and 266.1MB in the end (delta: -173.0MB). Peak memory consumption was 12.3MB. Max. memory is 16.1GB. [2024-10-11 11:17:26,560 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 148.9MB. Free memory is still 109.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 11:17:26,560 INFO L158 Benchmark]: CACSL2BoogieTranslator took 443.06ms. Allocated memory is still 148.9MB. Free memory was 92.7MB in the beginning and 74.5MB in the end (delta: 18.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-11 11:17:26,560 INFO L158 Benchmark]: Boogie Procedure Inliner took 85.50ms. Allocated memory is still 148.9MB. Free memory was 74.5MB in the beginning and 68.9MB in the end (delta: 5.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 11:17:26,561 INFO L158 Benchmark]: Boogie Preprocessor took 106.48ms. Allocated memory is still 148.9MB. Free memory was 68.9MB in the beginning and 116.7MB in the end (delta: -47.7MB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. [2024-10-11 11:17:26,561 INFO L158 Benchmark]: RCFGBuilder took 923.83ms. Allocated memory was 148.9MB in the beginning and 211.8MB in the end (delta: 62.9MB). Free memory was 116.6MB in the beginning and 144.9MB in the end (delta: -28.3MB). Peak memory consumption was 39.2MB. Max. memory is 16.1GB. [2024-10-11 11:17:26,561 INFO L158 Benchmark]: TraceAbstraction took 8205.88ms. Allocated memory was 211.8MB in the beginning and 333.4MB in the end (delta: 121.6MB). Free memory was 143.8MB in the beginning and 266.1MB in the end (delta: -122.2MB). Peak memory consumption was 162.2MB. Max. memory is 16.1GB. [2024-10-11 11:17:26,561 INFO L158 Benchmark]: Witness Printer took 4.02ms. Allocated memory is still 333.4MB. Free memory is still 266.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 11:17:26,563 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.21ms. Allocated memory is still 148.9MB. Free memory is still 109.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 443.06ms. Allocated memory is still 148.9MB. Free memory was 92.7MB in the beginning and 74.5MB in the end (delta: 18.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 85.50ms. Allocated memory is still 148.9MB. Free memory was 74.5MB in the beginning and 68.9MB in the end (delta: 5.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 106.48ms. Allocated memory is still 148.9MB. Free memory was 68.9MB in the beginning and 116.7MB in the end (delta: -47.7MB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. * RCFGBuilder took 923.83ms. Allocated memory was 148.9MB in the beginning and 211.8MB in the end (delta: 62.9MB). Free memory was 116.6MB in the beginning and 144.9MB in the end (delta: -28.3MB). Peak memory consumption was 39.2MB. Max. memory is 16.1GB. * TraceAbstraction took 8205.88ms. Allocated memory was 211.8MB in the beginning and 333.4MB in the end (delta: 121.6MB). Free memory was 143.8MB in the beginning and 266.1MB in the end (delta: -122.2MB). Peak memory consumption was 162.2MB. Max. memory is 16.1GB. * Witness Printer took 4.02ms. Allocated memory is still 333.4MB. Free memory is still 266.1MB. 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] COND TRUE 1 [L207] 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 [L207] RET updateLastVariables() [L208] 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=4, 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=4, 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=4, 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=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=4, 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=4, 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=4, 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=4, var_1_5=4, 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=4, var_1_5=4, 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=4, var_1_5=4, 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=4, var_1_5=4, 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=4, var_1_5=4, 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=4, var_1_5=4, 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=4, var_1_5=4, 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=4, var_1_5=4, 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=4, var_1_5=4, 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=4, var_1_5=4, 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=4, var_1_5=4, 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=4, var_1_5=4, 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=4, var_1_5=4, 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=4, var_1_5=4, 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=4, var_1_5=4, 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=4, var_1_5=4, 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=4, var_1_5=4, 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=4, var_1_5=4, 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=4, var_1_5=4, 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=4, var_1_5=4, 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=4, var_1_5=4, 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=4, var_1_5=4, 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=4, var_1_5=4, 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=4, var_1_5=4, 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=4, var_1_5=4, 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=4, var_1_5=4, 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=4, var_1_5=4, 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=4, var_1_5=4, 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=4, var_1_5=4, 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=4, var_1_5=4, 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=4, var_1_5=4, 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=4, var_1_5=4, 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=4, var_1_5=4, 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=4, var_1_5=4, 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=4, var_1_5=4, 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=4, var_1_5=4, 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=4, var_1_5=4, 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=4, var_1_5=4, 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=4, var_1_5=4, 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=4, var_1_5=4, 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=4, var_1_5=4, 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=4, var_1_5=4, 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=4, var_1_5=4, 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=4, var_1_5=4, 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=-1073741825, 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=4, var_1_5=4, 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=-1073741825, 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=4, var_1_5=4, 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=-1073741825, 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=4, var_1_5=4, 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=-1073741825, 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=4, var_1_5=4, 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=-1073741825, 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=4, var_1_5=4, 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=-1073741825, 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=4, var_1_5=4, 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=-1073741825, 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=4, var_1_5=4, 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=-1073741825, 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=4, var_1_5=4, 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=-1073741825, 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=4, var_1_5=4, 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=-1073741825, 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=4, var_1_5=4, 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=-1073741825, 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=4, var_1_5=4, 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=-1073741825, 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=4, var_1_5=4, 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=-1073741825, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=5368709119, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=4, var_1_5=4, 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=-1073741825, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=5368709119, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=4, var_1_5=4, 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=-1073741825, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=5368709119, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=4, var_1_5=4, 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=-1073741825, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=5368709119, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=4, var_1_5=4, 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=-1073741825, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=5368709119, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=4, var_1_5=4, 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=-1073741825, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=5368709119, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=4, var_1_5=4, 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=-1073741825, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=5368709119, var_1_32=1073741829, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=4, var_1_5=4, 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=-1073741825, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=5368709119, var_1_32=1073741829, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=4, var_1_5=4, 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=-1073741825, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=5368709119, var_1_32=1073741829, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=4, var_1_5=4, 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=-1073741825, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=5368709119, var_1_32=1073741829, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=4, var_1_5=4, 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=-1073741825, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=5368709119, var_1_32=1073741829, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=4, var_1_5=4, 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=-1073741825, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=5368709119, var_1_32=1073741829, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=4, var_1_5=4, var_1_6=1] [L208] RET updateVariables() [L209] 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=-1073741825, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=5368709119, var_1_32=1073741829, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=4, var_1_5=4, 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=-1073741825, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=5368709119, var_1_32=1073741829, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=4, var_1_5=4, 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=-1073741830, 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=-1073741825, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=5368709119, var_1_32=1073741829, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=4, var_1_5=4, 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=-1073741830, 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=-1073741825, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=5368709119, var_1_32=1073741829, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=4, var_1_5=4, 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=8, var_1_27=-1073741825, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=5368709119, var_1_32=1073741829, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=4, var_1_5=4, 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=8, var_1_27=-1073741825, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=5368709119, var_1_32=1073741829, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=4, var_1_5=4, 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=6442450950, var_1_22=6442450949, var_1_24=-128, var_1_25=128, var_1_26=8, var_1_27=-1073741825, var_1_28=0, var_1_29=1, var_1_30=6442450944, var_1_31=5368709119, var_1_32=1073741829, var_1_33=6442450950, var_1_34=6442450949, var_1_35=6442450944, var_1_4=4, var_1_5=4, 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=6442450950, var_1_22=6442450949, var_1_24=-128, var_1_25=128, var_1_26=8, var_1_27=-1073741825, var_1_28=0, var_1_29=1, var_1_30=6442450944, var_1_31=5368709119, var_1_32=1073741829, var_1_33=6442450950, var_1_34=6442450949, var_1_35=6442450944, var_1_4=4, var_1_5=4, 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=6442450950, var_1_22=6442450949, var_1_24=-128, var_1_25=128, var_1_26=8, var_1_27=-1073741825, var_1_28=0, var_1_29=1, var_1_30=6442450944, var_1_31=5368709119, var_1_32=1073741829, var_1_33=6442450950, var_1_34=6442450949, var_1_35=6442450944, var_1_4=4, var_1_5=4, 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=6442450950, var_1_22=6442450949, var_1_24=-128, var_1_25=128, var_1_26=8, var_1_27=-1073741825, var_1_28=0, var_1_29=1, var_1_30=6442450944, var_1_31=5368709119, var_1_32=1073741829, var_1_33=6442450950, var_1_34=6442450949, var_1_35=6442450944, var_1_4=4, var_1_5=4, 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=6442450950, var_1_22=6442450949, var_1_24=-128, var_1_25=128, var_1_26=8, var_1_27=-1073741825, var_1_28=0, var_1_29=1, var_1_30=6442450944, var_1_31=5368709119, var_1_32=1073741829, var_1_33=6442450950, var_1_34=6442450949, var_1_35=6442450944, var_1_4=4, var_1_5=4, 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=6442450950, var_1_22=6442450949, var_1_24=0, var_1_25=128, var_1_26=8, var_1_27=-1073741825, var_1_28=0, var_1_29=1, var_1_30=6442450944, var_1_31=5368709119, var_1_32=1073741829, var_1_33=6442450950, var_1_34=6442450949, var_1_35=6442450944, var_1_4=4, var_1_5=4, 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=6442450950, var_1_22=6442450949, var_1_24=0, var_1_25=128, var_1_26=8, var_1_27=-1073741825, var_1_28=0, var_1_29=1, var_1_30=6442450944, var_1_31=5368709119, var_1_32=1073741829, var_1_33=6442450950, var_1_34=6442450949, var_1_35=6442450944, var_1_4=4, var_1_5=4, 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=4, var_1_20=6442450950, var_1_22=6442450949, var_1_24=0, var_1_25=128, var_1_26=8, var_1_27=-1073741825, var_1_28=0, var_1_29=1, var_1_30=6442450944, var_1_31=5368709119, var_1_32=1073741829, var_1_33=6442450950, var_1_34=6442450949, var_1_35=6442450944, var_1_4=4, var_1_5=4, 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=4, 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=4, var_1_20=6442450950, var_1_22=6442450949, var_1_24=0, var_1_25=128, var_1_26=8, var_1_27=-1073741825, var_1_28=0, var_1_29=1, var_1_30=6442450944, var_1_31=5368709119, var_1_32=1073741829, var_1_33=6442450950, var_1_34=6442450949, var_1_35=6442450944, var_1_4=4, var_1_5=4, 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=4, var_1_11=0, var_1_12=0, var_1_13=4, var_1_14=1, var_1_16=-1, var_1_17=-63, var_1_18=0, var_1_19=2567/10, var_1_1=4, var_1_20=6442450950, var_1_22=6442450949, var_1_24=0, var_1_25=128, var_1_26=8, var_1_27=-1073741825, var_1_28=0, var_1_29=1, var_1_30=6442450944, var_1_31=5368709119, var_1_32=1073741829, var_1_33=6442450950, var_1_34=6442450949, var_1_35=6442450944, var_1_4=4, var_1_5=4, 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=4, stepLocal_3=0, var_1_11=0, var_1_12=0, var_1_13=4, var_1_14=1, var_1_16=-1, var_1_17=-63, var_1_18=0, var_1_19=2567/10, var_1_1=4, var_1_20=6442450950, var_1_22=6442450949, var_1_24=0, var_1_25=128, var_1_26=8, var_1_27=-1073741825, var_1_28=0, var_1_29=1, var_1_30=6442450944, var_1_31=5368709119, var_1_32=1073741829, var_1_33=6442450950, var_1_34=6442450949, var_1_35=6442450944, var_1_4=4, var_1_5=4, 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=4, var_1_11=0, var_1_12=0, var_1_13=4, var_1_14=1, var_1_16=-1, var_1_17=-63, var_1_18=0, var_1_19=2567/10, var_1_1=4, var_1_20=6442450950, var_1_22=6442450949, var_1_24=0, var_1_25=128, var_1_26=8, var_1_27=-1073741825, var_1_28=0, var_1_29=1, var_1_30=6442450944, var_1_31=5368709119, var_1_32=1073741829, var_1_33=6442450950, var_1_34=6442450949, var_1_35=6442450944, var_1_4=4, var_1_5=4, 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=4, stepLocal_5=4, var_1_11=0, var_1_12=0, var_1_13=4, var_1_14=1, var_1_16=-1, var_1_17=-63, var_1_18=0, var_1_19=2567/10, var_1_1=4, var_1_20=6442450950, var_1_22=6442450949, var_1_24=0, var_1_25=128, var_1_26=8, var_1_27=-1073741825, var_1_28=0, var_1_29=1, var_1_30=6442450944, var_1_31=5368709119, var_1_32=1073741829, var_1_33=6442450950, var_1_34=6442450949, var_1_35=6442450944, var_1_4=4, var_1_5=4, 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=4, stepLocal_5=4, var_1_11=0, var_1_12=0, var_1_13=4, var_1_14=1, var_1_16=-1, var_1_17=-63, var_1_18=0, var_1_19=2567/10, var_1_1=4, var_1_20=6442450950, var_1_22=6442450949, var_1_24=0, var_1_25=128, var_1_26=8, var_1_27=-1073741825, var_1_28=0, var_1_29=1, var_1_30=6442450944, var_1_31=5368709119, var_1_32=1073741829, var_1_33=6442450950, var_1_34=6442450949, var_1_35=6442450944, var_1_4=4, var_1_5=4, 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=4, stepLocal_5=4, var_1_11=0, var_1_12=0, var_1_13=4, var_1_14=1, var_1_16=-1, var_1_17=-63, var_1_18=0, var_1_19=2567/10, var_1_1=4, var_1_20=6442450950, var_1_22=6442450949, var_1_24=0, var_1_25=4, var_1_26=8, var_1_27=-1073741825, var_1_28=0, var_1_29=1, var_1_30=6442450944, var_1_31=5368709119, var_1_32=1073741829, var_1_33=6442450950, var_1_34=6442450949, var_1_35=6442450944, var_1_4=4, var_1_5=4, var_1_6=0] [L209] RET step() [L210] 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=4, var_1_14=1, var_1_16=-1, var_1_17=-63, var_1_18=0, var_1_19=2567/10, var_1_1=4, var_1_20=6442450950, var_1_22=6442450949, var_1_24=0, var_1_25=4, var_1_26=8, var_1_27=-1073741825, var_1_28=0, var_1_29=1, var_1_30=6442450944, var_1_31=5368709119, var_1_32=1073741829, var_1_33=6442450950, var_1_34=6442450949, var_1_35=6442450944, var_1_4=4, var_1_5=4, 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=4, var_1_14=1, var_1_16=-1, var_1_17=-63, var_1_18=0, var_1_19=2567/10, var_1_1=4, var_1_20=6442450950, var_1_22=6442450949, var_1_24=0, var_1_25=4, var_1_26=8, var_1_27=-1073741825, var_1_28=0, var_1_29=1, var_1_30=6442450944, var_1_31=5368709119, var_1_32=1073741829, var_1_33=6442450950, var_1_34=6442450949, var_1_35=6442450944, var_1_4=4, var_1_5=4, 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=4, var_1_14=1, var_1_16=-1, var_1_17=-63, var_1_18=0, var_1_19=2567/10, var_1_1=4, var_1_20=6442450950, var_1_22=6442450949, var_1_24=0, var_1_25=4, var_1_26=8, var_1_27=-1073741825, var_1_28=0, var_1_29=1, var_1_30=6442450944, var_1_31=5368709119, var_1_32=1073741829, var_1_33=6442450950, var_1_34=6442450949, var_1_35=6442450944, var_1_4=4, var_1_5=4, 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)) ; [L210] RET, EXPR property() [L210] 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=4, var_1_14=1, var_1_16=-1, var_1_17=-63, var_1_18=0, var_1_19=2567/10, var_1_1=4, var_1_20=6442450950, var_1_22=6442450949, var_1_24=0, var_1_25=4, var_1_26=8, var_1_27=-1073741825, var_1_28=0, var_1_29=1, var_1_30=6442450944, var_1_31=5368709119, var_1_32=1073741829, var_1_33=6442450950, var_1_34=6442450949, var_1_35=6442450944, var_1_4=4, var_1_5=4, 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=4, var_1_14=1, var_1_16=-1, var_1_17=-63, var_1_18=0, var_1_19=2567/10, var_1_1=4, var_1_20=6442450950, var_1_22=6442450949, var_1_24=0, var_1_25=4, var_1_26=8, var_1_27=-1073741825, var_1_28=0, var_1_29=1, var_1_30=6442450944, var_1_31=5368709119, var_1_32=1073741829, var_1_33=6442450950, var_1_34=6442450949, var_1_35=6442450944, var_1_4=4, var_1_5=4, var_1_6=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 110 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.0s, OverallIterations: 10, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1350 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1350 mSDsluCounter, 4646 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2956 mSDsCounter, 642 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 383 IncrementalHoareTripleChecker+Invalid, 1025 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 642 mSolverCounterUnsat, 1690 mSDtfsCounter, 383 mSolverCounterSat, 0.1s 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.1s InterpolantComputationTime, 1811 NumberOfCodeBlocks, 1811 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1618 ConstructedInterpolants, 0 QuantifiedInterpolants, 5277 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-11 11:17:26,605 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-43.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 d82b18cd242e9ca49d0125d9760f9ce4d46eda4589890d58c3d3555645b3c016 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 11:17:28,870 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 11:17:28,958 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 11:17:28,963 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 11:17:28,964 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 11:17:28,989 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 11:17:28,992 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 11:17:28,992 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 11:17:28,993 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 11:17:28,994 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 11:17:28,994 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 11:17:28,995 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 11:17:28,995 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 11:17:28,996 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 11:17:28,997 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 11:17:28,999 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 11:17:28,999 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 11:17:28,999 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 11:17:29,000 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 11:17:29,000 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 11:17:29,003 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 11:17:29,004 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 11:17:29,004 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 11:17:29,004 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 11:17:29,004 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 11:17:29,004 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 11:17:29,004 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 11:17:29,005 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 11:17:29,005 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 11:17:29,005 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 11:17:29,006 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 11:17:29,006 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 11:17:29,006 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 11:17:29,006 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 11:17:29,007 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:17:29,008 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 11:17:29,008 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 11:17:29,008 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 11:17:29,009 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 11:17:29,009 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 11:17:29,009 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 11:17:29,010 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 11:17:29,010 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 11:17:29,011 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 11:17:29,011 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 11:17:29,011 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-clean/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-clean/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 -> d82b18cd242e9ca49d0125d9760f9ce4d46eda4589890d58c3d3555645b3c016 [2024-10-11 11:17:29,350 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 11:17:29,372 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 11:17:29,376 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 11:17:29,377 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 11:17:29,379 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 11:17:29,381 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-43.i [2024-10-11 11:17:30,949 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 11:17:31,185 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 11:17:31,189 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-43.i [2024-10-11 11:17:31,207 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/4ec9336ba/b4ff5590ea824b35ae81613c48325c97/FLAG04b3bda87 [2024-10-11 11:17:31,225 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/4ec9336ba/b4ff5590ea824b35ae81613c48325c97 [2024-10-11 11:17:31,228 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 11:17:31,229 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 11:17:31,232 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 11:17:31,232 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 11:17:31,238 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 11:17:31,239 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:17:31" (1/1) ... [2024-10-11 11:17:31,240 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23dcb34b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:17:31, skipping insertion in model container [2024-10-11 11:17:31,240 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:17:31" (1/1) ... [2024-10-11 11:17:31,280 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 11:17:31,469 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-while_file-43.i[916,929] [2024-10-11 11:17:31,579 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:17:31,598 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 11:17:31,612 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-while_file-43.i[916,929] [2024-10-11 11:17:31,683 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:17:31,710 INFO L204 MainTranslator]: Completed translation [2024-10-11 11:17:31,711 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:17:31 WrapperNode [2024-10-11 11:17:31,711 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 11:17:31,713 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 11:17:31,713 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 11:17:31,713 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 11:17:31,719 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:17:31" (1/1) ... [2024-10-11 11:17:31,741 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:17:31" (1/1) ... [2024-10-11 11:17:31,780 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 205 [2024-10-11 11:17:31,781 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 11:17:31,781 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 11:17:31,781 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 11:17:31,782 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 11:17:31,794 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:17:31" (1/1) ... [2024-10-11 11:17:31,794 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:17:31" (1/1) ... [2024-10-11 11:17:31,802 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:17:31" (1/1) ... [2024-10-11 11:17:31,821 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-11 11:17:31,821 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:17:31" (1/1) ... [2024-10-11 11:17:31,822 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:17:31" (1/1) ... [2024-10-11 11:17:31,838 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:17:31" (1/1) ... [2024-10-11 11:17:31,846 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:17:31" (1/1) ... [2024-10-11 11:17:31,853 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:17:31" (1/1) ... [2024-10-11 11:17:31,855 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:17:31" (1/1) ... [2024-10-11 11:17:31,859 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 11:17:31,860 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 11:17:31,860 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 11:17:31,860 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 11:17:31,864 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:17:31" (1/1) ... [2024-10-11 11:17:31,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:17:31,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:17:31,930 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 11:17:31,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 11:17:31,984 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 11:17:31,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 11:17:31,985 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 11:17:31,985 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 11:17:31,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 11:17:31,987 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 11:17:32,076 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 11:17:32,080 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 11:17:42,707 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-10-11 11:17:42,707 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 11:17:42,787 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 11:17:42,790 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 11:17:42,791 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:17:42 BoogieIcfgContainer [2024-10-11 11:17:42,791 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 11:17:42,793 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 11:17:42,793 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 11:17:42,797 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 11:17:42,798 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:17:31" (1/3) ... [2024-10-11 11:17:42,798 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@88e5386 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:17:42, skipping insertion in model container [2024-10-11 11:17:42,799 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:17:31" (2/3) ... [2024-10-11 11:17:42,799 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@88e5386 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:17:42, skipping insertion in model container [2024-10-11 11:17:42,799 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:17:42" (3/3) ... [2024-10-11 11:17:42,800 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-43.i [2024-10-11 11:17:42,817 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 11:17:42,817 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 11:17:42,918 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 11:17:42,927 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;@c2a1885, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 11:17:42,927 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 11:17:42,935 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-11 11:17:42,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-11 11:17:42,951 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:17:42,952 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-11 11:17:42,953 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:17:42,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:17:42,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1210957691, now seen corresponding path program 1 times [2024-10-11 11:17:42,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:17:42,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [331225014] [2024-10-11 11:17:42,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:17:42,984 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-11 11:17:42,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:17:42,987 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/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-11 11:17:43,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 11:17:43,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:43,520 INFO L255 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 11:17:43,534 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:17:43,584 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-11 11:17:43,586 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 11:17:43,587 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 11:17:43,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [331225014] [2024-10-11 11:17:43,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [331225014] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:17:43,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:17:43,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 11:17:43,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228220244] [2024-10-11 11:17:43,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:17:43,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 11:17:43,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 11:17:43,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 11:17:43,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:17:43,630 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-11 11:17:47,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:17:47,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:17:47,900 INFO L93 Difference]: Finished difference Result 157 states and 276 transitions. [2024-10-11 11:17:47,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 11:17:47,956 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-11 11:17:47,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:17:47,963 INFO L225 Difference]: With dead ends: 157 [2024-10-11 11:17:47,963 INFO L226 Difference]: Without dead ends: 78 [2024-10-11 11:17:47,966 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-11 11:17:47,969 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-10-11 11:17:47,970 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 117 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2024-10-11 11:17:47,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-11 11:17:48,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-10-11 11:17:48,012 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-11 11:17:48,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 120 transitions. [2024-10-11 11:17:48,017 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 120 transitions. Word has length 168 [2024-10-11 11:17:48,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:17:48,018 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 120 transitions. [2024-10-11 11:17:48,018 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-11 11:17:48,018 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 120 transitions. [2024-10-11 11:17:48,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-11 11:17:48,022 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:17:48,022 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-11 11:17:48,041 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 11:17:48,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/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-11 11:17:48,224 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:17:48,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:17:48,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1061401487, now seen corresponding path program 1 times [2024-10-11 11:17:48,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:17:48,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [206168943] [2024-10-11 11:17:48,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:17:48,226 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-11 11:17:48,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:17:48,228 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/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-11 11:17:48,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 11:17:48,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:48,712 INFO L255 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 11:17:48,718 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:17:50,823 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-11 11:17:50,823 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 11:17:50,823 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 11:17:50,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [206168943] [2024-10-11 11:17:50,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [206168943] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:17:50,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:17:50,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 11:17:50,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633811542] [2024-10-11 11:17:50,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:17:50,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 11:17:50,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 11:17:50,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 11:17:50,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 11:17:50,828 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-11 11:17:56,318 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:18:00,323 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-11 11:18:05,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:18:09,355 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-11 11:18:13,361 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-11 11:18:13,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:18:13,362 INFO L93 Difference]: Finished difference Result 233 states and 359 transitions. [2024-10-11 11:18:13,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 11:18:13,418 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-11 11:18:13,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:18:13,421 INFO L225 Difference]: With dead ends: 233 [2024-10-11 11:18:13,421 INFO L226 Difference]: Without dead ends: 156 [2024-10-11 11:18:13,422 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-11 11:18:13,423 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 75 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 53 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.5s IncrementalHoareTripleChecker+Time [2024-10-11 11:18:13,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 343 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 12 Invalid, 5 Unknown, 0 Unchecked, 22.5s Time] [2024-10-11 11:18:13,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-10-11 11:18:13,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 126. [2024-10-11 11:18:13,464 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-11 11:18:13,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 193 transitions. [2024-10-11 11:18:13,469 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 193 transitions. Word has length 168 [2024-10-11 11:18:13,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:18:13,470 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 193 transitions. [2024-10-11 11:18:13,470 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-11 11:18:13,470 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 193 transitions. [2024-10-11 11:18:13,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-11 11:18:13,474 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:18:13,474 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-11 11:18:13,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 11:18:13,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/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-11 11:18:13,676 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:18:13,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:18:13,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1517708599, now seen corresponding path program 1 times [2024-10-11 11:18:13,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:18:13,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1274329850] [2024-10-11 11:18:13,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:18:13,677 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-11 11:18:13,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:18:13,680 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/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-11 11:18:13,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 11:18:14,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:14,170 INFO L255 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 11:18:14,184 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:18:18,958 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-11 11:18:18,959 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 11:18:18,959 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 11:18:18,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1274329850] [2024-10-11 11:18:18,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1274329850] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:18:18,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:18:18,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 11:18:18,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474611632] [2024-10-11 11:18:18,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:18:18,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 11:18:18,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 11:18:18,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 11:18:18,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 11:18:18,962 INFO L87 Difference]: Start difference. First operand 126 states and 193 transitions. Second operand has 4 states, 4 states have (on average 10.5) 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-11 11:18:23,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:18:27,448 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-11 11:18:31,688 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:18:35,695 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-11 11:18:39,707 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-11 11:18:39,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:18:39,707 INFO L93 Difference]: Finished difference Result 247 states and 382 transitions. [2024-10-11 11:18:39,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 11:18:39,755 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) 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-11 11:18:39,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:18:39,757 INFO L225 Difference]: With dead ends: 247 [2024-10-11 11:18:39,758 INFO L226 Difference]: Without dead ends: 170 [2024-10-11 11:18:39,761 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 11:18:39,762 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 99 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 53 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.6s IncrementalHoareTripleChecker+Time [2024-10-11 11:18:39,762 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 359 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 23 Invalid, 5 Unknown, 0 Unchecked, 20.6s Time] [2024-10-11 11:18:39,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-10-11 11:18:39,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 127. [2024-10-11 11:18:39,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 72 states have (on average 1.25) internal successors, (90), 72 states have internal predecessors, (90), 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-11 11:18:39,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 194 transitions. [2024-10-11 11:18:39,802 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 194 transitions. Word has length 169 [2024-10-11 11:18:39,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:18:39,804 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 194 transitions. [2024-10-11 11:18:39,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) 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-11 11:18:39,806 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 194 transitions. [2024-10-11 11:18:39,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-11 11:18:39,809 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:18:39,809 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-11 11:18:39,830 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-11 11:18:40,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/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-11 11:18:40,012 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:18:40,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:18:40,013 INFO L85 PathProgramCache]: Analyzing trace with hash 700060149, now seen corresponding path program 1 times [2024-10-11 11:18:40,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:18:40,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1135864586] [2024-10-11 11:18:40,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:18:40,014 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-11 11:18:40,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:18:40,017 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/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-11 11:18:40,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 11:18:40,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:40,445 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 11:18:40,453 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:18:40,512 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-11 11:18:40,512 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 11:18:40,512 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 11:18:40,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1135864586] [2024-10-11 11:18:40,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1135864586] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:18:40,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:18:40,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 11:18:40,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776125989] [2024-10-11 11:18:40,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:18:40,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 11:18:40,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 11:18:40,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 11:18:40,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 11:18:40,514 INFO L87 Difference]: Start difference. First operand 127 states and 194 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)