./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-75.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-75.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 b3d91d8f93f332a0b991591fdb7699a2f5039db379a8bbd5ad480afa85a9a3c7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 15:37:22,629 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 15:37:22,687 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 15:37:22,691 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 15:37:22,691 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 15:37:22,708 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 15:37:22,708 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 15:37:22,709 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 15:37:22,709 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 15:37:22,709 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 15:37:22,709 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 15:37:22,709 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 15:37:22,709 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 15:37:22,709 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 15:37:22,709 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 15:37:22,710 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 15:37:22,710 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 15:37:22,710 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 15:37:22,710 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 15:37:22,710 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 15:37:22,710 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 15:37:22,710 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 15:37:22,710 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 15:37:22,710 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 15:37:22,710 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 15:37:22,710 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 15:37:22,710 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 15:37:22,711 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 15:37:22,711 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 15:37:22,711 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 15:37:22,711 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 15:37:22,711 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 15:37:22,711 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:37:22,711 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 15:37:22,711 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 15:37:22,712 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 15:37:22,712 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 15:37:22,712 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 15:37:22,712 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 15:37:22,712 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 15:37:22,712 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 15:37:22,712 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 15:37:22,712 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 15:37:22,712 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 -> b3d91d8f93f332a0b991591fdb7699a2f5039db379a8bbd5ad480afa85a9a3c7 [2025-03-08 15:37:22,913 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 15:37:22,918 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 15:37:22,919 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 15:37:22,920 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 15:37:22,920 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 15:37:22,921 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-75.i [2025-03-08 15:37:23,986 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df2f02665/1402533e504f4d9a829d6980104794bf/FLAGcac5e1823 [2025-03-08 15:37:24,236 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 15:37:24,236 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-75.i [2025-03-08 15:37:24,273 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df2f02665/1402533e504f4d9a829d6980104794bf/FLAGcac5e1823 [2025-03-08 15:37:24,563 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df2f02665/1402533e504f4d9a829d6980104794bf [2025-03-08 15:37:24,565 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 15:37:24,566 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 15:37:24,568 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 15:37:24,568 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 15:37:24,571 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 15:37:24,572 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:37:24" (1/1) ... [2025-03-08 15:37:24,574 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f6ac0aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:37:24, skipping insertion in model container [2025-03-08 15:37:24,574 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:37:24" (1/1) ... [2025-03-08 15:37:24,588 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 15:37:24,670 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-75.i[915,928] [2025-03-08 15:37:24,702 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:37:24,709 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 15:37:24,716 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-75.i[915,928] [2025-03-08 15:37:24,728 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:37:24,737 INFO L204 MainTranslator]: Completed translation [2025-03-08 15:37:24,738 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:37:24 WrapperNode [2025-03-08 15:37:24,738 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 15:37:24,738 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 15:37:24,738 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 15:37:24,739 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 15:37:24,742 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:37:24" (1/1) ... [2025-03-08 15:37:24,747 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:37:24" (1/1) ... [2025-03-08 15:37:24,777 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 97 [2025-03-08 15:37:24,782 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 15:37:24,782 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 15:37:24,782 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 15:37:24,782 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 15:37:24,789 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:37:24" (1/1) ... [2025-03-08 15:37:24,790 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:37:24" (1/1) ... [2025-03-08 15:37:24,792 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:37:24" (1/1) ... [2025-03-08 15:37:24,804 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 15:37:24,804 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:37:24" (1/1) ... [2025-03-08 15:37:24,804 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:37:24" (1/1) ... [2025-03-08 15:37:24,811 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:37:24" (1/1) ... [2025-03-08 15:37:24,812 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:37:24" (1/1) ... [2025-03-08 15:37:24,813 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:37:24" (1/1) ... [2025-03-08 15:37:24,816 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:37:24" (1/1) ... [2025-03-08 15:37:24,818 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 15:37:24,821 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 15:37:24,821 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 15:37:24,821 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 15:37:24,821 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:37:24" (1/1) ... [2025-03-08 15:37:24,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:37:24,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:37:24,846 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 15:37:24,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 15:37:24,866 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 15:37:24,866 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 15:37:24,866 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 15:37:24,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 15:37:24,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 15:37:24,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 15:37:24,918 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 15:37:24,920 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 15:37:25,086 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-08 15:37:25,087 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 15:37:25,095 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 15:37:25,098 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 15:37:25,098 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:37:25 BoogieIcfgContainer [2025-03-08 15:37:25,098 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 15:37:25,100 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 15:37:25,100 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 15:37:25,103 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 15:37:25,103 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 03:37:24" (1/3) ... [2025-03-08 15:37:25,103 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77b262d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:37:25, skipping insertion in model container [2025-03-08 15:37:25,104 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:37:24" (2/3) ... [2025-03-08 15:37:25,104 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77b262d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:37:25, skipping insertion in model container [2025-03-08 15:37:25,104 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:37:25" (3/3) ... [2025-03-08 15:37:25,107 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-75.i [2025-03-08 15:37:25,117 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 15:37:25,119 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount25_file-75.i that has 2 procedures, 45 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 15:37:25,156 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 15:37:25,168 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;@9010a8e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 15:37:25,168 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 15:37:25,172 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 28 states have (on average 1.25) internal successors, (35), 29 states have internal predecessors, (35), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-08 15:37:25,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-08 15:37:25,183 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:37:25,183 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:37:25,184 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:37:25,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:37:25,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1353505916, now seen corresponding path program 1 times [2025-03-08 15:37:25,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:37:25,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132095161] [2025-03-08 15:37:25,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:37:25,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:37:25,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-08 15:37:25,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 15:37:25,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:37:25,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:37:25,403 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-08 15:37:25,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:37:25,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132095161] [2025-03-08 15:37:25,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132095161] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:37:25,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1226332117] [2025-03-08 15:37:25,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:37:25,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:37:25,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:37:25,407 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:37:25,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 15:37:25,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-08 15:37:25,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 15:37:25,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:37:25,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:37:25,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 15:37:25,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:37:25,557 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-08 15:37:25,558 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:37:25,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1226332117] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:37:25,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 15:37:25,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 15:37:25,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132299449] [2025-03-08 15:37:25,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:37:25,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 15:37:25,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:37:25,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 15:37:25,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:37:25,577 INFO L87 Difference]: Start difference. First operand has 45 states, 28 states have (on average 1.25) internal successors, (35), 29 states have internal predecessors, (35), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 15:37:25,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:37:25,589 INFO L93 Difference]: Finished difference Result 84 states and 135 transitions. [2025-03-08 15:37:25,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 15:37:25,591 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 92 [2025-03-08 15:37:25,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:37:25,595 INFO L225 Difference]: With dead ends: 84 [2025-03-08 15:37:25,595 INFO L226 Difference]: Without dead ends: 42 [2025-03-08 15:37:25,597 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:37:25,598 INFO L435 NwaCegarLoop]: 58 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, 58 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:37:25,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:37:25,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-08 15:37:25,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-03-08 15:37:25,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-08 15:37:25,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 58 transitions. [2025-03-08 15:37:25,621 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 58 transitions. Word has length 92 [2025-03-08 15:37:25,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:37:25,621 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 58 transitions. [2025-03-08 15:37:25,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 15:37:25,622 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 58 transitions. [2025-03-08 15:37:25,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-08 15:37:25,624 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:37:25,624 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:37:25,630 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 15:37:25,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 15:37:25,825 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:37:25,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:37:25,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1050018016, now seen corresponding path program 1 times [2025-03-08 15:37:25,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:37:25,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126863805] [2025-03-08 15:37:25,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:37:25,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:37:25,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-08 15:37:25,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 15:37:25,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:37:25,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 15:37:25,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [350149508] [2025-03-08 15:37:25,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:37:25,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:37:25,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:37:25,937 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:37:25,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 15:37:25,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-08 15:37:26,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 15:37:26,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:37:26,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:37:26,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 15:37:26,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:37:26,200 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 15:37:26,201 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:37:26,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:37:26,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126863805] [2025-03-08 15:37:26,201 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 15:37:26,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350149508] [2025-03-08 15:37:26,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [350149508] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:37:26,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:37:26,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:37:26,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048303070] [2025-03-08 15:37:26,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:37:26,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:37:26,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:37:26,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:37:26,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:37:26,204 INFO L87 Difference]: Start difference. First operand 42 states and 58 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-08 15:37:26,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:37:26,315 INFO L93 Difference]: Finished difference Result 121 states and 169 transitions. [2025-03-08 15:37:26,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:37:26,315 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 92 [2025-03-08 15:37:26,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:37:26,317 INFO L225 Difference]: With dead ends: 121 [2025-03-08 15:37:26,317 INFO L226 Difference]: Without dead ends: 82 [2025-03-08 15:37:26,318 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-08 15:37:26,318 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 30 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:37:26,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 179 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:37:26,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-08 15:37:26,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 72. [2025-03-08 15:37:26,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 41 states have internal predecessors, (45), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-08 15:37:26,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 101 transitions. [2025-03-08 15:37:26,337 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 101 transitions. Word has length 92 [2025-03-08 15:37:26,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:37:26,337 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 101 transitions. [2025-03-08 15:37:26,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-08 15:37:26,338 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 101 transitions. [2025-03-08 15:37:26,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-08 15:37:26,341 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:37:26,341 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:37:26,348 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 15:37:26,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-08 15:37:26,546 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:37:26,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:37:26,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1502138945, now seen corresponding path program 1 times [2025-03-08 15:37:26,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:37:26,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44068725] [2025-03-08 15:37:26,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:37:26,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:37:26,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-08 15:37:26,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 15:37:26,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:37:26,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 15:37:26,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [993675637] [2025-03-08 15:37:26,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:37:26,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:37:26,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:37:26,614 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:37:26,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 15:37:26,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-08 15:37:26,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 15:37:26,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:37:26,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 15:37:26,681 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 15:37:26,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-08 15:37:26,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 15:37:26,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:37:26,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 15:37:26,737 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 15:37:26,738 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 15:37:26,738 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 15:37:26,746 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 15:37:26,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:37:26,942 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-08 15:37:26,978 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 15:37:26,982 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 03:37:26 BoogieIcfgContainer [2025-03-08 15:37:26,982 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 15:37:26,982 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 15:37:26,982 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 15:37:26,983 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 15:37:26,983 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:37:25" (3/4) ... [2025-03-08 15:37:26,984 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 15:37:26,986 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 15:37:26,987 INFO L158 Benchmark]: Toolchain (without parser) took 2420.98ms. Allocated memory is still 167.8MB. Free memory was 124.1MB in the beginning and 63.7MB in the end (delta: 60.4MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. [2025-03-08 15:37:26,988 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 117.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 15:37:26,988 INFO L158 Benchmark]: CACSL2BoogieTranslator took 170.50ms. Allocated memory is still 167.8MB. Free memory was 124.1MB in the beginning and 110.8MB in the end (delta: 13.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 15:37:26,988 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.39ms. Allocated memory is still 167.8MB. Free memory was 110.8MB in the beginning and 107.9MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 15:37:26,989 INFO L158 Benchmark]: Boogie Preprocessor took 35.75ms. Allocated memory is still 167.8MB. Free memory was 107.9MB in the beginning and 102.4MB in the end (delta: 5.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 15:37:26,989 INFO L158 Benchmark]: IcfgBuilder took 277.71ms. Allocated memory is still 167.8MB. Free memory was 102.4MB in the beginning and 83.7MB in the end (delta: 18.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 15:37:26,989 INFO L158 Benchmark]: TraceAbstraction took 1882.22ms. Allocated memory is still 167.8MB. Free memory was 82.8MB in the beginning and 63.7MB in the end (delta: 19.1MB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. [2025-03-08 15:37:26,989 INFO L158 Benchmark]: Witness Printer took 3.73ms. Allocated memory is still 167.8MB. Free memory was 63.7MB in the beginning and 63.7MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 15:37:26,990 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.17ms. Allocated memory is still 201.3MB. Free memory is still 117.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 170.50ms. Allocated memory is still 167.8MB. Free memory was 124.1MB in the beginning and 110.8MB in the end (delta: 13.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.39ms. Allocated memory is still 167.8MB. Free memory was 110.8MB in the beginning and 107.9MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.75ms. Allocated memory is still 167.8MB. Free memory was 107.9MB in the beginning and 102.4MB in the end (delta: 5.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 277.71ms. Allocated memory is still 167.8MB. Free memory was 102.4MB in the beginning and 83.7MB in the end (delta: 18.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 1882.22ms. Allocated memory is still 167.8MB. Free memory was 82.8MB in the beginning and 63.7MB in the end (delta: 19.1MB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. * Witness Printer took 3.73ms. Allocated memory is still 167.8MB. Free memory was 63.7MB in the beginning and 63.7MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 79, overapproximation of someBinaryFLOATComparisonOperation at line 51, overapproximation of someBinaryFLOATComparisonOperation at line 85, overapproximation of someBinaryFLOATComparisonOperation at line 75, overapproximation of someBinaryFLOATComparisonOperation at line 77, overapproximation of someUnaryDOUBLEoperation at line 27, overapproximation of someBinaryDOUBLEComparisonOperation at line 73, overapproximation of someBinaryDOUBLEComparisonOperation at line 85, overapproximation of someBinaryDOUBLEComparisonOperation at line 50, overapproximation of someBinaryArithmeticFLOAToperation at line 51. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 32; [L23] unsigned char var_1_7 = 128; [L24] unsigned char var_1_8 = 64; [L25] unsigned char var_1_9 = 100; [L26] unsigned char var_1_10 = 1; [L27] float var_1_11 = -0.6; [L28] unsigned char var_1_12 = 1; [L29] double var_1_13 = 999999999999999.2; [L30] float var_1_14 = 50.25; [L31] float var_1_15 = 15.5; [L32] float var_1_16 = 128.5; [L33] unsigned char var_1_17 = 0; [L34] unsigned char last_1_var_1_17 = 0; VAL [isInitial=0, last_1_var_1_17=0, var_1_10=1, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=128, var_1_8=64, var_1_9=100] [L89] isInitial = 1 [L90] FCALL initially() [L91] COND TRUE 1 [L92] CALL updateLastVariables() [L82] last_1_var_1_17 = var_1_17 VAL [isInitial=1, last_1_var_1_17=0, var_1_10=1, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=128, var_1_8=64, var_1_9=100] [L92] RET updateLastVariables() [L93] CALL updateVariables() [L57] var_1_7 = __VERIFIER_nondet_uchar() [L58] CALL assume_abort_if_not(var_1_7 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=1, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=510, var_1_8=64, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=1, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=510, var_1_8=64, var_1_9=100] [L58] RET assume_abort_if_not(var_1_7 >= 127) VAL [isInitial=1, last_1_var_1_17=0, var_1_10=1, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=510, var_1_8=64, var_1_9=100] [L59] CALL assume_abort_if_not(var_1_7 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=1, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=510, var_1_8=64, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=1, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=510, var_1_8=64, var_1_9=100] [L59] RET assume_abort_if_not(var_1_7 <= 254) VAL [isInitial=1, last_1_var_1_17=0, var_1_10=1, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=510, var_1_8=64, var_1_9=100] [L60] var_1_8 = __VERIFIER_nondet_uchar() [L61] CALL assume_abort_if_not(var_1_8 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=1, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=510, var_1_8=63, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=1, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=510, var_1_8=63, var_1_9=100] [L61] RET assume_abort_if_not(var_1_8 >= 63) VAL [isInitial=1, last_1_var_1_17=0, var_1_10=1, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=510, var_1_8=63, var_1_9=100] [L62] CALL assume_abort_if_not(var_1_8 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=1, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=510, var_1_8=63, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=1, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=510, var_1_8=63, var_1_9=100] [L62] RET assume_abort_if_not(var_1_8 <= 127) VAL [isInitial=1, last_1_var_1_17=0, var_1_10=1, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=510, var_1_8=63, var_1_9=100] [L63] var_1_9 = __VERIFIER_nondet_uchar() [L64] CALL assume_abort_if_not(var_1_9 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=1, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=510, var_1_8=63, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=1, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=510, var_1_8=63, var_1_9=63] [L64] RET assume_abort_if_not(var_1_9 >= 63) VAL [isInitial=1, last_1_var_1_17=0, var_1_10=1, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=510, var_1_8=63, var_1_9=63] [L65] CALL assume_abort_if_not(var_1_9 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=1, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=510, var_1_8=63, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=1, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=510, var_1_8=63, var_1_9=63] [L65] RET assume_abort_if_not(var_1_9 <= 127) VAL [isInitial=1, last_1_var_1_17=0, var_1_10=1, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=510, var_1_8=63, var_1_9=63] [L66] var_1_10 = __VERIFIER_nondet_uchar() [L67] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=510, var_1_8=63, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=510, var_1_8=63, var_1_9=63] [L67] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_17=0, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=510, var_1_8=63, var_1_9=63] [L68] CALL assume_abort_if_not(var_1_10 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=63, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=510, var_1_8=63, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=63, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=510, var_1_8=63, var_1_9=63] [L68] RET assume_abort_if_not(var_1_10 <= 63) VAL [isInitial=1, last_1_var_1_17=0, var_1_10=63, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=510, var_1_8=63, var_1_9=63] [L69] var_1_12 = __VERIFIER_nondet_uchar() [L70] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=63, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=510, var_1_8=63, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=63, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=510, var_1_8=63, var_1_9=63] [L70] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_17=0, var_1_10=63, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=510, var_1_8=63, var_1_9=63] [L71] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=63, var_1_12=0, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=510, var_1_8=63, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=63, var_1_12=0, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=510, var_1_8=63, var_1_9=63] [L71] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, last_1_var_1_17=0, var_1_10=63, var_1_12=0, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=510, var_1_8=63, var_1_9=63] [L72] var_1_13 = __VERIFIER_nondet_double() [L73] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=63, var_1_12=0, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=510, var_1_8=63, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=63, var_1_12=0, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=510, var_1_8=63, var_1_9=63] [L73] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=0, var_1_10=63, var_1_12=0, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=510, var_1_8=63, var_1_9=63] [L74] var_1_14 = __VERIFIER_nondet_float() [L75] CALL assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=63, var_1_12=0, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=510, var_1_8=63, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=63, var_1_12=0, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=510, var_1_8=63, var_1_9=63] [L75] RET assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=0, var_1_10=63, var_1_12=0, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=510, var_1_8=63, var_1_9=63] [L76] var_1_15 = __VERIFIER_nondet_float() [L77] CALL assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=63, var_1_12=0, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=510, var_1_8=63, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=63, var_1_12=0, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=510, var_1_8=63, var_1_9=63] [L77] RET assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=0, var_1_10=63, var_1_12=0, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=510, var_1_8=63, var_1_9=63] [L78] var_1_16 = __VERIFIER_nondet_float() [L79] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=63, var_1_12=0, var_1_17=0, var_1_1=32, var_1_7=510, var_1_8=63, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=63, var_1_12=0, var_1_17=0, var_1_1=32, var_1_7=510, var_1_8=63, var_1_9=63] [L79] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=0, var_1_10=63, var_1_12=0, var_1_17=0, var_1_1=32, var_1_7=510, var_1_8=63, var_1_9=63] [L93] RET updateVariables() [L94] CALL step() [L38] signed long int stepLocal_0 = (last_1_var_1_17 * last_1_var_1_17) * last_1_var_1_17; VAL [isInitial=1, last_1_var_1_17=0, stepLocal_0=0, var_1_10=63, var_1_12=0, var_1_17=0, var_1_1=32, var_1_7=510, var_1_8=63, var_1_9=63] [L39] COND FALSE !(stepLocal_0 < ((((last_1_var_1_17) > (last_1_var_1_17)) ? (last_1_var_1_17) : (last_1_var_1_17)))) [L42] var_1_1 = var_1_8 VAL [isInitial=1, last_1_var_1_17=0, var_1_10=63, var_1_12=0, var_1_17=0, var_1_1=63, var_1_7=510, var_1_8=63, var_1_9=63] [L44] unsigned char stepLocal_1 = var_1_1; VAL [isInitial=1, last_1_var_1_17=0, stepLocal_1=63, var_1_10=63, var_1_12=0, var_1_17=0, var_1_1=63, var_1_7=510, var_1_8=63, var_1_9=63] [L45] COND TRUE stepLocal_1 >= var_1_1 [L46] var_1_17 = (((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7))) - (((((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))) < 0 ) ? -((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))) : ((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10)))))) VAL [isInitial=1, last_1_var_1_17=0, var_1_10=63, var_1_12=0, var_1_17=191, var_1_1=63, var_1_7=510, var_1_8=63, var_1_9=63] [L50] COND TRUE var_1_12 || ((var_1_13 * 49.25) == 32.8) [L51] var_1_11 = (((((var_1_14 + var_1_15)) > (var_1_16)) ? ((var_1_14 + var_1_15)) : (var_1_16))) VAL [isInitial=1, last_1_var_1_17=0, var_1_10=63, var_1_11=2, var_1_12=0, var_1_16=0, var_1_17=191, var_1_1=63, var_1_7=510, var_1_8=63, var_1_9=63] [L94] RET step() [L95] CALL, EXPR property() [L85-L86] return (((((last_1_var_1_17 * last_1_var_1_17) * last_1_var_1_17) < ((((last_1_var_1_17) > (last_1_var_1_17)) ? (last_1_var_1_17) : (last_1_var_1_17)))) ? (var_1_1 == ((unsigned char) (var_1_7 - (((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))) - var_1_10)))) : (var_1_1 == ((unsigned char) var_1_8))) && ((var_1_12 || ((var_1_13 * 49.25) == 32.8)) ? (var_1_11 == ((float) (((((var_1_14 + var_1_15)) > (var_1_16)) ? ((var_1_14 + var_1_15)) : (var_1_16))))) : (var_1_11 == ((float) var_1_15)))) && ((var_1_1 >= var_1_1) ? (var_1_17 == ((unsigned char) (((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7))) - (((((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))) < 0 ) ? -((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))) : ((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10)))))))) : (var_1_17 == ((unsigned char) var_1_8))) ; VAL [\result=0, isInitial=1, last_1_var_1_17=0, var_1_10=63, var_1_11=2, var_1_12=0, var_1_16=0, var_1_17=191, var_1_1=63, var_1_7=510, var_1_8=63, var_1_9=63] [L95] RET, EXPR property() [L95] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_17=0, var_1_10=63, var_1_11=2, var_1_12=0, var_1_16=0, var_1_17=191, var_1_1=63, var_1_7=510, var_1_8=63, var_1_9=63] [L19] reach_error() VAL [isInitial=1, last_1_var_1_17=0, var_1_10=63, var_1_11=2, var_1_12=0, var_1_16=0, var_1_17=191, var_1_1=63, var_1_7=510, var_1_8=63, var_1_9=63] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 45 locations, 77 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.8s, OverallIterations: 3, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 30 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 30 mSDsluCounter, 237 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 125 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 47 IncrementalHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 112 mSDtfsCounter, 47 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 186 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=72occurred in iteration=2, InterpolantAutomatonStates: 7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 10 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 552 NumberOfCodeBlocks, 552 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 273 ConstructedInterpolants, 0 QuantifiedInterpolants, 445 SizeOfPredicates, 1 NumberOfNonLiveVariables, 426 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 1066/1092 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 15:37:27,003 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-75.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 b3d91d8f93f332a0b991591fdb7699a2f5039db379a8bbd5ad480afa85a9a3c7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 15:37:28,843 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 15:37:28,916 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 15:37:28,923 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 15:37:28,926 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 15:37:28,947 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 15:37:28,947 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 15:37:28,947 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 15:37:28,948 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 15:37:28,948 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 15:37:28,949 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 15:37:28,949 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 15:37:28,949 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 15:37:28,949 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 15:37:28,950 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 15:37:28,950 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 15:37:28,950 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 15:37:28,950 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 15:37:28,950 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 15:37:28,951 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 15:37:28,951 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 15:37:28,951 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 15:37:28,951 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 15:37:28,951 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 15:37:28,951 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 15:37:28,951 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 15:37:28,951 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 15:37:28,951 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 15:37:28,951 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 15:37:28,951 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 15:37:28,952 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 15:37:28,952 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 15:37:28,952 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 15:37:28,952 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 15:37:28,952 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:37:28,952 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 15:37:28,952 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 15:37:28,952 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 15:37:28,952 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 15:37:28,952 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 15:37:28,952 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 15:37:28,952 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 15:37:28,952 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 15:37:28,952 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 15:37:28,952 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 15:37:28,952 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 -> b3d91d8f93f332a0b991591fdb7699a2f5039db379a8bbd5ad480afa85a9a3c7 [2025-03-08 15:37:29,204 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 15:37:29,211 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 15:37:29,212 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 15:37:29,213 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 15:37:29,213 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 15:37:29,215 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-75.i [2025-03-08 15:37:30,388 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf1563dac/caf3270a6b274a2295193b7450cda7b7/FLAG77ac6fba0 [2025-03-08 15:37:30,579 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 15:37:30,580 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-75.i [2025-03-08 15:37:30,586 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf1563dac/caf3270a6b274a2295193b7450cda7b7/FLAG77ac6fba0 [2025-03-08 15:37:30,955 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf1563dac/caf3270a6b274a2295193b7450cda7b7 [2025-03-08 15:37:30,957 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 15:37:30,958 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 15:37:30,959 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 15:37:30,959 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 15:37:30,962 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 15:37:30,962 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:37:30" (1/1) ... [2025-03-08 15:37:30,963 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d018ac6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:37:30, skipping insertion in model container [2025-03-08 15:37:30,963 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:37:30" (1/1) ... [2025-03-08 15:37:30,979 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 15:37:31,068 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-75.i[915,928] [2025-03-08 15:37:31,105 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:37:31,124 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 15:37:31,132 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-75.i[915,928] [2025-03-08 15:37:31,154 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:37:31,174 INFO L204 MainTranslator]: Completed translation [2025-03-08 15:37:31,175 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:37:31 WrapperNode [2025-03-08 15:37:31,176 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 15:37:31,177 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 15:37:31,177 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 15:37:31,177 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 15:37:31,181 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:37:31" (1/1) ... [2025-03-08 15:37:31,190 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:37:31" (1/1) ... [2025-03-08 15:37:31,211 INFO L138 Inliner]: procedures = 27, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 97 [2025-03-08 15:37:31,212 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 15:37:31,212 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 15:37:31,212 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 15:37:31,213 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 15:37:31,218 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:37:31" (1/1) ... [2025-03-08 15:37:31,219 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:37:31" (1/1) ... [2025-03-08 15:37:31,221 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:37:31" (1/1) ... [2025-03-08 15:37:31,237 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 15:37:31,238 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:37:31" (1/1) ... [2025-03-08 15:37:31,238 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:37:31" (1/1) ... [2025-03-08 15:37:31,249 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:37:31" (1/1) ... [2025-03-08 15:37:31,250 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:37:31" (1/1) ... [2025-03-08 15:37:31,251 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:37:31" (1/1) ... [2025-03-08 15:37:31,252 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:37:31" (1/1) ... [2025-03-08 15:37:31,253 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 15:37:31,254 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 15:37:31,254 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 15:37:31,254 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 15:37:31,255 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:37:31" (1/1) ... [2025-03-08 15:37:31,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:37:31,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:37:31,290 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 15:37:31,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 15:37:31,308 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 15:37:31,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 15:37:31,308 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 15:37:31,308 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 15:37:31,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 15:37:31,308 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 15:37:31,366 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 15:37:31,367 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 15:37:32,429 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-08 15:37:32,429 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 15:37:32,435 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 15:37:32,435 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 15:37:32,435 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:37:32 BoogieIcfgContainer [2025-03-08 15:37:32,436 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 15:37:32,437 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 15:37:32,437 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 15:37:32,440 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 15:37:32,441 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 03:37:30" (1/3) ... [2025-03-08 15:37:32,441 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@140df6ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:37:32, skipping insertion in model container [2025-03-08 15:37:32,441 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:37:31" (2/3) ... [2025-03-08 15:37:32,441 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@140df6ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:37:32, skipping insertion in model container [2025-03-08 15:37:32,442 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:37:32" (3/3) ... [2025-03-08 15:37:32,442 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-75.i [2025-03-08 15:37:32,453 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 15:37:32,454 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount25_file-75.i that has 2 procedures, 45 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 15:37:32,485 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 15:37:32,492 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;@7e8e4826, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 15:37:32,492 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 15:37:32,495 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 28 states have (on average 1.25) internal successors, (35), 29 states have internal predecessors, (35), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-08 15:37:32,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-08 15:37:32,501 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:37:32,501 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:37:32,502 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:37:32,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:37:32,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1353505916, now seen corresponding path program 1 times [2025-03-08 15:37:32,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 15:37:32,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2052630610] [2025-03-08 15:37:32,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:37:32,516 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 15:37:32,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 15:37:32,518 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 15:37:32,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-08 15:37:32,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-08 15:37:32,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 15:37:32,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:37:32,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:37:32,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 15:37:32,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:37:32,783 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2025-03-08 15:37:32,783 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:37:32,783 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 15:37:32,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2052630610] [2025-03-08 15:37:32,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2052630610] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:37:32,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:37:32,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 15:37:32,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313276615] [2025-03-08 15:37:32,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:37:32,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 15:37:32,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 15:37:32,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 15:37:32,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:37:32,803 INFO L87 Difference]: Start difference. First operand has 45 states, 28 states have (on average 1.25) internal successors, (35), 29 states have internal predecessors, (35), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 15:37:32,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:37:32,817 INFO L93 Difference]: Finished difference Result 84 states and 135 transitions. [2025-03-08 15:37:32,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 15:37:32,818 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 92 [2025-03-08 15:37:32,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:37:32,822 INFO L225 Difference]: With dead ends: 84 [2025-03-08 15:37:32,822 INFO L226 Difference]: Without dead ends: 42 [2025-03-08 15:37:32,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:37:32,826 INFO L435 NwaCegarLoop]: 58 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, 58 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:37:32,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:37:32,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-08 15:37:32,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-03-08 15:37:32,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-08 15:37:32,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 58 transitions. [2025-03-08 15:37:32,870 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 58 transitions. Word has length 92 [2025-03-08 15:37:32,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:37:32,870 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 58 transitions. [2025-03-08 15:37:32,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 15:37:32,871 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 58 transitions. [2025-03-08 15:37:32,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-08 15:37:32,873 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:37:32,873 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:37:32,881 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-08 15:37:33,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 15:37:33,074 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:37:33,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:37:33,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1050018016, now seen corresponding path program 1 times [2025-03-08 15:37:33,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 15:37:33,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [696512729] [2025-03-08 15:37:33,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:37:33,075 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 15:37:33,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 15:37:33,077 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 15:37:33,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-08 15:37:33,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-08 15:37:33,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 15:37:33,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:37:33,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:37:33,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 15:37:33,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:37:33,501 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 15:37:33,501 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:37:33,501 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 15:37:33,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [696512729] [2025-03-08 15:37:33,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [696512729] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:37:33,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:37:33,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:37:33,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085018019] [2025-03-08 15:37:33,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:37:33,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:37:33,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 15:37:33,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:37:33,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:37:33,503 INFO L87 Difference]: Start difference. First operand 42 states and 58 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-08 15:37:34,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:37:34,285 INFO L93 Difference]: Finished difference Result 121 states and 169 transitions. [2025-03-08 15:37:34,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:37:34,294 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 92 [2025-03-08 15:37:34,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:37:34,296 INFO L225 Difference]: With dead ends: 121 [2025-03-08 15:37:34,296 INFO L226 Difference]: Without dead ends: 82 [2025-03-08 15:37:34,296 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-08 15:37:34,297 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 30 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 15:37:34,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 179 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 15:37:34,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-08 15:37:34,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 72. [2025-03-08 15:37:34,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 41 states have internal predecessors, (45), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-08 15:37:34,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 101 transitions. [2025-03-08 15:37:34,311 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 101 transitions. Word has length 92 [2025-03-08 15:37:34,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:37:34,311 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 101 transitions. [2025-03-08 15:37:34,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-08 15:37:34,312 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 101 transitions. [2025-03-08 15:37:34,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-08 15:37:34,315 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:37:34,315 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:37:34,324 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-08 15:37:34,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 15:37:34,516 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:37:34,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:37:34,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1502138945, now seen corresponding path program 1 times [2025-03-08 15:37:34,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 15:37:34,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1238436983] [2025-03-08 15:37:34,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:37:34,517 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 15:37:34,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 15:37:34,520 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 15:37:34,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-08 15:37:34,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-08 15:37:34,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 15:37:34,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:37:34,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:37:34,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-08 15:37:34,721 INFO L279 TraceCheckSpWp]: Computing forward predicates...