./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-46.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_amount10_file-46.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 4a308eb18926ee1b904bfd6b10e1895d29d262c0ba78b97b1e51aab5a345984c --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:04:43,710 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:04:43,819 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:04:43,823 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:04:43,827 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:04:43,867 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:04:43,868 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:04:43,868 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:04:43,869 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:04:43,872 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:04:43,873 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:04:43,873 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:04:43,873 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:04:43,873 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:04:43,873 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:04:43,873 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:04:43,873 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:04:43,873 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:04:43,873 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:04:43,873 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:04:43,873 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:04:43,874 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:04:43,874 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:04:43,874 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:04:43,874 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:04:43,874 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:04:43,874 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:04:43,874 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:04:43,874 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:04:43,874 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:04:43,874 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:04:43,874 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:04:43,874 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:04:43,874 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:04:43,874 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:04:43,874 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:04:43,874 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:04:43,876 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:04:43,876 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:04:43,877 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:04:43,877 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:04:43,877 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:04:43,877 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:04:43,877 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 -> 4a308eb18926ee1b904bfd6b10e1895d29d262c0ba78b97b1e51aab5a345984c [2025-03-04 00:04:44,341 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:04:44,357 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:04:44,364 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:04:44,366 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:04:44,366 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:04:44,367 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-46.i [2025-03-04 00:04:46,123 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5bb43130/090014ba00eb4ee6a4381ae71b710f78/FLAG8e703c1ad [2025-03-04 00:04:46,525 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:04:46,529 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-46.i [2025-03-04 00:04:46,543 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5bb43130/090014ba00eb4ee6a4381ae71b710f78/FLAG8e703c1ad [2025-03-04 00:04:46,580 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5bb43130/090014ba00eb4ee6a4381ae71b710f78 [2025-03-04 00:04:46,594 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:04:46,595 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:04:46,600 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:04:46,600 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:04:46,609 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:04:46,610 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:04:46" (1/1) ... [2025-03-04 00:04:46,615 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6afa18a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:46, skipping insertion in model container [2025-03-04 00:04:46,615 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:04:46" (1/1) ... [2025-03-04 00:04:46,640 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:04:46,843 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_amount10_file-46.i[915,928] [2025-03-04 00:04:46,904 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:04:46,923 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:04:46,943 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_amount10_file-46.i[915,928] [2025-03-04 00:04:46,965 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:04:47,002 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:04:47,003 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:47 WrapperNode [2025-03-04 00:04:47,003 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:04:47,004 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:04:47,004 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:04:47,004 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:04:47,012 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:04:47" (1/1) ... [2025-03-04 00:04:47,028 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:04:47" (1/1) ... [2025-03-04 00:04:47,063 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 93 [2025-03-04 00:04:47,067 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:04:47,067 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:04:47,067 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:04:47,067 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:04:47,077 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:47" (1/1) ... [2025-03-04 00:04:47,078 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:47" (1/1) ... [2025-03-04 00:04:47,081 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:47" (1/1) ... [2025-03-04 00:04:47,097 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:04:47,105 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:47" (1/1) ... [2025-03-04 00:04:47,105 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:47" (1/1) ... [2025-03-04 00:04:47,108 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:47" (1/1) ... [2025-03-04 00:04:47,110 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:47" (1/1) ... [2025-03-04 00:04:47,115 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:47" (1/1) ... [2025-03-04 00:04:47,116 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:47" (1/1) ... [2025-03-04 00:04:47,117 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:04:47,122 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:04:47,123 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:04:47,123 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:04:47,124 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:47" (1/1) ... [2025-03-04 00:04:47,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:04:47,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:04:47,163 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:04:47,168 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:04:47,206 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:04:47,206 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:04:47,206 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:04:47,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:04:47,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:04:47,206 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:04:47,301 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:04:47,304 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:04:47,594 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-04 00:04:47,595 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:04:47,610 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:04:47,611 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:04:47,612 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:04:47 BoogieIcfgContainer [2025-03-04 00:04:47,612 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:04:47,618 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:04:47,618 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:04:47,625 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:04:47,626 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:04:46" (1/3) ... [2025-03-04 00:04:47,626 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bed466c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:04:47, skipping insertion in model container [2025-03-04 00:04:47,627 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:47" (2/3) ... [2025-03-04 00:04:47,628 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bed466c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:04:47, skipping insertion in model container [2025-03-04 00:04:47,628 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:04:47" (3/3) ... [2025-03-04 00:04:47,629 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-46.i [2025-03-04 00:04:47,649 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:04:47,652 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-46.i that has 2 procedures, 44 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:04:47,742 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:04:47,763 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;@7f6006e8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:04:47,767 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:04:47,773 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 28 states have internal predecessors, (33), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 00:04:47,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-04 00:04:47,787 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:04:47,787 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:04:47,792 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:04:47,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:04:47,801 INFO L85 PathProgramCache]: Analyzing trace with hash 255127262, now seen corresponding path program 1 times [2025-03-04 00:04:47,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:04:47,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058164833] [2025-03-04 00:04:47,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:04:47,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:04:47,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-04 00:04:47,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-04 00:04:47,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:04:47,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:04:48,155 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-04 00:04:48,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:04:48,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058164833] [2025-03-04 00:04:48,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058164833] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:04:48,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1776692004] [2025-03-04 00:04:48,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:04:48,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:04:48,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:04:48,165 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:04:48,203 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:04:48,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-04 00:04:48,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-04 00:04:48,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:04:48,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:04:48,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:04:48,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:04:48,443 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-04 00:04:48,444 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:04:48,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1776692004] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:04:48,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:04:48,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:04:48,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394368525] [2025-03-04 00:04:48,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:04:48,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:04:48,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:04:48,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:04:48,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:04:48,497 INFO L87 Difference]: Start difference. First operand has 44 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 28 states have internal predecessors, (33), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 00:04:48,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:04:48,519 INFO L93 Difference]: Finished difference Result 82 states and 131 transitions. [2025-03-04 00:04:48,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:04:48,521 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 90 [2025-03-04 00:04:48,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:04:48,531 INFO L225 Difference]: With dead ends: 82 [2025-03-04 00:04:48,532 INFO L226 Difference]: Without dead ends: 41 [2025-03-04 00:04:48,534 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:04:48,541 INFO L435 NwaCegarLoop]: 56 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, 56 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:04:48,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:04:48,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-03-04 00:04:48,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2025-03-04 00:04:48,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 00:04:48,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 56 transitions. [2025-03-04 00:04:48,599 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 56 transitions. Word has length 90 [2025-03-04 00:04:48,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:04:48,599 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 56 transitions. [2025-03-04 00:04:48,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 00:04:48,601 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 56 transitions. [2025-03-04 00:04:48,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-04 00:04:48,607 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:04:48,607 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:04:48,619 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 00:04:48,809 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:04:48,809 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:04:48,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:04:48,811 INFO L85 PathProgramCache]: Analyzing trace with hash 584511034, now seen corresponding path program 1 times [2025-03-04 00:04:48,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:04:48,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901683735] [2025-03-04 00:04:48,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:04:48,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:04:48,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-04 00:04:48,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-04 00:04:48,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:04:48,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:04:48,970 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 00:04:48,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-04 00:04:49,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-04 00:04:49,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:04:49,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:04:49,129 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 00:04:49,129 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 00:04:49,133 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 00:04:49,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:04:49,140 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-04 00:04:49,213 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 00:04:49,222 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 12:04:49 BoogieIcfgContainer [2025-03-04 00:04:49,222 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 00:04:49,222 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 00:04:49,226 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 00:04:49,227 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 00:04:49,227 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:04:47" (3/4) ... [2025-03-04 00:04:49,229 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 00:04:49,229 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 00:04:49,230 INFO L158 Benchmark]: Toolchain (without parser) took 2634.99ms. Allocated memory is still 142.6MB. Free memory was 113.7MB in the beginning and 105.9MB in the end (delta: 7.8MB). Peak memory consumption was 5.6MB. Max. memory is 16.1GB. [2025-03-04 00:04:49,230 INFO L158 Benchmark]: CDTParser took 3.37ms. Allocated memory is still 226.5MB. Free memory is still 144.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:04:49,230 INFO L158 Benchmark]: CACSL2BoogieTranslator took 403.06ms. Allocated memory is still 142.6MB. Free memory was 113.3MB in the beginning and 101.6MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:04:49,230 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.25ms. Allocated memory is still 142.6MB. Free memory was 101.6MB in the beginning and 100.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:04:49,230 INFO L158 Benchmark]: Boogie Preprocessor took 49.53ms. Allocated memory is still 142.6MB. Free memory was 100.1MB in the beginning and 98.9MB in the end (delta: 1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:04:49,236 INFO L158 Benchmark]: IcfgBuilder took 489.45ms. Allocated memory is still 142.6MB. Free memory was 98.9MB in the beginning and 85.3MB in the end (delta: 13.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:04:49,236 INFO L158 Benchmark]: TraceAbstraction took 1603.79ms. Allocated memory is still 142.6MB. Free memory was 84.6MB in the beginning and 105.9MB in the end (delta: -21.4MB). Peak memory consumption was 47.6MB. Max. memory is 16.1GB. [2025-03-04 00:04:49,236 INFO L158 Benchmark]: Witness Printer took 6.76ms. Allocated memory is still 142.6MB. Free memory was 105.9MB in the beginning and 105.9MB in the end (delta: 17.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:04:49,237 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 3.37ms. Allocated memory is still 226.5MB. Free memory is still 144.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 403.06ms. Allocated memory is still 142.6MB. Free memory was 113.3MB in the beginning and 101.6MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.25ms. Allocated memory is still 142.6MB. Free memory was 101.6MB in the beginning and 100.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 49.53ms. Allocated memory is still 142.6MB. Free memory was 100.1MB in the beginning and 98.9MB in the end (delta: 1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 489.45ms. Allocated memory is still 142.6MB. Free memory was 98.9MB in the beginning and 85.3MB in the end (delta: 13.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1603.79ms. Allocated memory is still 142.6MB. Free memory was 84.6MB in the beginning and 105.9MB in the end (delta: -21.4MB). Peak memory consumption was 47.6MB. Max. memory is 16.1GB. * Witness Printer took 6.76ms. Allocated memory is still 142.6MB. Free memory was 105.9MB in the beginning and 105.9MB in the end (delta: 17.6kB). 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 someUnaryDOUBLEoperation at line 31, overapproximation of someBinaryDOUBLEComparisonOperation at line 67, overapproximation of someBinaryDOUBLEComparisonOperation at line 74, overapproximation of someBinaryDOUBLEComparisonOperation at line 51, overapproximation of someBinaryDOUBLEComparisonOperation at line 69, overapproximation of someBinaryDOUBLEComparisonOperation at line 53, overapproximation of someBinaryDOUBLEComparisonOperation at line 38. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 255.3; [L23] unsigned char var_1_2 = 0; [L24] double var_1_3 = 1000000000000.5; [L25] double var_1_4 = 999999999.125; [L26] signed long int var_1_5 = 0; [L27] signed long int var_1_6 = 100; [L28] signed long int var_1_7 = 256; [L29] signed long int var_1_8 = -5; [L30] double var_1_9 = 24.2; [L31] double var_1_10 = -0.125; [L32] double var_1_11 = -0.5; VAL [isInitial=0, var_1_1=2553/10, var_1_2=0, var_1_3=2000000000001/2, var_1_4=7999999993/8, var_1_5=0, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L78] isInitial = 1 [L79] FCALL initially() [L80] COND TRUE 1 [L81] FCALL updateLastVariables() [L82] CALL updateVariables() [L47] var_1_2 = __VERIFIER_nondet_uchar() [L48] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_3=2000000000001/2, var_1_4=7999999993/8, var_1_5=0, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_3=2000000000001/2, var_1_4=7999999993/8, var_1_5=0, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L48] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_1=2553/10, var_1_3=2000000000001/2, var_1_4=7999999993/8, var_1_5=0, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L49] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_3=2000000000001/2, var_1_4=7999999993/8, var_1_5=0, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_3=2000000000001/2, var_1_4=7999999993/8, var_1_5=0, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L49] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_3=2000000000001/2, var_1_4=7999999993/8, var_1_5=0, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L50] var_1_3 = __VERIFIER_nondet_double() [L51] CALL assume_abort_if_not((var_1_3 >= -922337.2036854765600e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_4=7999999993/8, var_1_5=0, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_4=7999999993/8, var_1_5=0, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L51] RET assume_abort_if_not((var_1_3 >= -922337.2036854765600e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_4=7999999993/8, var_1_5=0, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L52] var_1_4 = __VERIFIER_nondet_double() [L53] CALL assume_abort_if_not((var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=0, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=0, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L53] RET assume_abort_if_not((var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=0, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L54] var_1_5 = __VERIFIER_nondet_long() [L55] CALL assume_abort_if_not(var_1_5 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L55] RET assume_abort_if_not(var_1_5 >= -2147483648) VAL [isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L56] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L56] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L57] var_1_6 = __VERIFIER_nondet_long() [L58] CALL assume_abort_if_not(var_1_6 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L58] RET assume_abort_if_not(var_1_6 >= -2147483648) VAL [isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L59] CALL assume_abort_if_not(var_1_6 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L59] RET assume_abort_if_not(var_1_6 <= 2147483647) VAL [isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L60] var_1_7 = __VERIFIER_nondet_long() [L61] CALL assume_abort_if_not(var_1_7 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=-5, var_1_9=121/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=-5, var_1_9=121/5] [L61] RET assume_abort_if_not(var_1_7 >= -2147483648) VAL [isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=-5, var_1_9=121/5] [L62] CALL assume_abort_if_not(var_1_7 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=-5, var_1_9=121/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=-5, var_1_9=121/5] [L62] RET assume_abort_if_not(var_1_7 <= 2147483647) VAL [isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=-5, var_1_9=121/5] [L63] var_1_8 = __VERIFIER_nondet_long() [L64] CALL assume_abort_if_not(var_1_8 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5, var_1_9=121/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5, var_1_9=121/5] [L64] RET assume_abort_if_not(var_1_8 >= -2147483648) VAL [isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5, var_1_9=121/5] [L65] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5, var_1_9=121/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5, var_1_9=121/5] [L65] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5, var_1_9=121/5] [L66] var_1_9 = __VERIFIER_nondet_double() [L67] CALL assume_abort_if_not((var_1_9 >= -461168.6018427382800e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5] [L67] RET assume_abort_if_not((var_1_9 >= -461168.6018427382800e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5] [L68] var_1_10 = __VERIFIER_nondet_double() [L69] CALL assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5] [L69] RET assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5] [L82] RET updateVariables() [L83] CALL step() [L36] signed long int stepLocal_0 = (((((((var_1_5) < (var_1_6)) ? (var_1_5) : (var_1_6)))) > (var_1_7)) ? (((((var_1_5) < (var_1_6)) ? (var_1_5) : (var_1_6)))) : (var_1_7)); VAL [isInitial=1, stepLocal_0=4, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5] [L37] COND TRUE \read(var_1_2) [L38] var_1_1 = ((((var_1_3) > (var_1_4)) ? (var_1_3) : (var_1_4))) VAL [isInitial=1, stepLocal_0=4, var_1_1=1000000000005, var_1_2=1, var_1_3=1000000000005, var_1_4=1000000000005, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5] [L44] var_1_11 = var_1_3 VAL [isInitial=1, stepLocal_0=4, var_1_11=1000000000005, var_1_1=1000000000005, var_1_2=1, var_1_3=1000000000005, var_1_4=1000000000005, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5] [L83] RET step() [L84] CALL, EXPR property() [L74-L75] return (var_1_2 ? (var_1_1 == ((double) ((((var_1_3) > (var_1_4)) ? (var_1_3) : (var_1_4))))) : ((((((((((var_1_5) < (var_1_6)) ? (var_1_5) : (var_1_6)))) > (var_1_7)) ? (((((var_1_5) < (var_1_6)) ? (var_1_5) : (var_1_6)))) : (var_1_7))) < var_1_8) ? (var_1_1 == ((double) (var_1_9 + var_1_10))) : 1)) && (var_1_11 == ((double) var_1_3)) ; VAL [\result=0, isInitial=1, var_1_11=1000000000005, var_1_1=1000000000005, var_1_2=1, var_1_3=1000000000005, var_1_4=1000000000005, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5] [L84] RET, EXPR property() [L84] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_11=1000000000005, var_1_1=1000000000005, var_1_2=1, var_1_3=1000000000005, var_1_4=1000000000005, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5] [L19] reach_error() VAL [isInitial=1, var_1_11=1000000000005, var_1_1=1000000000005, var_1_2=1, var_1_3=1000000000005, var_1_4=1000000000005, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 44 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 2, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 56 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 56 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 91 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=0, InterpolantAutomatonStates: 2, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 270 NumberOfCodeBlocks, 270 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 178 ConstructedInterpolants, 0 QuantifiedInterpolants, 178 SizeOfPredicates, 0 NumberOfNonLiveVariables, 204 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 702/728 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:04:49,265 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_amount10_file-46.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 4a308eb18926ee1b904bfd6b10e1895d29d262c0ba78b97b1e51aab5a345984c --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:04:51,300 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:04:51,382 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 00:04:51,389 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:04:51,389 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:04:51,408 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:04:51,409 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:04:51,409 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:04:51,410 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:04:51,410 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:04:51,410 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:04:51,411 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:04:51,411 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:04:51,411 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:04:51,411 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:04:51,412 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:04:51,412 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:04:51,412 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:04:51,412 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:04:51,412 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:04:51,412 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:04:51,412 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:04:51,412 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:04:51,412 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 00:04:51,413 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 00:04:51,413 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 00:04:51,413 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:04:51,413 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:04:51,413 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:04:51,413 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:04:51,413 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:04:51,413 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:04:51,413 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:04:51,414 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:04:51,414 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:04:51,414 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:04:51,414 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:04:51,414 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:04:51,414 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:04:51,414 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 00:04:51,414 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 00:04:51,414 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:04:51,414 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:04:51,415 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:04:51,415 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:04:51,415 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 -> 4a308eb18926ee1b904bfd6b10e1895d29d262c0ba78b97b1e51aab5a345984c [2025-03-04 00:04:51,651 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:04:51,656 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:04:51,661 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:04:51,662 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:04:51,662 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:04:51,663 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-46.i [2025-03-04 00:04:52,897 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/545a1e3a1/c8931203d2a2400e8bf4de435e772ea3/FLAGf6f010148 [2025-03-04 00:04:53,082 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:04:53,083 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-46.i [2025-03-04 00:04:53,090 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/545a1e3a1/c8931203d2a2400e8bf4de435e772ea3/FLAGf6f010148 [2025-03-04 00:04:53,104 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/545a1e3a1/c8931203d2a2400e8bf4de435e772ea3 [2025-03-04 00:04:53,108 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:04:53,110 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:04:53,111 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:04:53,111 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:04:53,115 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:04:53,115 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:04:53" (1/1) ... [2025-03-04 00:04:53,117 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34b30e4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:53, skipping insertion in model container [2025-03-04 00:04:53,118 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:04:53" (1/1) ... [2025-03-04 00:04:53,134 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:04:53,234 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_amount10_file-46.i[915,928] [2025-03-04 00:04:53,268 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:04:53,279 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:04:53,288 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_amount10_file-46.i[915,928] [2025-03-04 00:04:53,308 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:04:53,319 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:04:53,320 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:53 WrapperNode [2025-03-04 00:04:53,321 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:04:53,321 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:04:53,322 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:04:53,322 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:04:53,327 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:04:53" (1/1) ... [2025-03-04 00:04:53,334 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:04:53" (1/1) ... [2025-03-04 00:04:53,353 INFO L138 Inliner]: procedures = 27, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 89 [2025-03-04 00:04:53,355 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:04:53,356 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:04:53,356 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:04:53,356 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:04:53,362 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:53" (1/1) ... [2025-03-04 00:04:53,362 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:53" (1/1) ... [2025-03-04 00:04:53,365 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:53" (1/1) ... [2025-03-04 00:04:53,377 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:04:53,381 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:53" (1/1) ... [2025-03-04 00:04:53,382 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:53" (1/1) ... [2025-03-04 00:04:53,386 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:53" (1/1) ... [2025-03-04 00:04:53,391 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:53" (1/1) ... [2025-03-04 00:04:53,393 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:53" (1/1) ... [2025-03-04 00:04:53,397 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:53" (1/1) ... [2025-03-04 00:04:53,399 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:04:53,400 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:04:53,400 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:04:53,400 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:04:53,404 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:53" (1/1) ... [2025-03-04 00:04:53,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:04:53,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:04:53,434 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:04:53,436 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:04:53,456 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:04:53,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 00:04:53,456 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:04:53,456 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:04:53,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:04:53,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:04:53,519 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:04:53,521 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:04:54,003 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-04 00:04:54,004 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:04:54,012 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:04:54,012 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:04:54,012 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:04:54 BoogieIcfgContainer [2025-03-04 00:04:54,012 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:04:54,015 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:04:54,015 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:04:54,019 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:04:54,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:04:53" (1/3) ... [2025-03-04 00:04:54,020 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@492f50b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:04:54, skipping insertion in model container [2025-03-04 00:04:54,020 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:53" (2/3) ... [2025-03-04 00:04:54,020 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@492f50b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:04:54, skipping insertion in model container [2025-03-04 00:04:54,020 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:04:54" (3/3) ... [2025-03-04 00:04:54,022 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-46.i [2025-03-04 00:04:54,037 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:04:54,039 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-46.i that has 2 procedures, 44 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:04:54,098 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:04:54,110 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;@1263dcd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:04:54,111 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:04:54,115 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 28 states have internal predecessors, (33), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 00:04:54,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-04 00:04:54,125 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:04:54,126 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:04:54,127 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:04:54,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:04:54,132 INFO L85 PathProgramCache]: Analyzing trace with hash 255127262, now seen corresponding path program 1 times [2025-03-04 00:04:54,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:04:54,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [747674882] [2025-03-04 00:04:54,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:04:54,146 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:04:54,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:04:54,152 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:04:54,153 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:04:54,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-04 00:04:54,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-04 00:04:54,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:04:54,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:04:54,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:04:54,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:04:54,410 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2025-03-04 00:04:54,411 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:04:54,411 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:04:54,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [747674882] [2025-03-04 00:04:54,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [747674882] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:04:54,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:04:54,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 00:04:54,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007881896] [2025-03-04 00:04:54,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:04:54,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:04:54,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:04:54,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:04:54,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:04:54,431 INFO L87 Difference]: Start difference. First operand has 44 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 28 states have internal predecessors, (33), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 00:04:54,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:04:54,451 INFO L93 Difference]: Finished difference Result 82 states and 131 transitions. [2025-03-04 00:04:54,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:04:54,452 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 90 [2025-03-04 00:04:54,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:04:54,456 INFO L225 Difference]: With dead ends: 82 [2025-03-04 00:04:54,456 INFO L226 Difference]: Without dead ends: 41 [2025-03-04 00:04:54,459 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 89 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:04:54,462 INFO L435 NwaCegarLoop]: 56 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, 56 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:04:54,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:04:54,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-03-04 00:04:54,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2025-03-04 00:04:54,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 00:04:54,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 56 transitions. [2025-03-04 00:04:54,494 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 56 transitions. Word has length 90 [2025-03-04 00:04:54,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:04:54,495 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 56 transitions. [2025-03-04 00:04:54,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 00:04:54,495 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 56 transitions. [2025-03-04 00:04:54,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-04 00:04:54,499 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:04:54,499 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:04:54,506 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:04:54,700 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:04:54,700 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:04:54,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:04:54,701 INFO L85 PathProgramCache]: Analyzing trace with hash 584511034, now seen corresponding path program 1 times [2025-03-04 00:04:54,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:04:54,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [156500657] [2025-03-04 00:04:54,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:04:54,701 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:04:54,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:04:54,708 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:04:54,708 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:04:54,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-04 00:04:54,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-04 00:04:54,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:04:54,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:04:54,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 00:04:54,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:05:18,014 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 118 proven. 60 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2025-03-04 00:05:18,015 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:06:09,618 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:06:09,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [156500657] [2025-03-04 00:06:09,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [156500657] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:06:09,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [955675454] [2025-03-04 00:06:09,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:06:09,618 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-04 00:06:09,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-04 00:06:09,643 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-04 00:06:09,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2025-03-04 00:06:09,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-04 00:06:10,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-04 00:06:10,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:06:10,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:06:10,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 00:06:10,353 INFO L279 TraceCheckSpWp]: Computing forward predicates...