./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-14.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-14.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 238938febf9540614aa82bd40df03c35fdebef583c6ca0f0e5f9f9a39b9451c5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 23:39:36,238 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 23:39:36,292 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 23:39:36,297 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 23:39:36,297 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 23:39:36,318 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 23:39:36,320 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 23:39:36,320 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 23:39:36,320 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 23:39:36,320 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 23:39:36,321 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 23:39:36,321 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 23:39:36,321 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 23:39:36,321 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 23:39:36,322 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 23:39:36,322 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 23:39:36,322 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 23:39:36,322 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 23:39:36,322 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 23:39:36,322 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 23:39:36,322 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 23:39:36,323 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 23:39:36,323 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 23:39:36,323 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 23:39:36,323 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 23:39:36,323 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 23:39:36,323 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 23:39:36,323 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 23:39:36,323 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 23:39:36,323 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 23:39:36,323 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 23:39:36,323 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 23:39:36,323 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:39:36,324 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 23:39:36,324 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 23:39:36,324 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 23:39:36,324 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 23:39:36,324 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 23:39:36,324 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 23:39:36,324 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 23:39:36,324 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 23:39:36,324 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 23:39:36,324 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 23:39:36,324 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 -> 238938febf9540614aa82bd40df03c35fdebef583c6ca0f0e5f9f9a39b9451c5 [2025-03-03 23:39:36,549 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 23:39:36,557 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 23:39:36,559 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 23:39:36,559 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 23:39:36,559 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 23:39:36,560 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-14.i [2025-03-03 23:39:37,746 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea99a0911/f52e0e7a1b764c669437aa24cb4106d7/FLAG228dd0691 [2025-03-03 23:39:38,019 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 23:39:38,020 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-14.i [2025-03-03 23:39:38,028 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea99a0911/f52e0e7a1b764c669437aa24cb4106d7/FLAG228dd0691 [2025-03-03 23:39:38,337 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea99a0911/f52e0e7a1b764c669437aa24cb4106d7 [2025-03-03 23:39:38,339 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 23:39:38,340 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 23:39:38,342 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 23:39:38,342 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 23:39:38,345 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 23:39:38,346 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:39:38" (1/1) ... [2025-03-03 23:39:38,347 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38ece31b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:39:38, skipping insertion in model container [2025-03-03 23:39:38,348 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:39:38" (1/1) ... [2025-03-03 23:39:38,363 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 23:39:38,461 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-14.i[915,928] [2025-03-03 23:39:38,505 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:39:38,513 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 23:39:38,520 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-14.i[915,928] [2025-03-03 23:39:38,537 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:39:38,551 INFO L204 MainTranslator]: Completed translation [2025-03-03 23:39:38,552 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:39:38 WrapperNode [2025-03-03 23:39:38,552 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 23:39:38,553 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 23:39:38,553 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 23:39:38,553 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 23:39:38,557 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:39:38" (1/1) ... [2025-03-03 23:39:38,563 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:39:38" (1/1) ... [2025-03-03 23:39:38,590 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 144 [2025-03-03 23:39:38,591 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 23:39:38,591 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 23:39:38,591 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 23:39:38,591 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 23:39:38,597 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:39:38" (1/1) ... [2025-03-03 23:39:38,598 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:39:38" (1/1) ... [2025-03-03 23:39:38,601 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:39:38" (1/1) ... [2025-03-03 23:39:38,617 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 23:39:38,619 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:39:38" (1/1) ... [2025-03-03 23:39:38,619 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:39:38" (1/1) ... [2025-03-03 23:39:38,628 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:39:38" (1/1) ... [2025-03-03 23:39:38,632 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:39:38" (1/1) ... [2025-03-03 23:39:38,634 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:39:38" (1/1) ... [2025-03-03 23:39:38,634 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:39:38" (1/1) ... [2025-03-03 23:39:38,639 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 23:39:38,640 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 23:39:38,640 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 23:39:38,640 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 23:39:38,641 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:39:38" (1/1) ... [2025-03-03 23:39:38,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:39:38,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:39:38,664 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 23:39:38,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 23:39:38,682 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 23:39:38,682 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 23:39:38,682 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 23:39:38,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 23:39:38,682 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 23:39:38,682 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 23:39:38,740 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 23:39:38,741 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 23:39:38,979 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-03 23:39:38,979 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 23:39:38,986 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 23:39:38,988 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 23:39:38,989 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:39:38 BoogieIcfgContainer [2025-03-03 23:39:38,989 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 23:39:38,991 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 23:39:38,991 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 23:39:38,994 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 23:39:38,995 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:39:38" (1/3) ... [2025-03-03 23:39:38,995 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bae3ec4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:39:38, skipping insertion in model container [2025-03-03 23:39:38,996 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:39:38" (2/3) ... [2025-03-03 23:39:38,996 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bae3ec4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:39:38, skipping insertion in model container [2025-03-03 23:39:38,996 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:39:38" (3/3) ... [2025-03-03 23:39:38,997 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-14.i [2025-03-03 23:39:39,007 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 23:39:39,008 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-while_file-14.i that has 2 procedures, 64 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 23:39:39,045 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 23:39:39,056 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;@29f4b601, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 23:39:39,056 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 23:39:39,060 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 38 states have (on average 1.368421052631579) internal successors, (52), 39 states have internal predecessors, (52), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-03 23:39:39,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-03 23:39:39,068 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:39:39,068 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:39:39,068 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:39:39,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:39:39,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1851238215, now seen corresponding path program 1 times [2025-03-03 23:39:39,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:39:39,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183955018] [2025-03-03 23:39:39,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:39:39,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:39:39,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-03 23:39:39,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-03 23:39:39,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:39:39,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:39:39,335 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-03-03 23:39:39,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:39:39,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183955018] [2025-03-03 23:39:39,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183955018] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:39:39,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [488115407] [2025-03-03 23:39:39,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:39:39,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:39:39,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:39:39,339 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 23:39:39,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 23:39:39,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-03 23:39:39,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-03 23:39:39,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:39:39,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:39:39,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 23:39:39,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:39:39,521 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-03-03 23:39:39,523 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:39:39,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [488115407] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:39:39,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 23:39:39,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 23:39:39,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305067889] [2025-03-03 23:39:39,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:39:39,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 23:39:39,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:39:39,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 23:39:39,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:39:39,547 INFO L87 Difference]: Start difference. First operand has 64 states, 38 states have (on average 1.368421052631579) internal successors, (52), 39 states have internal predecessors, (52), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 23:39:39,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:39:39,567 INFO L93 Difference]: Finished difference Result 122 states and 214 transitions. [2025-03-03 23:39:39,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 23:39:39,570 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 143 [2025-03-03 23:39:39,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:39:39,575 INFO L225 Difference]: With dead ends: 122 [2025-03-03 23:39:39,575 INFO L226 Difference]: Without dead ends: 61 [2025-03-03 23:39:39,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:39:39,581 INFO L435 NwaCegarLoop]: 93 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, 93 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:39:39,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:39:39,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-03-03 23:39:39,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2025-03-03 23:39:39,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 36 states have internal predecessors, (47), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-03 23:39:39,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 93 transitions. [2025-03-03 23:39:39,606 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 93 transitions. Word has length 143 [2025-03-03 23:39:39,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:39:39,606 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 93 transitions. [2025-03-03 23:39:39,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 23:39:39,607 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 93 transitions. [2025-03-03 23:39:39,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-03 23:39:39,609 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:39:39,610 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:39:39,617 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-03 23:39:39,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 23:39:39,811 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:39:39,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:39:39,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1449833996, now seen corresponding path program 1 times [2025-03-03 23:39:39,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:39:39,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329178603] [2025-03-03 23:39:39,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:39:39,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:39:39,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-03 23:39:40,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-03 23:39:40,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:39:40,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 23:39:40,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [294456285] [2025-03-03 23:39:40,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:39:40,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:39:40,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:39:40,033 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 23:39:40,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 23:39:40,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-03 23:39:40,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-03 23:39:40,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:39:40,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:39:40,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 23:39:40,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:39:40,427 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 222 proven. 6 refuted. 0 times theorem prover too weak. 784 trivial. 0 not checked. [2025-03-03 23:39:40,429 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 23:39:40,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:39:40,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329178603] [2025-03-03 23:39:40,688 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 23:39:40,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294456285] [2025-03-03 23:39:40,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294456285] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:39:40,689 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-03 23:39:40,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2025-03-03 23:39:40,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655219561] [2025-03-03 23:39:40,690 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-03 23:39:40,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 23:39:40,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:39:40,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 23:39:40,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-03 23:39:40,692 INFO L87 Difference]: Start difference. First operand 61 states and 93 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 23:39:41,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:39:41,097 INFO L93 Difference]: Finished difference Result 217 states and 329 transitions. [2025-03-03 23:39:41,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 23:39:41,100 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 143 [2025-03-03 23:39:41,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:39:41,102 INFO L225 Difference]: With dead ends: 217 [2025-03-03 23:39:41,102 INFO L226 Difference]: Without dead ends: 159 [2025-03-03 23:39:41,102 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2025-03-03 23:39:41,103 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 83 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 23:39:41,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 367 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 23:39:41,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-03-03 23:39:41,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 151. [2025-03-03 23:39:41,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 82 states have (on average 1.2439024390243902) internal successors, (102), 83 states have internal predecessors, (102), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 63 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-03 23:39:41,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 230 transitions. [2025-03-03 23:39:41,135 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 230 transitions. Word has length 143 [2025-03-03 23:39:41,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:39:41,137 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 230 transitions. [2025-03-03 23:39:41,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 23:39:41,137 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 230 transitions. [2025-03-03 23:39:41,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-03 23:39:41,139 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:39:41,139 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:39:41,147 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 23:39:41,340 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,SelfDestructingSolverStorable1 [2025-03-03 23:39:41,340 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:39:41,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:39:41,341 INFO L85 PathProgramCache]: Analyzing trace with hash 292976339, now seen corresponding path program 1 times [2025-03-03 23:39:41,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:39:41,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763649210] [2025-03-03 23:39:41,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:39:41,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:39:41,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-03 23:39:41,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-03 23:39:41,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:39:41,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 23:39:41,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [238312809] [2025-03-03 23:39:41,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:39:41,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:39:41,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:39:41,448 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 23:39:41,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 23:39:41,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-03 23:39:41,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-03 23:39:41,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:39:41,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:39:41,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 23:39:41,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:39:42,000 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 396 proven. 15 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2025-03-03 23:39:42,001 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 23:39:42,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:39:42,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763649210] [2025-03-03 23:39:42,160 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 23:39:42,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [238312809] [2025-03-03 23:39:42,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [238312809] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:39:42,160 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-03 23:39:42,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2025-03-03 23:39:42,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278989041] [2025-03-03 23:39:42,161 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-03 23:39:42,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 23:39:42,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:39:42,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 23:39:42,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-03 23:39:42,162 INFO L87 Difference]: Start difference. First operand 151 states and 230 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 23:39:42,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:39:42,946 INFO L93 Difference]: Finished difference Result 291 states and 429 transitions. [2025-03-03 23:39:42,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 23:39:42,947 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 143 [2025-03-03 23:39:42,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:39:42,950 INFO L225 Difference]: With dead ends: 291 [2025-03-03 23:39:42,950 INFO L226 Difference]: Without dead ends: 170 [2025-03-03 23:39:42,951 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2025-03-03 23:39:42,951 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 75 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 23:39:42,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 368 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 23:39:42,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-03-03 23:39:42,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 151. [2025-03-03 23:39:42,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 84 states have (on average 1.2261904761904763) internal successors, (103), 85 states have internal predecessors, (103), 61 states have call successors, (61), 5 states have call predecessors, (61), 5 states have return successors, (61), 60 states have call predecessors, (61), 61 states have call successors, (61) [2025-03-03 23:39:42,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 225 transitions. [2025-03-03 23:39:42,978 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 225 transitions. Word has length 143 [2025-03-03 23:39:42,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:39:42,979 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 225 transitions. [2025-03-03 23:39:42,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 23:39:42,980 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 225 transitions. [2025-03-03 23:39:42,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-03 23:39:42,982 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:39:42,983 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:39:42,990 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 23:39:43,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:39:43,183 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:39:43,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:39:43,184 INFO L85 PathProgramCache]: Analyzing trace with hash -36174091, now seen corresponding path program 1 times [2025-03-03 23:39:43,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:39:43,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4113206] [2025-03-03 23:39:43,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:39:43,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:39:43,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-03 23:39:43,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-03 23:39:43,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:39:43,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:39:43,553 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-03 23:39:43,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:39:43,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4113206] [2025-03-03 23:39:43,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4113206] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:39:43,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:39:43,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 23:39:43,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583007533] [2025-03-03 23:39:43,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:39:43,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 23:39:43,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:39:43,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 23:39:43,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 23:39:43,555 INFO L87 Difference]: Start difference. First operand 151 states and 225 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-03 23:39:43,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:39:43,684 INFO L93 Difference]: Finished difference Result 421 states and 619 transitions. [2025-03-03 23:39:43,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 23:39:43,685 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 144 [2025-03-03 23:39:43,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:39:43,689 INFO L225 Difference]: With dead ends: 421 [2025-03-03 23:39:43,689 INFO L226 Difference]: Without dead ends: 296 [2025-03-03 23:39:43,690 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-03 23:39:43,690 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 70 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 23:39:43,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 270 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 23:39:43,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2025-03-03 23:39:43,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 274. [2025-03-03 23:39:43,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 156 states have (on average 1.2243589743589745) internal successors, (191), 157 states have internal predecessors, (191), 107 states have call successors, (107), 10 states have call predecessors, (107), 10 states have return successors, (107), 106 states have call predecessors, (107), 107 states have call successors, (107) [2025-03-03 23:39:43,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 405 transitions. [2025-03-03 23:39:43,747 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 405 transitions. Word has length 144 [2025-03-03 23:39:43,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:39:43,747 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 405 transitions. [2025-03-03 23:39:43,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-03 23:39:43,748 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 405 transitions. [2025-03-03 23:39:43,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-03 23:39:43,751 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:39:43,751 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:39:43,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 23:39:43,751 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:39:43,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:39:43,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1833125450, now seen corresponding path program 1 times [2025-03-03 23:39:43,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:39:43,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530564827] [2025-03-03 23:39:43,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:39:43,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:39:43,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-03 23:39:43,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-03 23:39:43,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:39:43,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 23:39:43,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1395129080] [2025-03-03 23:39:43,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:39:43,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:39:43,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:39:43,858 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-03 23:39:43,862 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-03 23:39:43,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-03 23:39:43,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-03 23:39:43,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:39:43,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 23:39:43,965 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 23:39:43,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-03 23:39:44,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-03 23:39:44,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:39:44,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 23:39:44,081 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 23:39:44,081 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 23:39:44,082 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 23:39:44,090 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-03 23:39:44,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:39:44,287 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-03 23:39:44,376 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 23:39:44,380 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 11:39:44 BoogieIcfgContainer [2025-03-03 23:39:44,381 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 23:39:44,382 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 23:39:44,383 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 23:39:44,383 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 23:39:44,383 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:39:38" (3/4) ... [2025-03-03 23:39:44,385 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 23:39:44,385 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 23:39:44,386 INFO L158 Benchmark]: Toolchain (without parser) took 6045.72ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 105.0MB in the beginning and 125.3MB in the end (delta: -20.3MB). Peak memory consumption was 170.7MB. Max. memory is 16.1GB. [2025-03-03 23:39:44,386 INFO L158 Benchmark]: CDTParser took 1.02ms. Allocated memory is still 201.3MB. Free memory is still 126.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:39:44,387 INFO L158 Benchmark]: CACSL2BoogieTranslator took 210.79ms. Allocated memory is still 142.6MB. Free memory was 105.0MB in the beginning and 90.8MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 23:39:44,387 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.15ms. Allocated memory is still 142.6MB. Free memory was 90.8MB in the beginning and 87.6MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:39:44,387 INFO L158 Benchmark]: Boogie Preprocessor took 48.27ms. Allocated memory is still 142.6MB. Free memory was 87.6MB in the beginning and 81.2MB in the end (delta: 6.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 23:39:44,387 INFO L158 Benchmark]: IcfgBuilder took 349.21ms. Allocated memory is still 142.6MB. Free memory was 81.2MB in the beginning and 58.4MB in the end (delta: 22.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 23:39:44,388 INFO L158 Benchmark]: TraceAbstraction took 5389.83ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 58.4MB in the beginning and 125.3MB in the end (delta: -67.0MB). Peak memory consumption was 120.3MB. Max. memory is 16.1GB. [2025-03-03 23:39:44,388 INFO L158 Benchmark]: Witness Printer took 3.56ms. Allocated memory is still 335.5MB. Free memory was 125.3MB in the beginning and 125.3MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:39:44,390 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.02ms. Allocated memory is still 201.3MB. Free memory is still 126.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 210.79ms. Allocated memory is still 142.6MB. Free memory was 105.0MB in the beginning and 90.8MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.15ms. Allocated memory is still 142.6MB. Free memory was 90.8MB in the beginning and 87.6MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 48.27ms. Allocated memory is still 142.6MB. Free memory was 87.6MB in the beginning and 81.2MB in the end (delta: 6.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 349.21ms. Allocated memory is still 142.6MB. Free memory was 81.2MB in the beginning and 58.4MB in the end (delta: 22.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 5389.83ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 58.4MB in the beginning and 125.3MB in the end (delta: -67.0MB). Peak memory consumption was 120.3MB. Max. memory is 16.1GB. * Witness Printer took 3.56ms. Allocated memory is still 335.5MB. Free memory was 125.3MB in the beginning and 125.3MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 121, overapproximation of someBinaryFLOATComparisonOperation at line 68, overapproximation of someBinaryFLOATComparisonOperation at line 123, overapproximation of someBinaryFLOATComparisonOperation at line 70, overapproximation of someBinaryFLOATComparisonOperation at line 134, overapproximation of someBinaryDOUBLEComparisonOperation at line 134, overapproximation of someBinaryDOUBLEComparisonOperation at line 53. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -10; [L23] unsigned char var_1_4 = 0; [L24] unsigned char var_1_7 = 1; [L25] unsigned char var_1_8 = 0; [L26] unsigned char var_1_9 = 0; [L27] unsigned char var_1_10 = 1; [L28] unsigned long int var_1_11 = 16; [L29] signed short int var_1_12 = -32; [L30] unsigned char var_1_15 = 8; [L31] unsigned char var_1_17 = 100; [L32] unsigned char var_1_18 = 10; [L33] signed long int var_1_19 = 1; [L34] unsigned char var_1_20 = 5; [L35] float var_1_21 = 25.5; [L36] signed long int var_1_23 = -5; [L37] float var_1_24 = 1.125; [L38] float var_1_25 = 15.25; [L39] signed long int var_1_26 = 5; [L40] unsigned char var_1_28 = 16; [L41] unsigned char last_1_var_1_4 = 0; [L42] unsigned char last_1_var_1_15 = 8; [L43] signed long int last_1_var_1_19 = 1; [L44] float last_1_var_1_21 = 25.5; [L45] signed long int last_1_var_1_26 = 5; [L46] unsigned char last_1_var_1_28 = 16; VAL [isInitial=0, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=-32, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=0] [L138] isInitial = 1 [L139] FCALL initially() [L140] COND TRUE 1 [L141] CALL updateLastVariables() [L126] last_1_var_1_4 = var_1_4 [L127] last_1_var_1_15 = var_1_15 [L128] last_1_var_1_19 = var_1_19 [L129] last_1_var_1_21 = var_1_21 [L130] last_1_var_1_26 = var_1_26 [L131] last_1_var_1_28 = var_1_28 VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=-32, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=0] [L141] RET updateLastVariables() [L142] CALL updateVariables() [L90] var_1_7 = __VERIFIER_nondet_uchar() [L91] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=-32, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=-32, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_8=0, var_1_9=0] [L91] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=-32, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_8=0, var_1_9=0] [L92] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=-32, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=-32, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=0] [L92] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=-32, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=0] [L93] var_1_8 = __VERIFIER_nondet_uchar() [L94] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=-32, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=-32, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_9=0] [L94] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=-32, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_9=0] [L95] CALL assume_abort_if_not(var_1_8 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=-32, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=-32, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=0] [L95] RET assume_abort_if_not(var_1_8 <= 0) VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=-32, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=0] [L96] var_1_9 = __VERIFIER_nondet_uchar() [L97] CALL assume_abort_if_not(var_1_9 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=-32, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=-32, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L97] RET assume_abort_if_not(var_1_9 >= 1) VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=-32, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L98] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=-32, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=-32, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L98] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=-32, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L99] var_1_10 = __VERIFIER_nondet_uchar() [L100] CALL assume_abort_if_not(var_1_10 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=-32, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=-32, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L100] RET assume_abort_if_not(var_1_10 >= 1) VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=-32, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L101] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=-32, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=-32, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L101] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=-32, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L102] var_1_12 = __VERIFIER_nondet_short() [L103] CALL assume_abort_if_not(var_1_12 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=17, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=17, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L103] RET assume_abort_if_not(var_1_12 >= -32768) VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=17, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L104] CALL assume_abort_if_not(var_1_12 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=17, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=17, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L104] RET assume_abort_if_not(var_1_12 <= 32767) VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=17, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L105] CALL assume_abort_if_not(var_1_12 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=17, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=17, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L105] RET assume_abort_if_not(var_1_12 != 0) VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=17, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L106] var_1_17 = __VERIFIER_nondet_uchar() [L107] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=17, var_1_15=8, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=17, var_1_15=8, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L107] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=17, var_1_15=8, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L108] CALL assume_abort_if_not(var_1_17 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=17, var_1_15=8, var_1_17=1, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=17, var_1_15=8, var_1_17=1, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L108] RET assume_abort_if_not(var_1_17 <= 254) VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=17, var_1_15=8, var_1_17=1, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L109] var_1_18 = __VERIFIER_nondet_uchar() [L110] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=17, var_1_15=8, var_1_17=1, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=17, var_1_15=8, var_1_17=1, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L110] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=17, var_1_15=8, var_1_17=1, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L111] CALL assume_abort_if_not(var_1_18 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=17, var_1_15=8, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=17, var_1_15=8, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L111] RET assume_abort_if_not(var_1_18 <= 254) VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=17, var_1_15=8, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L112] var_1_20 = __VERIFIER_nondet_uchar() [L113] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=17, var_1_15=8, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-10, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=17, var_1_15=8, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-10, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L113] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=17, var_1_15=8, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-10, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L114] CALL assume_abort_if_not(var_1_20 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=17, var_1_15=8, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-10, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=17, var_1_15=8, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-10, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L114] RET assume_abort_if_not(var_1_20 <= 255) VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=17, var_1_15=8, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-10, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L115] CALL assume_abort_if_not(var_1_20 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=17, var_1_15=8, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-10, var_1_20=1, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=17, var_1_15=8, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-10, var_1_20=1, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L115] RET assume_abort_if_not(var_1_20 != 0) VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=17, var_1_15=8, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-10, var_1_20=1, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L116] var_1_23 = __VERIFIER_nondet_long() [L117] CALL assume_abort_if_not(var_1_23 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=17, var_1_15=8, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-10, var_1_20=1, var_1_21=51/2, var_1_23=-1, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=17, var_1_15=8, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-10, var_1_20=1, var_1_21=51/2, var_1_23=-1, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L117] RET assume_abort_if_not(var_1_23 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=17, var_1_15=8, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-10, var_1_20=1, var_1_21=51/2, var_1_23=-1, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L118] CALL assume_abort_if_not(var_1_23 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=17, var_1_15=8, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-10, var_1_20=1, var_1_21=51/2, var_1_23=-1, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=17, var_1_15=8, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-10, var_1_20=1, var_1_21=51/2, var_1_23=-1, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L118] RET assume_abort_if_not(var_1_23 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=17, var_1_15=8, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-10, var_1_20=1, var_1_21=51/2, var_1_23=-1, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L119] CALL assume_abort_if_not(var_1_23 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=17, var_1_15=8, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-10, var_1_20=1, var_1_21=51/2, var_1_23=-1, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=17, var_1_15=8, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-10, var_1_20=1, var_1_21=51/2, var_1_23=-1, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L119] RET assume_abort_if_not(var_1_23 != 0) VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=17, var_1_15=8, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-10, var_1_20=1, var_1_21=51/2, var_1_23=-1, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L120] var_1_24 = __VERIFIER_nondet_float() [L121] CALL assume_abort_if_not((var_1_24 >= -922337.2036854765600e+13F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 9223372.036854765600e+12F && var_1_24 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=17, var_1_15=8, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-10, var_1_20=1, var_1_21=51/2, var_1_23=-1, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=17, var_1_15=8, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-10, var_1_20=1, var_1_21=51/2, var_1_23=-1, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L121] RET assume_abort_if_not((var_1_24 >= -922337.2036854765600e+13F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 9223372.036854765600e+12F && var_1_24 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=17, var_1_15=8, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-10, var_1_20=1, var_1_21=51/2, var_1_23=-1, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L122] var_1_25 = __VERIFIER_nondet_float() [L123] CALL assume_abort_if_not((var_1_25 >= -922337.2036854765600e+13F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 9223372.036854765600e+12F && var_1_25 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=17, var_1_15=8, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-10, var_1_20=1, var_1_21=51/2, var_1_23=-1, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=17, var_1_15=8, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-10, var_1_20=1, var_1_21=51/2, var_1_23=-1, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L123] RET assume_abort_if_not((var_1_25 >= -922337.2036854765600e+13F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 9223372.036854765600e+12F && var_1_25 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=17, var_1_15=8, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-10, var_1_20=1, var_1_21=51/2, var_1_23=-1, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L142] RET updateVariables() [L143] CALL step() [L50] COND TRUE (last_1_var_1_28 / var_1_12) <= last_1_var_1_19 [L51] var_1_11 = ((((last_1_var_1_28) > (last_1_var_1_15)) ? (last_1_var_1_28) : (last_1_var_1_15))) VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=17, var_1_15=8, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-10, var_1_20=1, var_1_21=51/2, var_1_23=-1, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L53] COND TRUE ((((last_1_var_1_21) < (-0.5)) ? (last_1_var_1_21) : (-0.5))) > (10.9 * last_1_var_1_21) VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=17, var_1_15=8, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-10, var_1_20=1, var_1_21=51/2, var_1_23=-1, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L54] COND FALSE !(\read(last_1_var_1_4)) [L57] var_1_15 = var_1_18 VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=17, var_1_15=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-10, var_1_20=1, var_1_21=51/2, var_1_23=-1, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L60] var_1_1 = (var_1_15 + var_1_15) [L61] var_1_28 = var_1_17 VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=17, var_1_15=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=1, var_1_21=51/2, var_1_23=-1, var_1_26=5, var_1_28=1, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L62] COND TRUE var_1_9 || ((var_1_11 + last_1_var_1_26) <= 4) [L63] var_1_26 = (var_1_28 - var_1_20) VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=17, var_1_15=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=1, var_1_21=51/2, var_1_23=-1, var_1_26=0, var_1_28=1, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L67] COND TRUE ((~ var_1_28) * var_1_1) >= (var_1_15 % var_1_23) [L68] var_1_21 = ((((var_1_24) > (var_1_25)) ? (var_1_24) : (var_1_25))) VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=17, var_1_15=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=1, var_1_21=2, var_1_23=-1, var_1_24=2, var_1_25=0, var_1_26=0, var_1_28=1, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L70] COND TRUE (var_1_21 + 9.999999999999994E14f) < (- var_1_21) [L71] var_1_4 = (var_1_7 && var_1_8) VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=17, var_1_15=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=1, var_1_21=2, var_1_23=-1, var_1_24=2, var_1_25=0, var_1_26=0, var_1_28=1, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L77] unsigned char stepLocal_1 = var_1_17; [L78] signed long int stepLocal_0 = var_1_15 % var_1_20; VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, stepLocal_0=0, stepLocal_1=1, var_1_10=1, var_1_11=16, var_1_12=17, var_1_15=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=1, var_1_21=2, var_1_23=-1, var_1_24=2, var_1_25=0, var_1_26=0, var_1_28=1, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L79] COND FALSE !(stepLocal_0 != var_1_1) VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, stepLocal_1=1, var_1_10=1, var_1_11=16, var_1_12=17, var_1_15=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=1, var_1_21=2, var_1_23=-1, var_1_24=2, var_1_25=0, var_1_26=0, var_1_28=1, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L143] RET step() [L144] CALL, EXPR property() [L134-L135] return (((((((var_1_1 == ((signed long int) (var_1_15 + var_1_15))) && (((var_1_21 + 9.999999999999994E14f) < (- var_1_21)) ? (var_1_4 == ((unsigned char) (var_1_7 && var_1_8))) : (var_1_7 ? (var_1_4 == ((unsigned char) ((var_1_8 || var_1_9) && var_1_10))) : 1))) && (((last_1_var_1_28 / var_1_12) <= last_1_var_1_19) ? (var_1_11 == ((unsigned long int) ((((last_1_var_1_28) > (last_1_var_1_15)) ? (last_1_var_1_28) : (last_1_var_1_15))))) : 1)) && ((((((last_1_var_1_21) < (-0.5)) ? (last_1_var_1_21) : (-0.5))) > (10.9 * last_1_var_1_21)) ? (last_1_var_1_4 ? (var_1_15 == ((unsigned char) ((((((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17)))) < (var_1_18)) ? (((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17)))) : (var_1_18))))) : (var_1_15 == ((unsigned char) var_1_18))) : 1)) && (((var_1_15 % var_1_20) != var_1_1) ? ((var_1_18 == var_1_17) ? (var_1_4 ? (var_1_19 == ((signed long int) var_1_18)) : (var_1_19 == ((signed long int) var_1_26))) : 1) : 1)) && ((((~ var_1_28) * var_1_1) >= (var_1_15 % var_1_23)) ? (var_1_21 == ((float) ((((var_1_24) > (var_1_25)) ? (var_1_24) : (var_1_25))))) : 1)) && ((var_1_9 || ((var_1_11 + last_1_var_1_26) <= 4)) ? (var_1_26 == ((signed long int) (var_1_28 - var_1_20))) : (var_1_26 == ((signed long int) (var_1_20 - var_1_17))))) && (var_1_28 == ((unsigned char) var_1_17)) ; VAL [\result=0, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=17, var_1_15=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=1, var_1_21=2, var_1_23=-1, var_1_24=2, var_1_25=0, var_1_26=0, var_1_28=1, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L144] RET, EXPR property() [L144] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=17, var_1_15=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=1, var_1_21=2, var_1_23=-1, var_1_24=2, var_1_25=0, var_1_26=0, var_1_28=1, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=17, var_1_15=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=1, var_1_21=2, var_1_23=-1, var_1_24=2, var_1_25=0, var_1_26=0, var_1_28=1, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 64 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.3s, OverallIterations: 5, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 294 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 228 mSDsluCounter, 1098 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 726 mSDsCounter, 85 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 723 IncrementalHoareTripleChecker+Invalid, 808 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 85 mSolverCounterUnsat, 372 mSDtfsCounter, 723 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 505 GetRequests, 471 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=274occurred in iteration=4, InterpolantAutomatonStates: 34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 49 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 1290 NumberOfCodeBlocks, 1290 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 711 ConstructedInterpolants, 1 QuantifiedInterpolants, 1973 SizeOfPredicates, 9 NumberOfNonLiveVariables, 1033 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 4995/5060 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-03 23:39:44,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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_loopvsstraightlinecode_50-while_file-14.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 238938febf9540614aa82bd40df03c35fdebef583c6ca0f0e5f9f9a39b9451c5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 23:39:46,332 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 23:39:46,410 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 23:39:46,415 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 23:39:46,416 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 23:39:46,434 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 23:39:46,435 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 23:39:46,436 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 23:39:46,436 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 23:39:46,436 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 23:39:46,436 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 23:39:46,436 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 23:39:46,436 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 23:39:46,437 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 23:39:46,437 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 23:39:46,437 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 23:39:46,438 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 23:39:46,438 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 23:39:46,438 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 23:39:46,438 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 23:39:46,438 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 23:39:46,438 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 23:39:46,438 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 23:39:46,438 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 23:39:46,438 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 23:39:46,438 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 23:39:46,438 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 23:39:46,439 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 23:39:46,439 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 23:39:46,439 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 23:39:46,439 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 23:39:46,439 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 23:39:46,439 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 23:39:46,439 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 23:39:46,439 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:39:46,439 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 23:39:46,439 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 23:39:46,439 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 23:39:46,439 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 23:39:46,439 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 23:39:46,439 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 23:39:46,439 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 23:39:46,439 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 23:39:46,439 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 23:39:46,439 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 23:39:46,439 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 -> 238938febf9540614aa82bd40df03c35fdebef583c6ca0f0e5f9f9a39b9451c5 [2025-03-03 23:39:46,698 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 23:39:46,708 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 23:39:46,711 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 23:39:46,712 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 23:39:46,712 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 23:39:46,713 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-14.i [2025-03-03 23:39:47,953 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bc8bcb30/629f0b94910d44deab0fc85585a6b97f/FLAG035ed65d6 [2025-03-03 23:39:48,145 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 23:39:48,146 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-14.i [2025-03-03 23:39:48,156 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bc8bcb30/629f0b94910d44deab0fc85585a6b97f/FLAG035ed65d6 [2025-03-03 23:39:48,511 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bc8bcb30/629f0b94910d44deab0fc85585a6b97f [2025-03-03 23:39:48,513 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 23:39:48,514 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 23:39:48,515 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 23:39:48,515 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 23:39:48,518 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 23:39:48,518 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:39:48" (1/1) ... [2025-03-03 23:39:48,519 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4db8844a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:39:48, skipping insertion in model container [2025-03-03 23:39:48,519 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:39:48" (1/1) ... [2025-03-03 23:39:48,534 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 23:39:48,625 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-14.i[915,928] [2025-03-03 23:39:48,658 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:39:48,671 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 23:39:48,679 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-14.i[915,928] [2025-03-03 23:39:48,698 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:39:48,712 INFO L204 MainTranslator]: Completed translation [2025-03-03 23:39:48,713 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:39:48 WrapperNode [2025-03-03 23:39:48,713 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 23:39:48,714 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 23:39:48,714 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 23:39:48,714 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 23:39:48,718 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:39:48" (1/1) ... [2025-03-03 23:39:48,725 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:39:48" (1/1) ... [2025-03-03 23:39:48,748 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 142 [2025-03-03 23:39:48,749 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 23:39:48,749 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 23:39:48,749 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 23:39:48,749 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 23:39:48,759 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:39:48" (1/1) ... [2025-03-03 23:39:48,759 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:39:48" (1/1) ... [2025-03-03 23:39:48,762 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:39:48" (1/1) ... [2025-03-03 23:39:48,776 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 23:39:48,777 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:39:48" (1/1) ... [2025-03-03 23:39:48,777 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:39:48" (1/1) ... [2025-03-03 23:39:48,789 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:39:48" (1/1) ... [2025-03-03 23:39:48,790 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:39:48" (1/1) ... [2025-03-03 23:39:48,795 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:39:48" (1/1) ... [2025-03-03 23:39:48,796 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:39:48" (1/1) ... [2025-03-03 23:39:48,802 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 23:39:48,802 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 23:39:48,802 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 23:39:48,802 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 23:39:48,803 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:39:48" (1/1) ... [2025-03-03 23:39:48,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:39:48,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:39:48,835 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 23:39:48,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 23:39:48,859 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 23:39:48,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 23:39:48,859 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 23:39:48,859 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 23:39:48,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 23:39:48,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 23:39:48,934 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 23:39:48,936 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 23:39:58,713 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-03 23:39:58,713 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 23:39:58,720 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 23:39:58,720 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 23:39:58,721 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:39:58 BoogieIcfgContainer [2025-03-03 23:39:58,721 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 23:39:58,722 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 23:39:58,723 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 23:39:58,727 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 23:39:58,728 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:39:48" (1/3) ... [2025-03-03 23:39:58,728 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1554c67e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:39:58, skipping insertion in model container [2025-03-03 23:39:58,729 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:39:48" (2/3) ... [2025-03-03 23:39:58,730 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1554c67e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:39:58, skipping insertion in model container [2025-03-03 23:39:58,730 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:39:58" (3/3) ... [2025-03-03 23:39:58,731 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-14.i [2025-03-03 23:39:58,741 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 23:39:58,742 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-while_file-14.i that has 2 procedures, 64 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 23:39:58,780 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 23:39:58,791 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;@1aa4f4f4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 23:39:58,791 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 23:39:58,794 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 38 states have (on average 1.368421052631579) internal successors, (52), 39 states have internal predecessors, (52), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-03 23:39:58,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-03 23:39:58,802 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:39:58,802 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:39:58,803 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:39:58,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:39:58,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1851238215, now seen corresponding path program 1 times [2025-03-03 23:39:58,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:39:58,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1266912190] [2025-03-03 23:39:58,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:39:58,816 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 23:39:58,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:39:58,818 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 23:39:58,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-03 23:39:58,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-03 23:39:59,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-03 23:39:59,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:39:59,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:39:59,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 23:39:59,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:39:59,224 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 464 proven. 0 refuted. 0 times theorem prover too weak. 548 trivial. 0 not checked. [2025-03-03 23:39:59,224 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:39:59,225 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 23:39:59,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1266912190] [2025-03-03 23:39:59,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1266912190] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:39:59,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:39:59,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 23:39:59,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787744710] [2025-03-03 23:39:59,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:39:59,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 23:39:59,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 23:39:59,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 23:39:59,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:39:59,243 INFO L87 Difference]: Start difference. First operand has 64 states, 38 states have (on average 1.368421052631579) internal successors, (52), 39 states have internal predecessors, (52), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 23:39:59,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:39:59,259 INFO L93 Difference]: Finished difference Result 122 states and 214 transitions. [2025-03-03 23:39:59,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 23:39:59,260 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 143 [2025-03-03 23:39:59,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:39:59,265 INFO L225 Difference]: With dead ends: 122 [2025-03-03 23:39:59,265 INFO L226 Difference]: Without dead ends: 61 [2025-03-03 23:39:59,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:39:59,270 INFO L435 NwaCegarLoop]: 93 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, 93 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:39:59,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:39:59,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-03-03 23:39:59,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2025-03-03 23:39:59,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 36 states have internal predecessors, (47), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-03 23:39:59,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 93 transitions. [2025-03-03 23:39:59,309 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 93 transitions. Word has length 143 [2025-03-03 23:39:59,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:39:59,310 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 93 transitions. [2025-03-03 23:39:59,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 23:39:59,310 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 93 transitions. [2025-03-03 23:39:59,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-03 23:39:59,313 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:39:59,314 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:39:59,326 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-03 23:39:59,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 23:39:59,515 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:39:59,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:39:59,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1449833996, now seen corresponding path program 1 times [2025-03-03 23:39:59,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:39:59,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1049365170] [2025-03-03 23:39:59,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:39:59,516 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 23:39:59,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:39:59,519 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 23:39:59,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-03 23:39:59,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-03 23:39:59,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-03 23:39:59,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:39:59,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:39:59,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-03 23:39:59,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:40:15,710 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 318 proven. 54 refuted. 0 times theorem prover too weak. 640 trivial. 0 not checked. [2025-03-03 23:40:15,710 INFO L312 TraceCheckSpWp]: Computing backward predicates...