./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-41.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-41.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 db5cf358c364cfe65a71e13a4e5a4cda1dfcc7eb4e0976a026f41ab20e8c8e5f --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 09:48:41,277 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 09:48:41,334 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 09:48:41,337 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 09:48:41,338 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 09:48:41,360 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 09:48:41,360 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 09:48:41,361 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 09:48:41,361 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 09:48:41,361 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 09:48:41,361 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 09:48:41,361 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 09:48:41,362 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 09:48:41,362 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 09:48:41,362 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 09:48:41,362 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 09:48:41,363 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 09:48:41,363 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 09:48:41,363 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 09:48:41,363 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 09:48:41,363 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 09:48:41,363 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 09:48:41,363 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 09:48:41,363 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 09:48:41,363 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 09:48:41,363 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 09:48:41,363 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 09:48:41,364 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 09:48:41,364 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 09:48:41,364 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 09:48:41,364 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 09:48:41,364 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 09:48:41,364 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:48:41,364 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 09:48:41,364 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 09:48:41,364 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 09:48:41,364 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 09:48:41,364 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 09:48:41,364 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 09:48:41,364 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 09:48:41,364 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 09:48:41,364 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 09:48:41,364 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 09:48:41,364 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 -> db5cf358c364cfe65a71e13a4e5a4cda1dfcc7eb4e0976a026f41ab20e8c8e5f [2025-03-08 09:48:41,578 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 09:48:41,586 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 09:48:41,587 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 09:48:41,588 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 09:48:41,588 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 09:48:41,589 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-41.i [2025-03-08 09:48:42,717 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31e8193a6/e9a84344ed74405189997cca0b5670cb/FLAGe49597a22 [2025-03-08 09:48:42,935 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 09:48:42,935 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-41.i [2025-03-08 09:48:42,945 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31e8193a6/e9a84344ed74405189997cca0b5670cb/FLAGe49597a22 [2025-03-08 09:48:43,284 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31e8193a6/e9a84344ed74405189997cca0b5670cb [2025-03-08 09:48:43,286 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 09:48:43,287 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 09:48:43,288 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 09:48:43,288 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 09:48:43,290 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 09:48:43,291 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:48:43" (1/1) ... [2025-03-08 09:48:43,291 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@596afd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:48:43, skipping insertion in model container [2025-03-08 09:48:43,291 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:48:43" (1/1) ... [2025-03-08 09:48:43,303 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 09:48:43,392 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_codestructure_dependencies_file-41.i[919,932] [2025-03-08 09:48:43,439 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:48:43,447 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 09:48:43,453 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_codestructure_dependencies_file-41.i[919,932] [2025-03-08 09:48:43,479 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:48:43,491 INFO L204 MainTranslator]: Completed translation [2025-03-08 09:48:43,492 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:48:43 WrapperNode [2025-03-08 09:48:43,492 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 09:48:43,493 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 09:48:43,493 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 09:48:43,493 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 09:48:43,498 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:48:43" (1/1) ... [2025-03-08 09:48:43,503 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:48:43" (1/1) ... [2025-03-08 09:48:43,520 INFO L138 Inliner]: procedures = 26, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 109 [2025-03-08 09:48:43,520 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 09:48:43,521 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 09:48:43,521 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 09:48:43,521 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 09:48:43,529 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:48:43" (1/1) ... [2025-03-08 09:48:43,529 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:48:43" (1/1) ... [2025-03-08 09:48:43,531 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:48:43" (1/1) ... [2025-03-08 09:48:43,543 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 09:48:43,544 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:48:43" (1/1) ... [2025-03-08 09:48:43,544 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:48:43" (1/1) ... [2025-03-08 09:48:43,547 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:48:43" (1/1) ... [2025-03-08 09:48:43,548 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:48:43" (1/1) ... [2025-03-08 09:48:43,549 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:48:43" (1/1) ... [2025-03-08 09:48:43,555 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:48:43" (1/1) ... [2025-03-08 09:48:43,558 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 09:48:43,559 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 09:48:43,559 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 09:48:43,560 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 09:48:43,561 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:48:43" (1/1) ... [2025-03-08 09:48:43,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:48:43,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:48:43,583 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 09:48:43,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 09:48:43,599 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 09:48:43,599 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 09:48:43,599 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 09:48:43,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 09:48:43,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 09:48:43,599 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 09:48:43,656 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 09:48:43,657 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 09:48:43,930 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-08 09:48:43,930 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 09:48:43,939 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 09:48:43,940 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 09:48:43,940 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:48:43 BoogieIcfgContainer [2025-03-08 09:48:43,940 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 09:48:43,943 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 09:48:43,943 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 09:48:43,946 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 09:48:43,946 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:48:43" (1/3) ... [2025-03-08 09:48:43,946 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42ae28d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:48:43, skipping insertion in model container [2025-03-08 09:48:43,947 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:48:43" (2/3) ... [2025-03-08 09:48:43,947 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42ae28d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:48:43, skipping insertion in model container [2025-03-08 09:48:43,947 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:48:43" (3/3) ... [2025-03-08 09:48:43,948 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-41.i [2025-03-08 09:48:43,957 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 09:48:43,959 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_dependencies_file-41.i that has 2 procedures, 49 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 09:48:43,997 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 09:48:44,006 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;@7d098da0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 09:48:44,006 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 09:48:44,010 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 33 states have (on average 1.4242424242424243) internal successors, (47), 34 states have internal predecessors, (47), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-08 09:48:44,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-08 09:48:44,015 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:48:44,016 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:48:44,016 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:48:44,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:48:44,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1599799210, now seen corresponding path program 1 times [2025-03-08 09:48:44,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:48:44,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895289494] [2025-03-08 09:48:44,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:48:44,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:48:44,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-08 09:48:44,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-08 09:48:44,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:48:44,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:48:44,240 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-03-08 09:48:44,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:48:44,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895289494] [2025-03-08 09:48:44,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895289494] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 09:48:44,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [913650274] [2025-03-08 09:48:44,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:48:44,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:48:44,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:48:44,244 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 09:48:44,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 09:48:44,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-08 09:48:44,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-08 09:48:44,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:48:44,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:48:44,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 09:48:44,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:48:44,367 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-03-08 09:48:44,367 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 09:48:44,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [913650274] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:48:44,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 09:48:44,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 09:48:44,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355821424] [2025-03-08 09:48:44,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:48:44,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 09:48:44,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:48:44,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 09:48:44,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 09:48:44,388 INFO L87 Difference]: Start difference. First operand has 49 states, 33 states have (on average 1.4242424242424243) internal successors, (47), 34 states have internal predecessors, (47), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 09:48:44,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:48:44,400 INFO L93 Difference]: Finished difference Result 92 states and 154 transitions. [2025-03-08 09:48:44,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 09:48:44,401 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 89 [2025-03-08 09:48:44,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:48:44,404 INFO L225 Difference]: With dead ends: 92 [2025-03-08 09:48:44,404 INFO L226 Difference]: Without dead ends: 46 [2025-03-08 09:48:44,406 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 09:48:44,407 INFO L435 NwaCegarLoop]: 67 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, 67 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 09:48:44,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 09:48:44,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-08 09:48:44,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-03-08 09:48:44,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-08 09:48:44,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 67 transitions. [2025-03-08 09:48:44,429 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 67 transitions. Word has length 89 [2025-03-08 09:48:44,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:48:44,429 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 67 transitions. [2025-03-08 09:48:44,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 09:48:44,429 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 67 transitions. [2025-03-08 09:48:44,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-08 09:48:44,431 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:48:44,431 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:48:44,438 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-08 09:48:44,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 09:48:44,633 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:48:44,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:48:44,633 INFO L85 PathProgramCache]: Analyzing trace with hash 541919477, now seen corresponding path program 1 times [2025-03-08 09:48:44,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:48:44,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909394319] [2025-03-08 09:48:44,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:48:44,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:48:44,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-08 09:48:44,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-08 09:48:44,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:48:44,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 09:48:44,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1438400969] [2025-03-08 09:48:44,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:48:44,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:48:44,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:48:44,807 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 09:48:44,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 09:48:44,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-08 09:48:44,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-08 09:48:44,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:48:44,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:48:44,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 09:48:44,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:48:45,067 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 78 proven. 3 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-03-08 09:48:45,067 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 09:48:45,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:48:45,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909394319] [2025-03-08 09:48:45,298 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 09:48:45,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1438400969] [2025-03-08 09:48:45,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1438400969] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 09:48:45,298 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-08 09:48:45,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2025-03-08 09:48:45,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050752659] [2025-03-08 09:48:45,298 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-08 09:48:45,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 09:48:45,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:48:45,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 09:48:45,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-08 09:48:45,301 INFO L87 Difference]: Start difference. First operand 46 states and 67 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 09:48:45,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:48:45,507 INFO L93 Difference]: Finished difference Result 129 states and 182 transitions. [2025-03-08 09:48:45,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 09:48:45,508 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 89 [2025-03-08 09:48:45,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:48:45,509 INFO L225 Difference]: With dead ends: 129 [2025-03-08 09:48:45,509 INFO L226 Difference]: Without dead ends: 86 [2025-03-08 09:48:45,509 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2025-03-08 09:48:45,510 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 89 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 09:48:45,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 141 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 09:48:45,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-08 09:48:45,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 79. [2025-03-08 09:48:45,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 51 states have (on average 1.2156862745098038) internal successors, (62), 52 states have internal predecessors, (62), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-08 09:48:45,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 110 transitions. [2025-03-08 09:48:45,527 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 110 transitions. Word has length 89 [2025-03-08 09:48:45,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:48:45,527 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 110 transitions. [2025-03-08 09:48:45,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 09:48:45,527 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 110 transitions. [2025-03-08 09:48:45,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-08 09:48:45,531 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:48:45,531 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:48:45,539 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 09:48:45,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-08 09:48:45,736 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:48:45,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:48:45,737 INFO L85 PathProgramCache]: Analyzing trace with hash -291645840, now seen corresponding path program 1 times [2025-03-08 09:48:45,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:48:45,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268923776] [2025-03-08 09:48:45,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:48:45,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:48:45,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-08 09:48:45,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-08 09:48:45,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:48:45,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 09:48:45,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2070802312] [2025-03-08 09:48:45,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:48:45,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:48:45,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:48:45,814 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 09:48:45,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 09:48:45,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-08 09:48:45,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-08 09:48:45,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:48:45,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 09:48:45,911 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 09:48:45,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-08 09:48:45,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-08 09:48:45,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:48:45,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 09:48:45,982 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 09:48:45,982 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 09:48:45,983 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 09:48:45,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 09:48:46,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:48:46,187 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-08 09:48:46,234 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 09:48:46,236 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 09:48:46 BoogieIcfgContainer [2025-03-08 09:48:46,236 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 09:48:46,236 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 09:48:46,236 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 09:48:46,236 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 09:48:46,237 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:48:43" (3/4) ... [2025-03-08 09:48:46,238 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 09:48:46,239 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 09:48:46,239 INFO L158 Benchmark]: Toolchain (without parser) took 2952.61ms. Allocated memory is still 142.6MB. Free memory was 112.1MB in the beginning and 58.3MB in the end (delta: 53.9MB). Peak memory consumption was 54.3MB. Max. memory is 16.1GB. [2025-03-08 09:48:46,240 INFO L158 Benchmark]: CDTParser took 0.40ms. Allocated memory is still 201.3MB. Free memory is still 123.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 09:48:46,240 INFO L158 Benchmark]: CACSL2BoogieTranslator took 205.06ms. Allocated memory is still 142.6MB. Free memory was 112.1MB in the beginning and 98.9MB in the end (delta: 13.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 09:48:46,240 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.14ms. Allocated memory is still 142.6MB. Free memory was 98.9MB in the beginning and 95.6MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 09:48:46,240 INFO L158 Benchmark]: Boogie Preprocessor took 37.82ms. Allocated memory is still 142.6MB. Free memory was 95.6MB in the beginning and 91.3MB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 09:48:46,240 INFO L158 Benchmark]: IcfgBuilder took 381.07ms. Allocated memory is still 142.6MB. Free memory was 91.0MB in the beginning and 71.0MB in the end (delta: 20.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 09:48:46,241 INFO L158 Benchmark]: TraceAbstraction took 2293.25ms. Allocated memory is still 142.6MB. Free memory was 70.5MB in the beginning and 58.3MB in the end (delta: 12.2MB). Peak memory consumption was 12.4MB. Max. memory is 16.1GB. [2025-03-08 09:48:46,241 INFO L158 Benchmark]: Witness Printer took 2.60ms. Allocated memory is still 142.6MB. Free memory was 58.3MB in the beginning and 58.3MB in the end (delta: 24.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 09:48:46,242 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.40ms. Allocated memory is still 201.3MB. Free memory is still 123.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 205.06ms. Allocated memory is still 142.6MB. Free memory was 112.1MB in the beginning and 98.9MB in the end (delta: 13.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.14ms. Allocated memory is still 142.6MB. Free memory was 98.9MB in the beginning and 95.6MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 37.82ms. Allocated memory is still 142.6MB. Free memory was 95.6MB in the beginning and 91.3MB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 381.07ms. Allocated memory is still 142.6MB. Free memory was 91.0MB in the beginning and 71.0MB in the end (delta: 20.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 2293.25ms. Allocated memory is still 142.6MB. Free memory was 70.5MB in the beginning and 58.3MB in the end (delta: 12.2MB). Peak memory consumption was 12.4MB. Max. memory is 16.1GB. * Witness Printer took 2.60ms. Allocated memory is still 142.6MB. Free memory was 58.3MB in the beginning and 58.3MB in the end (delta: 24.1kB). 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 56, overapproximation of someBinaryFLOATComparisonOperation at line 108, overapproximation of someBinaryFLOATComparisonOperation at line 96, overapproximation of someBinaryDOUBLEComparisonOperation at line 108, overapproximation of someBinaryDOUBLEComparisonOperation at line 49. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_4 = 1; [L24] unsigned char var_1_5 = 1; [L25] unsigned char var_1_6 = 0; [L26] signed char var_1_8 = 64; [L27] signed char var_1_11 = -10; [L28] signed char var_1_12 = 64; [L29] float var_1_13 = 1.6; [L30] float var_1_14 = 3.5; [L31] unsigned char var_1_15 = 8; [L32] unsigned char var_1_16 = 4; [L33] unsigned short int var_1_17 = 2; [L34] unsigned short int var_1_18 = 10000; [L35] signed short int var_1_20 = 4; [L36] signed char var_1_22 = -32; [L37] unsigned long int var_1_23 = 0; [L38] unsigned char last_1_var_1_15 = 8; VAL [isInitial=0, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L112] isInitial = 1 [L113] FCALL initially() [L114] COND TRUE 1 [L115] CALL updateLastVariables() [L105] last_1_var_1_15 = var_1_15 VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L115] RET updateLastVariables() [L116] CALL updateVariables() [L83] var_1_4 = __VERIFIER_nondet_uchar() [L84] CALL assume_abort_if_not(var_1_4 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L84] RET assume_abort_if_not(var_1_4 >= 1) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L85] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L85] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L86] var_1_5 = __VERIFIER_nondet_uchar() [L87] CALL assume_abort_if_not(var_1_5 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L87] RET assume_abort_if_not(var_1_5 >= 1) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L88] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L88] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L89] var_1_11 = __VERIFIER_nondet_char() [L90] CALL assume_abort_if_not(var_1_11 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L90] RET assume_abort_if_not(var_1_11 >= -127) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L91] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L91] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L92] var_1_12 = __VERIFIER_nondet_char() [L93] CALL assume_abort_if_not(var_1_12 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L93] RET assume_abort_if_not(var_1_12 >= -127) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L94] CALL assume_abort_if_not(var_1_12 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L94] RET assume_abort_if_not(var_1_12 <= 126) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L95] var_1_14 = __VERIFIER_nondet_float() [L96] CALL assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L96] RET assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L97] var_1_16 = __VERIFIER_nondet_uchar() [L98] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L98] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L99] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=2, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=2, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L99] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=2, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L100] var_1_18 = __VERIFIER_nondet_ushort() [L101] CALL assume_abort_if_not(var_1_18 >= 8192) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=2, var_1_17=2, var_1_18=139265, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=2, var_1_17=2, var_1_18=139265, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L101] RET assume_abort_if_not(var_1_18 >= 8192) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=2, var_1_17=2, var_1_18=139265, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L102] CALL assume_abort_if_not(var_1_18 <= 16384) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=2, var_1_17=2, var_1_18=139265, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=2, var_1_17=2, var_1_18=139265, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L102] RET assume_abort_if_not(var_1_18 <= 16384) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=2, var_1_17=2, var_1_18=139265, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L116] RET updateVariables() [L117] CALL step() [L42] COND FALSE !((! var_1_5) || (var_1_12 < last_1_var_1_15)) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=2, var_1_17=2, var_1_18=139265, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L49] COND FALSE !((127.35 + var_1_13) <= var_1_13) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=2, var_1_17=2, var_1_18=139265, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L54] var_1_22 = 1 [L55] var_1_23 = var_1_22 VAL [isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=2, var_1_17=2, var_1_18=139265, var_1_1=0, var_1_20=4, var_1_22=1, var_1_23=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L56] COND TRUE (- var_1_13) > 31.9f [L57] var_1_1 = ((var_1_6 || var_1_4) && var_1_5) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=2, var_1_17=2, var_1_18=139265, var_1_1=1, var_1_20=4, var_1_22=1, var_1_23=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L61] COND TRUE \read(var_1_1) [L62] var_1_15 = var_1_16 VAL [isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=2, var_1_16=2, var_1_17=2, var_1_18=139265, var_1_1=1, var_1_20=4, var_1_22=1, var_1_23=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L64] COND TRUE var_1_15 > var_1_23 [L65] var_1_8 = ((((var_1_11) < (var_1_12)) ? (var_1_11) : (var_1_12))) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=2, var_1_16=2, var_1_17=2, var_1_18=139265, var_1_1=1, var_1_20=4, var_1_22=1, var_1_23=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=8] [L67] COND TRUE var_1_1 || (var_1_23 < var_1_15) [L68] var_1_17 = (var_1_15 + ((var_1_18 - var_1_16) + var_1_15)) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=2, var_1_16=2, var_1_17=8195, var_1_18=139265, var_1_1=1, var_1_20=4, var_1_22=1, var_1_23=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=8] [L72] COND FALSE !(((var_1_15 / var_1_18) * var_1_15) < -10) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=2, var_1_16=2, var_1_17=8195, var_1_18=139265, var_1_1=1, var_1_20=4, var_1_22=1, var_1_23=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=8] [L75] COND FALSE !(! (var_1_17 <= var_1_17)) [L78] var_1_20 = var_1_12 VAL [isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=2, var_1_16=2, var_1_17=8195, var_1_18=139265, var_1_1=1, var_1_20=8, var_1_22=1, var_1_23=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=8] [L117] RET step() [L118] CALL, EXPR property() [L108-L109] return ((((((((((- var_1_13) > 31.9f) ? (var_1_1 == ((unsigned char) ((var_1_6 || var_1_4) && var_1_5))) : (var_1_1 == ((unsigned char) var_1_5))) && (((127.35 + var_1_13) <= var_1_13) ? ((4.5 <= (var_1_13 * var_1_13)) ? (var_1_6 == ((unsigned char) var_1_5)) : 1) : 1)) && ((var_1_15 > var_1_23) ? (var_1_8 == ((signed char) ((((var_1_11) < (var_1_12)) ? (var_1_11) : (var_1_12))))) : 1)) && (((! var_1_5) || (var_1_12 < last_1_var_1_15)) ? ((! var_1_5) ? (var_1_13 == ((float) var_1_14)) : (var_1_13 == ((float) var_1_14))) : 1)) && (var_1_1 ? (var_1_15 == ((unsigned char) var_1_16)) : 1)) && ((var_1_1 || (var_1_23 < var_1_15)) ? (var_1_17 == ((unsigned short int) (var_1_15 + ((var_1_18 - var_1_16) + var_1_15)))) : (var_1_17 == ((unsigned short int) (var_1_16 + var_1_18))))) && ((((var_1_15 / var_1_18) * var_1_15) < -10) ? (var_1_20 == ((signed short int) ((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16))))) : ((! (var_1_17 <= var_1_17)) ? (var_1_20 == ((signed short int) var_1_11)) : (var_1_20 == ((signed short int) var_1_12))))) && (var_1_22 == ((signed char) 1))) && (var_1_23 == ((unsigned long int) var_1_22)) ; VAL [\result=0, isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=2, var_1_16=2, var_1_17=8195, var_1_18=139265, var_1_1=1, var_1_20=8, var_1_22=1, var_1_23=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=8] [L118] RET, EXPR property() [L118] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=2, var_1_16=2, var_1_17=8195, var_1_18=139265, var_1_1=1, var_1_20=8, var_1_22=1, var_1_23=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=8] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=2, var_1_16=2, var_1_17=8195, var_1_18=139265, var_1_1=1, var_1_20=8, var_1_22=1, var_1_23=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 49 locations, 86 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.2s, OverallIterations: 3, TraceHistogramMax: 13, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 111 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 89 mSDsluCounter, 208 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 94 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 123 IncrementalHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 114 mSDtfsCounter, 123 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 198 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred in iteration=2, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 7 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 536 NumberOfCodeBlocks, 536 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 264 ConstructedInterpolants, 0 QuantifiedInterpolants, 340 SizeOfPredicates, 3 NumberOfNonLiveVariables, 448 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 909/936 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 09:48:46,258 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_codestructure_dependencies_file-41.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 db5cf358c364cfe65a71e13a4e5a4cda1dfcc7eb4e0976a026f41ab20e8c8e5f --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 09:48:47,974 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 09:48:48,039 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 09:48:48,043 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 09:48:48,044 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 09:48:48,063 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 09:48:48,064 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 09:48:48,064 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 09:48:48,064 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 09:48:48,064 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 09:48:48,064 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 09:48:48,064 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 09:48:48,064 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 09:48:48,064 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 09:48:48,064 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 09:48:48,065 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 09:48:48,065 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 09:48:48,065 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 09:48:48,065 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 09:48:48,065 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 09:48:48,065 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 09:48:48,065 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 09:48:48,065 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 09:48:48,065 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 09:48:48,065 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 09:48:48,065 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 09:48:48,065 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 09:48:48,065 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 09:48:48,065 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 09:48:48,065 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 09:48:48,065 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 09:48:48,065 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 09:48:48,065 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 09:48:48,066 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 09:48:48,066 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:48:48,066 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 09:48:48,066 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 09:48:48,066 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 09:48:48,066 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 09:48:48,066 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 09:48:48,066 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 09:48:48,066 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 09:48:48,066 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 09:48:48,066 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 09:48:48,066 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 09:48:48,066 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 -> db5cf358c364cfe65a71e13a4e5a4cda1dfcc7eb4e0976a026f41ab20e8c8e5f [2025-03-08 09:48:48,354 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 09:48:48,361 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 09:48:48,364 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 09:48:48,365 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 09:48:48,365 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 09:48:48,367 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-41.i [2025-03-08 09:48:49,470 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ec4b1bbb/9c8c475dbc7b46a9b87127c71718e595/FLAG0163e82fd [2025-03-08 09:48:49,665 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 09:48:49,666 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-41.i [2025-03-08 09:48:49,671 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ec4b1bbb/9c8c475dbc7b46a9b87127c71718e595/FLAG0163e82fd [2025-03-08 09:48:50,040 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ec4b1bbb/9c8c475dbc7b46a9b87127c71718e595 [2025-03-08 09:48:50,042 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 09:48:50,042 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 09:48:50,043 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 09:48:50,043 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 09:48:50,046 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 09:48:50,047 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:48:50" (1/1) ... [2025-03-08 09:48:50,047 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b8236e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:48:50, skipping insertion in model container [2025-03-08 09:48:50,047 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:48:50" (1/1) ... [2025-03-08 09:48:50,057 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 09:48:50,144 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_codestructure_dependencies_file-41.i[919,932] [2025-03-08 09:48:50,176 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:48:50,185 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 09:48:50,193 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_codestructure_dependencies_file-41.i[919,932] [2025-03-08 09:48:50,211 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:48:50,223 INFO L204 MainTranslator]: Completed translation [2025-03-08 09:48:50,224 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:48:50 WrapperNode [2025-03-08 09:48:50,224 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 09:48:50,225 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 09:48:50,225 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 09:48:50,225 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 09:48:50,228 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:48:50" (1/1) ... [2025-03-08 09:48:50,234 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:48:50" (1/1) ... [2025-03-08 09:48:50,249 INFO L138 Inliner]: procedures = 27, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 107 [2025-03-08 09:48:50,250 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 09:48:50,250 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 09:48:50,250 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 09:48:50,250 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 09:48:50,256 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:48:50" (1/1) ... [2025-03-08 09:48:50,256 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:48:50" (1/1) ... [2025-03-08 09:48:50,258 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:48:50" (1/1) ... [2025-03-08 09:48:50,266 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 09:48:50,266 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:48:50" (1/1) ... [2025-03-08 09:48:50,266 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:48:50" (1/1) ... [2025-03-08 09:48:50,274 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:48:50" (1/1) ... [2025-03-08 09:48:50,275 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:48:50" (1/1) ... [2025-03-08 09:48:50,278 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:48:50" (1/1) ... [2025-03-08 09:48:50,278 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:48:50" (1/1) ... [2025-03-08 09:48:50,280 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 09:48:50,281 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 09:48:50,281 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 09:48:50,281 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 09:48:50,282 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:48:50" (1/1) ... [2025-03-08 09:48:50,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:48:50,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:48:50,305 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 09:48:50,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 09:48:50,323 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 09:48:50,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 09:48:50,323 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 09:48:50,323 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 09:48:50,323 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 09:48:50,323 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 09:48:50,383 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 09:48:50,384 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 09:48:52,828 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-08 09:48:52,828 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 09:48:52,834 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 09:48:52,834 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 09:48:52,835 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:48:52 BoogieIcfgContainer [2025-03-08 09:48:52,835 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 09:48:52,836 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 09:48:52,836 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 09:48:52,839 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 09:48:52,839 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:48:50" (1/3) ... [2025-03-08 09:48:52,840 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a71c2b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:48:52, skipping insertion in model container [2025-03-08 09:48:52,840 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:48:50" (2/3) ... [2025-03-08 09:48:52,840 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a71c2b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:48:52, skipping insertion in model container [2025-03-08 09:48:52,840 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:48:52" (3/3) ... [2025-03-08 09:48:52,841 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-41.i [2025-03-08 09:48:52,849 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 09:48:52,850 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_dependencies_file-41.i that has 2 procedures, 49 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 09:48:52,887 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 09:48:52,895 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;@6b7e12b9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 09:48:52,895 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 09:48:52,897 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 33 states have (on average 1.4242424242424243) internal successors, (47), 34 states have internal predecessors, (47), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-08 09:48:52,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-08 09:48:52,903 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:48:52,904 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:48:52,904 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:48:52,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:48:52,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1599799210, now seen corresponding path program 1 times [2025-03-08 09:48:52,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 09:48:52,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [259278733] [2025-03-08 09:48:52,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:48:52,916 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 09:48:52,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 09:48:52,918 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 09:48:52,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-08 09:48:52,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-08 09:48:53,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-08 09:48:53,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:48:53,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:48:53,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 09:48:53,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:48:53,174 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2025-03-08 09:48:53,174 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 09:48:53,174 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 09:48:53,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [259278733] [2025-03-08 09:48:53,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [259278733] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:48:53,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:48:53,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 09:48:53,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121087293] [2025-03-08 09:48:53,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:48:53,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 09:48:53,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 09:48:53,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 09:48:53,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 09:48:53,193 INFO L87 Difference]: Start difference. First operand has 49 states, 33 states have (on average 1.4242424242424243) internal successors, (47), 34 states have internal predecessors, (47), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 09:48:53,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:48:53,223 INFO L93 Difference]: Finished difference Result 92 states and 154 transitions. [2025-03-08 09:48:53,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 09:48:53,224 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 89 [2025-03-08 09:48:53,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:48:53,228 INFO L225 Difference]: With dead ends: 92 [2025-03-08 09:48:53,228 INFO L226 Difference]: Without dead ends: 46 [2025-03-08 09:48:53,230 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 09:48:53,231 INFO L435 NwaCegarLoop]: 67 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, 67 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 09:48:53,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 09:48:53,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-08 09:48:53,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-03-08 09:48:53,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-08 09:48:53,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 67 transitions. [2025-03-08 09:48:53,253 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 67 transitions. Word has length 89 [2025-03-08 09:48:53,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:48:53,253 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 67 transitions. [2025-03-08 09:48:53,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 09:48:53,253 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 67 transitions. [2025-03-08 09:48:53,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-08 09:48:53,255 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:48:53,255 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:48:53,263 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-08 09:48:53,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 09:48:53,456 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:48:53,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:48:53,456 INFO L85 PathProgramCache]: Analyzing trace with hash 541919477, now seen corresponding path program 1 times [2025-03-08 09:48:53,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 09:48:53,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1161122144] [2025-03-08 09:48:53,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:48:53,457 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 09:48:53,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 09:48:53,459 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 09:48:53,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-08 09:48:53,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-08 09:48:53,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-08 09:48:53,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:48:53,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:48:53,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 09:48:53,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:48:54,330 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-08 09:48:54,330 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 09:48:54,330 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 09:48:54,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1161122144] [2025-03-08 09:48:54,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1161122144] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:48:54,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:48:54,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 09:48:54,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714490119] [2025-03-08 09:48:54,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:48:54,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 09:48:54,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 09:48:54,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 09:48:54,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 09:48:54,333 INFO L87 Difference]: Start difference. First operand 46 states and 67 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 09:48:56,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:48:56,700 INFO L93 Difference]: Finished difference Result 131 states and 193 transitions. [2025-03-08 09:48:56,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 09:48:56,701 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 89 [2025-03-08 09:48:56,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:48:56,703 INFO L225 Difference]: With dead ends: 131 [2025-03-08 09:48:56,703 INFO L226 Difference]: Without dead ends: 88 [2025-03-08 09:48:56,703 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 09:48:56,704 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 17 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-08 09:48:56,704 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 117 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-08 09:48:56,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-08 09:48:56,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 85. [2025-03-08 09:48:56,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 56 states have (on average 1.2857142857142858) internal successors, (72), 56 states have internal predecessors, (72), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-08 09:48:56,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 124 transitions. [2025-03-08 09:48:56,713 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 124 transitions. Word has length 89 [2025-03-08 09:48:56,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:48:56,713 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 124 transitions. [2025-03-08 09:48:56,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 09:48:56,713 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 124 transitions. [2025-03-08 09:48:56,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-08 09:48:56,715 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:48:56,715 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:48:56,724 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2025-03-08 09:48:56,916 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-08 09:48:56,916 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:48:56,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:48:56,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1265534986, now seen corresponding path program 1 times [2025-03-08 09:48:56,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 09:48:56,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1057851953] [2025-03-08 09:48:56,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:48:56,917 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 09:48:56,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 09:48:56,919 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-08 09:48:56,920 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-08 09:48:56,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-08 09:48:57,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-08 09:48:57,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:48:57,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:48:57,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-08 09:48:57,115 INFO L279 TraceCheckSpWp]: Computing forward predicates...