./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-40.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-40.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 9dff56f51c27efe8188b93a5bc7538c1f88ddad58c38db68dc6e9ef1b97db7e2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:21:40,534 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:21:40,591 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:21:40,597 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:21:40,598 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:21:40,618 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:21:40,619 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:21:40,619 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:21:40,620 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:21:40,620 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:21:40,621 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:21:40,621 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:21:40,621 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:21:40,621 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:21:40,621 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:21:40,621 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:21:40,621 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:21:40,622 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:21:40,622 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:21:40,622 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:21:40,622 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:21:40,622 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:21:40,622 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:21:40,622 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:21:40,622 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:21:40,622 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:21:40,622 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:21:40,622 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:21:40,622 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:21:40,622 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:21:40,623 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:21:40,623 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:21:40,623 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:21:40,623 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:21:40,623 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:21:40,623 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:21:40,624 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:21:40,624 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:21:40,624 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:21:40,624 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:21:40,624 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:21:40,624 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:21:40,624 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:21:40,624 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 -> 9dff56f51c27efe8188b93a5bc7538c1f88ddad58c38db68dc6e9ef1b97db7e2 [2025-03-04 00:21:40,848 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:21:40,854 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:21:40,857 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:21:40,857 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:21:40,858 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:21:40,858 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-40.i [2025-03-04 00:21:41,979 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49f531a1f/26bf588ed49f4302a5f7cdb5cf5b5ba2/FLAG6d7ea6a53 [2025-03-04 00:21:42,230 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:21:42,233 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-40.i [2025-03-04 00:21:42,240 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49f531a1f/26bf588ed49f4302a5f7cdb5cf5b5ba2/FLAG6d7ea6a53 [2025-03-04 00:21:42,565 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49f531a1f/26bf588ed49f4302a5f7cdb5cf5b5ba2 [2025-03-04 00:21:42,567 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:21:42,568 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:21:42,569 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:21:42,569 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:21:42,572 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:21:42,572 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:21:42" (1/1) ... [2025-03-04 00:21:42,573 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33211a5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:21:42, skipping insertion in model container [2025-03-04 00:21:42,573 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:21:42" (1/1) ... [2025-03-04 00:21:42,589 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:21:42,676 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-40.i[915,928] [2025-03-04 00:21:42,708 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:21:42,716 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:21:42,723 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-40.i[915,928] [2025-03-04 00:21:42,734 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:21:42,745 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:21:42,745 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:21:42 WrapperNode [2025-03-04 00:21:42,746 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:21:42,746 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:21:42,746 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:21:42,746 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:21:42,751 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:21:42" (1/1) ... [2025-03-04 00:21:42,757 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:21:42" (1/1) ... [2025-03-04 00:21:42,780 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 102 [2025-03-04 00:21:42,781 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:21:42,781 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:21:42,782 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:21:42,782 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:21:42,789 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:21:42" (1/1) ... [2025-03-04 00:21:42,789 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:21:42" (1/1) ... [2025-03-04 00:21:42,790 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:21:42" (1/1) ... [2025-03-04 00:21:42,809 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 00:21:42,809 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:21:42" (1/1) ... [2025-03-04 00:21:42,812 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:21:42" (1/1) ... [2025-03-04 00:21:42,820 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:21:42" (1/1) ... [2025-03-04 00:21:42,820 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:21:42" (1/1) ... [2025-03-04 00:21:42,821 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:21:42" (1/1) ... [2025-03-04 00:21:42,822 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:21:42" (1/1) ... [2025-03-04 00:21:42,823 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:21:42,823 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:21:42,823 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:21:42,824 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:21:42,824 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:21:42" (1/1) ... [2025-03-04 00:21:42,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:21:42,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:21:42,853 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 00:21:42,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 00:21:42,878 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:21:42,878 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:21:42,878 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:21:42,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:21:42,878 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:21:42,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:21:42,939 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:21:42,941 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:21:43,131 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-04 00:21:43,132 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:21:43,140 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:21:43,142 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:21:43,142 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:21:43 BoogieIcfgContainer [2025-03-04 00:21:43,142 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:21:43,144 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:21:43,144 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:21:43,148 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:21:43,148 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:21:42" (1/3) ... [2025-03-04 00:21:43,148 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d3f7bfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:21:43, skipping insertion in model container [2025-03-04 00:21:43,149 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:21:42" (2/3) ... [2025-03-04 00:21:43,149 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d3f7bfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:21:43, skipping insertion in model container [2025-03-04 00:21:43,149 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:21:43" (3/3) ... [2025-03-04 00:21:43,150 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-40.i [2025-03-04 00:21:43,163 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:21:43,165 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount25_file-40.i that has 2 procedures, 49 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:21:43,211 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:21:43,221 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;@73b55456, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:21:43,222 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:21:43,225 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 32 states have internal predecessors, (41), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 00:21:43,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-04 00:21:43,233 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:21:43,234 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:21:43,234 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:21:43,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:21:43,239 INFO L85 PathProgramCache]: Analyzing trace with hash -687193478, now seen corresponding path program 1 times [2025-03-04 00:21:43,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:21:43,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820625886] [2025-03-04 00:21:43,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:21:43,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:21:43,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-04 00:21:43,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-04 00:21:43,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:21:43,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:21:43,452 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-04 00:21:43,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:21:43,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820625886] [2025-03-04 00:21:43,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820625886] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:21:43,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1711731668] [2025-03-04 00:21:43,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:21:43,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:21:43,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:21:43,456 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:21:43,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 00:21:43,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-04 00:21:43,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-04 00:21:43,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:21:43,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:21:43,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:21:43,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:21:43,616 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-04 00:21:43,616 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:21:43,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1711731668] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:21:43,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:21:43,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:21:43,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127248813] [2025-03-04 00:21:43,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:21:43,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:21:43,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:21:43,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:21:43,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:21:43,637 INFO L87 Difference]: Start difference. First operand has 49 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 32 states have internal predecessors, (41), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 00:21:43,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:21:43,651 INFO L93 Difference]: Finished difference Result 92 states and 152 transitions. [2025-03-04 00:21:43,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:21:43,652 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 97 [2025-03-04 00:21:43,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:21:43,657 INFO L225 Difference]: With dead ends: 92 [2025-03-04 00:21:43,657 INFO L226 Difference]: Without dead ends: 46 [2025-03-04 00:21:43,659 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:21:43,661 INFO L435 NwaCegarLoop]: 66 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, 66 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:21:43,663 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:21:43,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-04 00:21:43,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-03-04 00:21:43,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 00:21:43,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 66 transitions. [2025-03-04 00:21:43,688 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 66 transitions. Word has length 97 [2025-03-04 00:21:43,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:21:43,689 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 66 transitions. [2025-03-04 00:21:43,689 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 00:21:43,689 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 66 transitions. [2025-03-04 00:21:43,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-04 00:21:43,691 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:21:43,691 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:21:43,697 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-04 00:21:43,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 00:21:43,892 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:21:43,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:21:43,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1922032693, now seen corresponding path program 1 times [2025-03-04 00:21:43,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:21:43,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688785384] [2025-03-04 00:21:43,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:21:43,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:21:43,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-04 00:21:43,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-04 00:21:43,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:21:43,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:21:44,065 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 00:21:44,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:21:44,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688785384] [2025-03-04 00:21:44,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688785384] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:21:44,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:21:44,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:21:44,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557738544] [2025-03-04 00:21:44,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:21:44,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:21:44,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:21:44,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:21:44,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:21:44,070 INFO L87 Difference]: Start difference. First operand 46 states and 66 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 00:21:44,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:21:44,104 INFO L93 Difference]: Finished difference Result 99 states and 140 transitions. [2025-03-04 00:21:44,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:21:44,105 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 97 [2025-03-04 00:21:44,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:21:44,106 INFO L225 Difference]: With dead ends: 99 [2025-03-04 00:21:44,107 INFO L226 Difference]: Without dead ends: 56 [2025-03-04 00:21:44,108 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:21:44,108 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 14 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:21:44,109 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 124 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:21:44,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-04 00:21:44,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 48. [2025-03-04 00:21:44,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 states have internal predecessors, (38), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 00:21:44,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 68 transitions. [2025-03-04 00:21:44,118 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 68 transitions. Word has length 97 [2025-03-04 00:21:44,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:21:44,119 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 68 transitions. [2025-03-04 00:21:44,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 00:21:44,119 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2025-03-04 00:21:44,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-04 00:21:44,120 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:21:44,120 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:21:44,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:21:44,121 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:21:44,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:21:44,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1485430922, now seen corresponding path program 1 times [2025-03-04 00:21:44,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:21:44,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973648656] [2025-03-04 00:21:44,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:21:44,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:21:44,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-04 00:21:44,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-04 00:21:44,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:21:44,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 00:21:44,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1940415591] [2025-03-04 00:21:44,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:21:44,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:21:44,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:21:44,259 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:21:44,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 00:21:44,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-04 00:21:44,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-04 00:21:44,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:21:44,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:21:44,357 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 00:21:44,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-04 00:21:44,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-04 00:21:44,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:21:44,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:21:44,426 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 00:21:44,426 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 00:21:44,427 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 00:21:44,436 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 00:21:44,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-04 00:21:44,632 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-04 00:21:44,676 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 00:21:44,678 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 12:21:44 BoogieIcfgContainer [2025-03-04 00:21:44,678 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 00:21:44,679 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 00:21:44,680 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 00:21:44,680 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 00:21:44,681 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:21:43" (3/4) ... [2025-03-04 00:21:44,682 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 00:21:44,683 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 00:21:44,683 INFO L158 Benchmark]: Toolchain (without parser) took 2115.70ms. Allocated memory is still 167.8MB. Free memory was 123.0MB in the beginning and 92.0MB in the end (delta: 30.9MB). Peak memory consumption was 29.9MB. Max. memory is 16.1GB. [2025-03-04 00:21:44,684 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 117.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:21:44,684 INFO L158 Benchmark]: CACSL2BoogieTranslator took 177.16ms. Allocated memory is still 167.8MB. Free memory was 123.0MB in the beginning and 109.9MB in the end (delta: 13.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:21:44,684 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.56ms. Allocated memory is still 167.8MB. Free memory was 109.9MB in the beginning and 109.0MB in the end (delta: 944.6kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:21:44,684 INFO L158 Benchmark]: Boogie Preprocessor took 41.26ms. Allocated memory is still 167.8MB. Free memory was 109.0MB in the beginning and 107.0MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:21:44,684 INFO L158 Benchmark]: IcfgBuilder took 319.07ms. Allocated memory is still 167.8MB. Free memory was 107.0MB in the beginning and 91.2MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 00:21:44,684 INFO L158 Benchmark]: TraceAbstraction took 1533.44ms. Allocated memory is still 167.8MB. Free memory was 91.2MB in the beginning and 92.0MB in the end (delta: -815.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:21:44,684 INFO L158 Benchmark]: Witness Printer took 4.40ms. Allocated memory is still 167.8MB. Free memory was 92.0MB in the beginning and 92.0MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:21:44,685 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.18ms. Allocated memory is still 201.3MB. Free memory is still 117.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 177.16ms. Allocated memory is still 167.8MB. Free memory was 123.0MB in the beginning and 109.9MB in the end (delta: 13.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.56ms. Allocated memory is still 167.8MB. Free memory was 109.9MB in the beginning and 109.0MB in the end (delta: 944.6kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.26ms. Allocated memory is still 167.8MB. Free memory was 109.0MB in the beginning and 107.0MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 319.07ms. Allocated memory is still 167.8MB. Free memory was 107.0MB in the beginning and 91.2MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1533.44ms. Allocated memory is still 167.8MB. Free memory was 91.2MB in the beginning and 92.0MB in the end (delta: -815.9kB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.40ms. Allocated memory is still 167.8MB. Free memory was 92.0MB in the beginning and 92.0MB 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 78, overapproximation of someBinaryFLOATComparisonOperation at line 76, overapproximation of someBinaryFLOATComparisonOperation at line 80, overapproximation of someBinaryFLOATComparisonOperation at line 45, overapproximation of someBinaryFLOATComparisonOperation at line 82, overapproximation of someBinaryFLOATComparisonOperation at line 88. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -4; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 0; [L25] signed short int var_1_7 = 5; [L26] unsigned long int var_1_9 = 256; [L27] signed char var_1_10 = 10; [L28] signed char var_1_11 = 4; [L29] float var_1_12 = 32.4; [L30] float var_1_13 = 1.2; [L31] float var_1_14 = 64.8; [L32] float var_1_15 = 127.3; [L33] float var_1_16 = 4.02; [L34] signed char var_1_17 = -32; [L35] unsigned long int last_1_var_1_9 = 256; VAL [isInitial=0, last_1_var_1_9=256, var_1_10=10, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=0, var_1_7=5, var_1_9=256] [L92] isInitial = 1 [L93] FCALL initially() [L94] COND TRUE 1 [L95] CALL updateLastVariables() [L85] last_1_var_1_9 = var_1_9 VAL [isInitial=1, last_1_var_1_9=256, var_1_10=10, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=0, var_1_7=5, var_1_9=256] [L95] RET updateLastVariables() [L96] CALL updateVariables() [L59] var_1_2 = __VERIFIER_nondet_uchar() [L60] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=10, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_3=0, var_1_7=5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=10, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_3=0, var_1_7=5, var_1_9=256] [L60] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_9=256, var_1_10=10, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_3=0, var_1_7=5, var_1_9=256] [L61] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=10, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=0, var_1_7=5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=10, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=0, var_1_7=5, var_1_9=256] [L61] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_9=256, var_1_10=10, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=0, var_1_7=5, var_1_9=256] [L62] var_1_3 = __VERIFIER_nondet_uchar() [L63] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=10, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_7=5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=10, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_7=5, var_1_9=256] [L63] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_9=256, var_1_10=10, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_7=5, var_1_9=256] [L64] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=10, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=10, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=5, var_1_9=256] [L64] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_9=256, var_1_10=10, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=5, var_1_9=256] [L65] var_1_7 = __VERIFIER_nondet_short() [L66] CALL assume_abort_if_not(var_1_7 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=10, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=3, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=10, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=3, var_1_9=256] [L66] RET assume_abort_if_not(var_1_7 >= -32768) VAL [isInitial=1, last_1_var_1_9=256, var_1_10=10, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=3, var_1_9=256] [L67] CALL assume_abort_if_not(var_1_7 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=10, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=3, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=10, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=3, var_1_9=256] [L67] RET assume_abort_if_not(var_1_7 <= 32767) VAL [isInitial=1, last_1_var_1_9=256, var_1_10=10, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=3, var_1_9=256] [L68] CALL assume_abort_if_not(var_1_7 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=10, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=3, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=10, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=3, var_1_9=256] [L68] RET assume_abort_if_not(var_1_7 != 0) VAL [isInitial=1, last_1_var_1_9=256, var_1_10=10, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=3, var_1_9=256] [L69] var_1_10 = __VERIFIER_nondet_char() [L70] CALL assume_abort_if_not(var_1_10 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=3, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=3, var_1_9=256] [L70] RET assume_abort_if_not(var_1_10 >= -1) VAL [isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=3, var_1_9=256] [L71] CALL assume_abort_if_not(var_1_10 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=3, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=3, var_1_9=256] [L71] RET assume_abort_if_not(var_1_10 <= 127) VAL [isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=3, var_1_9=256] [L72] var_1_11 = __VERIFIER_nondet_char() [L73] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=0, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=3, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=0, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=3, var_1_9=256] [L73] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=0, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=3, var_1_9=256] [L74] CALL assume_abort_if_not(var_1_11 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=0, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=3, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=0, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=3, var_1_9=256] [L74] RET assume_abort_if_not(var_1_11 <= 127) VAL [isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=0, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=3, var_1_9=256] [L75] var_1_13 = __VERIFIER_nondet_float() [L76] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=0, var_1_12=162/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=3, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=0, var_1_12=162/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=3, var_1_9=256] [L76] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=0, var_1_12=162/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=3, var_1_9=256] [L77] var_1_14 = __VERIFIER_nondet_float() [L78] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=0, var_1_12=162/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=3, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=0, var_1_12=162/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=3, var_1_9=256] [L78] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=0, var_1_12=162/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=3, var_1_9=256] [L79] var_1_15 = __VERIFIER_nondet_float() [L80] CALL assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=0, var_1_12=162/5, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=3, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=0, var_1_12=162/5, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=3, var_1_9=256] [L80] RET assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=0, var_1_12=162/5, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=3, var_1_9=256] [L81] var_1_16 = __VERIFIER_nondet_float() [L82] 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_9=256, var_1_10=-1, var_1_11=0, var_1_12=162/5, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=3, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=0, var_1_12=162/5, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=3, var_1_9=256] [L82] 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_9=256, var_1_10=-1, var_1_11=0, var_1_12=162/5, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=3, var_1_9=256] [L96] RET updateVariables() [L97] CALL step() [L39] COND TRUE (var_1_10 - var_1_11) >= last_1_var_1_9 [L40] var_1_9 = (var_1_11 + 2u) VAL [isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=0, var_1_12=162/5, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=3, var_1_9=2] [L42] COND FALSE !(\read(var_1_2)) [L45] var_1_12 = ((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16))) VAL [isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=0, var_1_12=2, var_1_15=2, var_1_16=0, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=3, var_1_9=2] [L47] var_1_17 = -4 VAL [isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=0, var_1_12=2, var_1_15=2, var_1_16=0, var_1_17=-4, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=3, var_1_9=2] [L48] COND FALSE !(\read(var_1_2)) VAL [isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=0, var_1_12=2, var_1_15=2, var_1_16=0, var_1_17=-4, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=3, var_1_9=2] [L97] RET step() [L98] CALL, EXPR property() [L88-L89] return (((var_1_2 ? ((var_1_3 && (var_1_12 <= (- 63.9f))) ? ((var_1_12 >= var_1_12) ? (((var_1_9 / var_1_7) <= var_1_9) ? (var_1_1 == ((signed long int) var_1_9)) : 1) : 1) : 1) : 1) && (((var_1_10 - var_1_11) >= last_1_var_1_9) ? (var_1_9 == ((unsigned long int) (var_1_11 + 2u))) : 1)) && (var_1_2 ? (var_1_12 == ((float) ((((((((var_1_13 - var_1_14) < 0 ) ? -(var_1_13 - var_1_14) : (var_1_13 - var_1_14)))) < (((((var_1_15) < (var_1_16)) ? (var_1_15) : (var_1_16))))) ? (((((var_1_13 - var_1_14) < 0 ) ? -(var_1_13 - var_1_14) : (var_1_13 - var_1_14)))) : (((((var_1_15) < (var_1_16)) ? (var_1_15) : (var_1_16)))))))) : (var_1_12 == ((float) ((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16))))))) && (var_1_17 == ((signed char) -4)) ; VAL [\result=0, isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=0, var_1_12=2, var_1_15=2, var_1_16=0, var_1_17=-4, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=3, var_1_9=2] [L98] RET, EXPR property() [L98] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=0, var_1_12=2, var_1_15=2, var_1_16=0, var_1_17=-4, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=3, var_1_9=2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=0, var_1_12=2, var_1_15=2, var_1_16=0, var_1_17=-4, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=3, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 49 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 3, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 14 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14 mSDsluCounter, 190 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 52 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9 IncrementalHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 138 mSDtfsCounter, 9 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 101 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49occurred in iteration=0, InterpolantAutomatonStates: 5, 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, 8 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 485 NumberOfCodeBlocks, 485 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 288 ConstructedInterpolants, 0 QuantifiedInterpolants, 298 SizeOfPredicates, 0 NumberOfNonLiveVariables, 227 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 1232/1260 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-04 00:21:44,699 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-40.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 9dff56f51c27efe8188b93a5bc7538c1f88ddad58c38db68dc6e9ef1b97db7e2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:21:46,539 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:21:46,636 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 00:21:46,642 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:21:46,644 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:21:46,668 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:21:46,670 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:21:46,670 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:21:46,670 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:21:46,671 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:21:46,671 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:21:46,671 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:21:46,672 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:21:46,672 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:21:46,672 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:21:46,672 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:21:46,672 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:21:46,673 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:21:46,673 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:21:46,673 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:21:46,673 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:21:46,673 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:21:46,673 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:21:46,673 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 00:21:46,673 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 00:21:46,673 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 00:21:46,673 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:21:46,674 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:21:46,674 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:21:46,674 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:21:46,674 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:21:46,674 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:21:46,675 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:21:46,675 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:21:46,675 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:21:46,675 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:21:46,675 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:21:46,675 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:21:46,675 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:21:46,675 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 00:21:46,675 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 00:21:46,675 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:21:46,675 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:21:46,675 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:21:46,675 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:21:46,675 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 -> 9dff56f51c27efe8188b93a5bc7538c1f88ddad58c38db68dc6e9ef1b97db7e2 [2025-03-04 00:21:46,952 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:21:46,960 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:21:46,962 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:21:46,964 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:21:46,964 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:21:46,965 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-40.i [2025-03-04 00:21:48,136 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd404a97a/ee4dd9960eb144d68c612c2c69357e75/FLAG444766579 [2025-03-04 00:21:48,329 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:21:48,330 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-40.i [2025-03-04 00:21:48,339 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd404a97a/ee4dd9960eb144d68c612c2c69357e75/FLAG444766579 [2025-03-04 00:21:48,702 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd404a97a/ee4dd9960eb144d68c612c2c69357e75 [2025-03-04 00:21:48,704 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:21:48,706 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:21:48,707 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:21:48,707 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:21:48,710 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:21:48,710 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:21:48" (1/1) ... [2025-03-04 00:21:48,711 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dae1f51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:21:48, skipping insertion in model container [2025-03-04 00:21:48,711 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:21:48" (1/1) ... [2025-03-04 00:21:48,724 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:21:48,824 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-40.i[915,928] [2025-03-04 00:21:48,861 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:21:48,876 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:21:48,884 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-40.i[915,928] [2025-03-04 00:21:48,898 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:21:48,910 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:21:48,911 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:21:48 WrapperNode [2025-03-04 00:21:48,911 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:21:48,912 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:21:48,912 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:21:48,912 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:21:48,918 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:21:48" (1/1) ... [2025-03-04 00:21:48,924 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:21:48" (1/1) ... [2025-03-04 00:21:48,939 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 99 [2025-03-04 00:21:48,939 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:21:48,940 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:21:48,940 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:21:48,940 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:21:48,947 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:21:48" (1/1) ... [2025-03-04 00:21:48,947 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:21:48" (1/1) ... [2025-03-04 00:21:48,949 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:21:48" (1/1) ... [2025-03-04 00:21:48,957 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 00:21:48,957 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:21:48" (1/1) ... [2025-03-04 00:21:48,957 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:21:48" (1/1) ... [2025-03-04 00:21:48,962 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:21:48" (1/1) ... [2025-03-04 00:21:48,967 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:21:48" (1/1) ... [2025-03-04 00:21:48,968 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:21:48" (1/1) ... [2025-03-04 00:21:48,969 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:21:48" (1/1) ... [2025-03-04 00:21:48,970 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:21:48,971 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:21:48,971 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:21:48,971 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:21:48,972 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:21:48" (1/1) ... [2025-03-04 00:21:48,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:21:48,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:21:49,001 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 00:21:49,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 00:21:49,025 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:21:49,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 00:21:49,025 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:21:49,026 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:21:49,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:21:49,026 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:21:49,087 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:21:49,090 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:21:49,643 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-04 00:21:49,643 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:21:49,652 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:21:49,652 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:21:49,652 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:21:49 BoogieIcfgContainer [2025-03-04 00:21:49,652 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:21:49,654 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:21:49,654 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:21:49,658 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:21:49,658 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:21:48" (1/3) ... [2025-03-04 00:21:49,658 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57b60163 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:21:49, skipping insertion in model container [2025-03-04 00:21:49,658 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:21:48" (2/3) ... [2025-03-04 00:21:49,659 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57b60163 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:21:49, skipping insertion in model container [2025-03-04 00:21:49,659 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:21:49" (3/3) ... [2025-03-04 00:21:49,660 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-40.i [2025-03-04 00:21:49,670 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:21:49,671 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount25_file-40.i that has 2 procedures, 49 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:21:49,706 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:21:49,713 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@78df56e0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:21:49,714 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:21:49,716 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 32 states have internal predecessors, (41), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 00:21:49,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-04 00:21:49,722 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:21:49,723 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:21:49,723 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:21:49,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:21:49,726 INFO L85 PathProgramCache]: Analyzing trace with hash -687193478, now seen corresponding path program 1 times [2025-03-04 00:21:49,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:21:49,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1131777952] [2025-03-04 00:21:49,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:21:49,734 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:21:49,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:21:49,736 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 00:21:49,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-04 00:21:49,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-04 00:21:49,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-04 00:21:49,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:21:49,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:21:49,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:21:49,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:21:50,027 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2025-03-04 00:21:50,028 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:21:50,028 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:21:50,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1131777952] [2025-03-04 00:21:50,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1131777952] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:21:50,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:21:50,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 00:21:50,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405040567] [2025-03-04 00:21:50,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:21:50,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:21:50,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:21:50,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:21:50,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:21:50,051 INFO L87 Difference]: Start difference. First operand has 49 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 32 states have internal predecessors, (41), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) 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, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 00:21:50,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:21:50,067 INFO L93 Difference]: Finished difference Result 92 states and 152 transitions. [2025-03-04 00:21:50,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:21:50,068 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, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 97 [2025-03-04 00:21:50,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:21:50,073 INFO L225 Difference]: With dead ends: 92 [2025-03-04 00:21:50,073 INFO L226 Difference]: Without dead ends: 46 [2025-03-04 00:21:50,075 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:21:50,076 INFO L435 NwaCegarLoop]: 66 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, 66 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:21:50,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:21:50,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-04 00:21:50,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-03-04 00:21:50,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 00:21:50,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 66 transitions. [2025-03-04 00:21:50,114 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 66 transitions. Word has length 97 [2025-03-04 00:21:50,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:21:50,114 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 66 transitions. [2025-03-04 00:21:50,114 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, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 00:21:50,114 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 66 transitions. [2025-03-04 00:21:50,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-04 00:21:50,116 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:21:50,116 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:21:50,127 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-04 00:21:50,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:21:50,317 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:21:50,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:21:50,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1922032693, now seen corresponding path program 1 times [2025-03-04 00:21:50,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:21:50,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1159495263] [2025-03-04 00:21:50,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:21:50,319 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:21:50,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:21:50,322 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 00:21:50,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-04 00:21:50,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-04 00:21:50,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-04 00:21:50,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:21:50,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:21:50,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 00:21:50,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:21:50,631 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 00:21:50,631 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:21:50,631 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:21:50,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1159495263] [2025-03-04 00:21:50,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1159495263] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:21:50,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:21:50,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:21:50,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105480600] [2025-03-04 00:21:50,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:21:50,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:21:50,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:21:50,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:21:50,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:21:50,635 INFO L87 Difference]: Start difference. First operand 46 states and 66 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 00:21:50,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:21:50,882 INFO L93 Difference]: Finished difference Result 99 states and 140 transitions. [2025-03-04 00:21:50,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:21:50,882 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 97 [2025-03-04 00:21:50,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:21:50,884 INFO L225 Difference]: With dead ends: 99 [2025-03-04 00:21:50,884 INFO L226 Difference]: Without dead ends: 56 [2025-03-04 00:21:50,884 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:21:50,885 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 14 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:21:50,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 123 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:21:50,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-04 00:21:50,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 48. [2025-03-04 00:21:50,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 states have internal predecessors, (38), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 00:21:50,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 68 transitions. [2025-03-04 00:21:50,895 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 68 transitions. Word has length 97 [2025-03-04 00:21:50,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:21:50,896 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 68 transitions. [2025-03-04 00:21:50,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 00:21:50,896 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2025-03-04 00:21:50,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-04 00:21:50,897 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:21:50,897 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:21:50,907 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-04 00:21:51,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:21:51,098 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:21:51,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:21:51,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1485430922, now seen corresponding path program 1 times [2025-03-04 00:21:51,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:21:51,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [709820800] [2025-03-04 00:21:51,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:21:51,099 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:21:51,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:21:51,102 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 00:21:51,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-04 00:21:51,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-04 00:21:51,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-04 00:21:51,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:21:51,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:21:51,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 00:21:51,344 INFO L279 TraceCheckSpWp]: Computing forward predicates...