./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-50.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_operatoramount_amount50_file-50.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 4f94a38395646f2fd21cd971e66ffb72cd86cb75430b7e6468fd3a29b21b1fc3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:44:01,138 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:44:01,184 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:44:01,187 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:44:01,189 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:44:01,201 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:44:01,202 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:44:01,202 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:44:01,204 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:44:01,204 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:44:01,204 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:44:01,204 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:44:01,204 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:44:01,205 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:44:01,205 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:44:01,205 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:44:01,206 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:44:01,206 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:44:01,206 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:44:01,206 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:44:01,206 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:44:01,206 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:44:01,206 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:44:01,206 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:44:01,206 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:44:01,206 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:44:01,206 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:44:01,206 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:44:01,206 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:44:01,206 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:44:01,206 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:44:01,206 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:44:01,206 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:44:01,206 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:44:01,206 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:44:01,206 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:44:01,206 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:44:01,206 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:44:01,206 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:44:01,206 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:44:01,206 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:44:01,207 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:44:01,207 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:44:01,207 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 -> 4f94a38395646f2fd21cd971e66ffb72cd86cb75430b7e6468fd3a29b21b1fc3 [2025-03-04 00:44:01,477 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:44:01,488 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:44:01,490 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:44:01,491 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:44:01,492 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:44:01,493 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-50.i [2025-03-04 00:44:02,611 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ba250a81/6251a0bf45e84043ba5b252260b20509/FLAGb3de095ac [2025-03-04 00:44:02,873 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:44:02,875 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-50.i [2025-03-04 00:44:02,882 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ba250a81/6251a0bf45e84043ba5b252260b20509/FLAGb3de095ac [2025-03-04 00:44:02,897 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ba250a81/6251a0bf45e84043ba5b252260b20509 [2025-03-04 00:44:02,900 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:44:02,902 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:44:02,903 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:44:02,903 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:44:02,906 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:44:02,907 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:44:02" (1/1) ... [2025-03-04 00:44:02,908 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a7f80c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:44:02, skipping insertion in model container [2025-03-04 00:44:02,909 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:44:02" (1/1) ... [2025-03-04 00:44:02,924 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:44:03,027 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_operatoramount_amount50_file-50.i[915,928] [2025-03-04 00:44:03,084 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:44:03,096 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:44:03,104 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_operatoramount_amount50_file-50.i[915,928] [2025-03-04 00:44:03,135 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:44:03,152 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:44:03,152 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:44:03 WrapperNode [2025-03-04 00:44:03,153 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:44:03,155 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:44:03,155 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:44:03,155 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:44:03,159 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:44:03" (1/1) ... [2025-03-04 00:44:03,170 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:44:03" (1/1) ... [2025-03-04 00:44:03,203 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 131 [2025-03-04 00:44:03,208 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:44:03,208 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:44:03,208 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:44:03,208 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:44:03,216 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:44:03" (1/1) ... [2025-03-04 00:44:03,216 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:44:03" (1/1) ... [2025-03-04 00:44:03,218 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:44:03" (1/1) ... [2025-03-04 00:44:03,243 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-04 00:44:03,243 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:44:03" (1/1) ... [2025-03-04 00:44:03,244 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:44:03" (1/1) ... [2025-03-04 00:44:03,251 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:44:03" (1/1) ... [2025-03-04 00:44:03,257 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:44:03" (1/1) ... [2025-03-04 00:44:03,258 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:44:03" (1/1) ... [2025-03-04 00:44:03,258 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:44:03" (1/1) ... [2025-03-04 00:44:03,265 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:44:03,269 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:44:03,269 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:44:03,269 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:44:03,270 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:44:03" (1/1) ... [2025-03-04 00:44:03,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:44:03,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:44:03,298 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-04 00:44:03,301 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-04 00:44:03,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:44:03,318 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:44:03,319 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:44:03,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:44:03,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:44:03,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:44:03,371 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:44:03,373 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:44:03,631 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-04 00:44:03,633 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:44:03,642 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:44:03,644 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:44:03,644 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:44:03 BoogieIcfgContainer [2025-03-04 00:44:03,644 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:44:03,647 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:44:03,647 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:44:03,650 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:44:03,650 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:44:02" (1/3) ... [2025-03-04 00:44:03,651 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68fffae7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:44:03, skipping insertion in model container [2025-03-04 00:44:03,651 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:44:03" (2/3) ... [2025-03-04 00:44:03,651 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68fffae7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:44:03, skipping insertion in model container [2025-03-04 00:44:03,651 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:44:03" (3/3) ... [2025-03-04 00:44:03,652 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-50.i [2025-03-04 00:44:03,662 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:44:03,663 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount50_file-50.i that has 2 procedures, 61 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:44:03,705 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:44:03,712 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;@420c6942, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:44:03,713 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:44:03,716 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 39 states have internal predecessors, (50), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 00:44:03,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-04 00:44:03,726 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:44:03,726 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:44:03,727 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:44:03,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:44:03,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1913004807, now seen corresponding path program 1 times [2025-03-04 00:44:03,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:44:03,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075312378] [2025-03-04 00:44:03,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:44:03,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:44:03,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-04 00:44:03,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-04 00:44:03,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:44:03,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:44:03,990 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-04 00:44:03,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:44:03,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075312378] [2025-03-04 00:44:03,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075312378] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:44:03,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [301741436] [2025-03-04 00:44:03,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:44:03,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:44:03,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:44:03,995 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-04 00:44:03,996 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-04 00:44:04,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-04 00:44:04,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-04 00:44:04,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:44:04,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:44:04,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:44:04,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:44:04,152 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-04 00:44:04,153 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:44:04,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [301741436] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:44:04,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:44:04,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:44:04,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333523752] [2025-03-04 00:44:04,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:44:04,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:44:04,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:44:04,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:44:04,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:44:04,174 INFO L87 Difference]: Start difference. First operand has 61 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 39 states have internal predecessors, (50), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-04 00:44:04,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:44:04,193 INFO L93 Difference]: Finished difference Result 116 states and 195 transitions. [2025-03-04 00:44:04,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:44:04,195 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 130 [2025-03-04 00:44:04,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:44:04,199 INFO L225 Difference]: With dead ends: 116 [2025-03-04 00:44:04,200 INFO L226 Difference]: Without dead ends: 58 [2025-03-04 00:44:04,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 131 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-04 00:44:04,206 INFO L435 NwaCegarLoop]: 85 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, 85 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-04 00:44:04,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:44:04,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-04 00:44:04,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2025-03-04 00:44:04,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 36 states have (on average 1.25) internal successors, (45), 36 states have internal predecessors, (45), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 00:44:04,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 85 transitions. [2025-03-04 00:44:04,247 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 85 transitions. Word has length 130 [2025-03-04 00:44:04,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:44:04,248 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 85 transitions. [2025-03-04 00:44:04,248 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-04 00:44:04,248 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 85 transitions. [2025-03-04 00:44:04,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-04 00:44:04,251 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:44:04,251 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:44:04,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 00:44:04,456 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-04 00:44:04,456 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:44:04,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:44:04,457 INFO L85 PathProgramCache]: Analyzing trace with hash -338173079, now seen corresponding path program 1 times [2025-03-04 00:44:04,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:44:04,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722495581] [2025-03-04 00:44:04,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:44:04,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:44:04,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-04 00:44:04,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-04 00:44:04,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:44:04,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:44:04,732 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-04 00:44:04,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:44:04,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722495581] [2025-03-04 00:44:04,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722495581] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:44:04,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:44:04,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:44:04,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460871392] [2025-03-04 00:44:04,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:44:04,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:44:04,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:44:04,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:44:04,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:44:04,734 INFO L87 Difference]: Start difference. First operand 58 states and 85 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-04 00:44:04,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:44:04,868 INFO L93 Difference]: Finished difference Result 167 states and 247 transitions. [2025-03-04 00:44:04,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:44:04,870 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 130 [2025-03-04 00:44:04,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:44:04,871 INFO L225 Difference]: With dead ends: 167 [2025-03-04 00:44:04,871 INFO L226 Difference]: Without dead ends: 112 [2025-03-04 00:44:04,872 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-04 00:44:04,872 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 78 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:44:04,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 190 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:44:04,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-04 00:44:04,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 62. [2025-03-04 00:44:04,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 40 states have (on average 1.25) internal successors, (50), 40 states have internal predecessors, (50), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 00:44:04,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 90 transitions. [2025-03-04 00:44:04,887 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 90 transitions. Word has length 130 [2025-03-04 00:44:04,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:44:04,888 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 90 transitions. [2025-03-04 00:44:04,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-04 00:44:04,888 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 90 transitions. [2025-03-04 00:44:04,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-04 00:44:04,889 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:44:04,891 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:44:04,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:44:04,892 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:44:04,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:44:04,893 INFO L85 PathProgramCache]: Analyzing trace with hash 549330602, now seen corresponding path program 1 times [2025-03-04 00:44:04,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:44:04,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194915796] [2025-03-04 00:44:04,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:44:04,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:44:04,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-04 00:44:05,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-04 00:44:05,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:44:05,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:44:05,681 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 105 proven. 3 refuted. 0 times theorem prover too weak. 652 trivial. 0 not checked. [2025-03-04 00:44:05,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:44:05,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194915796] [2025-03-04 00:44:05,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194915796] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:44:05,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1518201855] [2025-03-04 00:44:05,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:44:05,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:44:05,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:44:05,685 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-04 00:44:05,686 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-04 00:44:05,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-04 00:44:05,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-04 00:44:05,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:44:05,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:44:05,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 00:44:05,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:44:06,004 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 216 proven. 27 refuted. 0 times theorem prover too weak. 517 trivial. 0 not checked. [2025-03-04 00:44:06,005 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:44:06,564 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 105 proven. 6 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2025-03-04 00:44:06,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1518201855] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:44:06,565 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:44:06,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 12] total 23 [2025-03-04 00:44:06,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663307254] [2025-03-04 00:44:06,565 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:44:06,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 00:44:06,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:44:06,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 00:44:06,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2025-03-04 00:44:06,566 INFO L87 Difference]: Start difference. First operand 62 states and 90 transitions. Second operand has 23 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 23 states have internal predecessors, (65), 3 states have call successors, (24), 2 states have call predecessors, (24), 6 states have return successors, (26), 6 states have call predecessors, (26), 3 states have call successors, (26) [2025-03-04 00:44:07,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:44:07,757 INFO L93 Difference]: Finished difference Result 247 states and 342 transitions. [2025-03-04 00:44:07,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-03-04 00:44:07,758 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 23 states have internal predecessors, (65), 3 states have call successors, (24), 2 states have call predecessors, (24), 6 states have return successors, (26), 6 states have call predecessors, (26), 3 states have call successors, (26) Word has length 130 [2025-03-04 00:44:07,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:44:07,761 INFO L225 Difference]: With dead ends: 247 [2025-03-04 00:44:07,761 INFO L226 Difference]: Without dead ends: 188 [2025-03-04 00:44:07,765 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 495 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=552, Invalid=1800, Unknown=0, NotChecked=0, Total=2352 [2025-03-04 00:44:07,766 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 450 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 775 mSolverCounterSat, 355 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 1130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 355 IncrementalHoareTripleChecker+Valid, 775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 00:44:07,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 530 Invalid, 1130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [355 Valid, 775 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 00:44:07,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-03-04 00:44:07,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 72. [2025-03-04 00:44:07,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 48 states have (on average 1.2083333333333333) internal successors, (58), 48 states have internal predecessors, (58), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 00:44:07,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 98 transitions. [2025-03-04 00:44:07,792 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 98 transitions. Word has length 130 [2025-03-04 00:44:07,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:44:07,793 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 98 transitions. [2025-03-04 00:44:07,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 23 states have internal predecessors, (65), 3 states have call successors, (24), 2 states have call predecessors, (24), 6 states have return successors, (26), 6 states have call predecessors, (26), 3 states have call successors, (26) [2025-03-04 00:44:07,793 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 98 transitions. [2025-03-04 00:44:07,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-04 00:44:07,796 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:44:07,796 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:44:07,803 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 00:44:08,001 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,SelfDestructingSolverStorable2 [2025-03-04 00:44:08,001 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:44:08,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:44:08,002 INFO L85 PathProgramCache]: Analyzing trace with hash -2135124438, now seen corresponding path program 1 times [2025-03-04 00:44:08,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:44:08,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813152049] [2025-03-04 00:44:08,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:44:08,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:44:08,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-04 00:44:08,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-04 00:44:08,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:44:08,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:44:08,113 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-04 00:44:08,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:44:08,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813152049] [2025-03-04 00:44:08,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813152049] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:44:08,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:44:08,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:44:08,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506042922] [2025-03-04 00:44:08,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:44:08,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:44:08,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:44:08,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:44:08,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:44:08,115 INFO L87 Difference]: Start difference. First operand 72 states and 98 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-04 00:44:08,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:44:08,185 INFO L93 Difference]: Finished difference Result 141 states and 193 transitions. [2025-03-04 00:44:08,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:44:08,186 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 130 [2025-03-04 00:44:08,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:44:08,187 INFO L225 Difference]: With dead ends: 141 [2025-03-04 00:44:08,187 INFO L226 Difference]: Without dead ends: 72 [2025-03-04 00:44:08,188 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-04 00:44:08,188 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 78 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:44:08,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 115 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:44:08,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-04 00:44:08,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 68. [2025-03-04 00:44:08,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 44 states have internal predecessors, (52), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 00:44:08,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 92 transitions. [2025-03-04 00:44:08,200 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 92 transitions. Word has length 130 [2025-03-04 00:44:08,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:44:08,200 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 92 transitions. [2025-03-04 00:44:08,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-04 00:44:08,200 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 92 transitions. [2025-03-04 00:44:08,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-04 00:44:08,201 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:44:08,201 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:44:08,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 00:44:08,202 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:44:08,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:44:08,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1247620757, now seen corresponding path program 1 times [2025-03-04 00:44:08,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:44:08,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290519348] [2025-03-04 00:44:08,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:44:08,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:44:08,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-04 00:44:08,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-04 00:44:08,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:44:08,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 00:44:08,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1688983955] [2025-03-04 00:44:08,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:44:08,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:44:08,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:44:08,280 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-04 00:44:08,282 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-04 00:44:08,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-04 00:44:08,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-04 00:44:08,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:44:08,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:44:08,579 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 00:44:08,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-04 00:44:08,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-04 00:44:08,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:44:08,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:44:08,685 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 00:44:08,685 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 00:44:08,686 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 00:44:08,694 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 00:44:08,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:44:08,891 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-04 00:44:08,966 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 00:44:08,970 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 12:44:08 BoogieIcfgContainer [2025-03-04 00:44:08,970 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 00:44:08,971 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 00:44:08,971 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 00:44:08,971 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 00:44:08,972 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:44:03" (3/4) ... [2025-03-04 00:44:08,973 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 00:44:08,974 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 00:44:08,976 INFO L158 Benchmark]: Toolchain (without parser) took 6072.79ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 130.1MB in the beginning and 121.4MB in the end (delta: 8.7MB). Peak memory consumption was 41.5MB. Max. memory is 16.1GB. [2025-03-04 00:44:08,976 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 201.3MB. Free memory is still 126.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:44:08,977 INFO L158 Benchmark]: CACSL2BoogieTranslator took 251.40ms. Allocated memory is still 167.8MB. Free memory was 129.7MB in the beginning and 115.9MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 00:44:08,977 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.16ms. Allocated memory is still 167.8MB. Free memory was 115.4MB in the beginning and 112.0MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:44:08,977 INFO L158 Benchmark]: Boogie Preprocessor took 56.93ms. Allocated memory is still 167.8MB. Free memory was 112.0MB in the beginning and 105.3MB in the end (delta: 6.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:44:08,977 INFO L158 Benchmark]: IcfgBuilder took 374.93ms. Allocated memory is still 167.8MB. Free memory was 105.3MB in the beginning and 83.8MB in the end (delta: 21.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 00:44:08,978 INFO L158 Benchmark]: TraceAbstraction took 5323.59ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 83.3MB in the beginning and 121.5MB in the end (delta: -38.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:44:08,978 INFO L158 Benchmark]: Witness Printer took 2.86ms. Allocated memory is still 201.3MB. Free memory was 121.5MB in the beginning and 121.4MB in the end (delta: 60.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:44:08,979 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26ms. Allocated memory is still 201.3MB. Free memory is still 126.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 251.40ms. Allocated memory is still 167.8MB. Free memory was 129.7MB in the beginning and 115.9MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.16ms. Allocated memory is still 167.8MB. Free memory was 115.4MB in the beginning and 112.0MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 56.93ms. Allocated memory is still 167.8MB. Free memory was 112.0MB in the beginning and 105.3MB in the end (delta: 6.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 374.93ms. Allocated memory is still 167.8MB. Free memory was 105.3MB in the beginning and 83.8MB in the end (delta: 21.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 5323.59ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 83.3MB in the beginning and 121.5MB in the end (delta: -38.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.86ms. Allocated memory is still 201.3MB. Free memory was 121.5MB in the beginning and 121.4MB in the end (delta: 60.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 93, overapproximation of someBinaryFLOATComparisonOperation at line 46, overapproximation of someBinaryFLOATComparisonOperation at line 95, overapproximation of someBinaryFLOATComparisonOperation at line 121, overapproximation of someBinaryFLOATComparisonOperation at line 97, overapproximation of someBinaryArithmeticFLOAToperation at line 46, overapproximation of someUnaryFLOAToperation at line 46. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_7 = 0; [L24] unsigned char var_1_8 = 1; [L25] signed short int var_1_9 = -2; [L26] float var_1_13 = 999.4; [L27] float var_1_14 = 100.425; [L28] float var_1_15 = 3.375; [L29] float var_1_16 = 15.9; [L30] signed short int var_1_17 = -10; [L31] signed short int var_1_18 = 18060; [L32] unsigned char var_1_20 = 0; [L33] unsigned long int var_1_21 = 4; [L34] unsigned char var_1_23 = 0; [L35] unsigned char var_1_24 = 0; [L36] unsigned char var_1_25 = 100; [L37] unsigned char var_1_26 = 32; [L38] unsigned char var_1_27 = 10; [L39] unsigned char var_1_28 = 1; [L40] unsigned short int var_1_29 = 256; [L41] unsigned char var_1_30 = 1; VAL [isInitial=0, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=0, var_1_8=1, var_1_9=-2] [L125] isInitial = 1 [L126] FCALL initially() [L127] COND TRUE 1 [L128] FCALL updateLastVariables() [L129] CALL updateVariables() [L86] var_1_7 = __VERIFIER_nondet_uchar() [L87] CALL assume_abort_if_not(var_1_7 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L87] RET assume_abort_if_not(var_1_7 >= 1) VAL [isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L88] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L88] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L89] var_1_8 = __VERIFIER_nondet_uchar() [L90] CALL assume_abort_if_not(var_1_8 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L90] RET assume_abort_if_not(var_1_8 >= 1) VAL [isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L91] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L91] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L92] var_1_14 = __VERIFIER_nondet_float() [L93] CALL assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L93] RET assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4997/5, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L94] var_1_15 = __VERIFIER_nondet_float() [L95] CALL assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L95] RET assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4997/5, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L96] var_1_16 = __VERIFIER_nondet_float() [L97] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L97] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L98] var_1_18 = __VERIFIER_nondet_short() [L99] CALL assume_abort_if_not(var_1_18 >= 16382) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L99] RET assume_abort_if_not(var_1_18 >= 16382) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L100] CALL assume_abort_if_not(var_1_18 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L100] RET assume_abort_if_not(var_1_18 <= 32766) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L101] var_1_21 = __VERIFIER_nondet_ulong() [L102] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L102] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L103] CALL assume_abort_if_not(var_1_21 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L103] RET assume_abort_if_not(var_1_21 <= 4294967295) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L104] CALL assume_abort_if_not(var_1_21 != 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16385, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16385, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L104] RET assume_abort_if_not(var_1_21 != 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16385, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L105] var_1_23 = __VERIFIER_nondet_uchar() [L106] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16385, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16385, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L106] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16385, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L107] CALL assume_abort_if_not(var_1_23 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16385, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16385, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L107] RET assume_abort_if_not(var_1_23 <= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16385, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L108] var_1_24 = __VERIFIER_nondet_uchar() [L109] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16385, var_1_23=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16385, var_1_23=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L109] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16385, var_1_23=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L110] CALL assume_abort_if_not(var_1_24 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16385, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16385, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L110] RET assume_abort_if_not(var_1_24 <= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16385, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L111] var_1_26 = __VERIFIER_nondet_uchar() [L112] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16385, var_1_23=0, var_1_24=0, var_1_25=100, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16385, var_1_23=0, var_1_24=0, var_1_25=100, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L112] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16385, var_1_23=0, var_1_24=0, var_1_25=100, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L113] CALL assume_abort_if_not(var_1_26 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16385, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=1, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16385, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=1, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L113] RET assume_abort_if_not(var_1_26 <= 127) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16385, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=1, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L114] var_1_27 = __VERIFIER_nondet_uchar() [L115] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16385, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=1, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16385, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=1, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L115] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16385, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=1, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L116] CALL assume_abort_if_not(var_1_27 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16385, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=1, var_1_27=256, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16385, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=1, var_1_27=256, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L116] RET assume_abort_if_not(var_1_27 <= 127) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16385, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=1, var_1_27=256, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L129] RET updateVariables() [L130] CALL step() [L45] COND TRUE \read(var_1_8) [L46] var_1_13 = (((((var_1_14 + var_1_15)) < (((((-0.2f) < (var_1_16)) ? (-0.2f) : (var_1_16))))) ? ((var_1_14 + var_1_15)) : (((((-0.2f) < (var_1_16)) ? (-0.2f) : (var_1_16)))))) VAL [isInitial=1, var_1_13=2, var_1_16=0, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16385, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=1, var_1_27=256, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L48] COND TRUE \read(var_1_8) [L49] var_1_25 = (var_1_26 + var_1_27) VAL [isInitial=1, var_1_13=2, var_1_16=0, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16385, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=1, var_1_27=256, var_1_28=1, var_1_29=256, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L51] var_1_29 = var_1_27 [L52] var_1_30 = var_1_8 VAL [isInitial=1, var_1_13=2, var_1_16=0, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16385, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=1, var_1_27=256, var_1_28=1, var_1_29=0, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L53] COND FALSE !((var_1_29 > var_1_25) && var_1_30) [L56] var_1_9 = ((((var_1_25) > ((((((var_1_25 - 10)) < (var_1_25)) ? ((var_1_25 - 10)) : (var_1_25))))) ? (var_1_25) : ((((((var_1_25 - 10)) < (var_1_25)) ? ((var_1_25 - 10)) : (var_1_25)))))) VAL [isInitial=1, var_1_13=2, var_1_16=0, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16385, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=1, var_1_27=256, var_1_28=1, var_1_29=0, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=1] [L58] var_1_17 = ((var_1_18 - 25) - var_1_25) [L59] signed long int stepLocal_2 = var_1_25 + var_1_17; VAL [isInitial=1, stepLocal_2=16357, var_1_13=2, var_1_16=0, var_1_17=16356, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16385, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=1, var_1_27=256, var_1_28=1, var_1_29=0, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=1] [L60] COND TRUE ((var_1_18 % var_1_21) & ((((1u) < 0 ) ? -(1u) : (1u)))) < stepLocal_2 [L61] var_1_20 = (var_1_23 || var_1_24) VAL [isInitial=1, var_1_13=2, var_1_16=0, var_1_17=16356, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16385, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=1, var_1_27=256, var_1_28=1, var_1_29=0, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=1] [L65] signed short int stepLocal_3 = var_1_9; VAL [isInitial=1, stepLocal_3=1, var_1_13=2, var_1_16=0, var_1_17=16356, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16385, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=1, var_1_27=256, var_1_28=1, var_1_29=0, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=1] [L66] COND FALSE !((~ var_1_29) > stepLocal_3) [L69] var_1_28 = (var_1_20 || ((! var_1_23) && (var_1_24 || var_1_7))) VAL [isInitial=1, var_1_13=2, var_1_16=0, var_1_17=16356, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16385, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=1, var_1_27=256, var_1_28=1, var_1_29=0, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=1] [L71] signed long int stepLocal_1 = (((var_1_9) > (var_1_25)) ? (var_1_9) : (var_1_25)); [L72] unsigned char stepLocal_0 = var_1_25; VAL [isInitial=1, stepLocal_0=1, stepLocal_1=1, var_1_13=2, var_1_16=0, var_1_17=16356, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16385, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=1, var_1_27=256, var_1_28=1, var_1_29=0, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=1] [L73] COND FALSE !(stepLocal_1 <= (var_1_25 - var_1_25)) [L82] var_1_1 = 0 VAL [isInitial=1, stepLocal_0=1, var_1_13=2, var_1_16=0, var_1_17=16356, var_1_18=16382, var_1_1=0, var_1_20=0, var_1_21=16385, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=1, var_1_27=256, var_1_28=1, var_1_29=0, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=1] [L130] RET step() [L131] CALL, EXPR property() [L121-L122] return (((((((((((((var_1_9) > (var_1_25)) ? (var_1_9) : (var_1_25))) <= (var_1_25 - var_1_25)) ? ((var_1_25 < var_1_25) ? (var_1_20 ? (var_1_1 == ((unsigned char) var_1_7)) : (var_1_1 == ((unsigned char) var_1_8))) : 1) : (var_1_1 == ((unsigned char) 0))) && (((var_1_29 > var_1_25) && var_1_30) ? (var_1_9 == ((signed short int) var_1_25)) : (var_1_9 == ((signed short int) ((((var_1_25) > ((((((var_1_25 - 10)) < (var_1_25)) ? ((var_1_25 - 10)) : (var_1_25))))) ? (var_1_25) : ((((((var_1_25 - 10)) < (var_1_25)) ? ((var_1_25 - 10)) : (var_1_25)))))))))) && (var_1_8 ? (var_1_13 == ((float) (((((var_1_14 + var_1_15)) < (((((-0.2f) < (var_1_16)) ? (-0.2f) : (var_1_16))))) ? ((var_1_14 + var_1_15)) : (((((-0.2f) < (var_1_16)) ? (-0.2f) : (var_1_16)))))))) : 1)) && (var_1_17 == ((signed short int) ((var_1_18 - 25) - var_1_25)))) && ((((var_1_18 % var_1_21) & ((((1u) < 0 ) ? -(1u) : (1u)))) < (var_1_25 + var_1_17)) ? (var_1_20 == ((unsigned char) (var_1_23 || var_1_24))) : (var_1_20 == ((unsigned char) var_1_7)))) && (var_1_8 ? (var_1_25 == ((unsigned char) (var_1_26 + var_1_27))) : 1)) && (((~ var_1_29) > var_1_9) ? (var_1_28 == ((unsigned char) (! var_1_7))) : (var_1_28 == ((unsigned char) (var_1_20 || ((! var_1_23) && (var_1_24 || var_1_7))))))) && (var_1_29 == ((unsigned short int) var_1_27))) && (var_1_30 == ((unsigned char) var_1_8)) ; VAL [\result=0, isInitial=1, var_1_13=2, var_1_16=0, var_1_17=16356, var_1_18=16382, var_1_1=0, var_1_20=0, var_1_21=16385, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=1, var_1_27=256, var_1_28=1, var_1_29=0, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=1] [L131] RET, EXPR property() [L131] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_13=2, var_1_16=0, var_1_17=16356, var_1_18=16382, var_1_1=0, var_1_20=0, var_1_21=16385, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=1, var_1_27=256, var_1_28=1, var_1_29=0, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=1] [L19] reach_error() VAL [isInitial=1, var_1_13=2, var_1_16=0, var_1_17=16356, var_1_18=16382, var_1_1=0, var_1_20=0, var_1_21=16385, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=1, var_1_27=256, var_1_28=1, var_1_29=0, var_1_30=1, var_1_7=1, var_1_8=1, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 61 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.2s, OverallIterations: 5, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 626 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 606 mSDsluCounter, 920 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 582 mSDsCounter, 358 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 889 IncrementalHoareTripleChecker+Invalid, 1247 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 358 mSolverCounterUnsat, 338 mSDtfsCounter, 889 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 441 GetRequests, 388 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 495 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=72occurred in iteration=3, InterpolantAutomatonStates: 46, 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, 170 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 1040 NumberOfCodeBlocks, 1040 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 903 ConstructedInterpolants, 0 QuantifiedInterpolants, 1436 SizeOfPredicates, 7 NumberOfNonLiveVariables, 612 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 7 InterpolantComputations, 3 PerfectInterpolantSequences, 5246/5320 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-04 00:44:08,998 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-50.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 4f94a38395646f2fd21cd971e66ffb72cd86cb75430b7e6468fd3a29b21b1fc3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:44:10,733 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:44:10,818 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 00:44:10,825 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:44:10,825 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:44:10,839 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:44:10,839 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:44:10,839 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:44:10,840 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:44:10,840 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:44:10,840 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:44:10,840 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:44:10,840 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:44:10,840 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:44:10,840 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:44:10,840 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:44:10,841 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:44:10,841 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:44:10,841 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:44:10,841 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:44:10,841 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:44:10,841 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:44:10,841 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:44:10,841 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 00:44:10,841 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 00:44:10,841 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 00:44:10,841 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:44:10,841 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:44:10,841 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:44:10,842 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:44:10,842 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:44:10,842 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:44:10,842 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:44:10,842 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:44:10,842 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:44:10,842 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:44:10,842 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:44:10,842 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:44:10,842 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:44:10,842 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 00:44:10,842 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 00:44:10,842 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:44:10,842 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:44:10,842 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:44:10,842 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:44:10,842 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 -> 4f94a38395646f2fd21cd971e66ffb72cd86cb75430b7e6468fd3a29b21b1fc3 [2025-03-04 00:44:11,052 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:44:11,059 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:44:11,061 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:44:11,062 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:44:11,063 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:44:11,064 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-50.i [2025-03-04 00:44:12,210 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8c2433a6/d7b7ce2951ba46309f3649aeba519a2e/FLAGc721edb43 [2025-03-04 00:44:12,367 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:44:12,368 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-50.i [2025-03-04 00:44:12,373 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8c2433a6/d7b7ce2951ba46309f3649aeba519a2e/FLAGc721edb43 [2025-03-04 00:44:12,755 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8c2433a6/d7b7ce2951ba46309f3649aeba519a2e [2025-03-04 00:44:12,757 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:44:12,758 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:44:12,759 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:44:12,759 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:44:12,762 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:44:12,763 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:44:12" (1/1) ... [2025-03-04 00:44:12,764 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2201fb3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:44:12, skipping insertion in model container [2025-03-04 00:44:12,764 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:44:12" (1/1) ... [2025-03-04 00:44:12,776 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:44:12,875 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_operatoramount_amount50_file-50.i[915,928] [2025-03-04 00:44:12,911 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:44:12,921 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:44:12,928 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_operatoramount_amount50_file-50.i[915,928] [2025-03-04 00:44:12,945 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:44:12,959 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:44:12,961 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:44:12 WrapperNode [2025-03-04 00:44:12,961 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:44:12,962 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:44:12,962 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:44:12,962 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:44:12,966 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:44:12" (1/1) ... [2025-03-04 00:44:12,979 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:44:12" (1/1) ... [2025-03-04 00:44:13,003 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 130 [2025-03-04 00:44:13,004 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:44:13,004 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:44:13,004 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:44:13,004 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:44:13,010 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:44:12" (1/1) ... [2025-03-04 00:44:13,012 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:44:12" (1/1) ... [2025-03-04 00:44:13,016 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:44:12" (1/1) ... [2025-03-04 00:44:13,032 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-04 00:44:13,035 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:44:12" (1/1) ... [2025-03-04 00:44:13,035 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:44:12" (1/1) ... [2025-03-04 00:44:13,045 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:44:12" (1/1) ... [2025-03-04 00:44:13,050 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:44:12" (1/1) ... [2025-03-04 00:44:13,052 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:44:12" (1/1) ... [2025-03-04 00:44:13,052 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:44:12" (1/1) ... [2025-03-04 00:44:13,054 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:44:13,055 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:44:13,055 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:44:13,055 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:44:13,059 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:44:12" (1/1) ... [2025-03-04 00:44:13,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:44:13,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:44:13,088 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-04 00:44:13,091 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-04 00:44:13,110 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:44:13,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 00:44:13,111 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:44:13,111 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:44:13,111 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:44:13,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:44:13,180 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:44:13,182 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:44:13,637 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-04 00:44:13,637 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:44:13,644 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:44:13,644 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:44:13,644 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:44:13 BoogieIcfgContainer [2025-03-04 00:44:13,644 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:44:13,648 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:44:13,648 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:44:13,652 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:44:13,652 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:44:12" (1/3) ... [2025-03-04 00:44:13,653 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24a31ecf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:44:13, skipping insertion in model container [2025-03-04 00:44:13,653 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:44:12" (2/3) ... [2025-03-04 00:44:13,653 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24a31ecf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:44:13, skipping insertion in model container [2025-03-04 00:44:13,653 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:44:13" (3/3) ... [2025-03-04 00:44:13,654 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-50.i [2025-03-04 00:44:13,664 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:44:13,666 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount50_file-50.i that has 2 procedures, 61 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:44:13,703 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:44:13,713 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;@6b408594, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:44:13,713 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:44:13,717 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 39 states have internal predecessors, (50), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 00:44:13,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-04 00:44:13,724 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:44:13,725 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:44:13,725 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:44:13,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:44:13,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1913004807, now seen corresponding path program 1 times [2025-03-04 00:44:13,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:44:13,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1261267497] [2025-03-04 00:44:13,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:44:13,737 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-04 00:44:13,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:44:13,739 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-04 00:44:13,740 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-04 00:44:13,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-04 00:44:13,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-04 00:44:13,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:44:13,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:44:13,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:44:14,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:44:14,045 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 350 proven. 0 refuted. 0 times theorem prover too weak. 410 trivial. 0 not checked. [2025-03-04 00:44:14,045 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:44:14,045 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:44:14,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1261267497] [2025-03-04 00:44:14,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1261267497] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:44:14,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:44:14,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 00:44:14,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267442306] [2025-03-04 00:44:14,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:44:14,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:44:14,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:44:14,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:44:14,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:44:14,069 INFO L87 Difference]: Start difference. First operand has 61 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 39 states have internal predecessors, (50), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-04 00:44:14,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:44:14,091 INFO L93 Difference]: Finished difference Result 116 states and 195 transitions. [2025-03-04 00:44:14,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:44:14,093 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 130 [2025-03-04 00:44:14,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:44:14,099 INFO L225 Difference]: With dead ends: 116 [2025-03-04 00:44:14,099 INFO L226 Difference]: Without dead ends: 58 [2025-03-04 00:44:14,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 129 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-04 00:44:14,102 INFO L435 NwaCegarLoop]: 85 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, 85 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-04 00:44:14,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:44:14,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-04 00:44:14,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2025-03-04 00:44:14,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 36 states have (on average 1.25) internal successors, (45), 36 states have internal predecessors, (45), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 00:44:14,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 85 transitions. [2025-03-04 00:44:14,135 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 85 transitions. Word has length 130 [2025-03-04 00:44:14,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:44:14,136 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 85 transitions. [2025-03-04 00:44:14,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-04 00:44:14,136 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 85 transitions. [2025-03-04 00:44:14,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-04 00:44:14,139 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:44:14,140 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:44:14,149 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-04 00:44:14,340 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-04 00:44:14,341 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:44:14,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:44:14,342 INFO L85 PathProgramCache]: Analyzing trace with hash -338173079, now seen corresponding path program 1 times [2025-03-04 00:44:14,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:44:14,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [506525123] [2025-03-04 00:44:14,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:44:14,343 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-04 00:44:14,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:44:14,346 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-04 00:44:14,347 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-04 00:44:14,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-04 00:44:14,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-04 00:44:14,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:44:14,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:44:14,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 00:44:14,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:44:14,632 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-04 00:44:14,632 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:44:14,632 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:44:14,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [506525123] [2025-03-04 00:44:14,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [506525123] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:44:14,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:44:14,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:44:14,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538177953] [2025-03-04 00:44:14,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:44:14,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:44:14,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:44:14,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:44:14,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:44:14,636 INFO L87 Difference]: Start difference. First operand 58 states and 85 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-04 00:44:14,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:44:14,781 INFO L93 Difference]: Finished difference Result 154 states and 230 transitions. [2025-03-04 00:44:14,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:44:14,782 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 130 [2025-03-04 00:44:14,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:44:14,784 INFO L225 Difference]: With dead ends: 154 [2025-03-04 00:44:14,784 INFO L226 Difference]: Without dead ends: 99 [2025-03-04 00:44:14,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 127 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-04 00:44:14,785 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 77 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:44:14,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 347 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:44:14,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-04 00:44:14,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 58. [2025-03-04 00:44:14,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 36 states have internal predecessors, (44), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 00:44:14,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 84 transitions. [2025-03-04 00:44:14,793 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 84 transitions. Word has length 130 [2025-03-04 00:44:14,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:44:14,794 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 84 transitions. [2025-03-04 00:44:14,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-04 00:44:14,795 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 84 transitions. [2025-03-04 00:44:14,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-04 00:44:14,797 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:44:14,797 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:44:14,805 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-04 00:44:14,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:44:14,998 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:44:14,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:44:14,998 INFO L85 PathProgramCache]: Analyzing trace with hash 549330602, now seen corresponding path program 1 times [2025-03-04 00:44:14,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:44:14,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [396524388] [2025-03-04 00:44:14,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:44:14,999 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-04 00:44:14,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:44:15,001 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 00:44:15,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-04 00:44:15,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-04 00:44:15,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-04 00:44:15,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:44:15,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:44:15,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-04 00:44:15,227 INFO L279 TraceCheckSpWp]: Computing forward predicates...