./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-68.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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_steplocals_file-68.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 d848ed00fc0d485481470376dd76caee8f421720e20ea964be77cc23ea1203a7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 23:23:15,930 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 23:23:15,983 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 23:23:15,989 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 23:23:15,991 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 23:23:16,010 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 23:23:16,010 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 23:23:16,011 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 23:23:16,012 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 23:23:16,012 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 23:23:16,013 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 23:23:16,013 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 23:23:16,013 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 23:23:16,013 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 23:23:16,013 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 23:23:16,014 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 23:23:16,014 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 23:23:16,014 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 23:23:16,014 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 23:23:16,014 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 23:23:16,014 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 23:23:16,014 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 23:23:16,014 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 23:23:16,014 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 23:23:16,014 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 23:23:16,015 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 23:23:16,015 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 23:23:16,015 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 23:23:16,015 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 23:23:16,015 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 23:23:16,015 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 23:23:16,015 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 23:23:16,015 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:23:16,015 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 23:23:16,016 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 23:23:16,016 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 23:23:16,016 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 23:23:16,016 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 23:23:16,016 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 23:23:16,016 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 23:23:16,016 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 23:23:16,016 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 23:23:16,016 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 23:23:16,016 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 -> d848ed00fc0d485481470376dd76caee8f421720e20ea964be77cc23ea1203a7 [2025-03-16 23:23:16,234 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 23:23:16,239 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 23:23:16,242 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 23:23:16,242 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 23:23:16,243 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 23:23:16,243 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-68.i [2025-03-16 23:23:17,355 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60740098f/59022b4d023247d4af02ad5929341159/FLAGfc757023b [2025-03-16 23:23:17,604 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 23:23:17,605 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-68.i [2025-03-16 23:23:17,615 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60740098f/59022b4d023247d4af02ad5929341159/FLAGfc757023b [2025-03-16 23:23:17,926 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60740098f/59022b4d023247d4af02ad5929341159 [2025-03-16 23:23:17,928 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 23:23:17,929 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 23:23:17,931 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 23:23:17,932 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 23:23:17,935 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 23:23:17,935 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:23:17" (1/1) ... [2025-03-16 23:23:17,936 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61bc8c13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:23:17, skipping insertion in model container [2025-03-16 23:23:17,936 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:23:17" (1/1) ... [2025-03-16 23:23:17,949 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 23:23:18,042 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_steplocals_file-68.i[917,930] [2025-03-16 23:23:18,098 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:23:18,111 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 23:23:18,118 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_steplocals_file-68.i[917,930] [2025-03-16 23:23:18,148 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:23:18,165 INFO L204 MainTranslator]: Completed translation [2025-03-16 23:23:18,165 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:23:18 WrapperNode [2025-03-16 23:23:18,166 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 23:23:18,167 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 23:23:18,167 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 23:23:18,167 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 23:23:18,171 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:23:18" (1/1) ... [2025-03-16 23:23:18,178 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:23:18" (1/1) ... [2025-03-16 23:23:18,203 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 140 [2025-03-16 23:23:18,204 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 23:23:18,204 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 23:23:18,204 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 23:23:18,204 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 23:23:18,211 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:23:18" (1/1) ... [2025-03-16 23:23:18,211 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:23:18" (1/1) ... [2025-03-16 23:23:18,213 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:23:18" (1/1) ... [2025-03-16 23:23:18,232 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-16 23:23:18,232 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:23:18" (1/1) ... [2025-03-16 23:23:18,232 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:23:18" (1/1) ... [2025-03-16 23:23:18,240 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:23:18" (1/1) ... [2025-03-16 23:23:18,244 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:23:18" (1/1) ... [2025-03-16 23:23:18,245 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:23:18" (1/1) ... [2025-03-16 23:23:18,250 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:23:18" (1/1) ... [2025-03-16 23:23:18,254 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 23:23:18,255 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 23:23:18,256 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 23:23:18,256 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 23:23:18,257 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:23:18" (1/1) ... [2025-03-16 23:23:18,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:23:18,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:23:18,280 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-16 23:23:18,285 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-16 23:23:18,300 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 23:23:18,300 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 23:23:18,300 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 23:23:18,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 23:23:18,300 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 23:23:18,300 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 23:23:18,350 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 23:23:18,352 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 23:23:18,610 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L118: havoc property_#t~bitwise13#1; [2025-03-16 23:23:18,632 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-03-16 23:23:18,633 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 23:23:18,643 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 23:23:18,644 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 23:23:18,644 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:23:18 BoogieIcfgContainer [2025-03-16 23:23:18,644 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 23:23:18,646 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 23:23:18,646 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 23:23:18,649 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 23:23:18,649 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 11:23:17" (1/3) ... [2025-03-16 23:23:18,650 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52651f29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:23:18, skipping insertion in model container [2025-03-16 23:23:18,650 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:23:18" (2/3) ... [2025-03-16 23:23:18,650 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52651f29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:23:18, skipping insertion in model container [2025-03-16 23:23:18,650 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:23:18" (3/3) ... [2025-03-16 23:23:18,651 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-68.i [2025-03-16 23:23:18,662 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 23:23:18,663 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_steplocals_file-68.i that has 2 procedures, 61 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 23:23:18,707 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 23:23:18,715 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;@5a18481a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 23:23:18,715 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 23:23:18,718 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 42 states have (on average 1.4761904761904763) internal successors, (62), 43 states have internal predecessors, (62), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-16 23:23:18,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-16 23:23:18,726 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:23:18,727 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:23:18,727 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:23:18,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:23:18,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1486919801, now seen corresponding path program 1 times [2025-03-16 23:23:18,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:23:18,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698031015] [2025-03-16 23:23:18,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:23:18,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:23:18,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-16 23:23:18,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-16 23:23:18,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:23:18,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:23:18,906 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-16 23:23:18,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:23:18,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698031015] [2025-03-16 23:23:18,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698031015] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 23:23:18,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2060929106] [2025-03-16 23:23:18,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:23:18,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 23:23:18,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:23:18,911 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-16 23:23:18,913 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-16 23:23:18,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-16 23:23:19,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-16 23:23:19,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:23:19,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:23:19,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-16 23:23:19,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:23:19,040 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-16 23:23:19,041 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 23:23:19,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2060929106] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:23:19,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 23:23:19,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-16 23:23:19,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685058724] [2025-03-16 23:23:19,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:23:19,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 23:23:19,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:23:19,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 23:23:19,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 23:23:19,062 INFO L87 Difference]: Start difference. First operand has 61 states, 42 states have (on average 1.4761904761904763) internal successors, (62), 43 states have internal predecessors, (62), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-16 23:23:19,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:23:19,079 INFO L93 Difference]: Finished difference Result 119 states and 202 transitions. [2025-03-16 23:23:19,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 23:23:19,081 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 107 [2025-03-16 23:23:19,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:23:19,085 INFO L225 Difference]: With dead ends: 119 [2025-03-16 23:23:19,085 INFO L226 Difference]: Without dead ends: 59 [2025-03-16 23:23:19,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 108 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-16 23:23:19,088 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 23:23:19,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 23:23:19,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-16 23:23:19,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-03-16 23:23:19,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 41 states have (on average 1.4146341463414633) internal successors, (58), 41 states have internal predecessors, (58), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-16 23:23:19,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 90 transitions. [2025-03-16 23:23:19,119 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 90 transitions. Word has length 107 [2025-03-16 23:23:19,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:23:19,120 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 90 transitions. [2025-03-16 23:23:19,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-16 23:23:19,120 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 90 transitions. [2025-03-16 23:23:19,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-16 23:23:19,124 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:23:19,125 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:23:19,131 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 23:23:19,325 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-16 23:23:19,326 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:23:19,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:23:19,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1142500969, now seen corresponding path program 1 times [2025-03-16 23:23:19,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:23:19,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280206811] [2025-03-16 23:23:19,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:23:19,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:23:19,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-16 23:23:19,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-16 23:23:19,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:23:19,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:23:19,555 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-16 23:23:19,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:23:19,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280206811] [2025-03-16 23:23:19,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280206811] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:23:19,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:23:19,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 23:23:19,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877055067] [2025-03-16 23:23:19,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:23:19,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 23:23:19,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:23:19,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 23:23:19,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 23:23:19,558 INFO L87 Difference]: Start difference. First operand 59 states and 90 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-16 23:23:19,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:23:19,596 INFO L93 Difference]: Finished difference Result 117 states and 179 transitions. [2025-03-16 23:23:19,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 23:23:19,597 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 107 [2025-03-16 23:23:19,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:23:19,598 INFO L225 Difference]: With dead ends: 117 [2025-03-16 23:23:19,598 INFO L226 Difference]: Without dead ends: 59 [2025-03-16 23:23:19,599 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-16 23:23:19,599 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 0 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 23:23:19,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 153 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 23:23:19,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-16 23:23:19,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-03-16 23:23:19,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 41 states have internal predecessors, (57), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-16 23:23:19,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 89 transitions. [2025-03-16 23:23:19,608 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 89 transitions. Word has length 107 [2025-03-16 23:23:19,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:23:19,608 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 89 transitions. [2025-03-16 23:23:19,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-16 23:23:19,609 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 89 transitions. [2025-03-16 23:23:19,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-16 23:23:19,609 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:23:19,610 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:23:19,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 23:23:19,610 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:23:19,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:23:19,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1422494037, now seen corresponding path program 1 times [2025-03-16 23:23:19,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:23:19,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597289715] [2025-03-16 23:23:19,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:23:19,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:23:19,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-16 23:23:19,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-16 23:23:19,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:23:19,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:23:19,889 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 21 proven. 24 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-16 23:23:19,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:23:19,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597289715] [2025-03-16 23:23:19,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597289715] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 23:23:19,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [353479989] [2025-03-16 23:23:19,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:23:19,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 23:23:19,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:23:19,892 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-16 23:23:19,893 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-16 23:23:19,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-16 23:23:19,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-16 23:23:19,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:23:19,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:23:19,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-16 23:23:19,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:23:20,095 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 253 proven. 24 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2025-03-16 23:23:20,096 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 23:23:20,265 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 21 proven. 24 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-16 23:23:20,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [353479989] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 23:23:20,266 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 23:23:20,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-16 23:23:20,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503189846] [2025-03-16 23:23:20,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 23:23:20,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 23:23:20,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:23:20,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 23:23:20,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 23:23:20,268 INFO L87 Difference]: Start difference. First operand 59 states and 89 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-16 23:23:20,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:23:20,422 INFO L93 Difference]: Finished difference Result 125 states and 184 transitions. [2025-03-16 23:23:20,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 23:23:20,424 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 108 [2025-03-16 23:23:20,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:23:20,425 INFO L225 Difference]: With dead ends: 125 [2025-03-16 23:23:20,425 INFO L226 Difference]: Without dead ends: 67 [2025-03-16 23:23:20,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 213 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-16 23:23:20,426 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 126 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 23:23:20,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 157 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 23:23:20,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-16 23:23:20,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 63. [2025-03-16 23:23:20,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 44 states have internal predecessors, (59), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-16 23:23:20,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 91 transitions. [2025-03-16 23:23:20,441 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 91 transitions. Word has length 108 [2025-03-16 23:23:20,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:23:20,441 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 91 transitions. [2025-03-16 23:23:20,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-16 23:23:20,441 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 91 transitions. [2025-03-16 23:23:20,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-16 23:23:20,443 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:23:20,443 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:23:20,453 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-16 23:23:20,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-16 23:23:20,644 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:23:20,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:23:20,645 INFO L85 PathProgramCache]: Analyzing trace with hash 374457322, now seen corresponding path program 1 times [2025-03-16 23:23:20,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:23:20,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367755431] [2025-03-16 23:23:20,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:23:20,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:23:20,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-16 23:23:20,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-16 23:23:20,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:23:20,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:23:21,066 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-16 23:23:21,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:23:21,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367755431] [2025-03-16 23:23:21,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367755431] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:23:21,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:23:21,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 23:23:21,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728474383] [2025-03-16 23:23:21,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:23:21,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 23:23:21,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:23:21,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 23:23:21,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 23:23:21,069 INFO L87 Difference]: Start difference. First operand 63 states and 91 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-16 23:23:21,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:23:21,134 INFO L93 Difference]: Finished difference Result 129 states and 184 transitions. [2025-03-16 23:23:21,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 23:23:21,135 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 108 [2025-03-16 23:23:21,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:23:21,136 INFO L225 Difference]: With dead ends: 129 [2025-03-16 23:23:21,136 INFO L226 Difference]: Without dead ends: 67 [2025-03-16 23:23:21,136 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 23:23:21,136 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 44 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 23:23:21,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 180 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 23:23:21,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-16 23:23:21,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-03-16 23:23:21,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 47 states have (on average 1.297872340425532) internal successors, (61), 47 states have internal predecessors, (61), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-16 23:23:21,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 93 transitions. [2025-03-16 23:23:21,148 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 93 transitions. Word has length 108 [2025-03-16 23:23:21,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:23:21,148 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 93 transitions. [2025-03-16 23:23:21,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-16 23:23:21,148 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 93 transitions. [2025-03-16 23:23:21,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-16 23:23:21,149 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:23:21,150 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:23:21,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 23:23:21,151 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:23:21,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:23:21,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1372728683, now seen corresponding path program 1 times [2025-03-16 23:23:21,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:23:21,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343292466] [2025-03-16 23:23:21,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:23:21,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:23:21,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-16 23:23:21,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-16 23:23:21,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:23:21,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-16 23:23:21,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1414171594] [2025-03-16 23:23:21,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:23:21,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 23:23:21,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:23:21,213 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-16 23:23:21,214 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-16 23:23:21,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-16 23:23:21,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-16 23:23:21,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:23:21,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 23:23:21,294 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-16 23:23:21,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-16 23:23:21,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-16 23:23:21,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:23:21,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 23:23:21,359 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-16 23:23:21,360 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-16 23:23:21,360 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 23:23:21,369 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-16 23:23:21,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 23:23:21,564 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-16 23:23:21,617 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 23:23:21,619 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 11:23:21 BoogieIcfgContainer [2025-03-16 23:23:21,619 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 23:23:21,620 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 23:23:21,620 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 23:23:21,620 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 23:23:21,620 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:23:18" (3/4) ... [2025-03-16 23:23:21,622 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-16 23:23:21,622 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 23:23:21,623 INFO L158 Benchmark]: Toolchain (without parser) took 3693.33ms. Allocated memory is still 142.6MB. Free memory was 111.6MB in the beginning and 85.9MB in the end (delta: 25.7MB). Peak memory consumption was 28.1MB. Max. memory is 16.1GB. [2025-03-16 23:23:21,624 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 123.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 23:23:21,624 INFO L158 Benchmark]: CACSL2BoogieTranslator took 235.26ms. Allocated memory is still 142.6MB. Free memory was 111.1MB in the beginning and 97.5MB in the end (delta: 13.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 23:23:21,624 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.88ms. Allocated memory is still 142.6MB. Free memory was 97.5MB in the beginning and 94.1MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 23:23:21,624 INFO L158 Benchmark]: Boogie Preprocessor took 50.67ms. Allocated memory is still 142.6MB. Free memory was 93.6MB in the beginning and 89.7MB in the end (delta: 3.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 23:23:21,625 INFO L158 Benchmark]: IcfgBuilder took 389.00ms. Allocated memory is still 142.6MB. Free memory was 89.7MB in the beginning and 65.1MB in the end (delta: 24.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 23:23:21,625 INFO L158 Benchmark]: TraceAbstraction took 2973.23ms. Allocated memory is still 142.6MB. Free memory was 64.5MB in the beginning and 87.3MB in the end (delta: -22.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 23:23:21,626 INFO L158 Benchmark]: Witness Printer took 2.60ms. Allocated memory is still 142.6MB. Free memory was 87.3MB in the beginning and 85.9MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 23:23:21,626 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.19ms. Allocated memory is still 201.3MB. Free memory is still 123.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 235.26ms. Allocated memory is still 142.6MB. Free memory was 111.1MB in the beginning and 97.5MB in the end (delta: 13.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.88ms. Allocated memory is still 142.6MB. Free memory was 97.5MB in the beginning and 94.1MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 50.67ms. Allocated memory is still 142.6MB. Free memory was 93.6MB in the beginning and 89.7MB in the end (delta: 3.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 389.00ms. Allocated memory is still 142.6MB. Free memory was 89.7MB in the beginning and 65.1MB in the end (delta: 24.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2973.23ms. Allocated memory is still 142.6MB. Free memory was 64.5MB in the beginning and 87.3MB in the end (delta: -22.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.60ms. Allocated memory is still 142.6MB. Free memory was 87.3MB in the beginning and 85.9MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. 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 118, overapproximation of someBinaryDOUBLEComparisonOperation at line 118, overapproximation of someBinaryDOUBLEComparisonOperation at line 110, overapproximation of someBinaryDOUBLEComparisonOperation at line 65. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_2 = 10; [L24] unsigned char var_1_3 = 25; [L25] unsigned char var_1_4 = 16; [L26] unsigned char var_1_5 = 0; [L27] unsigned char var_1_6 = 0; [L28] unsigned char var_1_7 = 1; [L29] unsigned char var_1_8 = 32; [L30] double var_1_9 = 4.6; [L31] double var_1_10 = 9.25; [L32] double var_1_11 = 1.25; [L33] unsigned char var_1_12 = 100; [L34] unsigned char var_1_13 = 64; [L35] unsigned char var_1_14 = 0; [L36] float var_1_15 = 7.5; [L37] signed long int var_1_16 = 0; [L122] isInitial = 1 [L123] FCALL initially() [L124] COND TRUE 1 [L125] FCALL updateLastVariables() [L126] CALL updateVariables() [L90] var_1_2 = __VERIFIER_nondet_uchar() [L91] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_3=25, var_1_4=16, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_3=25, var_1_4=16, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L91] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_3=25, var_1_4=16, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L92] CALL assume_abort_if_not(var_1_2 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_3=25, var_1_4=16, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_3=25, var_1_4=16, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L92] RET assume_abort_if_not(var_1_2 <= 255) VAL [isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_3=25, var_1_4=16, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L93] var_1_3 = __VERIFIER_nondet_uchar() [L94] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_4=16, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_4=16, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L94] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_4=16, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L95] CALL assume_abort_if_not(var_1_3 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_4=16, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_4=16, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L95] RET assume_abort_if_not(var_1_3 <= 255) VAL [isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_4=16, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L96] var_1_4 = __VERIFIER_nondet_uchar() [L97] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L97] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L98] CALL assume_abort_if_not(var_1_4 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L98] RET assume_abort_if_not(var_1_4 <= 255) VAL [isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L99] var_1_5 = __VERIFIER_nondet_uchar() [L100] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L100] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L101] CALL assume_abort_if_not(var_1_5 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L101] RET assume_abort_if_not(var_1_5 <= 0) VAL [isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L102] var_1_7 = __VERIFIER_nondet_uchar() [L103] CALL assume_abort_if_not(var_1_7 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L103] RET assume_abort_if_not(var_1_7 >= 1) VAL [isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L104] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L104] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L105] var_1_8 = __VERIFIER_nondet_uchar() [L106] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L106] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L107] CALL assume_abort_if_not(var_1_8 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L107] RET assume_abort_if_not(var_1_8 <= 255) VAL [isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L108] CALL assume_abort_if_not(var_1_8 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=23/5] [L108] RET assume_abort_if_not(var_1_8 != 0) VAL [isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=23/5] [L109] var_1_10 = __VERIFIER_nondet_double() [L110] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=23/5] [L110] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=23/5] [L111] var_1_13 = __VERIFIER_nondet_uchar() [L112] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=5/4, var_1_12=100, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=5/4, var_1_12=100, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=23/5] [L112] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_11=5/4, var_1_12=100, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=23/5] [L113] CALL assume_abort_if_not(var_1_13 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_11=5/4, var_1_12=100, var_1_13=1, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=5/4, var_1_12=100, var_1_13=1, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=23/5] [L113] RET assume_abort_if_not(var_1_13 <= 254) VAL [isInitial=1, var_1_11=5/4, var_1_12=100, var_1_13=1, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=23/5] [L126] RET updateVariables() [L127] CALL step() [L41] unsigned char stepLocal_0 = var_1_2; VAL [isInitial=1, stepLocal_0=0, var_1_11=5/4, var_1_12=100, var_1_13=1, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_2=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=23/5] [L42] EXPR var_1_3 ^ var_1_4 VAL [isInitial=1, stepLocal_0=0, var_1_11=5/4, var_1_12=100, var_1_13=1, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_2=0, var_1_3=0, var_1_4=-255, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=23/5] [L42] COND TRUE stepLocal_0 <= (var_1_3 ^ var_1_4) [L43] var_1_1 = (! var_1_5) VAL [isInitial=1, var_1_11=5/4, var_1_12=100, var_1_13=1, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_2=0, var_1_3=0, var_1_4=-255, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=23/5] [L47] unsigned char stepLocal_2 = (var_1_5 && var_1_7) && var_1_1; [L48] signed long int stepLocal_1 = -256; VAL [isInitial=1, stepLocal_1=-256, stepLocal_2=0, var_1_11=5/4, var_1_12=100, var_1_13=1, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_2=0, var_1_3=0, var_1_4=-255, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=23/5] [L49] COND FALSE !(stepLocal_1 >= var_1_3) VAL [isInitial=1, stepLocal_2=0, var_1_11=5/4, var_1_12=100, var_1_13=1, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_2=0, var_1_3=0, var_1_4=-255, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=23/5] [L52] COND TRUE (var_1_2 < (var_1_4 / var_1_8)) || stepLocal_2 [L53] var_1_6 = var_1_7 VAL [isInitial=1, var_1_11=5/4, var_1_12=100, var_1_13=1, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_2=0, var_1_3=0, var_1_4=-255, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=23/5] [L56] COND TRUE ((((((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3)))) > (var_1_4)) ? (((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3)))) : (var_1_4))) <= (50 * var_1_8) [L57] var_1_9 = var_1_10 VAL [isInitial=1, var_1_10=2, var_1_11=5/4, var_1_12=100, var_1_13=1, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_2=0, var_1_3=0, var_1_4=-255, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=2] [L59] unsigned char stepLocal_3 = var_1_7 && var_1_1; VAL [isInitial=1, stepLocal_3=1, var_1_10=2, var_1_11=5/4, var_1_12=100, var_1_13=1, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_2=0, var_1_3=0, var_1_4=-255, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=2] [L60] COND TRUE stepLocal_3 || (! var_1_5) [L61] var_1_11 = var_1_10 VAL [isInitial=1, var_1_10=2, var_1_11=2, var_1_12=100, var_1_13=1, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_2=0, var_1_3=0, var_1_4=-255, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=2] [L63] unsigned char stepLocal_4 = var_1_3; VAL [isInitial=1, stepLocal_4=0, var_1_10=2, var_1_11=2, var_1_12=100, var_1_13=1, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_2=0, var_1_3=0, var_1_4=-255, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=2] [L64] COND TRUE \read(var_1_1) VAL [isInitial=1, stepLocal_4=0, var_1_10=2, var_1_11=2, var_1_12=100, var_1_13=1, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_2=0, var_1_3=0, var_1_4=-255, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=2] [L65] COND FALSE !(var_1_10 >= (- var_1_9)) [L72] var_1_12 = var_1_13 VAL [isInitial=1, stepLocal_4=0, var_1_10=2, var_1_11=2, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_2=0, var_1_3=0, var_1_4=-255, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=2] [L77] unsigned char stepLocal_6 = var_1_2; [L78] signed long int stepLocal_5 = var_1_13 + 16; VAL [isInitial=1, stepLocal_4=0, stepLocal_5=17, stepLocal_6=0, var_1_10=2, var_1_11=2, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_2=0, var_1_3=0, var_1_4=-255, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=2] [L79] COND FALSE !((var_1_13 % (5u + 256u)) <= stepLocal_6) VAL [isInitial=1, stepLocal_4=0, stepLocal_5=17, var_1_10=2, var_1_11=2, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_2=0, var_1_3=0, var_1_4=-255, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=2] [L86] var_1_15 = var_1_10 [L87] var_1_16 = var_1_3 [L127] RET step() [L128] CALL, EXPR property() [L118] EXPR var_1_3 ^ var_1_4 VAL [isInitial=1, var_1_10=2, var_1_11=2, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=2, var_1_16=0, var_1_1=1, var_1_2=0, var_1_3=0, var_1_4=-255, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=2] [L118-L119] return ((((((((var_1_2 <= (var_1_3 ^ var_1_4)) ? (var_1_1 == ((unsigned char) (! var_1_5))) : (var_1_1 == ((unsigned char) (! var_1_5)))) && ((-256 >= var_1_3) ? (var_1_6 == ((unsigned char) (var_1_1 || var_1_7))) : (((var_1_2 < (var_1_4 / var_1_8)) || ((var_1_5 && var_1_7) && var_1_1)) ? (var_1_6 == ((unsigned char) var_1_7)) : 1))) && ((((((((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3)))) > (var_1_4)) ? (((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3)))) : (var_1_4))) <= (50 * var_1_8)) ? (var_1_9 == ((double) var_1_10)) : 1)) && (((var_1_7 && var_1_1) || (! var_1_5)) ? (var_1_11 == ((double) var_1_10)) : 1)) && (var_1_1 ? ((var_1_10 >= (- var_1_9)) ? ((var_1_8 != var_1_3) ? (var_1_12 == ((unsigned char) var_1_13)) : (var_1_12 == ((unsigned char) 50))) : (var_1_12 == ((unsigned char) var_1_13))) : (var_1_12 == ((unsigned char) var_1_13)))) && (((var_1_13 % (5u + 256u)) <= var_1_2) ? (((var_1_13 + 16) >= var_1_2) ? (var_1_14 == ((unsigned char) var_1_7)) : (var_1_14 == ((unsigned char) var_1_7))) : 1)) && (var_1_15 == ((float) var_1_10))) && (var_1_16 == ((signed long int) var_1_3)) ; [L128] RET, EXPR property() [L128] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=2, var_1_11=2, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=2, var_1_16=0, var_1_1=1, var_1_2=0, var_1_3=0, var_1_4=-255, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=2] [L19] reach_error() VAL [isInitial=1, var_1_10=2, var_1_11=2, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=2, var_1_16=0, var_1_1=1, var_1_2=0, var_1_3=0, var_1_4=-255, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 61 locations, 110 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.9s, OverallIterations: 5, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 176 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 170 mSDsluCounter, 578 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 261 mSDsCounter, 41 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 166 IncrementalHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 41 mSolverCounterUnsat, 317 mSDtfsCounter, 166 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 342 GetRequests, 328 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=67occurred in iteration=4, InterpolantAutomatonStates: 19, 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, 4 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 863 NumberOfCodeBlocks, 863 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 746 ConstructedInterpolants, 0 QuantifiedInterpolants, 1337 SizeOfPredicates, 1 NumberOfNonLiveVariables, 527 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 7 InterpolantComputations, 3 PerfectInterpolantSequences, 3258/3360 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-16 23:23:21,643 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_steplocals_file-68.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 d848ed00fc0d485481470376dd76caee8f421720e20ea964be77cc23ea1203a7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 23:23:23,371 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 23:23:23,438 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-16 23:23:23,442 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 23:23:23,444 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 23:23:23,469 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 23:23:23,469 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 23:23:23,469 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 23:23:23,470 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 23:23:23,470 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 23:23:23,470 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 23:23:23,470 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 23:23:23,471 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 23:23:23,471 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 23:23:23,471 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 23:23:23,471 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 23:23:23,472 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 23:23:23,472 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 23:23:23,472 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 23:23:23,472 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 23:23:23,472 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 23:23:23,472 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 23:23:23,472 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 23:23:23,472 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-16 23:23:23,472 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-16 23:23:23,472 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-16 23:23:23,473 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 23:23:23,473 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 23:23:23,473 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 23:23:23,473 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 23:23:23,473 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 23:23:23,473 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 23:23:23,473 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 23:23:23,473 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 23:23:23,474 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:23:23,474 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 23:23:23,474 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 23:23:23,474 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 23:23:23,474 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 23:23:23,474 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-16 23:23:23,474 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-16 23:23:23,474 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 23:23:23,474 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 23:23:23,474 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 23:23:23,475 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 23:23:23,475 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 -> d848ed00fc0d485481470376dd76caee8f421720e20ea964be77cc23ea1203a7 [2025-03-16 23:23:23,681 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 23:23:23,689 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 23:23:23,690 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 23:23:23,691 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 23:23:23,691 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 23:23:23,692 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-68.i [2025-03-16 23:23:24,853 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6781bd5e/779386a29eba4cec9a4e7c132bfa8574/FLAGb421870cb [2025-03-16 23:23:25,040 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 23:23:25,040 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-68.i [2025-03-16 23:23:25,049 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6781bd5e/779386a29eba4cec9a4e7c132bfa8574/FLAGb421870cb [2025-03-16 23:23:25,422 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6781bd5e/779386a29eba4cec9a4e7c132bfa8574 [2025-03-16 23:23:25,425 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 23:23:25,427 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 23:23:25,428 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 23:23:25,428 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 23:23:25,431 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 23:23:25,431 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:23:25" (1/1) ... [2025-03-16 23:23:25,432 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69950f25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:23:25, skipping insertion in model container [2025-03-16 23:23:25,432 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:23:25" (1/1) ... [2025-03-16 23:23:25,446 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 23:23:25,541 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_steplocals_file-68.i[917,930] [2025-03-16 23:23:25,572 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:23:25,581 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 23:23:25,588 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_steplocals_file-68.i[917,930] [2025-03-16 23:23:25,606 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:23:25,621 INFO L204 MainTranslator]: Completed translation [2025-03-16 23:23:25,621 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:23:25 WrapperNode [2025-03-16 23:23:25,621 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 23:23:25,622 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 23:23:25,622 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 23:23:25,622 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 23:23:25,628 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:23:25" (1/1) ... [2025-03-16 23:23:25,635 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:23:25" (1/1) ... [2025-03-16 23:23:25,653 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 118 [2025-03-16 23:23:25,654 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 23:23:25,654 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 23:23:25,654 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 23:23:25,655 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 23:23:25,660 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:23:25" (1/1) ... [2025-03-16 23:23:25,661 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:23:25" (1/1) ... [2025-03-16 23:23:25,663 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:23:25" (1/1) ... [2025-03-16 23:23:25,681 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-16 23:23:25,682 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:23:25" (1/1) ... [2025-03-16 23:23:25,682 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:23:25" (1/1) ... [2025-03-16 23:23:25,691 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:23:25" (1/1) ... [2025-03-16 23:23:25,696 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:23:25" (1/1) ... [2025-03-16 23:23:25,698 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:23:25" (1/1) ... [2025-03-16 23:23:25,698 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:23:25" (1/1) ... [2025-03-16 23:23:25,700 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 23:23:25,704 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 23:23:25,704 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 23:23:25,704 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 23:23:25,705 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:23:25" (1/1) ... [2025-03-16 23:23:25,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:23:25,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:23:25,738 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-16 23:23:25,742 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-16 23:23:25,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 23:23:25,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-16 23:23:25,762 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 23:23:25,762 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 23:23:25,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 23:23:25,762 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 23:23:25,824 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 23:23:25,826 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 23:23:26,171 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-16 23:23:26,171 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 23:23:26,180 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 23:23:26,180 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 23:23:26,181 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:23:26 BoogieIcfgContainer [2025-03-16 23:23:26,181 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 23:23:26,183 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 23:23:26,183 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 23:23:26,187 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 23:23:26,187 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 11:23:25" (1/3) ... [2025-03-16 23:23:26,188 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28c29667 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:23:26, skipping insertion in model container [2025-03-16 23:23:26,188 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:23:25" (2/3) ... [2025-03-16 23:23:26,188 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28c29667 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:23:26, skipping insertion in model container [2025-03-16 23:23:26,188 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:23:26" (3/3) ... [2025-03-16 23:23:26,189 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-68.i [2025-03-16 23:23:26,198 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 23:23:26,199 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_steplocals_file-68.i that has 2 procedures, 51 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 23:23:26,230 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 23:23:26,237 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;@709d517b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 23:23:26,237 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 23:23:26,240 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 32 states have (on average 1.4375) internal successors, (46), 33 states have internal predecessors, (46), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-16 23:23:26,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-16 23:23:26,247 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:23:26,248 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:23:26,248 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:23:26,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:23:26,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1886592818, now seen corresponding path program 1 times [2025-03-16 23:23:26,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 23:23:26,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1743850026] [2025-03-16 23:23:26,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:23:26,265 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-16 23:23:26,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 23:23:26,267 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-16 23:23:26,270 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-16 23:23:26,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-16 23:23:26,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-16 23:23:26,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:23:26,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:23:26,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-16 23:23:26,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:23:26,474 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-16 23:23:26,474 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 23:23:26,475 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 23:23:26,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1743850026] [2025-03-16 23:23:26,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1743850026] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:23:26,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:23:26,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 23:23:26,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709361108] [2025-03-16 23:23:26,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:23:26,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 23:23:26,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 23:23:26,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 23:23:26,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 23:23:26,496 INFO L87 Difference]: Start difference. First operand has 51 states, 32 states have (on average 1.4375) internal successors, (46), 33 states have internal predecessors, (46), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-16 23:23:26,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:23:26,517 INFO L93 Difference]: Finished difference Result 99 states and 170 transitions. [2025-03-16 23:23:26,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 23:23:26,519 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) Word has length 103 [2025-03-16 23:23:26,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:23:26,525 INFO L225 Difference]: With dead ends: 99 [2025-03-16 23:23:26,525 INFO L226 Difference]: Without dead ends: 49 [2025-03-16 23:23:26,529 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 102 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-16 23:23:26,532 INFO L435 NwaCegarLoop]: 74 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, 74 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-16 23:23:26,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 23:23:26,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-16 23:23:26,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-03-16 23:23:26,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 31 states have internal predecessors, (42), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-16 23:23:26,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 74 transitions. [2025-03-16 23:23:26,565 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 74 transitions. Word has length 103 [2025-03-16 23:23:26,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:23:26,566 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 74 transitions. [2025-03-16 23:23:26,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-16 23:23:26,566 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 74 transitions. [2025-03-16 23:23:26,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-16 23:23:26,570 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:23:26,570 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:23:26,577 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-16 23:23:26,771 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-16 23:23:26,771 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:23:26,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:23:26,772 INFO L85 PathProgramCache]: Analyzing trace with hash -609724180, now seen corresponding path program 1 times [2025-03-16 23:23:26,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 23:23:26,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1158063316] [2025-03-16 23:23:26,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:23:26,773 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-16 23:23:26,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 23:23:26,776 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-16 23:23:26,776 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-16 23:23:26,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-16 23:23:26,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-16 23:23:26,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:23:26,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:23:26,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 23:23:26,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:23:26,940 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-16 23:23:26,940 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 23:23:26,940 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 23:23:26,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1158063316] [2025-03-16 23:23:26,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1158063316] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:23:26,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:23:26,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 23:23:26,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486434933] [2025-03-16 23:23:26,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:23:26,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 23:23:26,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 23:23:26,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 23:23:26,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 23:23:26,942 INFO L87 Difference]: Start difference. First operand 49 states and 74 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-16 23:23:27,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:23:27,020 INFO L93 Difference]: Finished difference Result 97 states and 147 transitions. [2025-03-16 23:23:27,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 23:23:27,027 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 103 [2025-03-16 23:23:27,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:23:27,028 INFO L225 Difference]: With dead ends: 97 [2025-03-16 23:23:27,028 INFO L226 Difference]: Without dead ends: 49 [2025-03-16 23:23:27,030 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 101 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-16 23:23:27,030 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 23:23:27,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 141 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 23:23:27,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-16 23:23:27,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-03-16 23:23:27,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-16 23:23:27,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 73 transitions. [2025-03-16 23:23:27,042 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 73 transitions. Word has length 103 [2025-03-16 23:23:27,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:23:27,043 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 73 transitions. [2025-03-16 23:23:27,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-16 23:23:27,043 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 73 transitions. [2025-03-16 23:23:27,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-16 23:23:27,044 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:23:27,044 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:23:27,051 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-16 23:23:27,245 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-16 23:23:27,245 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:23:27,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:23:27,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1715333938, now seen corresponding path program 1 times [2025-03-16 23:23:27,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 23:23:27,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1029310502] [2025-03-16 23:23:27,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:23:27,246 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-16 23:23:27,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 23:23:27,249 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-16 23:23:27,250 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-16 23:23:27,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-16 23:23:27,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-16 23:23:27,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:23:27,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:23:27,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-16 23:23:27,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:23:27,554 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 253 proven. 24 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2025-03-16 23:23:27,554 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 23:23:27,729 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 21 proven. 24 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-16 23:23:27,729 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 23:23:27,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1029310502] [2025-03-16 23:23:27,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1029310502] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 23:23:27,729 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 23:23:27,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2025-03-16 23:23:27,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541365928] [2025-03-16 23:23:27,729 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 23:23:27,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 23:23:27,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 23:23:27,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 23:23:27,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-16 23:23:27,731 INFO L87 Difference]: Start difference. First operand 49 states and 73 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-16 23:23:28,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:23:28,131 INFO L93 Difference]: Finished difference Result 105 states and 152 transitions. [2025-03-16 23:23:28,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 23:23:28,137 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 104 [2025-03-16 23:23:28,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:23:28,138 INFO L225 Difference]: With dead ends: 105 [2025-03-16 23:23:28,138 INFO L226 Difference]: Without dead ends: 57 [2025-03-16 23:23:28,139 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 199 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2025-03-16 23:23:28,139 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 102 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 23:23:28,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 105 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 23:23:28,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-16 23:23:28,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53. [2025-03-16 23:23:28,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-16 23:23:28,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 74 transitions. [2025-03-16 23:23:28,147 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 74 transitions. Word has length 104 [2025-03-16 23:23:28,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:23:28,147 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 74 transitions. [2025-03-16 23:23:28,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-16 23:23:28,147 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 74 transitions. [2025-03-16 23:23:28,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-16 23:23:28,148 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:23:28,148 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:23:28,154 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-16 23:23:28,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-16 23:23:28,349 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:23:28,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:23:28,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1684786995, now seen corresponding path program 1 times [2025-03-16 23:23:28,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 23:23:28,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [273477904] [2025-03-16 23:23:28,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:23:28,350 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-16 23:23:28,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 23:23:28,352 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-16 23:23:28,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-16 23:23:28,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-16 23:23:28,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-16 23:23:28,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:23:28,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:23:28,467 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-16 23:23:28,471 INFO L279 TraceCheckSpWp]: Computing forward predicates...