./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-85.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-85.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c4862b5ebb887702302f2980511014b313d3fbe17ee23cc3bf7542b446fc70eb --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 19:41:48,887 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 19:41:48,936 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 19:41:48,940 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 19:41:48,941 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 19:41:48,962 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 19:41:48,963 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 19:41:48,963 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 19:41:48,963 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 19:41:48,963 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 19:41:48,963 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 19:41:48,963 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 19:41:48,963 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 19:41:48,963 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 19:41:48,963 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 19:41:48,964 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 19:41:48,964 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 19:41:48,964 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 19:41:48,964 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 19:41:48,964 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 19:41:48,964 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 19:41:48,964 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 19:41:48,964 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 19:41:48,964 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 19:41:48,964 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 19:41:48,964 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 19:41:48,964 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 19:41:48,964 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 19:41:48,964 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 19:41:48,964 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 19:41:48,964 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 19:41:48,964 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 19:41:48,966 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:41:48,966 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 19:41:48,967 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 19:41:48,967 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 19:41:48,967 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 19:41:48,967 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 19:41:48,967 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 19:41:48,967 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 19:41:48,967 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 19:41:48,967 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 19:41:48,967 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 19:41:48,967 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c4862b5ebb887702302f2980511014b313d3fbe17ee23cc3bf7542b446fc70eb [2025-03-03 19:41:49,196 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 19:41:49,206 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 19:41:49,207 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 19:41:49,208 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 19:41:49,208 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 19:41:49,210 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-85.i [2025-03-03 19:41:50,314 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab9ff4246/46dcf9501d334c8485ae5965356c44a7/FLAG6ae257cf3 [2025-03-03 19:41:50,565 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 19:41:50,567 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-85.i [2025-03-03 19:41:50,574 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab9ff4246/46dcf9501d334c8485ae5965356c44a7/FLAG6ae257cf3 [2025-03-03 19:41:50,885 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab9ff4246/46dcf9501d334c8485ae5965356c44a7 [2025-03-03 19:41:50,887 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 19:41:50,888 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 19:41:50,889 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 19:41:50,889 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 19:41:50,892 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 19:41:50,893 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:41:50" (1/1) ... [2025-03-03 19:41:50,894 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e6118f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:41:50, skipping insertion in model container [2025-03-03 19:41:50,894 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:41:50" (1/1) ... [2025-03-03 19:41:50,907 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 19:41:51,010 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-85.i[915,928] [2025-03-03 19:41:51,069 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:41:51,085 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 19:41:51,092 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-85.i[915,928] [2025-03-03 19:41:51,113 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:41:51,125 INFO L204 MainTranslator]: Completed translation [2025-03-03 19:41:51,126 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:41:51 WrapperNode [2025-03-03 19:41:51,126 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 19:41:51,128 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 19:41:51,128 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 19:41:51,128 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 19:41:51,132 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:41:51" (1/1) ... [2025-03-03 19:41:51,137 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:41:51" (1/1) ... [2025-03-03 19:41:51,154 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 175 [2025-03-03 19:41:51,154 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 19:41:51,155 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 19:41:51,155 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 19:41:51,155 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 19:41:51,160 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:41:51" (1/1) ... [2025-03-03 19:41:51,160 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:41:51" (1/1) ... [2025-03-03 19:41:51,162 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:41:51" (1/1) ... [2025-03-03 19:41:51,177 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]. [2025-03-03 19:41:51,178 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:41:51" (1/1) ... [2025-03-03 19:41:51,178 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:41:51" (1/1) ... [2025-03-03 19:41:51,186 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:41:51" (1/1) ... [2025-03-03 19:41:51,189 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:41:51" (1/1) ... [2025-03-03 19:41:51,190 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:41:51" (1/1) ... [2025-03-03 19:41:51,191 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:41:51" (1/1) ... [2025-03-03 19:41:51,193 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 19:41:51,193 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 19:41:51,193 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 19:41:51,193 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 19:41:51,194 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:41:51" (1/1) ... [2025-03-03 19:41:51,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:41:51,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:41:51,216 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 19:41:51,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 19:41:51,232 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 19:41:51,232 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 19:41:51,232 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 19:41:51,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 19:41:51,232 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 19:41:51,232 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 19:41:51,293 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 19:41:51,295 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 19:41:51,552 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2025-03-03 19:41:51,552 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 19:41:51,570 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 19:41:51,570 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-03 19:41:51,572 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:41:51 BoogieIcfgContainer [2025-03-03 19:41:51,573 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 19:41:51,574 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 19:41:51,574 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 19:41:51,577 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 19:41:51,579 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 07:41:50" (1/3) ... [2025-03-03 19:41:51,580 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55529172 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:41:51, skipping insertion in model container [2025-03-03 19:41:51,580 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:41:51" (2/3) ... [2025-03-03 19:41:51,580 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55529172 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:41:51, skipping insertion in model container [2025-03-03 19:41:51,580 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:41:51" (3/3) ... [2025-03-03 19:41:51,581 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-85.i [2025-03-03 19:41:51,592 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 19:41:51,593 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-85.i that has 2 procedures, 73 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 19:41:51,630 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 19:41:51,637 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;@5c6c944b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 19:41:51,638 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 19:41:51,640 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 48 states have (on average 1.3958333333333333) internal successors, (67), 49 states have internal predecessors, (67), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-03 19:41:51,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-03 19:41:51,651 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:41:51,652 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:41:51,652 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:41:51,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:41:51,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1134986431, now seen corresponding path program 1 times [2025-03-03 19:41:51,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:41:51,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352571208] [2025-03-03 19:41:51,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:41:51,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:41:51,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-03 19:41:51,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-03 19:41:51,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:41:51,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:41:51,903 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-03-03 19:41:51,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:41:51,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352571208] [2025-03-03 19:41:51,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352571208] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:41:51,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [427363829] [2025-03-03 19:41:51,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:41:51,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:41:51,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:41:51,908 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 19:41:51,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 19:41:51,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-03 19:41:52,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-03 19:41:52,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:41:52,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:41:52,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 19:41:52,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:41:52,070 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-03-03 19:41:52,071 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:41:52,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [427363829] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:41:52,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 19:41:52,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 19:41:52,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635887495] [2025-03-03 19:41:52,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:41:52,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 19:41:52,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:41:52,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 19:41:52,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:41:52,093 INFO L87 Difference]: Start difference. First operand has 73 states, 48 states have (on average 1.3958333333333333) internal successors, (67), 49 states have internal predecessors, (67), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-03 19:41:52,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:41:52,112 INFO L93 Difference]: Finished difference Result 140 states and 239 transitions. [2025-03-03 19:41:52,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 19:41:52,113 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 144 [2025-03-03 19:41:52,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:41:52,119 INFO L225 Difference]: With dead ends: 140 [2025-03-03 19:41:52,119 INFO L226 Difference]: Without dead ends: 70 [2025-03-03 19:41:52,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:41:52,126 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:41:52,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 103 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:41:52,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-03 19:41:52,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2025-03-03 19:41:52,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 46 states have (on average 1.326086956521739) internal successors, (61), 46 states have internal predecessors, (61), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-03 19:41:52,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 105 transitions. [2025-03-03 19:41:52,160 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 105 transitions. Word has length 144 [2025-03-03 19:41:52,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:41:52,160 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 105 transitions. [2025-03-03 19:41:52,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-03 19:41:52,160 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 105 transitions. [2025-03-03 19:41:52,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-03 19:41:52,163 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:41:52,163 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:41:52,170 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 19:41:52,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 19:41:52,364 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:41:52,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:41:52,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1612354061, now seen corresponding path program 1 times [2025-03-03 19:41:52,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:41:52,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363283402] [2025-03-03 19:41:52,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:41:52,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:41:52,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-03 19:41:52,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-03 19:41:52,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:41:52,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:41:53,115 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 19:41:53,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:41:53,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363283402] [2025-03-03 19:41:53,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363283402] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:41:53,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:41:53,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 19:41:53,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166025728] [2025-03-03 19:41:53,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:41:53,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 19:41:53,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:41:53,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 19:41:53,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 19:41:53,122 INFO L87 Difference]: Start difference. First operand 70 states and 105 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 19:41:53,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:41:53,392 INFO L93 Difference]: Finished difference Result 205 states and 310 transitions. [2025-03-03 19:41:53,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 19:41:53,393 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 145 [2025-03-03 19:41:53,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:41:53,395 INFO L225 Difference]: With dead ends: 205 [2025-03-03 19:41:53,397 INFO L226 Difference]: Without dead ends: 138 [2025-03-03 19:41:53,397 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 19:41:53,398 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 83 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 19:41:53,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 324 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 19:41:53,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-03-03 19:41:53,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 120. [2025-03-03 19:41:53,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 73 states have (on average 1.273972602739726) internal successors, (93), 73 states have internal predecessors, (93), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-03 19:41:53,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 181 transitions. [2025-03-03 19:41:53,432 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 181 transitions. Word has length 145 [2025-03-03 19:41:53,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:41:53,432 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 181 transitions. [2025-03-03 19:41:53,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 19:41:53,433 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 181 transitions. [2025-03-03 19:41:53,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-03 19:41:53,435 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:41:53,435 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:41:53,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 19:41:53,436 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:41:53,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:41:53,437 INFO L85 PathProgramCache]: Analyzing trace with hash -889317713, now seen corresponding path program 1 times [2025-03-03 19:41:53,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:41:53,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776233559] [2025-03-03 19:41:53,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:41:53,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:41:53,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-03 19:41:53,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-03 19:41:53,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:41:53,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:41:53,928 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 19:41:53,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:41:53,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776233559] [2025-03-03 19:41:53,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776233559] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:41:53,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:41:53,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 19:41:53,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453199862] [2025-03-03 19:41:53,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:41:53,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 19:41:53,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:41:53,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 19:41:53,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 19:41:53,929 INFO L87 Difference]: Start difference. First operand 120 states and 181 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 19:41:54,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:41:54,194 INFO L93 Difference]: Finished difference Result 219 states and 328 transitions. [2025-03-03 19:41:54,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 19:41:54,195 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 146 [2025-03-03 19:41:54,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:41:54,197 INFO L225 Difference]: With dead ends: 219 [2025-03-03 19:41:54,199 INFO L226 Difference]: Without dead ends: 152 [2025-03-03 19:41:54,200 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-03 19:41:54,201 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 113 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 19:41:54,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 329 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 19:41:54,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-03-03 19:41:54,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 128. [2025-03-03 19:41:54,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 81 states have (on average 1.2962962962962963) internal successors, (105), 81 states have internal predecessors, (105), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-03 19:41:54,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 193 transitions. [2025-03-03 19:41:54,234 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 193 transitions. Word has length 146 [2025-03-03 19:41:54,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:41:54,235 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 193 transitions. [2025-03-03 19:41:54,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 19:41:54,235 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 193 transitions. [2025-03-03 19:41:54,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-03 19:41:54,237 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:41:54,239 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:41:54,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 19:41:54,239 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:41:54,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:41:54,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1814032, now seen corresponding path program 1 times [2025-03-03 19:41:54,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:41:54,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395478288] [2025-03-03 19:41:54,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:41:54,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:41:54,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-03 19:41:54,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-03 19:41:54,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:41:54,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:41:54,412 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 19:41:54,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:41:54,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395478288] [2025-03-03 19:41:54,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395478288] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:41:54,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:41:54,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 19:41:54,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086747075] [2025-03-03 19:41:54,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:41:54,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 19:41:54,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:41:54,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 19:41:54,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 19:41:54,414 INFO L87 Difference]: Start difference. First operand 128 states and 193 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 19:41:54,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:41:54,545 INFO L93 Difference]: Finished difference Result 219 states and 328 transitions. [2025-03-03 19:41:54,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 19:41:54,545 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 146 [2025-03-03 19:41:54,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:41:54,547 INFO L225 Difference]: With dead ends: 219 [2025-03-03 19:41:54,547 INFO L226 Difference]: Without dead ends: 142 [2025-03-03 19:41:54,547 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 19:41:54,547 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 97 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 19:41:54,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 415 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 19:41:54,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-03-03 19:41:54,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 138. [2025-03-03 19:41:54,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 90 states have (on average 1.288888888888889) internal successors, (116), 90 states have internal predecessors, (116), 44 states have call successors, (44), 3 states have call predecessors, (44), 3 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-03 19:41:54,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 204 transitions. [2025-03-03 19:41:54,570 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 204 transitions. Word has length 146 [2025-03-03 19:41:54,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:41:54,570 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 204 transitions. [2025-03-03 19:41:54,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 19:41:54,570 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 204 transitions. [2025-03-03 19:41:54,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-03 19:41:54,571 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:41:54,572 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:41:54,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 19:41:54,572 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:41:54,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:41:54,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1399352708, now seen corresponding path program 1 times [2025-03-03 19:41:54,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:41:54,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266748838] [2025-03-03 19:41:54,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:41:54,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:41:54,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-03 19:41:54,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-03 19:41:54,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:41:54,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:41:55,181 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 36 proven. 27 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2025-03-03 19:41:55,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:41:55,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266748838] [2025-03-03 19:41:55,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266748838] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:41:55,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [423224014] [2025-03-03 19:41:55,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:41:55,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:41:55,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:41:55,184 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 19:41:55,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 19:41:55,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-03 19:41:55,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-03 19:41:55,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:41:55,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:41:55,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 19:41:55,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:41:55,535 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 477 proven. 27 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-03 19:41:55,535 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 19:41:55,820 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 36 proven. 27 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2025-03-03 19:41:55,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [423224014] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 19:41:55,820 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 19:41:55,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2025-03-03 19:41:55,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770770806] [2025-03-03 19:41:55,820 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 19:41:55,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-03 19:41:55,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:41:55,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-03 19:41:55,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2025-03-03 19:41:55,821 INFO L87 Difference]: Start difference. First operand 138 states and 204 transitions. Second operand has 18 states, 18 states have (on average 4.722222222222222) internal successors, (85), 18 states have internal predecessors, (85), 4 states have call successors, (53), 2 states have call predecessors, (53), 4 states have return successors, (54), 4 states have call predecessors, (54), 4 states have call successors, (54) [2025-03-03 19:41:57,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:41:57,484 INFO L93 Difference]: Finished difference Result 469 states and 661 transitions. [2025-03-03 19:41:57,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-03-03 19:41:57,486 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.722222222222222) internal successors, (85), 18 states have internal predecessors, (85), 4 states have call successors, (53), 2 states have call predecessors, (53), 4 states have return successors, (54), 4 states have call predecessors, (54), 4 states have call successors, (54) Word has length 147 [2025-03-03 19:41:57,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:41:57,488 INFO L225 Difference]: With dead ends: 469 [2025-03-03 19:41:57,488 INFO L226 Difference]: Without dead ends: 393 [2025-03-03 19:41:57,492 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 288 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 769 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=622, Invalid=2348, Unknown=0, NotChecked=0, Total=2970 [2025-03-03 19:41:57,493 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 911 mSDsluCounter, 994 mSDsCounter, 0 mSdLazyCounter, 968 mSolverCounterSat, 526 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 937 SdHoareTripleChecker+Valid, 1085 SdHoareTripleChecker+Invalid, 1494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 526 IncrementalHoareTripleChecker+Valid, 968 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:41:57,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [937 Valid, 1085 Invalid, 1494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [526 Valid, 968 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 19:41:57,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2025-03-03 19:41:57,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 180. [2025-03-03 19:41:57,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 118 states have (on average 1.2627118644067796) internal successors, (149), 119 states have internal predecessors, (149), 55 states have call successors, (55), 6 states have call predecessors, (55), 6 states have return successors, (55), 54 states have call predecessors, (55), 55 states have call successors, (55) [2025-03-03 19:41:57,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 259 transitions. [2025-03-03 19:41:57,534 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 259 transitions. Word has length 147 [2025-03-03 19:41:57,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:41:57,535 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 259 transitions. [2025-03-03 19:41:57,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.722222222222222) internal successors, (85), 18 states have internal predecessors, (85), 4 states have call successors, (53), 2 states have call predecessors, (53), 4 states have return successors, (54), 4 states have call predecessors, (54), 4 states have call successors, (54) [2025-03-03 19:41:57,535 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 259 transitions. [2025-03-03 19:41:57,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-03 19:41:57,538 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:41:57,539 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:41:57,546 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 19:41:57,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:41:57,740 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:41:57,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:41:57,740 INFO L85 PathProgramCache]: Analyzing trace with hash -408101755, now seen corresponding path program 1 times [2025-03-03 19:41:57,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:41:57,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651993159] [2025-03-03 19:41:57,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:41:57,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:41:57,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-03 19:41:57,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-03 19:41:57,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:41:57,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 19:41:57,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1682115662] [2025-03-03 19:41:57,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:41:57,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:41:57,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:41:57,824 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 19:41:57,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 19:41:57,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-03 19:41:57,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-03 19:41:57,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:41:57,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 19:41:57,913 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 19:41:57,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-03 19:41:57,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-03 19:41:57,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:41:57,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 19:41:58,045 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 19:41:58,045 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 19:41:58,046 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 19:41:58,054 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 19:41:58,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:41:58,249 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-03 19:41:58,330 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 19:41:58,334 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 07:41:58 BoogieIcfgContainer [2025-03-03 19:41:58,335 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 19:41:58,335 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 19:41:58,335 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 19:41:58,335 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 19:41:58,336 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:41:51" (3/4) ... [2025-03-03 19:41:58,337 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 19:41:58,337 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 19:41:58,338 INFO L158 Benchmark]: Toolchain (without parser) took 7449.91ms. Allocated memory was 201.3MB in the beginning and 251.7MB in the end (delta: 50.3MB). Free memory was 154.1MB in the beginning and 164.6MB in the end (delta: -10.5MB). Peak memory consumption was 35.6MB. Max. memory is 16.1GB. [2025-03-03 19:41:58,339 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 119.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 19:41:58,339 INFO L158 Benchmark]: CACSL2BoogieTranslator took 236.92ms. Allocated memory is still 201.3MB. Free memory was 154.1MB in the beginning and 139.4MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 19:41:58,339 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.57ms. Allocated memory is still 201.3MB. Free memory was 139.4MB in the beginning and 136.6MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 19:41:58,339 INFO L158 Benchmark]: Boogie Preprocessor took 38.09ms. Allocated memory is still 201.3MB. Free memory was 136.6MB in the beginning and 132.9MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 19:41:58,339 INFO L158 Benchmark]: IcfgBuilder took 379.47ms. Allocated memory is still 201.3MB. Free memory was 132.9MB in the beginning and 110.6MB in the end (delta: 22.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 19:41:58,339 INFO L158 Benchmark]: TraceAbstraction took 6760.57ms. Allocated memory was 201.3MB in the beginning and 251.7MB in the end (delta: 50.3MB). Free memory was 109.8MB in the beginning and 164.7MB in the end (delta: -54.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 19:41:58,340 INFO L158 Benchmark]: Witness Printer took 2.47ms. Allocated memory is still 251.7MB. Free memory was 164.7MB in the beginning and 164.6MB in the end (delta: 73.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 19:41:58,340 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 201.3MB. Free memory is still 119.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 236.92ms. Allocated memory is still 201.3MB. Free memory was 154.1MB in the beginning and 139.4MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.57ms. Allocated memory is still 201.3MB. Free memory was 139.4MB in the beginning and 136.6MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 38.09ms. Allocated memory is still 201.3MB. Free memory was 136.6MB in the beginning and 132.9MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 379.47ms. Allocated memory is still 201.3MB. Free memory was 132.9MB in the beginning and 110.6MB in the end (delta: 22.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 6760.57ms. Allocated memory was 201.3MB in the beginning and 251.7MB in the end (delta: 50.3MB). Free memory was 109.8MB in the beginning and 164.7MB in the end (delta: -54.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.47ms. Allocated memory is still 251.7MB. Free memory was 164.7MB in the beginning and 164.6MB in the end (delta: 73.8kB). 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 shiftRight at line 59, overapproximation of someBinaryFLOATComparisonOperation at line 134, overapproximation of someBinaryFLOATComparisonOperation at line 116, overapproximation of someBinaryFLOATComparisonOperation at line 99, overapproximation of someBinaryFLOATComparisonOperation at line 147, overapproximation of someBinaryDOUBLEComparisonOperation at line 147, overapproximation of someBinaryDOUBLEComparisonOperation at line 124, overapproximation of someBinaryDOUBLEComparisonOperation at line 126. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 1000; [L23] unsigned char var_1_5 = 1; [L24] unsigned char var_1_6 = 0; [L25] float var_1_7 = 0.6; [L26] unsigned long int var_1_8 = 32; [L27] unsigned long int var_1_9 = 32; [L28] float var_1_11 = 5.5; [L29] unsigned long int var_1_12 = 128; [L30] unsigned char var_1_13 = 16; [L31] unsigned char var_1_14 = 0; [L32] unsigned long int var_1_15 = 8; [L33] unsigned char var_1_16 = 0; [L34] unsigned char var_1_17 = 0; [L35] double var_1_18 = 1.8; [L36] double var_1_19 = 4.5; [L37] double var_1_20 = 15.5; [L38] signed char var_1_21 = -5; [L39] signed char var_1_22 = 64; [L40] unsigned long int var_1_23 = 4; [L41] unsigned long int var_1_24 = 16; [L42] signed char var_1_25 = -100; [L43] float var_1_26 = 1000000.6; [L44] float var_1_27 = 4.5; [L45] double var_1_28 = 64.5; [L46] unsigned char var_1_29 = 0; [L47] unsigned long int last_1_var_1_1 = 1000; [L48] unsigned char last_1_var_1_5 = 1; [L49] unsigned long int last_1_var_1_12 = 128; [L50] unsigned char last_1_var_1_13 = 16; [L51] unsigned long int last_1_var_1_15 = 8; VAL [isInitial=0, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L151] isInitial = 1 [L152] FCALL initially() [L153] COND TRUE 1 [L154] CALL updateLastVariables() [L140] last_1_var_1_1 = var_1_1 [L141] last_1_var_1_5 = var_1_5 [L142] last_1_var_1_12 = var_1_12 [L143] last_1_var_1_13 = var_1_13 [L144] last_1_var_1_15 = var_1_15 VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L154] RET updateLastVariables() [L155] CALL updateVariables() [L104] var_1_6 = __VERIFIER_nondet_uchar() [L105] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_7=3/5, var_1_8=32, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_7=3/5, var_1_8=32, var_1_9=32] [L105] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_7=3/5, var_1_8=32, var_1_9=32] [L106] CALL assume_abort_if_not(var_1_6 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L106] RET assume_abort_if_not(var_1_6 <= 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L107] var_1_8 = __VERIFIER_nondet_ulong() [L108] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_9=32] [L108] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_9=32] [L109] CALL assume_abort_if_not(var_1_8 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_9=32] [L109] RET assume_abort_if_not(var_1_8 <= 4294967295) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_9=32] [L110] CALL assume_abort_if_not(var_1_8 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=32] [L110] RET assume_abort_if_not(var_1_8 != 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=32] [L111] var_1_9 = __VERIFIER_nondet_ulong() [L112] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33] [L112] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33] [L113] CALL assume_abort_if_not(var_1_9 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33] [L113] RET assume_abort_if_not(var_1_9 <= 4294967295) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33] [L114] CALL assume_abort_if_not(var_1_9 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L114] RET assume_abort_if_not(var_1_9 != 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L115] var_1_11 = __VERIFIER_nondet_float() [L116] CALL assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L116] RET assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L117] var_1_14 = __VERIFIER_nondet_uchar() [L118] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L118] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L119] CALL assume_abort_if_not(var_1_14 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L119] RET assume_abort_if_not(var_1_14 <= 254) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L120] var_1_17 = __VERIFIER_nondet_uchar() [L121] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L121] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L122] CALL assume_abort_if_not(var_1_17 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L122] RET assume_abort_if_not(var_1_17 <= 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L123] var_1_19 = __VERIFIER_nondet_double() [L124] CALL assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L124] RET assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L125] var_1_20 = __VERIFIER_nondet_double() [L126] CALL assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L126] RET assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L127] var_1_22 = __VERIFIER_nondet_char() [L128] CALL assume_abort_if_not(var_1_22 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_22=-1, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_22=-1, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L128] RET assume_abort_if_not(var_1_22 >= -127) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_22=-1, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L129] CALL assume_abort_if_not(var_1_22 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_22=-1, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_22=-1, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L129] RET assume_abort_if_not(var_1_22 <= 126) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_22=-1, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L130] var_1_24 = __VERIFIER_nondet_ulong() [L131] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_22=-1, var_1_23=4, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_22=-1, var_1_23=4, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L131] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_22=-1, var_1_23=4, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L132] CALL assume_abort_if_not(var_1_24 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_22=-1, var_1_23=4, var_1_24=256, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_22=-1, var_1_23=4, var_1_24=256, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L132] RET assume_abort_if_not(var_1_24 <= 4294967294) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_22=-1, var_1_23=4, var_1_24=256, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L133] var_1_27 = __VERIFIER_nondet_float() [L134] CALL assume_abort_if_not((var_1_27 >= -922337.2036854765600e+13F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 9223372.036854765600e+12F && var_1_27 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_22=-1, var_1_23=4, var_1_24=256, var_1_25=-100, var_1_26=5000003/5, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_22=-1, var_1_23=4, var_1_24=256, var_1_25=-100, var_1_26=5000003/5, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L134] RET assume_abort_if_not((var_1_27 >= -922337.2036854765600e+13F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 9223372.036854765600e+12F && var_1_27 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_22=-1, var_1_23=4, var_1_24=256, var_1_25=-100, var_1_26=5000003/5, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L135] var_1_29 = __VERIFIER_nondet_uchar() [L136] CALL assume_abort_if_not(var_1_29 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_22=-1, var_1_23=4, var_1_24=256, var_1_25=-100, var_1_26=5000003/5, var_1_28=129/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_22=-1, var_1_23=4, var_1_24=256, var_1_25=-100, var_1_26=5000003/5, var_1_28=129/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L136] RET assume_abort_if_not(var_1_29 >= 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_22=-1, var_1_23=4, var_1_24=256, var_1_25=-100, var_1_26=5000003/5, var_1_28=129/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L137] CALL assume_abort_if_not(var_1_29 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_22=-1, var_1_23=4, var_1_24=256, var_1_25=-100, var_1_26=5000003/5, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_22=-1, var_1_23=4, var_1_24=256, var_1_25=-100, var_1_26=5000003/5, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L137] RET assume_abort_if_not(var_1_29 <= 1) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_22=-1, var_1_23=4, var_1_24=256, var_1_25=-100, var_1_26=5000003/5, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L155] RET updateVariables() [L156] CALL step() [L55] var_1_21 = var_1_22 [L56] var_1_23 = var_1_24 [L57] var_1_25 = var_1_22 [L58] var_1_26 = var_1_27 VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-1, var_1_22=-1, var_1_23=256, var_1_24=256, var_1_25=-1, var_1_26=2, var_1_27=2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L59] EXPR var_1_24 >> var_1_22 VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-1, var_1_22=-1, var_1_23=256, var_1_24=256, var_1_25=-1, var_1_26=2, var_1_27=2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L59] EXPR 256u ^ (var_1_24 >> var_1_22) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-1, var_1_22=-1, var_1_23=256, var_1_24=256, var_1_25=-1, var_1_26=2, var_1_27=2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L59] COND FALSE !((256u ^ (var_1_24 >> var_1_22)) != var_1_23) [L64] signed long int stepLocal_1 = last_1_var_1_13; [L65] signed long int stepLocal_0 = last_1_var_1_13; VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, stepLocal_1=16, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-1, var_1_22=-1, var_1_23=256, var_1_24=256, var_1_25=-1, var_1_26=2, var_1_27=2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L66] COND TRUE stepLocal_1 < ((- last_1_var_1_12) * 64) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-1, var_1_22=-1, var_1_23=256, var_1_24=256, var_1_25=-1, var_1_26=2, var_1_27=2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L67] COND TRUE \read(last_1_var_1_5) [L68] var_1_1 = ((((last_1_var_1_12) < 0 ) ? -(last_1_var_1_12) : (last_1_var_1_12))) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-1, var_1_22=-1, var_1_23=256, var_1_24=256, var_1_25=-1, var_1_26=2, var_1_27=2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L77] unsigned long int stepLocal_2 = last_1_var_1_15 + last_1_var_1_1; VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, stepLocal_2=1008, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-1, var_1_22=-1, var_1_23=256, var_1_24=256, var_1_25=-1, var_1_26=2, var_1_27=2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L78] COND TRUE last_1_var_1_13 <= stepLocal_2 [L79] var_1_5 = ((last_1_var_1_15 == last_1_var_1_13) && var_1_6) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-1, var_1_22=-1, var_1_23=256, var_1_24=256, var_1_25=-1, var_1_26=2, var_1_27=2, var_1_28=129/2, var_1_29=0, var_1_5=0, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L83] unsigned char stepLocal_3 = var_1_5; VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, stepLocal_3=0, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-1, var_1_22=-1, var_1_23=256, var_1_24=256, var_1_25=-1, var_1_26=2, var_1_27=2, var_1_28=129/2, var_1_29=0, var_1_5=0, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L84] COND FALSE !(stepLocal_3 || var_1_17) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-1, var_1_22=-1, var_1_23=256, var_1_24=256, var_1_25=-1, var_1_26=2, var_1_27=2, var_1_28=129/2, var_1_29=0, var_1_5=0, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L87] var_1_13 = ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14))) [L88] var_1_16 = (var_1_6 && var_1_17) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_12=128, var_1_13=0, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-1, var_1_22=-1, var_1_23=256, var_1_24=256, var_1_25=-1, var_1_26=2, var_1_27=2, var_1_28=129/2, var_1_29=0, var_1_5=0, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L89] COND FALSE !(\read(var_1_5)) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_12=128, var_1_13=0, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-1, var_1_22=-1, var_1_23=256, var_1_24=256, var_1_25=-1, var_1_26=2, var_1_27=2, var_1_28=129/2, var_1_29=0, var_1_5=0, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L92] COND FALSE !((var_1_15 + (var_1_15 * var_1_13)) <= ((32u / var_1_8) / var_1_9)) [L97] var_1_7 = var_1_11 VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_11=3, var_1_12=128, var_1_13=0, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-1, var_1_22=-1, var_1_23=256, var_1_24=256, var_1_25=-1, var_1_26=2, var_1_27=2, var_1_28=129/2, var_1_29=0, var_1_5=0, var_1_6=0, var_1_7=3, var_1_8=33, var_1_9=1] [L99] COND TRUE var_1_7 <= (- (32.8f + var_1_7)) [L100] var_1_12 = last_1_var_1_12 VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_11=3, var_1_12=128, var_1_13=0, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-1, var_1_22=-1, var_1_23=256, var_1_24=256, var_1_25=-1, var_1_26=2, var_1_27=2, var_1_28=129/2, var_1_29=0, var_1_5=0, var_1_6=0, var_1_7=3, var_1_8=33, var_1_9=1] [L156] RET step() [L157] CALL, EXPR property() [L147-L148] return ((((((((last_1_var_1_13 < ((- last_1_var_1_12) * 64)) ? (last_1_var_1_5 ? (var_1_1 == ((unsigned long int) ((((last_1_var_1_12) < 0 ) ? -(last_1_var_1_12) : (last_1_var_1_12))))) : ((-10000000 < last_1_var_1_13) ? (var_1_1 == ((unsigned long int) (((((((last_1_var_1_12) > (5u)) ? (last_1_var_1_12) : (5u))) < 0 ) ? -((((last_1_var_1_12) > (5u)) ? (last_1_var_1_12) : (5u))) : ((((last_1_var_1_12) > (5u)) ? (last_1_var_1_12) : (5u))))))) : (var_1_1 == ((unsigned long int) 50u)))) : 1) && ((last_1_var_1_13 <= (last_1_var_1_15 + last_1_var_1_1)) ? (var_1_5 == ((unsigned char) ((last_1_var_1_15 == last_1_var_1_13) && var_1_6))) : (var_1_5 == ((unsigned char) var_1_6)))) && (((var_1_15 + (var_1_15 * var_1_13)) <= ((32u / var_1_8) / var_1_9)) ? ((1.25f < var_1_18) ? (var_1_7 == ((float) 1000000.1f)) : 1) : (var_1_7 == ((float) var_1_11)))) && ((var_1_7 <= (- (32.8f + var_1_7))) ? (var_1_12 == ((unsigned long int) last_1_var_1_12)) : 1)) && (var_1_13 == ((unsigned char) ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14)))))) && (var_1_5 ? (var_1_15 == ((unsigned long int) ((((var_1_1) > ((var_1_13 + ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14)))))) ? (var_1_1) : ((var_1_13 + ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14))))))))) : 1)) && (var_1_16 == ((unsigned char) (var_1_6 && var_1_17)))) && ((var_1_5 || var_1_17) ? (var_1_18 == ((double) ((((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19))) + var_1_20) - 63.6))) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=3, var_1_12=128, var_1_13=0, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-1, var_1_22=-1, var_1_23=256, var_1_24=256, var_1_25=-1, var_1_26=2, var_1_27=2, var_1_28=129/2, var_1_29=0, var_1_5=0, var_1_6=0, var_1_7=3, var_1_8=33, var_1_9=1] [L157] RET, EXPR property() [L157] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=3, var_1_12=128, var_1_13=0, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-1, var_1_22=-1, var_1_23=256, var_1_24=256, var_1_25=-1, var_1_26=2, var_1_27=2, var_1_28=129/2, var_1_29=0, var_1_5=0, var_1_6=0, var_1_7=3, var_1_8=33, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=3, var_1_12=128, var_1_13=0, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-1, var_1_22=-1, var_1_23=256, var_1_24=256, var_1_25=-1, var_1_26=2, var_1_27=2, var_1_28=129/2, var_1_29=0, var_1_5=0, var_1_6=0, var_1_7=3, var_1_8=33, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 73 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.6s, OverallIterations: 6, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1230 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1204 mSDsluCounter, 2256 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1730 mSDsCounter, 660 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1254 IncrementalHoareTripleChecker+Invalid, 1914 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 660 mSolverCounterUnsat, 526 mSDtfsCounter, 1254 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 513 GetRequests, 443 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 772 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=180occurred in iteration=5, InterpolantAutomatonStates: 65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 259 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 1313 NumberOfCodeBlocks, 1313 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1158 ConstructedInterpolants, 0 QuantifiedInterpolants, 5527 SizeOfPredicates, 7 NumberOfNonLiveVariables, 726 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 8 InterpolantComputations, 4 PerfectInterpolantSequences, 7269/7392 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-03 19:41:58,362 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-85.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c4862b5ebb887702302f2980511014b313d3fbe17ee23cc3bf7542b446fc70eb --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 19:42:00,159 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 19:42:00,241 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 19:42:00,245 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 19:42:00,245 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 19:42:00,273 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 19:42:00,273 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 19:42:00,273 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 19:42:00,274 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 19:42:00,274 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 19:42:00,274 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 19:42:00,274 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 19:42:00,274 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 19:42:00,274 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 19:42:00,274 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 19:42:00,274 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 19:42:00,274 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 19:42:00,274 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 19:42:00,274 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 19:42:00,274 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 19:42:00,274 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 19:42:00,274 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 19:42:00,274 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 19:42:00,275 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 19:42:00,275 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 19:42:00,275 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 19:42:00,275 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 19:42:00,275 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 19:42:00,275 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 19:42:00,275 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 19:42:00,275 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 19:42:00,275 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 19:42:00,275 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 19:42:00,275 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 19:42:00,275 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:42:00,275 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 19:42:00,275 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 19:42:00,277 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 19:42:00,277 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 19:42:00,277 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 19:42:00,277 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 19:42:00,277 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 19:42:00,277 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 19:42:00,278 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 19:42:00,278 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 19:42:00,278 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c4862b5ebb887702302f2980511014b313d3fbe17ee23cc3bf7542b446fc70eb [2025-03-03 19:42:00,510 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 19:42:00,517 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 19:42:00,519 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 19:42:00,521 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 19:42:00,521 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 19:42:00,522 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-85.i [2025-03-03 19:42:01,675 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e38a17f00/5e882b41d1c8477d95ec56897b398435/FLAG1161ac022 [2025-03-03 19:42:01,902 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 19:42:01,904 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-85.i [2025-03-03 19:42:01,913 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e38a17f00/5e882b41d1c8477d95ec56897b398435/FLAG1161ac022 [2025-03-03 19:42:02,259 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e38a17f00/5e882b41d1c8477d95ec56897b398435 [2025-03-03 19:42:02,261 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 19:42:02,262 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 19:42:02,263 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 19:42:02,263 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 19:42:02,266 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 19:42:02,266 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:42:02" (1/1) ... [2025-03-03 19:42:02,267 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4718f4af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:42:02, skipping insertion in model container [2025-03-03 19:42:02,267 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:42:02" (1/1) ... [2025-03-03 19:42:02,284 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 19:42:02,381 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-85.i[915,928] [2025-03-03 19:42:02,434 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:42:02,444 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 19:42:02,452 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-85.i[915,928] [2025-03-03 19:42:02,472 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:42:02,485 INFO L204 MainTranslator]: Completed translation [2025-03-03 19:42:02,487 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:42:02 WrapperNode [2025-03-03 19:42:02,487 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 19:42:02,488 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 19:42:02,488 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 19:42:02,488 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 19:42:02,492 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:42:02" (1/1) ... [2025-03-03 19:42:02,499 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:42:02" (1/1) ... [2025-03-03 19:42:02,522 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 156 [2025-03-03 19:42:02,522 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 19:42:02,523 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 19:42:02,523 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 19:42:02,523 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 19:42:02,529 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:42:02" (1/1) ... [2025-03-03 19:42:02,529 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:42:02" (1/1) ... [2025-03-03 19:42:02,536 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:42:02" (1/1) ... [2025-03-03 19:42:02,553 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]. [2025-03-03 19:42:02,557 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:42:02" (1/1) ... [2025-03-03 19:42:02,557 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:42:02" (1/1) ... [2025-03-03 19:42:02,569 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:42:02" (1/1) ... [2025-03-03 19:42:02,570 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:42:02" (1/1) ... [2025-03-03 19:42:02,571 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:42:02" (1/1) ... [2025-03-03 19:42:02,576 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:42:02" (1/1) ... [2025-03-03 19:42:02,578 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 19:42:02,579 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 19:42:02,579 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 19:42:02,579 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 19:42:02,580 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:42:02" (1/1) ... [2025-03-03 19:42:02,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:42:02,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:42:02,609 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 19:42:02,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 19:42:02,632 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 19:42:02,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 19:42:02,633 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 19:42:02,633 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 19:42:02,633 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 19:42:02,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 19:42:02,702 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 19:42:02,704 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 19:42:05,745 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-03 19:42:05,745 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 19:42:05,752 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 19:42:05,752 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 19:42:05,752 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:42:05 BoogieIcfgContainer [2025-03-03 19:42:05,753 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 19:42:05,754 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 19:42:05,754 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 19:42:05,757 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 19:42:05,758 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 07:42:02" (1/3) ... [2025-03-03 19:42:05,758 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10249762 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:42:05, skipping insertion in model container [2025-03-03 19:42:05,758 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:42:02" (2/3) ... [2025-03-03 19:42:05,758 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10249762 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:42:05, skipping insertion in model container [2025-03-03 19:42:05,758 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:42:05" (3/3) ... [2025-03-03 19:42:05,759 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-85.i [2025-03-03 19:42:05,768 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 19:42:05,769 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-85.i that has 2 procedures, 67 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 19:42:05,806 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 19:42:05,813 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;@7421c719, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 19:42:05,816 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 19:42:05,819 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 43 states have internal predecessors, (57), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-03 19:42:05,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-03 19:42:05,827 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:42:05,827 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:42:05,827 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:42:05,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:42:05,831 INFO L85 PathProgramCache]: Analyzing trace with hash 372720517, now seen corresponding path program 1 times [2025-03-03 19:42:05,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:42:05,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1062929143] [2025-03-03 19:42:05,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:42:05,840 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 [2025-03-03 19:42:05,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:42:05,842 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 19:42:05,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-03 19:42:05,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-03 19:42:06,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-03 19:42:06,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:42:06,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:42:06,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 19:42:06,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:42:06,261 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 458 proven. 0 refuted. 0 times theorem prover too weak. 466 trivial. 0 not checked. [2025-03-03 19:42:06,262 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:42:06,262 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 19:42:06,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1062929143] [2025-03-03 19:42:06,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1062929143] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:42:06,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:42:06,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 19:42:06,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873635021] [2025-03-03 19:42:06,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:42:06,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 19:42:06,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 19:42:06,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 19:42:06,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:42:06,278 INFO L87 Difference]: Start difference. First operand has 67 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 43 states have internal predecessors, (57), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-03 19:42:06,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:42:06,299 INFO L93 Difference]: Finished difference Result 128 states and 219 transitions. [2025-03-03 19:42:06,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 19:42:06,301 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 142 [2025-03-03 19:42:06,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:42:06,307 INFO L225 Difference]: With dead ends: 128 [2025-03-03 19:42:06,307 INFO L226 Difference]: Without dead ends: 64 [2025-03-03 19:42:06,311 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:42:06,313 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:42:06,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:42:06,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-03 19:42:06,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2025-03-03 19:42:06,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 40 states have (on average 1.3) internal successors, (52), 40 states have internal predecessors, (52), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-03 19:42:06,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 96 transitions. [2025-03-03 19:42:06,344 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 96 transitions. Word has length 142 [2025-03-03 19:42:06,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:42:06,344 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 96 transitions. [2025-03-03 19:42:06,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-03 19:42:06,344 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 96 transitions. [2025-03-03 19:42:06,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-03 19:42:06,348 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:42:06,348 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:42:06,361 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-03 19:42:06,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 19:42:06,549 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:42:06,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:42:06,550 INFO L85 PathProgramCache]: Analyzing trace with hash -517732097, now seen corresponding path program 1 times [2025-03-03 19:42:06,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:42:06,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1424432362] [2025-03-03 19:42:06,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:42:06,552 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 [2025-03-03 19:42:06,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:42:06,554 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 19:42:06,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-03 19:42:06,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-03 19:42:06,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-03 19:42:06,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:42:06,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:42:06,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 19:42:06,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:42:07,602 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 19:42:07,603 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:42:07,603 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 19:42:07,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1424432362] [2025-03-03 19:42:07,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1424432362] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:42:07,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:42:07,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 19:42:07,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637409063] [2025-03-03 19:42:07,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:42:07,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 19:42:07,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 19:42:07,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 19:42:07,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 19:42:07,605 INFO L87 Difference]: Start difference. First operand 64 states and 96 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 19:42:09,860 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 19:42:10,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:42:10,011 INFO L93 Difference]: Finished difference Result 125 states and 189 transitions. [2025-03-03 19:42:10,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 19:42:10,033 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 142 [2025-03-03 19:42:10,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:42:10,034 INFO L225 Difference]: With dead ends: 125 [2025-03-03 19:42:10,034 INFO L226 Difference]: Without dead ends: 64 [2025-03-03 19:42:10,035 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 19:42:10,035 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 78 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-03 19:42:10,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 131 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-03 19:42:10,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-03 19:42:10,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2025-03-03 19:42:10,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 40 states have (on average 1.275) internal successors, (51), 40 states have internal predecessors, (51), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-03 19:42:10,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 95 transitions. [2025-03-03 19:42:10,045 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 95 transitions. Word has length 142 [2025-03-03 19:42:10,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:42:10,046 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 95 transitions. [2025-03-03 19:42:10,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 19:42:10,046 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 95 transitions. [2025-03-03 19:42:10,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-03 19:42:10,047 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:42:10,048 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:42:10,060 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-03 19:42:10,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 19:42:10,248 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:42:10,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:42:10,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1315775197, now seen corresponding path program 1 times [2025-03-03 19:42:10,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:42:10,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [479007113] [2025-03-03 19:42:10,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:42:10,251 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 [2025-03-03 19:42:10,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:42:10,253 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 19:42:10,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-03 19:42:10,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-03 19:42:10,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-03 19:42:10,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:42:10,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:42:10,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-03 19:42:10,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:42:12,811 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 477 proven. 27 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-03 19:42:12,811 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 19:42:13,796 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 36 proven. 27 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2025-03-03 19:42:13,796 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 19:42:13,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [479007113] [2025-03-03 19:42:13,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [479007113] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 19:42:13,797 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 19:42:13,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14 [2025-03-03 19:42:13,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296306467] [2025-03-03 19:42:13,797 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 19:42:13,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 19:42:13,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 19:42:13,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 19:42:13,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-03-03 19:42:13,798 INFO L87 Difference]: Start difference. First operand 64 states and 95 transitions. Second operand has 14 states, 14 states have (on average 5.071428571428571) internal successors, (71), 14 states have internal predecessors, (71), 4 states have call successors, (44), 3 states have call predecessors, (44), 5 states have return successors, (44), 4 states have call predecessors, (44), 4 states have call successors, (44) [2025-03-03 19:42:16,640 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 19:42:19,217 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 19:42:19,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:42:19,360 INFO L93 Difference]: Finished difference Result 249 states and 367 transitions. [2025-03-03 19:42:19,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 19:42:19,361 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.071428571428571) internal successors, (71), 14 states have internal predecessors, (71), 4 states have call successors, (44), 3 states have call predecessors, (44), 5 states have return successors, (44), 4 states have call predecessors, (44), 4 states have call successors, (44) Word has length 143 [2025-03-03 19:42:19,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:42:19,364 INFO L225 Difference]: With dead ends: 249 [2025-03-03 19:42:19,364 INFO L226 Difference]: Without dead ends: 188 [2025-03-03 19:42:19,365 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 273 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=182, Invalid=418, Unknown=0, NotChecked=0, Total=600 [2025-03-03 19:42:19,365 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 322 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2025-03-03 19:42:19,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 503 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2025-03-03 19:42:19,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-03-03 19:42:19,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 152. [2025-03-03 19:42:19,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 92 states have (on average 1.2391304347826086) internal successors, (114), 93 states have internal predecessors, (114), 55 states have call successors, (55), 4 states have call predecessors, (55), 4 states have return successors, (55), 54 states have call predecessors, (55), 55 states have call successors, (55) [2025-03-03 19:42:19,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 224 transitions. [2025-03-03 19:42:19,390 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 224 transitions. Word has length 143 [2025-03-03 19:42:19,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:42:19,390 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 224 transitions. [2025-03-03 19:42:19,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.071428571428571) internal successors, (71), 14 states have internal predecessors, (71), 4 states have call successors, (44), 3 states have call predecessors, (44), 5 states have return successors, (44), 4 states have call predecessors, (44), 4 states have call successors, (44) [2025-03-03 19:42:19,391 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 224 transitions. [2025-03-03 19:42:19,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-03 19:42:19,392 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:42:19,392 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:42:19,406 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-03 19:42:19,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 19:42:19,594 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:42:19,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:42:19,594 INFO L85 PathProgramCache]: Analyzing trace with hash 2059241317, now seen corresponding path program 1 times [2025-03-03 19:42:19,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:42:19,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [404683] [2025-03-03 19:42:19,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:42:19,595 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 [2025-03-03 19:42:19,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:42:19,597 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 19:42:19,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-03 19:42:19,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-03 19:42:19,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-03 19:42:19,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:42:19,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:42:19,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-03 19:42:19,910 INFO L279 TraceCheckSpWp]: Computing forward predicates...