./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-70.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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_fillercodestructure_filler-pe-co_file-70.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 29f3b33aa76fbd79b42fdd0c3fff670150c31cac386cea2ae8894bfbaea7ba77 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 12:07:31,269 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 12:07:31,329 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 12:07:31,334 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 12:07:31,334 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 12:07:31,360 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 12:07:31,361 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 12:07:31,361 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 12:07:31,362 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 12:07:31,362 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 12:07:31,362 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 12:07:31,362 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 12:07:31,362 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 12:07:31,362 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 12:07:31,363 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 12:07:31,363 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 12:07:31,363 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 12:07:31,363 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 12:07:31,363 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 12:07:31,363 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 12:07:31,363 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 12:07:31,364 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 12:07:31,364 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 12:07:31,364 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 12:07:31,364 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 12:07:31,364 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 12:07:31,364 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 12:07:31,364 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 12:07:31,364 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 12:07:31,364 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 12:07:31,365 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 12:07:31,365 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 12:07:31,365 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 12:07:31,365 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 12:07:31,365 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 12:07:31,365 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 12:07:31,365 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 12:07:31,365 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 12:07:31,365 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 12:07:31,365 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 12:07:31,365 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 12:07:31,366 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 12:07:31,366 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 12:07:31,366 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 -> 29f3b33aa76fbd79b42fdd0c3fff670150c31cac386cea2ae8894bfbaea7ba77 [2025-03-08 12:07:31,744 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 12:07:31,753 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 12:07:31,754 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 12:07:31,756 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 12:07:31,756 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 12:07:31,758 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-70.i [2025-03-08 12:07:32,898 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a2ac54df/7cb99d5021614b5faf7bac68d56f4fa1/FLAG2413041dd [2025-03-08 12:07:33,112 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 12:07:33,115 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-70.i [2025-03-08 12:07:33,121 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a2ac54df/7cb99d5021614b5faf7bac68d56f4fa1/FLAG2413041dd [2025-03-08 12:07:33,136 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a2ac54df/7cb99d5021614b5faf7bac68d56f4fa1 [2025-03-08 12:07:33,138 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 12:07:33,140 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 12:07:33,141 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 12:07:33,142 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 12:07:33,145 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 12:07:33,146 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:07:33" (1/1) ... [2025-03-08 12:07:33,148 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49efd45b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:07:33, skipping insertion in model container [2025-03-08 12:07:33,148 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:07:33" (1/1) ... [2025-03-08 12:07:33,166 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 12:07:33,266 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_fillercodestructure_filler-pe-co_file-70.i[919,932] [2025-03-08 12:07:33,335 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 12:07:33,344 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 12:07:33,354 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_fillercodestructure_filler-pe-co_file-70.i[919,932] [2025-03-08 12:07:33,382 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 12:07:33,398 INFO L204 MainTranslator]: Completed translation [2025-03-08 12:07:33,398 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:07:33 WrapperNode [2025-03-08 12:07:33,399 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 12:07:33,399 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 12:07:33,399 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 12:07:33,399 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 12:07:33,405 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:07:33" (1/1) ... [2025-03-08 12:07:33,413 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:07:33" (1/1) ... [2025-03-08 12:07:33,437 INFO L138 Inliner]: procedures = 26, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 201 [2025-03-08 12:07:33,438 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 12:07:33,438 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 12:07:33,439 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 12:07:33,439 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 12:07:33,446 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:07:33" (1/1) ... [2025-03-08 12:07:33,446 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:07:33" (1/1) ... [2025-03-08 12:07:33,449 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:07:33" (1/1) ... [2025-03-08 12:07:33,469 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-08 12:07:33,469 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:07:33" (1/1) ... [2025-03-08 12:07:33,469 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:07:33" (1/1) ... [2025-03-08 12:07:33,483 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:07:33" (1/1) ... [2025-03-08 12:07:33,484 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:07:33" (1/1) ... [2025-03-08 12:07:33,490 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:07:33" (1/1) ... [2025-03-08 12:07:33,492 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:07:33" (1/1) ... [2025-03-08 12:07:33,497 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 12:07:33,498 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 12:07:33,498 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 12:07:33,498 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 12:07:33,500 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:07:33" (1/1) ... [2025-03-08 12:07:33,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 12:07:33,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:07:33,522 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-08 12:07:33,526 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-08 12:07:33,538 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 12:07:33,539 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 12:07:33,539 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 12:07:33,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 12:07:33,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 12:07:33,539 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 12:07:33,595 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 12:07:33,596 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 12:07:33,957 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-08 12:07:33,957 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 12:07:33,979 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 12:07:33,981 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 12:07:33,981 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:07:33 BoogieIcfgContainer [2025-03-08 12:07:33,981 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 12:07:33,983 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 12:07:33,983 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 12:07:33,986 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 12:07:33,987 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:07:33" (1/3) ... [2025-03-08 12:07:33,988 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b16244d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:07:33, skipping insertion in model container [2025-03-08 12:07:33,988 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:07:33" (2/3) ... [2025-03-08 12:07:33,988 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b16244d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:07:33, skipping insertion in model container [2025-03-08 12:07:33,989 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:07:33" (3/3) ... [2025-03-08 12:07:33,990 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-70.i [2025-03-08 12:07:33,999 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 12:07:34,001 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-70.i that has 2 procedures, 85 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 12:07:34,045 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 12:07:34,055 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;@26ef262e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 12:07:34,056 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 12:07:34,059 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 57 states have (on average 1.456140350877193) internal successors, (83), 58 states have internal predecessors, (83), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-08 12:07:34,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-08 12:07:34,072 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:07:34,073 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 12:07:34,073 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:07:34,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:07:34,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1714598811, now seen corresponding path program 1 times [2025-03-08 12:07:34,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:07:34,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903582483] [2025-03-08 12:07:34,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:07:34,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:07:34,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-08 12:07:34,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-08 12:07:34,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:07:34,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:07:34,352 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 1152 trivial. 0 not checked. [2025-03-08 12:07:34,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:07:34,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903582483] [2025-03-08 12:07:34,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903582483] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 12:07:34,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [214584234] [2025-03-08 12:07:34,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:07:34,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:07:34,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:07:34,358 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-08 12:07:34,361 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-08 12:07:34,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-08 12:07:34,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-08 12:07:34,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:07:34,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:07:34,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 12:07:34,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:07:34,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 1152 trivial. 0 not checked. [2025-03-08 12:07:34,559 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 12:07:34,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [214584234] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:07:34,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 12:07:34,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 12:07:34,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555691861] [2025-03-08 12:07:34,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:07:34,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 12:07:34,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:07:34,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 12:07:34,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 12:07:34,581 INFO L87 Difference]: Start difference. First operand has 85 states, 57 states have (on average 1.456140350877193) internal successors, (83), 58 states have internal predecessors, (83), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-08 12:07:34,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:07:34,601 INFO L93 Difference]: Finished difference Result 164 states and 286 transitions. [2025-03-08 12:07:34,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 12:07:34,603 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 164 [2025-03-08 12:07:34,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:07:34,607 INFO L225 Difference]: With dead ends: 164 [2025-03-08 12:07:34,607 INFO L226 Difference]: Without dead ends: 82 [2025-03-08 12:07:34,609 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 165 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-08 12:07:34,611 INFO L435 NwaCegarLoop]: 124 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, 124 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-08 12:07:34,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 12:07:34,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-08 12:07:34,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-03-08 12:07:34,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 55 states have (on average 1.3818181818181818) internal successors, (76), 55 states have internal predecessors, (76), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-08 12:07:34,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 126 transitions. [2025-03-08 12:07:34,644 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 126 transitions. Word has length 164 [2025-03-08 12:07:34,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:07:34,644 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 126 transitions. [2025-03-08 12:07:34,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-08 12:07:34,645 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 126 transitions. [2025-03-08 12:07:34,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-08 12:07:34,647 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:07:34,647 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 12:07:34,654 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 12:07:34,848 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-08 12:07:34,848 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:07:34,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:07:34,849 INFO L85 PathProgramCache]: Analyzing trace with hash 582422685, now seen corresponding path program 1 times [2025-03-08 12:07:34,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:07:34,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502296982] [2025-03-08 12:07:34,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:07:34,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:07:34,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-08 12:07:34,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-08 12:07:34,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:07:34,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:07:35,079 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-08 12:07:35,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:07:35,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502296982] [2025-03-08 12:07:35,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502296982] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:07:35,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:07:35,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 12:07:35,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675818014] [2025-03-08 12:07:35,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:07:35,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 12:07:35,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:07:35,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 12:07:35,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:07:35,082 INFO L87 Difference]: Start difference. First operand 82 states and 126 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-08 12:07:35,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:07:35,164 INFO L93 Difference]: Finished difference Result 230 states and 354 transitions. [2025-03-08 12:07:35,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 12:07:35,164 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 164 [2025-03-08 12:07:35,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:07:35,166 INFO L225 Difference]: With dead ends: 230 [2025-03-08 12:07:35,166 INFO L226 Difference]: Without dead ends: 151 [2025-03-08 12:07:35,167 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:07:35,167 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 112 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 12:07:35,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 307 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 12:07:35,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-03-08 12:07:35,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 149. [2025-03-08 12:07:35,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 96 states have (on average 1.3333333333333333) internal successors, (128), 96 states have internal predecessors, (128), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-08 12:07:35,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 228 transitions. [2025-03-08 12:07:35,186 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 228 transitions. Word has length 164 [2025-03-08 12:07:35,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:07:35,187 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 228 transitions. [2025-03-08 12:07:35,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-08 12:07:35,187 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 228 transitions. [2025-03-08 12:07:35,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-08 12:07:35,188 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:07:35,188 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 12:07:35,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 12:07:35,189 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:07:35,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:07:35,189 INFO L85 PathProgramCache]: Analyzing trace with hash 289019678, now seen corresponding path program 1 times [2025-03-08 12:07:35,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:07:35,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052887943] [2025-03-08 12:07:35,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:07:35,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:07:35,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-08 12:07:35,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-08 12:07:35,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:07:35,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:07:35,671 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-08 12:07:35,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:07:35,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052887943] [2025-03-08 12:07:35,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052887943] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:07:35,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:07:35,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 12:07:35,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172124134] [2025-03-08 12:07:35,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:07:35,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 12:07:35,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:07:35,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 12:07:35,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 12:07:35,674 INFO L87 Difference]: Start difference. First operand 149 states and 228 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-08 12:07:35,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:07:35,772 INFO L93 Difference]: Finished difference Result 408 states and 614 transitions. [2025-03-08 12:07:35,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 12:07:35,773 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 164 [2025-03-08 12:07:35,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:07:35,775 INFO L225 Difference]: With dead ends: 408 [2025-03-08 12:07:35,775 INFO L226 Difference]: Without dead ends: 262 [2025-03-08 12:07:35,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 12:07:35,776 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 142 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 12:07:35,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 298 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 12:07:35,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2025-03-08 12:07:35,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 221. [2025-03-08 12:07:35,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 160 states have (on average 1.3875) internal successors, (222), 162 states have internal predecessors, (222), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-08 12:07:35,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 334 transitions. [2025-03-08 12:07:35,810 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 334 transitions. Word has length 164 [2025-03-08 12:07:35,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:07:35,811 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 334 transitions. [2025-03-08 12:07:35,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-08 12:07:35,811 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 334 transitions. [2025-03-08 12:07:35,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-08 12:07:35,813 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:07:35,813 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 12:07:35,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 12:07:35,813 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:07:35,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:07:35,814 INFO L85 PathProgramCache]: Analyzing trace with hash -216538947, now seen corresponding path program 1 times [2025-03-08 12:07:35,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:07:35,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598675391] [2025-03-08 12:07:35,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:07:35,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:07:35,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-08 12:07:35,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-08 12:07:35,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:07:35,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:07:36,694 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 33 proven. 39 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2025-03-08 12:07:36,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:07:36,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598675391] [2025-03-08 12:07:36,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598675391] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 12:07:36,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1711701086] [2025-03-08 12:07:36,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:07:36,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:07:36,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:07:36,696 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-08 12:07:36,698 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-08 12:07:36,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-08 12:07:36,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-08 12:07:36,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:07:36,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:07:36,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-08 12:07:36,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:07:38,262 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 633 proven. 72 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2025-03-08 12:07:38,262 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 12:07:39,590 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 66 proven. 75 refuted. 0 times theorem prover too weak. 1059 trivial. 0 not checked. [2025-03-08 12:07:39,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1711701086] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 12:07:39,590 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 12:07:39,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 12] total 27 [2025-03-08 12:07:39,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641900854] [2025-03-08 12:07:39,590 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 12:07:39,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-08 12:07:39,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:07:39,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-08 12:07:39,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=565, Unknown=0, NotChecked=0, Total=702 [2025-03-08 12:07:39,593 INFO L87 Difference]: Start difference. First operand 221 states and 334 transitions. Second operand has 27 states, 26 states have (on average 3.8846153846153846) internal successors, (101), 25 states have internal predecessors, (101), 7 states have call successors, (75), 4 states have call predecessors, (75), 8 states have return successors, (75), 7 states have call predecessors, (75), 7 states have call successors, (75) [2025-03-08 12:07:44,479 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 12:07:50,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:07:50,953 INFO L93 Difference]: Finished difference Result 1332 states and 1945 transitions. [2025-03-08 12:07:50,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2025-03-08 12:07:50,954 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 3.8846153846153846) internal successors, (101), 25 states have internal predecessors, (101), 7 states have call successors, (75), 4 states have call predecessors, (75), 8 states have return successors, (75), 7 states have call predecessors, (75), 7 states have call successors, (75) Word has length 164 [2025-03-08 12:07:50,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:07:50,963 INFO L225 Difference]: With dead ends: 1332 [2025-03-08 12:07:50,963 INFO L226 Difference]: Without dead ends: 1114 [2025-03-08 12:07:50,966 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3131 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1835, Invalid=7477, Unknown=0, NotChecked=0, Total=9312 [2025-03-08 12:07:50,966 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 1639 mSDsluCounter, 958 mSDsCounter, 0 mSdLazyCounter, 2162 mSolverCounterSat, 1210 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1641 SdHoareTripleChecker+Valid, 1074 SdHoareTripleChecker+Invalid, 3373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1210 IncrementalHoareTripleChecker+Valid, 2162 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2025-03-08 12:07:50,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1641 Valid, 1074 Invalid, 3373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1210 Valid, 2162 Invalid, 1 Unknown, 0 Unchecked, 7.2s Time] [2025-03-08 12:07:50,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1114 states. [2025-03-08 12:07:51,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1114 to 699. [2025-03-08 12:07:51,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 491 states have (on average 1.3421588594704685) internal successors, (659), 498 states have internal predecessors, (659), 185 states have call successors, (185), 22 states have call predecessors, (185), 22 states have return successors, (185), 178 states have call predecessors, (185), 185 states have call successors, (185) [2025-03-08 12:07:51,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 1029 transitions. [2025-03-08 12:07:51,102 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 1029 transitions. Word has length 164 [2025-03-08 12:07:51,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:07:51,103 INFO L471 AbstractCegarLoop]: Abstraction has 699 states and 1029 transitions. [2025-03-08 12:07:51,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 3.8846153846153846) internal successors, (101), 25 states have internal predecessors, (101), 7 states have call successors, (75), 4 states have call predecessors, (75), 8 states have return successors, (75), 7 states have call predecessors, (75), 7 states have call successors, (75) [2025-03-08 12:07:51,103 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 1029 transitions. [2025-03-08 12:07:51,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-08 12:07:51,105 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:07:51,105 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 12:07:51,112 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-08 12:07:51,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-08 12:07:51,309 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:07:51,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:07:51,310 INFO L85 PathProgramCache]: Analyzing trace with hash 952099616, now seen corresponding path program 1 times [2025-03-08 12:07:51,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:07:51,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347614793] [2025-03-08 12:07:51,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:07:51,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:07:51,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-08 12:07:51,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-08 12:07:51,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:07:51,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:07:51,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 9 proven. 63 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2025-03-08 12:07:51,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:07:51,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347614793] [2025-03-08 12:07:51,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347614793] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 12:07:51,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [270150020] [2025-03-08 12:07:51,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:07:51,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:07:51,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:07:51,555 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-08 12:07:51,557 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-08 12:07:51,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-08 12:07:51,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-08 12:07:51,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:07:51,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:07:51,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 12:07:51,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:07:51,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 282 proven. 63 refuted. 0 times theorem prover too weak. 855 trivial. 0 not checked. [2025-03-08 12:07:51,870 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 12:07:52,063 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 9 proven. 63 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2025-03-08 12:07:52,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [270150020] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 12:07:52,063 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 12:07:52,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-08 12:07:52,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687860375] [2025-03-08 12:07:52,063 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 12:07:52,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 12:07:52,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:07:52,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 12:07:52,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 12:07:52,064 INFO L87 Difference]: Start difference. First operand 699 states and 1029 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2025-03-08 12:07:52,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:07:52,267 INFO L93 Difference]: Finished difference Result 1004 states and 1456 transitions. [2025-03-08 12:07:52,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 12:07:52,268 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) Word has length 164 [2025-03-08 12:07:52,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:07:52,271 INFO L225 Difference]: With dead ends: 1004 [2025-03-08 12:07:52,272 INFO L226 Difference]: Without dead ends: 430 [2025-03-08 12:07:52,273 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 325 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-03-08 12:07:52,273 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 120 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 12:07:52,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 226 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 12:07:52,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2025-03-08 12:07:52,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 388. [2025-03-08 12:07:52,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 255 states have (on average 1.2431372549019608) internal successors, (317), 256 states have internal predecessors, (317), 112 states have call successors, (112), 20 states have call predecessors, (112), 20 states have return successors, (112), 111 states have call predecessors, (112), 112 states have call successors, (112) [2025-03-08 12:07:52,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 541 transitions. [2025-03-08 12:07:52,346 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 541 transitions. Word has length 164 [2025-03-08 12:07:52,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:07:52,346 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 541 transitions. [2025-03-08 12:07:52,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2025-03-08 12:07:52,347 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 541 transitions. [2025-03-08 12:07:52,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 12:07:52,348 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:07:52,348 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 12:07:52,356 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-08 12:07:52,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:07:52,549 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:07:52,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:07:52,550 INFO L85 PathProgramCache]: Analyzing trace with hash -413218699, now seen corresponding path program 1 times [2025-03-08 12:07:52,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:07:52,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411906142] [2025-03-08 12:07:52,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:07:52,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:07:52,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 12:07:52,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 12:07:52,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:07:52,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:07:52,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-08 12:07:52,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:07:52,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411906142] [2025-03-08 12:07:52,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411906142] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:07:52,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:07:52,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 12:07:52,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546314371] [2025-03-08 12:07:52,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:07:52,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 12:07:52,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:07:52,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 12:07:52,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 12:07:52,796 INFO L87 Difference]: Start difference. First operand 388 states and 541 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-08 12:07:52,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:07:52,986 INFO L93 Difference]: Finished difference Result 578 states and 815 transitions. [2025-03-08 12:07:52,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 12:07:52,987 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 165 [2025-03-08 12:07:52,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:07:52,989 INFO L225 Difference]: With dead ends: 578 [2025-03-08 12:07:52,989 INFO L226 Difference]: Without dead ends: 416 [2025-03-08 12:07:52,991 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 12:07:52,993 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 103 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 12:07:52,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 357 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 12:07:52,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2025-03-08 12:07:53,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 388. [2025-03-08 12:07:53,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 255 states have (on average 1.223529411764706) internal successors, (312), 256 states have internal predecessors, (312), 112 states have call successors, (112), 20 states have call predecessors, (112), 20 states have return successors, (112), 111 states have call predecessors, (112), 112 states have call successors, (112) [2025-03-08 12:07:53,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 536 transitions. [2025-03-08 12:07:53,051 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 536 transitions. Word has length 165 [2025-03-08 12:07:53,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:07:53,051 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 536 transitions. [2025-03-08 12:07:53,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-08 12:07:53,052 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 536 transitions. [2025-03-08 12:07:53,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 12:07:53,053 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:07:53,053 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 12:07:53,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 12:07:53,053 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:07:53,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:07:53,053 INFO L85 PathProgramCache]: Analyzing trace with hash 397084650, now seen corresponding path program 1 times [2025-03-08 12:07:53,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:07:53,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032804094] [2025-03-08 12:07:53,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:07:53,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:07:53,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 12:07:53,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 12:07:53,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:07:53,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:07:53,368 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-08 12:07:53,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:07:53,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032804094] [2025-03-08 12:07:53,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032804094] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:07:53,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:07:53,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 12:07:53,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349295973] [2025-03-08 12:07:53,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:07:53,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 12:07:53,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:07:53,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 12:07:53,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 12:07:53,370 INFO L87 Difference]: Start difference. First operand 388 states and 536 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-08 12:07:54,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:07:54,037 INFO L93 Difference]: Finished difference Result 748 states and 1028 transitions. [2025-03-08 12:07:54,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 12:07:54,038 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 165 [2025-03-08 12:07:54,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:07:54,041 INFO L225 Difference]: With dead ends: 748 [2025-03-08 12:07:54,041 INFO L226 Difference]: Without dead ends: 524 [2025-03-08 12:07:54,042 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-08 12:07:54,042 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 410 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 12:07:54,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 369 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 12:07:54,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2025-03-08 12:07:54,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 406. [2025-03-08 12:07:54,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 273 states have (on average 1.249084249084249) internal successors, (341), 274 states have internal predecessors, (341), 112 states have call successors, (112), 20 states have call predecessors, (112), 20 states have return successors, (112), 111 states have call predecessors, (112), 112 states have call successors, (112) [2025-03-08 12:07:54,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 565 transitions. [2025-03-08 12:07:54,106 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 565 transitions. Word has length 165 [2025-03-08 12:07:54,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:07:54,107 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 565 transitions. [2025-03-08 12:07:54,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-08 12:07:54,107 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 565 transitions. [2025-03-08 12:07:54,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 12:07:54,109 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:07:54,109 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 12:07:54,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 12:07:54,110 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:07:54,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:07:54,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1284588331, now seen corresponding path program 1 times [2025-03-08 12:07:54,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:07:54,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261152902] [2025-03-08 12:07:54,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:07:54,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:07:54,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 12:07:54,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 12:07:54,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:07:54,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 12:07:54,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2145951421] [2025-03-08 12:07:54,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:07:54,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:07:54,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:07:54,211 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 12:07:54,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 12:07:54,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 12:07:54,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 12:07:54,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:07:54,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 12:07:54,342 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 12:07:54,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 12:07:54,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 12:07:54,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:07:54,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 12:07:54,492 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 12:07:54,493 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 12:07:54,497 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 12:07:54,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 12:07:54,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:07:54,701 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:07:54,785 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 12:07:54,787 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 12:07:54 BoogieIcfgContainer [2025-03-08 12:07:54,788 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 12:07:54,788 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 12:07:54,788 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 12:07:54,788 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 12:07:54,789 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:07:33" (3/4) ... [2025-03-08 12:07:54,791 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 12:07:54,791 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 12:07:54,792 INFO L158 Benchmark]: Toolchain (without parser) took 21652.37ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 112.7MB in the beginning and 226.1MB in the end (delta: -113.5MB). Peak memory consumption was 58.5MB. Max. memory is 16.1GB. [2025-03-08 12:07:54,792 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory was 127.0MB in the beginning and 126.7MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 12:07:54,793 INFO L158 Benchmark]: CACSL2BoogieTranslator took 257.45ms. Allocated memory is still 142.6MB. Free memory was 112.2MB in the beginning and 97.0MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 12:07:54,793 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.74ms. Allocated memory is still 142.6MB. Free memory was 97.0MB in the beginning and 92.5MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 12:07:54,793 INFO L158 Benchmark]: Boogie Preprocessor took 58.79ms. Allocated memory is still 142.6MB. Free memory was 92.5MB in the beginning and 86.9MB in the end (delta: 5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 12:07:54,794 INFO L158 Benchmark]: IcfgBuilder took 483.50ms. Allocated memory is still 142.6MB. Free memory was 86.9MB in the beginning and 58.2MB in the end (delta: 28.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 12:07:54,794 INFO L158 Benchmark]: TraceAbstraction took 20804.81ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 57.7MB in the beginning and 226.2MB in the end (delta: -168.5MB). Peak memory consumption was 8.2MB. Max. memory is 16.1GB. [2025-03-08 12:07:54,794 INFO L158 Benchmark]: Witness Printer took 3.19ms. Allocated memory is still 318.8MB. Free memory was 226.2MB in the beginning and 226.1MB in the end (delta: 97.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 12:07:54,795 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.22ms. Allocated memory is still 201.3MB. Free memory was 127.0MB in the beginning and 126.7MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 257.45ms. Allocated memory is still 142.6MB. Free memory was 112.2MB in the beginning and 97.0MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.74ms. Allocated memory is still 142.6MB. Free memory was 97.0MB in the beginning and 92.5MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 58.79ms. Allocated memory is still 142.6MB. Free memory was 92.5MB in the beginning and 86.9MB in the end (delta: 5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 483.50ms. Allocated memory is still 142.6MB. Free memory was 86.9MB in the beginning and 58.2MB in the end (delta: 28.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 20804.81ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 57.7MB in the beginning and 226.2MB in the end (delta: -168.5MB). Peak memory consumption was 8.2MB. Max. memory is 16.1GB. * Witness Printer took 3.19ms. Allocated memory is still 318.8MB. Free memory was 226.2MB in the beginning and 226.1MB in the end (delta: 97.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 158, overapproximation of someBinaryDOUBLEComparisonOperation at line 65, overapproximation of someBinaryDOUBLEComparisonOperation at line 111, overapproximation of someBinaryDOUBLEComparisonOperation at line 179, overapproximation of someBinaryDOUBLEComparisonOperation at line 133, overapproximation of someBinaryDOUBLEComparisonOperation at line 131, overapproximation of someBinaryDOUBLEComparisonOperation at line 135, overapproximation of someBinaryDOUBLEComparisonOperation at line 160. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 5.05; [L23] double var_1_6 = 0.0; [L24] double var_1_7 = 49.5; [L25] double var_1_8 = 16.75; [L26] unsigned short int var_1_9 = 1; [L27] unsigned long int var_1_11 = 8; [L28] unsigned char var_1_12 = 0; [L29] unsigned char var_1_13 = 1; [L30] unsigned char var_1_14 = 32; [L31] unsigned char var_1_15 = 50; [L32] unsigned char var_1_16 = 8; [L33] unsigned char var_1_17 = 32; [L34] unsigned long int var_1_18 = 2; [L35] unsigned long int var_1_19 = 3876014737; [L36] unsigned char var_1_20 = 0; [L37] unsigned short int var_1_21 = 25; [L38] unsigned char var_1_27 = 1; [L39] unsigned char var_1_30 = 1; [L40] unsigned char var_1_31 = 1; [L41] unsigned char var_1_32 = 0; [L42] unsigned long int var_1_33 = 2; [L43] unsigned short int var_1_34 = 0; [L44] signed short int var_1_35 = -10; [L45] double var_1_36 = 128.5; [L46] double var_1_37 = 128.25; [L47] unsigned char var_1_40 = 2; [L48] unsigned char var_1_41 = 25; [L49] unsigned short int var_1_42 = 8; [L50] unsigned long int var_1_43 = 3563499258; [L51] unsigned long int var_1_44 = 1249494912; [L52] double last_1_var_1_1 = 5.05; [L53] unsigned short int last_1_var_1_9 = 1; [L54] unsigned long int last_1_var_1_11 = 8; [L55] unsigned char last_1_var_1_14 = 32; [L56] unsigned char last_1_var_1_20 = 0; VAL [isInitial=0, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_6=0, var_1_7=99/2, var_1_8=67/4, var_1_9=1] [L183] isInitial = 1 [L184] FCALL initially() [L185] COND TRUE 1 [L186] CALL updateLastVariables() [L172] last_1_var_1_1 = var_1_1 [L173] last_1_var_1_9 = var_1_9 [L174] last_1_var_1_11 = var_1_11 [L175] last_1_var_1_14 = var_1_14 [L176] last_1_var_1_20 = var_1_20 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_6=0, var_1_7=99/2, var_1_8=67/4, var_1_9=1] [L186] RET updateLastVariables() [L187] CALL updateVariables() [L130] var_1_6 = __VERIFIER_nondet_double() [L131] CALL assume_abort_if_not((var_1_6 >= 2305843.009213691390e+12F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_7=99/2, var_1_8=67/4, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_7=99/2, var_1_8=67/4, var_1_9=1] [L131] RET assume_abort_if_not((var_1_6 >= 2305843.009213691390e+12F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_7=99/2, var_1_8=67/4, var_1_9=1] [L132] var_1_7 = __VERIFIER_nondet_double() [L133] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 2305843.009213691390e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_8=67/4, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_8=67/4, var_1_9=1] [L133] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 2305843.009213691390e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_8=67/4, var_1_9=1] [L134] var_1_8 = __VERIFIER_nondet_double() [L135] CALL assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L135] RET assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L136] var_1_13 = __VERIFIER_nondet_uchar() [L137] CALL assume_abort_if_not(var_1_13 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L137] RET assume_abort_if_not(var_1_13 >= 1) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L138] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L138] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L139] var_1_15 = __VERIFIER_nondet_uchar() [L140] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L140] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L141] CALL assume_abort_if_not(var_1_15 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L141] RET assume_abort_if_not(var_1_15 <= 127) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L142] var_1_16 = __VERIFIER_nondet_uchar() [L143] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L143] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L144] CALL assume_abort_if_not(var_1_16 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L144] RET assume_abort_if_not(var_1_16 <= 127) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L145] var_1_17 = __VERIFIER_nondet_uchar() [L146] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L146] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L147] CALL assume_abort_if_not(var_1_17 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L147] RET assume_abort_if_not(var_1_17 <= 254) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L148] var_1_19 = __VERIFIER_nondet_ulong() [L149] CALL assume_abort_if_not(var_1_19 >= 3221225470) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=-8589934594, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=-8589934594, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L149] RET assume_abort_if_not(var_1_19 >= 3221225470) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=-8589934594, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L150] CALL assume_abort_if_not(var_1_19 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=-8589934594, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=-8589934594, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L150] RET assume_abort_if_not(var_1_19 <= 4294967294) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=-8589934594, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L151] var_1_30 = __VERIFIER_nondet_uchar() [L152] CALL assume_abort_if_not(var_1_30 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=-8589934594, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=-8589934594, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L152] RET assume_abort_if_not(var_1_30 >= 1) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=-8589934594, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L153] CALL assume_abort_if_not(var_1_30 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=-8589934594, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=-8589934594, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L153] RET assume_abort_if_not(var_1_30 <= 1) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=-8589934594, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L154] var_1_32 = __VERIFIER_nondet_uchar() [L155] CALL assume_abort_if_not(var_1_32 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=-8589934594, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=-8589934594, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L155] RET assume_abort_if_not(var_1_32 >= 1) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=-8589934594, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L156] CALL assume_abort_if_not(var_1_32 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=-8589934594, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=-8589934594, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L156] RET assume_abort_if_not(var_1_32 <= 1) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=-8589934594, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L157] var_1_36 = __VERIFIER_nondet_double() [L158] CALL assume_abort_if_not((var_1_36 >= 0.0F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 9223372.036854776000e+12F && var_1_36 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=-8589934594, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=-8589934594, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L158] RET assume_abort_if_not((var_1_36 >= 0.0F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 9223372.036854776000e+12F && var_1_36 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=-8589934594, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L159] var_1_37 = __VERIFIER_nondet_double() [L160] CALL assume_abort_if_not((var_1_37 >= 0.0F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 9223372.036854776000e+12F && var_1_37 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=-8589934594, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=-8589934594, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L160] RET assume_abort_if_not((var_1_37 >= 0.0F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 9223372.036854776000e+12F && var_1_37 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=-8589934594, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L161] var_1_41 = __VERIFIER_nondet_uchar() [L162] CALL assume_abort_if_not(var_1_41 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=-8589934594, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=-8589934594, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L162] RET assume_abort_if_not(var_1_41 >= 0) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=-8589934594, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L163] CALL assume_abort_if_not(var_1_41 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=-8589934594, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=-8589934594, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L163] RET assume_abort_if_not(var_1_41 <= 254) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=-8589934594, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L164] var_1_43 = __VERIFIER_nondet_ulong() [L165] CALL assume_abort_if_not(var_1_43 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=-8589934594, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=2147483647, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=-8589934594, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=2147483647, var_1_44=1249494912, var_1_9=1] [L165] RET assume_abort_if_not(var_1_43 >= 2147483647) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=-8589934594, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=2147483647, var_1_44=1249494912, var_1_9=1] [L166] CALL assume_abort_if_not(var_1_43 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=-8589934594, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=2147483647, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=-8589934594, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=2147483647, var_1_44=1249494912, var_1_9=1] [L166] RET assume_abort_if_not(var_1_43 <= 4294967295) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=-8589934594, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=2147483647, var_1_44=1249494912, var_1_9=1] [L167] var_1_44 = __VERIFIER_nondet_ulong() [L168] CALL assume_abort_if_not(var_1_44 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=-8589934594, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=2147483647, var_1_44=1073741823, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=-8589934594, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=2147483647, var_1_44=1073741823, var_1_9=1] [L168] RET assume_abort_if_not(var_1_44 >= 1073741823) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=-8589934594, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=2147483647, var_1_44=1073741823, var_1_9=1] [L169] CALL assume_abort_if_not(var_1_44 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=-8589934594, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=2147483647, var_1_44=1073741823, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=-8589934594, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=2147483647, var_1_44=1073741823, var_1_9=1] [L169] RET assume_abort_if_not(var_1_44 <= 2147483647) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=-8589934594, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=2147483647, var_1_44=1073741823, var_1_9=1] [L187] RET updateVariables() [L188] CALL step() [L60] COND TRUE \read(var_1_13) [L61] var_1_18 = ((var_1_19 - last_1_var_1_9) - last_1_var_1_11) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=-8589934603, var_1_19=-8589934594, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=2147483647, var_1_44=1073741823, var_1_9=1] [L65] COND FALSE !(var_1_6 > ((((var_1_8) < (last_1_var_1_1)) ? (var_1_8) : (last_1_var_1_1)))) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=-8589934603, var_1_19=-8589934594, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=2147483647, var_1_44=1073741823, var_1_9=1] [L74] COND TRUE (8 - 64) <= (var_1_9 - var_1_9) [L75] var_1_14 = (((((var_1_15 + var_1_16)) < (var_1_17)) ? ((var_1_15 + var_1_16)) : (var_1_17))) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=-8589934603, var_1_19=-8589934594, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=2147483647, var_1_44=1073741823, var_1_9=1] [L79] signed long int stepLocal_0 = - ((((var_1_9) < (var_1_9)) ? (var_1_9) : (var_1_9))); VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, stepLocal_0=-1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=-8589934603, var_1_19=-8589934594, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=2147483647, var_1_44=1073741823, var_1_9=1] [L80] COND FALSE !(var_1_18 >= stepLocal_0) [L83] var_1_1 = var_1_7 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=-8589934603, var_1_19=-8589934594, var_1_1=2, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=2147483647, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L85] COND TRUE (var_1_14 / var_1_19) <= ((((var_1_18) < (var_1_14)) ? (var_1_18) : (var_1_14))) [L86] var_1_20 = var_1_13 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=-8589934603, var_1_19=-8589934594, var_1_1=2, var_1_20=1, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=2147483647, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L88] COND TRUE \read(var_1_20) [L89] var_1_12 = var_1_13 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=-8589934603, var_1_19=-8589934594, var_1_1=2, var_1_20=1, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=2147483647, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L91] var_1_11 = (var_1_9 + (((((var_1_18) < (var_1_9)) ? (var_1_18) : (var_1_9))) + 2u)) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=-8589934603, var_1_19=-8589934594, var_1_1=2, var_1_20=1, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=2147483647, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L92] COND FALSE !(((((var_1_9) < (var_1_18)) ? (var_1_9) : (var_1_18))) > var_1_9) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=-8589934603, var_1_19=-8589934594, var_1_1=2, var_1_20=1, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=2147483647, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L95] COND FALSE !((var_1_9 <= var_1_14) && var_1_20) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=-8589934603, var_1_19=-8589934594, var_1_1=2, var_1_20=1, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=2147483647, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L106] COND TRUE var_1_18 > (- var_1_18) [L107] var_1_31 = (var_1_30 && var_1_32) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=-8589934603, var_1_19=-8589934594, var_1_1=2, var_1_20=1, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=2147483647, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L109] var_1_33 = var_1_14 [L110] var_1_34 = (var_1_14 + 4) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=-8589934603, var_1_19=-8589934594, var_1_1=2, var_1_20=1, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=0, var_1_34=4, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=2147483647, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L111] COND TRUE ((var_1_36 - var_1_37) + var_1_1) == var_1_1 [L112] var_1_35 = var_1_9 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=-8589934603, var_1_19=-8589934594, var_1_1=2, var_1_20=1, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=0, var_1_34=4, var_1_35=1, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=2147483647, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L114] COND FALSE !(var_1_14 >= (~ var_1_18)) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=-8589934603, var_1_19=-8589934594, var_1_1=2, var_1_20=1, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=0, var_1_34=4, var_1_35=1, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=2147483647, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L117] COND TRUE \read(var_1_20) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=-8589934603, var_1_19=-8589934594, var_1_1=2, var_1_20=1, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=0, var_1_34=4, var_1_35=1, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=2147483647, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L118] COND FALSE !(var_1_11 < 1) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=-8589934603, var_1_19=-8589934594, var_1_1=2, var_1_20=1, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=0, var_1_34=4, var_1_35=1, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=2147483647, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L188] RET step() [L189] CALL, EXPR property() [L179-L180] return (((((((var_1_18 >= (- ((((var_1_9) < (var_1_9)) ? (var_1_9) : (var_1_9))))) ? (var_1_1 == ((double) (((var_1_6 - var_1_7) - ((((64.75) > (128.725)) ? (64.75) : (128.725)))) + var_1_8))) : (var_1_1 == ((double) var_1_7))) && ((var_1_6 > ((((var_1_8) < (last_1_var_1_1)) ? (var_1_8) : (last_1_var_1_1)))) ? ((! ((last_1_var_1_1 == var_1_7) && (last_1_var_1_20 || last_1_var_1_20))) ? ((! (var_1_6 <= var_1_7)) ? (var_1_9 == ((unsigned short int) ((((last_1_var_1_14) < (last_1_var_1_14)) ? (last_1_var_1_14) : (last_1_var_1_14))))) : 1) : (var_1_9 == ((unsigned short int) last_1_var_1_14))) : 1)) && (var_1_11 == ((unsigned long int) (var_1_9 + (((((var_1_18) < (var_1_9)) ? (var_1_18) : (var_1_9))) + 2u))))) && (var_1_20 ? (var_1_12 == ((unsigned char) var_1_13)) : 1)) && (((8 - 64) <= (var_1_9 - var_1_9)) ? (var_1_14 == ((unsigned char) (((((var_1_15 + var_1_16)) < (var_1_17)) ? ((var_1_15 + var_1_16)) : (var_1_17))))) : (var_1_14 == ((unsigned char) var_1_17)))) && (var_1_13 ? (var_1_18 == ((unsigned long int) ((var_1_19 - last_1_var_1_9) - last_1_var_1_11))) : (var_1_18 == ((unsigned long int) (((((var_1_19 - var_1_17)) > (var_1_15)) ? ((var_1_19 - var_1_17)) : (var_1_15))))))) && (((var_1_14 / var_1_19) <= ((((var_1_18) < (var_1_14)) ? (var_1_18) : (var_1_14)))) ? (var_1_20 == ((unsigned char) var_1_13)) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=-8589934603, var_1_19=-8589934594, var_1_1=2, var_1_20=1, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=0, var_1_34=4, var_1_35=1, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=2147483647, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L189] RET, EXPR property() [L189] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=-8589934603, var_1_19=-8589934594, var_1_1=2, var_1_20=1, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=0, var_1_34=4, var_1_35=1, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=2147483647, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=-8589934603, var_1_19=-8589934594, var_1_1=2, var_1_20=1, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=0, var_1_34=4, var_1_35=1, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=2147483647, var_1_44=1073741823, var_1_7=2, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 85 locations, 158 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 20.7s, OverallIterations: 8, TraceHistogramMax: 25, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 12.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 2531 SdHoareTripleChecker+Valid, 8.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2526 mSDsluCounter, 2755 SdHoareTripleChecker+Invalid, 7.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1780 mSDsCounter, 1512 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2722 IncrementalHoareTripleChecker+Invalid, 4235 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1512 mSolverCounterUnsat, 975 mSDtfsCounter, 2722 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 945 GetRequests, 829 SyntacticMatches, 1 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3132 ImplicationChecksByTransitivity, 4.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=699occurred in iteration=4, InterpolantAutomatonStates: 106, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 7 MinimizatonAttempts, 646 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 1972 NumberOfCodeBlocks, 1972 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1958 ConstructedInterpolants, 0 QuantifiedInterpolants, 8899 SizeOfPredicates, 7 NumberOfNonLiveVariables, 1187 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 12 InterpolantComputations, 5 PerfectInterpolantSequences, 13977/14400 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-08 12:07:54,872 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_fillercodestructure_filler-pe-co_file-70.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 29f3b33aa76fbd79b42fdd0c3fff670150c31cac386cea2ae8894bfbaea7ba77 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 12:07:56,671 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 12:07:56,754 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 12:07:56,759 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 12:07:56,762 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 12:07:56,785 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 12:07:56,787 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 12:07:56,787 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 12:07:56,787 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 12:07:56,787 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 12:07:56,787 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 12:07:56,788 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 12:07:56,788 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 12:07:56,788 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 12:07:56,788 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 12:07:56,789 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 12:07:56,789 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 12:07:56,789 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 12:07:56,789 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 12:07:56,792 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 12:07:56,793 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 12:07:56,793 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 12:07:56,793 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 12:07:56,793 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 12:07:56,793 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 12:07:56,793 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 12:07:56,793 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 12:07:56,793 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 12:07:56,793 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 12:07:56,793 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 12:07:56,793 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 12:07:56,793 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 12:07:56,793 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 12:07:56,793 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 12:07:56,793 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 12:07:56,793 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 12:07:56,793 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 12:07:56,793 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 12:07:56,793 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 12:07:56,794 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 12:07:56,794 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 12:07:56,794 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 12:07:56,794 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 12:07:56,794 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 12:07:56,794 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 12:07:56,794 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 -> 29f3b33aa76fbd79b42fdd0c3fff670150c31cac386cea2ae8894bfbaea7ba77 [2025-03-08 12:07:57,040 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 12:07:57,047 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 12:07:57,048 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 12:07:57,049 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 12:07:57,049 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 12:07:57,050 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-70.i [2025-03-08 12:07:58,203 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/145f0a30b/1c52321b384c4a8c93f7c3d69a7cf651/FLAG6174f9bb7 [2025-03-08 12:07:58,421 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 12:07:58,423 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-70.i [2025-03-08 12:07:58,431 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/145f0a30b/1c52321b384c4a8c93f7c3d69a7cf651/FLAG6174f9bb7 [2025-03-08 12:07:58,772 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/145f0a30b/1c52321b384c4a8c93f7c3d69a7cf651 [2025-03-08 12:07:58,774 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 12:07:58,775 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 12:07:58,776 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 12:07:58,776 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 12:07:58,779 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 12:07:58,779 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:07:58" (1/1) ... [2025-03-08 12:07:58,780 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64e8e615 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:07:58, skipping insertion in model container [2025-03-08 12:07:58,780 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:07:58" (1/1) ... [2025-03-08 12:07:58,796 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 12:07:58,897 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_fillercodestructure_filler-pe-co_file-70.i[919,932] [2025-03-08 12:07:58,951 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 12:07:58,962 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 12:07:58,969 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_fillercodestructure_filler-pe-co_file-70.i[919,932] [2025-03-08 12:07:58,991 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 12:07:59,008 INFO L204 MainTranslator]: Completed translation [2025-03-08 12:07:59,009 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:07:59 WrapperNode [2025-03-08 12:07:59,009 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 12:07:59,010 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 12:07:59,010 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 12:07:59,011 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 12:07:59,015 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:07:59" (1/1) ... [2025-03-08 12:07:59,024 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:07:59" (1/1) ... [2025-03-08 12:07:59,048 INFO L138 Inliner]: procedures = 27, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 183 [2025-03-08 12:07:59,048 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 12:07:59,049 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 12:07:59,049 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 12:07:59,049 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 12:07:59,056 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:07:59" (1/1) ... [2025-03-08 12:07:59,056 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:07:59" (1/1) ... [2025-03-08 12:07:59,059 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:07:59" (1/1) ... [2025-03-08 12:07:59,069 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-08 12:07:59,070 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:07:59" (1/1) ... [2025-03-08 12:07:59,070 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:07:59" (1/1) ... [2025-03-08 12:07:59,077 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:07:59" (1/1) ... [2025-03-08 12:07:59,077 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:07:59" (1/1) ... [2025-03-08 12:07:59,083 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:07:59" (1/1) ... [2025-03-08 12:07:59,088 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:07:59" (1/1) ... [2025-03-08 12:07:59,093 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 12:07:59,095 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 12:07:59,095 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 12:07:59,095 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 12:07:59,097 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:07:59" (1/1) ... [2025-03-08 12:07:59,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 12:07:59,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:07:59,123 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-08 12:07:59,128 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-08 12:07:59,147 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 12:07:59,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 12:07:59,147 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 12:07:59,147 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 12:07:59,148 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 12:07:59,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 12:07:59,216 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 12:07:59,218 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 12:08:09,222 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-08 12:08:09,222 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 12:08:09,231 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 12:08:09,231 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 12:08:09,231 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:08:09 BoogieIcfgContainer [2025-03-08 12:08:09,232 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 12:08:09,233 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 12:08:09,233 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 12:08:09,237 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 12:08:09,237 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:07:58" (1/3) ... [2025-03-08 12:08:09,237 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70a6d91a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:08:09, skipping insertion in model container [2025-03-08 12:08:09,237 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:07:59" (2/3) ... [2025-03-08 12:08:09,237 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70a6d91a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:08:09, skipping insertion in model container [2025-03-08 12:08:09,237 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:08:09" (3/3) ... [2025-03-08 12:08:09,238 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-70.i [2025-03-08 12:08:09,248 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 12:08:09,249 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-70.i that has 2 procedures, 79 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 12:08:09,284 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 12:08:09,292 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;@6c871120, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 12:08:09,292 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 12:08:09,295 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 51 states have (on average 1.4313725490196079) internal successors, (73), 52 states have internal predecessors, (73), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-08 12:08:09,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-08 12:08:09,307 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:08:09,308 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 12:08:09,308 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:08:09,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:08:09,313 INFO L85 PathProgramCache]: Analyzing trace with hash 223692136, now seen corresponding path program 1 times [2025-03-08 12:08:09,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 12:08:09,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [680204202] [2025-03-08 12:08:09,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:08:09,322 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-08 12:08:09,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 12:08:09,324 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-08 12:08:09,325 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-08 12:08:09,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-08 12:08:09,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-08 12:08:09,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:08:09,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:08:09,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 12:08:09,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:08:09,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 368 proven. 0 refuted. 0 times theorem prover too weak. 832 trivial. 0 not checked. [2025-03-08 12:08:09,816 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 12:08:09,816 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 12:08:09,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [680204202] [2025-03-08 12:08:09,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [680204202] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:08:09,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:08:09,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 12:08:09,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731542831] [2025-03-08 12:08:09,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:08:09,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 12:08:09,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 12:08:09,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 12:08:09,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 12:08:09,834 INFO L87 Difference]: Start difference. First operand has 79 states, 51 states have (on average 1.4313725490196079) internal successors, (73), 52 states have internal predecessors, (73), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-08 12:08:09,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:08:09,852 INFO L93 Difference]: Finished difference Result 151 states and 264 transitions. [2025-03-08 12:08:09,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 12:08:09,853 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 164 [2025-03-08 12:08:09,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:08:09,861 INFO L225 Difference]: With dead ends: 151 [2025-03-08 12:08:09,861 INFO L226 Difference]: Without dead ends: 75 [2025-03-08 12:08:09,865 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 163 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-08 12:08:09,867 INFO L435 NwaCegarLoop]: 113 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, 113 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-08 12:08:09,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 12:08:09,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-08 12:08:09,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2025-03-08 12:08:09,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 48 states have (on average 1.3125) internal successors, (63), 48 states have internal predecessors, (63), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-08 12:08:09,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 113 transitions. [2025-03-08 12:08:09,909 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 113 transitions. Word has length 164 [2025-03-08 12:08:09,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:08:09,909 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 113 transitions. [2025-03-08 12:08:09,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-08 12:08:09,910 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 113 transitions. [2025-03-08 12:08:09,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-08 12:08:09,914 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:08:09,914 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 12:08:09,930 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2025-03-08 12:08:10,115 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-08 12:08:10,115 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:08:10,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:08:10,116 INFO L85 PathProgramCache]: Analyzing trace with hash 888467369, now seen corresponding path program 1 times [2025-03-08 12:08:10,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 12:08:10,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [416556464] [2025-03-08 12:08:10,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:08:10,117 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-08 12:08:10,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 12:08:10,119 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-08 12:08:10,119 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-08 12:08:10,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-08 12:08:10,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-08 12:08:10,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:08:10,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:08:10,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 12:08:10,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:08:13,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 618 proven. 39 refuted. 0 times theorem prover too weak. 543 trivial. 0 not checked. [2025-03-08 12:08:13,833 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 12:08:14,412 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 12:08:14,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [416556464] [2025-03-08 12:08:14,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [416556464] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 12:08:14,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [52047028] [2025-03-08 12:08:14,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:08:14,412 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-08 12:08:14,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-08 12:08:14,436 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-08 12:08:14,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2025-03-08 12:08:14,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-08 12:08:14,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-08 12:08:14,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:08:14,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:08:14,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 12:08:14,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:08:14,840 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-08 12:08:14,840 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 12:08:14,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [52047028] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:08:14,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 12:08:14,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2025-03-08 12:08:14,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043879507] [2025-03-08 12:08:14,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:08:14,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 12:08:14,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 12:08:14,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 12:08:14,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-03-08 12:08:14,842 INFO L87 Difference]: Start difference. First operand 75 states and 113 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-08 12:08:18,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.71s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 12:08:18,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:08:18,698 INFO L93 Difference]: Finished difference Result 216 states and 328 transitions. [2025-03-08 12:08:18,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 12:08:18,699 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 164 [2025-03-08 12:08:18,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:08:18,702 INFO L225 Difference]: With dead ends: 216 [2025-03-08 12:08:18,702 INFO L226 Difference]: Without dead ends: 144 [2025-03-08 12:08:18,702 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 407 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-03-08 12:08:18,703 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 99 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2025-03-08 12:08:18,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 296 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2025-03-08 12:08:18,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-03-08 12:08:18,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 142. [2025-03-08 12:08:18,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 89 states have (on average 1.2921348314606742) internal successors, (115), 89 states have internal predecessors, (115), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-08 12:08:18,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 215 transitions. [2025-03-08 12:08:18,720 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 215 transitions. Word has length 164 [2025-03-08 12:08:18,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:08:18,721 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 215 transitions. [2025-03-08 12:08:18,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-08 12:08:18,721 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 215 transitions. [2025-03-08 12:08:18,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-08 12:08:18,722 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:08:18,722 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 12:08:18,727 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2025-03-08 12:08:18,938 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-08 12:08:19,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-08 12:08:19,123 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:08:19,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:08:19,124 INFO L85 PathProgramCache]: Analyzing trace with hash 595064362, now seen corresponding path program 1 times [2025-03-08 12:08:19,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 12:08:19,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [575030047] [2025-03-08 12:08:19,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:08:19,124 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-08 12:08:19,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 12:08:19,126 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-08 12:08:19,127 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-08 12:08:19,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-08 12:08:19,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-08 12:08:19,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:08:19,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:08:19,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 12:08:19,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:08:21,787 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 618 proven. 39 refuted. 0 times theorem prover too weak. 543 trivial. 0 not checked. [2025-03-08 12:08:21,788 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 12:08:22,700 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 12:08:22,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [575030047] [2025-03-08 12:08:22,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [575030047] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 12:08:22,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [788265425] [2025-03-08 12:08:22,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:08:22,700 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-08 12:08:22,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-08 12:08:22,703 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-08 12:08:22,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2025-03-08 12:08:22,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-08 12:08:23,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-08 12:08:23,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:08:23,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:08:23,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 12:08:23,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:08:23,164 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-08 12:08:23,164 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 12:08:23,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [788265425] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:08:23,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 12:08:23,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2025-03-08 12:08:23,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216007741] [2025-03-08 12:08:23,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:08:23,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 12:08:23,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 12:08:23,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 12:08:23,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-03-08 12:08:23,165 INFO L87 Difference]: Start difference. First operand 142 states and 215 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-08 12:08:25,272 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 12:08:25,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:08:25,544 INFO L93 Difference]: Finished difference Result 355 states and 527 transitions. [2025-03-08 12:08:25,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 12:08:25,544 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 164 [2025-03-08 12:08:25,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:08:25,546 INFO L225 Difference]: With dead ends: 355 [2025-03-08 12:08:25,547 INFO L226 Difference]: Without dead ends: 216 [2025-03-08 12:08:25,547 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 407 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2025-03-08 12:08:25,548 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 197 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-08 12:08:25,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 466 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-08 12:08:25,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2025-03-08 12:08:25,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 207. [2025-03-08 12:08:25,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 146 states have (on average 1.3424657534246576) internal successors, (196), 148 states have internal predecessors, (196), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-08 12:08:25,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 308 transitions. [2025-03-08 12:08:25,566 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 308 transitions. Word has length 164 [2025-03-08 12:08:25,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:08:25,566 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 308 transitions. [2025-03-08 12:08:25,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-08 12:08:25,566 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 308 transitions. [2025-03-08 12:08:25,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-08 12:08:25,568 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:08:25,568 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 12:08:25,584 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-03-08 12:08:25,772 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2025-03-08 12:08:25,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-08 12:08:25,968 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:08:25,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:08:25,969 INFO L85 PathProgramCache]: Analyzing trace with hash 89505737, now seen corresponding path program 1 times [2025-03-08 12:08:25,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 12:08:25,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2124576670] [2025-03-08 12:08:25,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:08:25,969 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-08 12:08:25,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 12:08:25,971 INFO L229 MonitoredProcess]: Starting monitored process 7 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-08 12:08:25,972 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 (7)] Waiting until timeout for monitored process [2025-03-08 12:08:25,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-08 12:08:26,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-08 12:08:26,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:08:26,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:08:26,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 12:08:26,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:08:28,120 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 618 proven. 39 refuted. 0 times theorem prover too weak. 543 trivial. 0 not checked. [2025-03-08 12:08:28,120 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 12:08:32,486 WARN L851 $PredicateComparison]: unable to prove that (forall ((~var_1_19~0 (_ BitVec 32))) (or (not (bvuge (bvadd (bvneg ((_ zero_extend 16) c_~last_1_var_1_9~0)) ~var_1_19~0 (bvneg c_~last_1_var_1_11~0)) (bvneg ((_ zero_extend 16) c_~var_1_9~0)))) (not (bvsge ((_ zero_extend 32) ~var_1_19~0) (_ bv3221225470 64))))) is different from false [2025-03-08 12:08:32,493 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 12:08:32,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2124576670] [2025-03-08 12:08:32,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2124576670] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 12:08:32,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [896852633] [2025-03-08 12:08:32,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:08:32,493 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-08 12:08:32,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-08 12:08:32,497 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-08 12:08:32,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2025-03-08 12:08:32,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-08 12:08:33,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-08 12:08:33,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:08:33,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:08:33,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 12:08:33,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:08:37,065 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 618 proven. 39 refuted. 0 times theorem prover too weak. 543 trivial. 0 not checked. [2025-03-08 12:08:37,065 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 12:08:37,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [896852633] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 12:08:37,640 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 12:08:37,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2025-03-08 12:08:37,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267591211] [2025-03-08 12:08:37,640 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 12:08:37,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 12:08:37,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 12:08:37,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 12:08:37,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=106, Unknown=1, NotChecked=20, Total=156 [2025-03-08 12:08:37,641 INFO L87 Difference]: Start difference. First operand 207 states and 308 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-08 12:08:42,069 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.57s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 12:08:43,541 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 12:08:46,599 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.06s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 12:08:47,916 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 12:08:50,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.53s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 12:08:53,662 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.91s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 12:08:55,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:08:55,096 INFO L93 Difference]: Finished difference Result 583 states and 861 transitions. [2025-03-08 12:08:55,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 12:08:55,097 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 164 [2025-03-08 12:08:55,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:08:55,100 INFO L225 Difference]: With dead ends: 583 [2025-03-08 12:08:55,100 INFO L226 Difference]: Without dead ends: 379 [2025-03-08 12:08:55,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 522 GetRequests, 501 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=118, Invalid=347, Unknown=1, NotChecked=40, Total=506 [2025-03-08 12:08:55,101 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 280 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.8s IncrementalHoareTripleChecker+Time [2025-03-08 12:08:55,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 515 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 16.8s Time] [2025-03-08 12:08:55,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2025-03-08 12:08:55,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 341. [2025-03-08 12:08:55,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 225 states have (on average 1.2844444444444445) internal successors, (289), 228 states have internal predecessors, (289), 106 states have call successors, (106), 9 states have call predecessors, (106), 9 states have return successors, (106), 103 states have call predecessors, (106), 106 states have call successors, (106) [2025-03-08 12:08:55,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 501 transitions. [2025-03-08 12:08:55,138 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 501 transitions. Word has length 164 [2025-03-08 12:08:55,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:08:55,138 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 501 transitions. [2025-03-08 12:08:55,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-08 12:08:55,139 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 501 transitions. [2025-03-08 12:08:55,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-08 12:08:55,140 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:08:55,140 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 12:08:55,156 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 (7)] Ended with exit code 0 [2025-03-08 12:08:55,352 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Forceful destruction successful, exit code 0 [2025-03-08 12:08:55,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-08 12:08:55,541 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:08:55,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:08:55,541 INFO L85 PathProgramCache]: Analyzing trace with hash -249407509, now seen corresponding path program 1 times [2025-03-08 12:08:55,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 12:08:55,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [874156985] [2025-03-08 12:08:55,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:08:55,542 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-08 12:08:55,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 12:08:55,544 INFO L229 MonitoredProcess]: Starting monitored process 9 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-08 12:08:55,544 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 (9)] Waiting until timeout for monitored process [2025-03-08 12:08:55,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-08 12:08:55,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-08 12:08:55,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:08:55,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:08:55,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 12:08:55,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:08:56,649 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 282 proven. 63 refuted. 0 times theorem prover too weak. 855 trivial. 0 not checked. [2025-03-08 12:08:56,649 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 12:08:57,326 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 9 proven. 63 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2025-03-08 12:08:57,326 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 12:08:57,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [874156985] [2025-03-08 12:08:57,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [874156985] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 12:08:57,326 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 12:08:57,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2025-03-08 12:08:57,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91132975] [2025-03-08 12:08:57,327 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 12:08:57,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 12:08:57,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 12:08:57,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 12:08:57,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 12:08:57,328 INFO L87 Difference]: Start difference. First operand 341 states and 501 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2025-03-08 12:09:00,480 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.37s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 12:09:00,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:09:00,583 INFO L93 Difference]: Finished difference Result 512 states and 739 transitions. [2025-03-08 12:09:00,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 12:09:00,613 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) Word has length 164 [2025-03-08 12:09:00,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:09:00,616 INFO L225 Difference]: With dead ends: 512 [2025-03-08 12:09:00,616 INFO L226 Difference]: Without dead ends: 301 [2025-03-08 12:09:00,616 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 320 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-03-08 12:09:00,617 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 94 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-03-08 12:09:00,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 193 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-03-08 12:09:00,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2025-03-08 12:09:00,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 230. [2025-03-08 12:09:00,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 144 states have (on average 1.1944444444444444) internal successors, (172), 144 states have internal predecessors, (172), 75 states have call successors, (75), 10 states have call predecessors, (75), 10 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2025-03-08 12:09:00,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 322 transitions. [2025-03-08 12:09:00,633 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 322 transitions. Word has length 164 [2025-03-08 12:09:00,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:09:00,634 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 322 transitions. [2025-03-08 12:09:00,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2025-03-08 12:09:00,634 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 322 transitions. [2025-03-08 12:09:00,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 12:09:00,635 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:09:00,635 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 12:09:00,652 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 (9)] Ended with exit code 0 [2025-03-08 12:09:00,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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-08 12:09:00,836 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:09:00,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:09:00,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1294535262, now seen corresponding path program 1 times [2025-03-08 12:09:00,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 12:09:00,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [598736154] [2025-03-08 12:09:00,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:09:00,837 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-08 12:09:00,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 12:09:00,840 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 12:09:00,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2025-03-08 12:09:00,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 12:09:01,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 12:09:01,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:09:01,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:09:01,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-08 12:09:01,310 INFO L279 TraceCheckSpWp]: Computing forward predicates...