./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-91.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_loopvsstraightlinecode_25-1loop_file-91.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 fcc09d49231b686aa277ecab6a7e97333755471ed05bf82f2888dada5ad54255 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 23:15:18,146 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 23:15:18,192 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 23:15:18,195 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 23:15:18,199 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 23:15:18,217 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 23:15:18,217 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 23:15:18,217 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 23:15:18,218 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 23:15:18,218 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 23:15:18,218 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 23:15:18,218 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 23:15:18,218 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 23:15:18,218 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 23:15:18,219 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 23:15:18,219 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 23:15:18,220 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 23:15:18,220 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 23:15:18,220 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 23:15:18,221 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 23:15:18,221 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 23:15:18,221 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 23:15:18,221 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 23:15:18,221 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 23:15:18,221 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 23:15:18,221 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 23:15:18,221 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 23:15:18,221 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 23:15:18,221 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 23:15:18,221 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 23:15:18,222 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 23:15:18,222 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 23:15:18,222 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:15:18,222 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 23:15:18,222 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 23:15:18,222 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 23:15:18,222 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 23:15:18,222 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 23:15:18,223 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 23:15:18,223 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 23:15:18,223 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 23:15:18,223 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 23:15:18,223 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 23:15:18,223 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 -> fcc09d49231b686aa277ecab6a7e97333755471ed05bf82f2888dada5ad54255 [2025-03-03 23:15:18,432 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 23:15:18,437 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 23:15:18,441 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 23:15:18,441 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 23:15:18,442 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 23:15:18,443 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-91.i [2025-03-03 23:15:19,601 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecc0ab71a/6c598d352c3e41caa3e9eaf5d2d5ecf8/FLAG3bbe52104 [2025-03-03 23:15:19,821 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 23:15:19,823 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-91.i [2025-03-03 23:15:19,830 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecc0ab71a/6c598d352c3e41caa3e9eaf5d2d5ecf8/FLAG3bbe52104 [2025-03-03 23:15:20,169 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecc0ab71a/6c598d352c3e41caa3e9eaf5d2d5ecf8 [2025-03-03 23:15:20,171 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 23:15:20,172 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 23:15:20,173 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 23:15:20,173 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 23:15:20,176 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 23:15:20,176 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:15:20" (1/1) ... [2025-03-03 23:15:20,177 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6dd28bc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:20, skipping insertion in model container [2025-03-03 23:15:20,177 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:15:20" (1/1) ... [2025-03-03 23:15:20,186 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 23:15:20,280 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_loopvsstraightlinecode_25-1loop_file-91.i[915,928] [2025-03-03 23:15:20,316 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:15:20,324 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 23:15:20,333 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_loopvsstraightlinecode_25-1loop_file-91.i[915,928] [2025-03-03 23:15:20,354 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:15:20,370 INFO L204 MainTranslator]: Completed translation [2025-03-03 23:15:20,370 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:20 WrapperNode [2025-03-03 23:15:20,371 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 23:15:20,372 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 23:15:20,372 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 23:15:20,372 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 23:15:20,377 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:20" (1/1) ... [2025-03-03 23:15:20,382 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:20" (1/1) ... [2025-03-03 23:15:20,407 INFO L138 Inliner]: procedures = 26, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 127 [2025-03-03 23:15:20,408 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 23:15:20,408 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 23:15:20,408 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 23:15:20,408 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 23:15:20,415 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:20" (1/1) ... [2025-03-03 23:15:20,416 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:20" (1/1) ... [2025-03-03 23:15:20,422 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:20" (1/1) ... [2025-03-03 23:15:20,437 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-03 23:15:20,438 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:20" (1/1) ... [2025-03-03 23:15:20,439 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:20" (1/1) ... [2025-03-03 23:15:20,447 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:20" (1/1) ... [2025-03-03 23:15:20,448 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:20" (1/1) ... [2025-03-03 23:15:20,449 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:20" (1/1) ... [2025-03-03 23:15:20,449 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:20" (1/1) ... [2025-03-03 23:15:20,451 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 23:15:20,451 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 23:15:20,451 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 23:15:20,451 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 23:15:20,452 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:20" (1/1) ... [2025-03-03 23:15:20,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:15:20,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:15:20,483 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-03 23:15:20,488 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-03 23:15:20,503 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 23:15:20,503 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 23:15:20,503 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 23:15:20,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 23:15:20,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 23:15:20,503 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 23:15:20,557 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 23:15:20,558 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 23:15:20,752 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L86: havoc property_#t~ite13#1;havoc property_#t~ite12#1;havoc property_#t~bitwise11#1;havoc property_#t~short14#1; [2025-03-03 23:15:20,775 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-03-03 23:15:20,776 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 23:15:20,793 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 23:15:20,794 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 23:15:20,794 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:15:20 BoogieIcfgContainer [2025-03-03 23:15:20,794 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 23:15:20,796 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 23:15:20,797 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 23:15:20,800 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 23:15:20,801 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:15:20" (1/3) ... [2025-03-03 23:15:20,801 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26b30c7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:15:20, skipping insertion in model container [2025-03-03 23:15:20,802 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:20" (2/3) ... [2025-03-03 23:15:20,802 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26b30c7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:15:20, skipping insertion in model container [2025-03-03 23:15:20,802 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:15:20" (3/3) ... [2025-03-03 23:15:20,803 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-91.i [2025-03-03 23:15:20,814 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 23:15:20,815 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-91.i that has 2 procedures, 54 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 23:15:20,859 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 23:15:20,867 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;@b52e909, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 23:15:20,869 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 23:15:20,873 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 40 states have (on average 1.425) internal successors, (57), 41 states have internal predecessors, (57), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-03 23:15:20,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-03 23:15:20,880 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:15:20,880 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 23:15:20,880 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:15:20,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:15:20,886 INFO L85 PathProgramCache]: Analyzing trace with hash 884144366, now seen corresponding path program 1 times [2025-03-03 23:15:20,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:15:20,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688888859] [2025-03-03 23:15:20,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:15:20,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:15:20,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-03 23:15:20,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 23:15:20,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:15:20,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:15:21,076 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-03-03 23:15:21,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:15:21,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688888859] [2025-03-03 23:15:21,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688888859] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:15:21,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1534254562] [2025-03-03 23:15:21,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:15:21,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:15:21,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:15:21,080 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-03 23:15:21,082 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-03 23:15:21,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-03 23:15:21,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 23:15:21,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:15:21,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:15:21,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 23:15:21,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:15:21,184 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-03-03 23:15:21,186 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:15:21,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1534254562] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:15:21,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 23:15:21,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 23:15:21,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238423541] [2025-03-03 23:15:21,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:15:21,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 23:15:21,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:15:21,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 23:15:21,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:15:21,205 INFO L87 Difference]: Start difference. First operand has 54 states, 40 states have (on average 1.425) internal successors, (57), 41 states have internal predecessors, (57), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) 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, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 23:15:21,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:15:21,226 INFO L93 Difference]: Finished difference Result 105 states and 166 transitions. [2025-03-03 23:15:21,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 23:15:21,228 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, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 75 [2025-03-03 23:15:21,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:15:21,232 INFO L225 Difference]: With dead ends: 105 [2025-03-03 23:15:21,232 INFO L226 Difference]: Without dead ends: 51 [2025-03-03 23:15:21,234 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 76 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-03 23:15:21,236 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:15:21,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:15:21,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-03 23:15:21,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-03-03 23:15:21,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 38 states have (on average 1.368421052631579) internal successors, (52), 38 states have internal predecessors, (52), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-03 23:15:21,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 74 transitions. [2025-03-03 23:15:21,264 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 74 transitions. Word has length 75 [2025-03-03 23:15:21,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:15:21,264 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 74 transitions. [2025-03-03 23:15:21,265 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, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 23:15:21,265 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 74 transitions. [2025-03-03 23:15:21,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-03 23:15:21,267 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:15:21,267 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 23:15:21,274 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-03 23:15:21,472 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-03 23:15:21,472 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:15:21,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:15:21,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1959835757, now seen corresponding path program 1 times [2025-03-03 23:15:21,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:15:21,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093995123] [2025-03-03 23:15:21,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:15:21,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:15:21,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-03 23:15:21,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 23:15:21,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:15:21,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:15:22,529 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-03 23:15:22,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:15:22,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093995123] [2025-03-03 23:15:22,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093995123] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:15:22,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:15:22,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 23:15:22,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279589073] [2025-03-03 23:15:22,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:15:22,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 23:15:22,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:15:22,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 23:15:22,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 23:15:22,533 INFO L87 Difference]: Start difference. First operand 51 states and 74 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-03 23:15:26,752 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-03 23:15:30,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-03 23:15:34,757 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-03 23:15:35,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:15:35,039 INFO L93 Difference]: Finished difference Result 158 states and 226 transitions. [2025-03-03 23:15:35,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 23:15:35,039 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 75 [2025-03-03 23:15:35,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:15:35,041 INFO L225 Difference]: With dead ends: 158 [2025-03-03 23:15:35,041 INFO L226 Difference]: Without dead ends: 110 [2025-03-03 23:15:35,041 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 23:15:35,042 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 91 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.4s IncrementalHoareTripleChecker+Time [2025-03-03 23:15:35,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 387 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 115 Invalid, 3 Unknown, 0 Unchecked, 12.4s Time] [2025-03-03 23:15:35,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-03-03 23:15:35,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 54. [2025-03-03 23:15:35,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 41 states have internal predecessors, (56), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-03 23:15:35,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 78 transitions. [2025-03-03 23:15:35,060 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 78 transitions. Word has length 75 [2025-03-03 23:15:35,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:15:35,061 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 78 transitions. [2025-03-03 23:15:35,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-03 23:15:35,061 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 78 transitions. [2025-03-03 23:15:35,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-03 23:15:35,062 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:15:35,062 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 23:15:35,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 23:15:35,062 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:15:35,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:15:35,063 INFO L85 PathProgramCache]: Analyzing trace with hash -592321204, now seen corresponding path program 1 times [2025-03-03 23:15:35,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:15:35,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371803463] [2025-03-03 23:15:35,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:15:35,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:15:35,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-03 23:15:35,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 23:15:35,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:15:35,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 23:15:35,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [908212762] [2025-03-03 23:15:35,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:15:35,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:15:35,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:15:35,104 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-03 23:15:35,106 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-03 23:15:35,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-03 23:15:35,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 23:15:35,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:15:35,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 23:15:35,173 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 23:15:35,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-03 23:15:35,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 23:15:35,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:15:35,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 23:15:35,232 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 23:15:35,233 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 23:15:35,233 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 23:15:35,241 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 23:15:35,439 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-03 23:15:35,441 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-03 23:15:35,481 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 23:15:35,484 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 11:15:35 BoogieIcfgContainer [2025-03-03 23:15:35,484 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 23:15:35,485 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 23:15:35,485 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 23:15:35,485 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 23:15:35,487 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:15:20" (3/4) ... [2025-03-03 23:15:35,488 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 23:15:35,489 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 23:15:35,490 INFO L158 Benchmark]: Toolchain (without parser) took 15317.65ms. Allocated memory is still 142.6MB. Free memory was 110.5MB in the beginning and 93.1MB in the end (delta: 17.4MB). Peak memory consumption was 19.6MB. Max. memory is 16.1GB. [2025-03-03 23:15:35,490 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 127.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:15:35,490 INFO L158 Benchmark]: CACSL2BoogieTranslator took 198.55ms. Allocated memory is still 142.6MB. Free memory was 110.5MB in the beginning and 97.9MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 23:15:35,491 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.85ms. Allocated memory is still 142.6MB. Free memory was 97.9MB in the beginning and 96.7MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:15:35,491 INFO L158 Benchmark]: Boogie Preprocessor took 42.50ms. Allocated memory is still 142.6MB. Free memory was 96.7MB in the beginning and 94.3MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:15:35,491 INFO L158 Benchmark]: IcfgBuilder took 343.11ms. Allocated memory is still 142.6MB. Free memory was 94.3MB in the beginning and 76.4MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 23:15:35,492 INFO L158 Benchmark]: TraceAbstraction took 14688.38ms. Allocated memory is still 142.6MB. Free memory was 76.4MB in the beginning and 93.1MB in the end (delta: -16.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:15:35,492 INFO L158 Benchmark]: Witness Printer took 4.17ms. Allocated memory is still 142.6MB. Free memory was 93.1MB in the beginning and 93.1MB in the end (delta: 37.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:15:35,493 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 127.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 198.55ms. Allocated memory is still 142.6MB. Free memory was 110.5MB in the beginning and 97.9MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.85ms. Allocated memory is still 142.6MB. Free memory was 97.9MB in the beginning and 96.7MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 42.50ms. Allocated memory is still 142.6MB. Free memory was 96.7MB in the beginning and 94.3MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 343.11ms. Allocated memory is still 142.6MB. Free memory was 94.3MB in the beginning and 76.4MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 14688.38ms. Allocated memory is still 142.6MB. Free memory was 76.4MB in the beginning and 93.1MB in the end (delta: -16.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.17ms. Allocated memory is still 142.6MB. Free memory was 93.1MB in the beginning and 93.1MB in the end (delta: 37.0kB). 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 86, overapproximation of someBinaryFLOATComparisonOperation at line 78, overapproximation of someBinaryFLOATComparisonOperation at line 51. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 100000000; [L23] signed short int var_1_5 = 1; [L24] signed short int var_1_8 = -128; [L25] signed short int var_1_9 = 1; [L26] float var_1_10 = 25.8; [L27] unsigned char var_1_11 = 0; [L28] unsigned char var_1_12 = 1; [L29] float var_1_13 = 16.45; [L30] unsigned long int var_1_14 = 200; [L31] unsigned short int var_1_15 = 32; [L32] unsigned short int var_1_16 = 256; VAL [isInitial=0, var_1_10=129/5, var_1_11=0, var_1_12=1, var_1_13=329/20, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=-128, var_1_9=1] [L90] isInitial = 1 [L91] FCALL initially() [L92] int k_loop; [L93] k_loop = 0 VAL [isInitial=1, k_loop=0, var_1_10=129/5, var_1_11=0, var_1_12=1, var_1_13=329/20, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=-128, var_1_9=1] [L93] COND TRUE k_loop < 1 [L94] FCALL updateLastVariables() [L95] CALL updateVariables() [L65] var_1_8 = __VERIFIER_nondet_short() [L66] CALL assume_abort_if_not(var_1_8 >= -32767) VAL [\old(cond)=1, isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=1, var_1_13=329/20, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=-32767, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=1, var_1_13=329/20, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=-32767, var_1_9=1] [L66] RET assume_abort_if_not(var_1_8 >= -32767) VAL [isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=1, var_1_13=329/20, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=-32767, var_1_9=1] [L67] CALL assume_abort_if_not(var_1_8 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=1, var_1_13=329/20, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=-32767, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=1, var_1_13=329/20, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=-32767, var_1_9=1] [L67] RET assume_abort_if_not(var_1_8 <= 32766) VAL [isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=1, var_1_13=329/20, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=-32767, var_1_9=1] [L68] var_1_9 = __VERIFIER_nondet_short() [L69] CALL assume_abort_if_not(var_1_9 >= -32767) VAL [\old(cond)=1, isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=1, var_1_13=329/20, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=-32767, var_1_9=-32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=1, var_1_13=329/20, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=-32767, var_1_9=-32767] [L69] RET assume_abort_if_not(var_1_9 >= -32767) VAL [isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=1, var_1_13=329/20, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=-32767, var_1_9=-32767] [L70] CALL assume_abort_if_not(var_1_9 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=1, var_1_13=329/20, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=-32767, var_1_9=-32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=1, var_1_13=329/20, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=-32767, var_1_9=-32767] [L70] RET assume_abort_if_not(var_1_9 <= 32766) VAL [isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=1, var_1_13=329/20, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=-32767, var_1_9=-32767] [L71] var_1_11 = __VERIFIER_nondet_uchar() [L72] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=129/5, var_1_12=1, var_1_13=329/20, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=-32767, var_1_9=-32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=129/5, var_1_12=1, var_1_13=329/20, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=-32767, var_1_9=-32767] [L72] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=129/5, var_1_12=1, var_1_13=329/20, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=-32767, var_1_9=-32767] [L73] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=1, var_1_13=329/20, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=-32767, var_1_9=-32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=1, var_1_13=329/20, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=-32767, var_1_9=-32767] [L73] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=1, var_1_13=329/20, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=-32767, var_1_9=-32767] [L74] var_1_12 = __VERIFIER_nondet_uchar() [L75] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=129/5, var_1_11=0, var_1_13=329/20, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=-32767, var_1_9=-32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=129/5, var_1_11=0, var_1_13=329/20, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=-32767, var_1_9=-32767] [L75] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, var_1_10=129/5, var_1_11=0, var_1_13=329/20, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=-32767, var_1_9=-32767] [L76] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=0, var_1_13=329/20, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=-32767, var_1_9=-32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=0, var_1_13=329/20, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=-32767, var_1_9=-32767] [L76] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=0, var_1_13=329/20, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=-32767, var_1_9=-32767] [L77] var_1_13 = __VERIFIER_nondet_float() [L78] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=0, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=-32767, var_1_9=-32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=0, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=-32767, var_1_9=-32767] [L78] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=0, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=-32767, var_1_9=-32767] [L79] var_1_16 = __VERIFIER_nondet_ushort() [L80] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=0, var_1_14=200, var_1_15=32, var_1_1=100000000, var_1_5=1, var_1_8=-32767, var_1_9=-32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=0, var_1_14=200, var_1_15=32, var_1_1=100000000, var_1_5=1, var_1_8=-32767, var_1_9=-32767] [L80] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=0, var_1_14=200, var_1_15=32, var_1_1=100000000, var_1_5=1, var_1_8=-32767, var_1_9=-32767] [L81] CALL assume_abort_if_not(var_1_16 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=0, var_1_14=200, var_1_15=32, var_1_16=3, var_1_1=100000000, var_1_5=1, var_1_8=-32767, var_1_9=-32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=0, var_1_14=200, var_1_15=32, var_1_16=3, var_1_1=100000000, var_1_5=1, var_1_8=-32767, var_1_9=-32767] [L81] RET assume_abort_if_not(var_1_16 <= 65534) VAL [isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=0, var_1_14=200, var_1_15=32, var_1_16=3, var_1_1=100000000, var_1_5=1, var_1_8=-32767, var_1_9=-32767] [L95] RET updateVariables() [L96] CALL step() [L36] var_1_15 = var_1_16 [L37] var_1_14 = var_1_15 VAL [isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=0, var_1_14=3, var_1_15=3, var_1_16=3, var_1_1=100000000, var_1_5=1, var_1_8=-32767, var_1_9=-32767] [L38] COND FALSE !(\read(var_1_11)) [L49] var_1_10 = var_1_13 VAL [isInitial=1, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=3, var_1_15=3, var_1_16=3, var_1_1=100000000, var_1_5=1, var_1_8=-32767, var_1_9=-32767] [L51] COND FALSE !(var_1_10 >= 50.4f) VAL [isInitial=1, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=3, var_1_15=3, var_1_16=3, var_1_1=100000000, var_1_5=1, var_1_8=-32767, var_1_9=-32767] [L54] COND FALSE !(var_1_15 == (var_1_14 * var_1_15)) [L61] var_1_5 = var_1_8 VAL [isInitial=1, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=3, var_1_15=3, var_1_16=3, var_1_1=100000000, var_1_5=-32767, var_1_8=-32767, var_1_9=-32767] [L96] RET step() [L97] CALL, EXPR property() [L86] EXPR (((var_1_10 >= 50.4f) ? (var_1_1 == ((unsigned long int) ((((var_1_15) > (var_1_15)) ? (var_1_15) : (var_1_15))))) : 1) && ((var_1_15 == (var_1_14 * var_1_15)) ? ((var_1_10 >= (var_1_10 + var_1_10)) ? (var_1_5 == ((signed short int) ((((var_1_8) > (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_5 == ((signed short int) var_1_8))) : (var_1_5 == ((signed short int) var_1_8)))) && (var_1_11 ? (var_1_12 ? (((var_1_15 & var_1_14) == var_1_15) ? (var_1_10 == ((float) var_1_13)) : (var_1_10 == ((float) var_1_13))) : (var_1_10 == ((float) var_1_13))) : (var_1_10 == ((float) var_1_13))) VAL [isInitial=1, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=3, var_1_15=3, var_1_16=3, var_1_1=100000000, var_1_5=-32767, var_1_8=-32767, var_1_9=-32767] [L86-L87] return (((((var_1_10 >= 50.4f) ? (var_1_1 == ((unsigned long int) ((((var_1_15) > (var_1_15)) ? (var_1_15) : (var_1_15))))) : 1) && ((var_1_15 == (var_1_14 * var_1_15)) ? ((var_1_10 >= (var_1_10 + var_1_10)) ? (var_1_5 == ((signed short int) ((((var_1_8) > (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_5 == ((signed short int) var_1_8))) : (var_1_5 == ((signed short int) var_1_8)))) && (var_1_11 ? (var_1_12 ? (((var_1_15 & var_1_14) == var_1_15) ? (var_1_10 == ((float) var_1_13)) : (var_1_10 == ((float) var_1_13))) : (var_1_10 == ((float) var_1_13))) : (var_1_10 == ((float) var_1_13)))) && (var_1_14 == ((unsigned long int) var_1_15))) && (var_1_15 == ((unsigned short int) var_1_16)) ; [L97] RET, EXPR property() [L97] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=3, var_1_15=3, var_1_16=3, var_1_1=100000000, var_1_5=-32767, var_1_8=-32767, var_1_9=-32767] [L19] reach_error() VAL [isInitial=1, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=3, var_1_15=3, var_1_16=3, var_1_1=100000000, var_1_5=-32767, var_1_8=-32767, var_1_9=-32767] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 54 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.6s, OverallIterations: 3, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 12.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3 mSolverCounterUnknown, 91 SdHoareTripleChecker+Valid, 12.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 91 mSDsluCounter, 462 SdHoareTripleChecker+Invalid, 12.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 277 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 117 IncrementalHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 185 mSDtfsCounter, 117 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 85 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=0, InterpolantAutomatonStates: 7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 56 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 375 NumberOfCodeBlocks, 375 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 222 ConstructedInterpolants, 0 QuantifiedInterpolants, 265 SizeOfPredicates, 0 NumberOfNonLiveVariables, 186 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 640/660 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-03 23:15:35,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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_loopvsstraightlinecode_25-1loop_file-91.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 fcc09d49231b686aa277ecab6a7e97333755471ed05bf82f2888dada5ad54255 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 23:15:37,187 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 23:15:37,265 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 23:15:37,269 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 23:15:37,270 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 23:15:37,291 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 23:15:37,291 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 23:15:37,292 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 23:15:37,292 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 23:15:37,292 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 23:15:37,292 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 23:15:37,292 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 23:15:37,292 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 23:15:37,292 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 23:15:37,293 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 23:15:37,293 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 23:15:37,293 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 23:15:37,293 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 23:15:37,293 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 23:15:37,293 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 23:15:37,293 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 23:15:37,293 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 23:15:37,293 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 23:15:37,293 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 23:15:37,293 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 23:15:37,294 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 23:15:37,294 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 23:15:37,294 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 23:15:37,294 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 23:15:37,294 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 23:15:37,294 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 23:15:37,294 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 23:15:37,294 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 23:15:37,294 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 23:15:37,294 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:15:37,294 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 23:15:37,295 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 23:15:37,295 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 23:15:37,295 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 23:15:37,295 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 23:15:37,295 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 23:15:37,295 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 23:15:37,295 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 23:15:37,295 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 23:15:37,295 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 23:15:37,295 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 -> fcc09d49231b686aa277ecab6a7e97333755471ed05bf82f2888dada5ad54255 [2025-03-03 23:15:37,534 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 23:15:37,542 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 23:15:37,543 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 23:15:37,544 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 23:15:37,545 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 23:15:37,546 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-91.i [2025-03-03 23:15:38,641 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdce5cd49/e017ee9f9cc84c1b93d610f642015758/FLAG032bdb019 [2025-03-03 23:15:38,842 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 23:15:38,842 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-91.i [2025-03-03 23:15:38,849 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdce5cd49/e017ee9f9cc84c1b93d610f642015758/FLAG032bdb019 [2025-03-03 23:15:39,210 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdce5cd49/e017ee9f9cc84c1b93d610f642015758 [2025-03-03 23:15:39,212 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 23:15:39,213 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 23:15:39,214 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 23:15:39,214 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 23:15:39,217 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 23:15:39,218 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:15:39" (1/1) ... [2025-03-03 23:15:39,219 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c8c0e41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:39, skipping insertion in model container [2025-03-03 23:15:39,219 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:15:39" (1/1) ... [2025-03-03 23:15:39,229 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 23:15:39,332 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_loopvsstraightlinecode_25-1loop_file-91.i[915,928] [2025-03-03 23:15:39,368 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:15:39,381 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 23:15:39,391 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_loopvsstraightlinecode_25-1loop_file-91.i[915,928] [2025-03-03 23:15:39,410 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:15:39,426 INFO L204 MainTranslator]: Completed translation [2025-03-03 23:15:39,427 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:39 WrapperNode [2025-03-03 23:15:39,427 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 23:15:39,428 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 23:15:39,428 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 23:15:39,428 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 23:15:39,432 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:39" (1/1) ... [2025-03-03 23:15:39,439 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:39" (1/1) ... [2025-03-03 23:15:39,457 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 92 [2025-03-03 23:15:39,458 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 23:15:39,458 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 23:15:39,458 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 23:15:39,458 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 23:15:39,464 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:39" (1/1) ... [2025-03-03 23:15:39,464 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:39" (1/1) ... [2025-03-03 23:15:39,466 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:39" (1/1) ... [2025-03-03 23:15:39,473 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-03 23:15:39,473 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:39" (1/1) ... [2025-03-03 23:15:39,473 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:39" (1/1) ... [2025-03-03 23:15:39,479 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:39" (1/1) ... [2025-03-03 23:15:39,479 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:39" (1/1) ... [2025-03-03 23:15:39,480 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:39" (1/1) ... [2025-03-03 23:15:39,481 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:39" (1/1) ... [2025-03-03 23:15:39,482 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 23:15:39,483 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 23:15:39,483 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 23:15:39,483 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 23:15:39,484 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:39" (1/1) ... [2025-03-03 23:15:39,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:15:39,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:15:39,509 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-03 23:15:39,511 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-03 23:15:39,529 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 23:15:39,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 23:15:39,529 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 23:15:39,529 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 23:15:39,529 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 23:15:39,529 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 23:15:39,589 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 23:15:39,591 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 23:15:39,829 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2025-03-03 23:15:39,829 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 23:15:39,837 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 23:15:39,837 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 23:15:39,837 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:15:39 BoogieIcfgContainer [2025-03-03 23:15:39,837 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 23:15:39,839 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 23:15:39,839 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 23:15:39,843 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 23:15:39,843 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:15:39" (1/3) ... [2025-03-03 23:15:39,844 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22db688d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:15:39, skipping insertion in model container [2025-03-03 23:15:39,844 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:39" (2/3) ... [2025-03-03 23:15:39,844 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22db688d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:15:39, skipping insertion in model container [2025-03-03 23:15:39,844 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:15:39" (3/3) ... [2025-03-03 23:15:39,846 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-91.i [2025-03-03 23:15:39,857 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 23:15:39,859 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-91.i that has 2 procedures, 41 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 23:15:39,905 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 23:15:39,915 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;@742bc7f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 23:15:39,917 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 23:15:39,919 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 28 states have internal predecessors, (37), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-03 23:15:39,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-03 23:15:39,926 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:15:39,927 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 23:15:39,927 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:15:39,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:15:39,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1902683528, now seen corresponding path program 1 times [2025-03-03 23:15:39,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:15:39,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [873412720] [2025-03-03 23:15:39,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:15:39,941 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-03 23:15:39,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:15:39,943 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-03 23:15:39,945 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-03 23:15:40,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-03 23:15:40,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-03 23:15:40,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:15:40,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:15:40,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 23:15:40,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:15:42,113 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 90 proven. 6 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-03-03 23:15:42,113 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 23:16:01,422 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-03 23:16:01,423 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 23:16:01,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [873412720] [2025-03-03 23:16:01,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [873412720] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 23:16:01,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 23:16:01,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17 [2025-03-03 23:16:01,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923625825] [2025-03-03 23:16:01,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:16:01,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 23:16:01,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 23:16:01,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 23:16:01,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2025-03-03 23:16:01,444 INFO L87 Difference]: Start difference. First operand has 41 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 28 states have internal predecessors, (37), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-03 23:16:08,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:16:08,251 INFO L93 Difference]: Finished difference Result 126 states and 194 transitions. [2025-03-03 23:16:08,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 23:16:08,254 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 73 [2025-03-03 23:16:08,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:16:08,259 INFO L225 Difference]: With dead ends: 126 [2025-03-03 23:16:08,259 INFO L226 Difference]: Without dead ends: 79 [2025-03-03 23:16:08,261 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2025-03-03 23:16:08,264 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 114 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-03 23:16:08,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 275 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-03 23:16:08,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-03 23:16:08,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 73. [2025-03-03 23:16:08,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 48 states have (on average 1.1875) internal successors, (57), 49 states have internal predecessors, (57), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-03 23:16:08,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 97 transitions. [2025-03-03 23:16:08,296 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 97 transitions. Word has length 73 [2025-03-03 23:16:08,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:16:08,296 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 97 transitions. [2025-03-03 23:16:08,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-03 23:16:08,296 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 97 transitions. [2025-03-03 23:16:08,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-03 23:16:08,298 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:16:08,298 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 23:16:08,305 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-03 23:16:08,501 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-03 23:16:08,501 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:16:08,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:16:08,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1874054377, now seen corresponding path program 1 times [2025-03-03 23:16:08,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:16:08,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [27493357] [2025-03-03 23:16:08,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:16:08,502 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-03 23:16:08,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:16:08,504 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-03 23:16:08,505 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-03 23:16:08,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-03 23:16:08,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-03 23:16:08,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:16:08,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:16:08,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 23:16:08,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:16:10,799 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 90 proven. 6 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-03-03 23:16:10,799 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 23:16:19,535 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 24 proven. 6 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-03-03 23:16:19,535 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 23:16:19,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [27493357] [2025-03-03 23:16:19,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [27493357] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 23:16:19,536 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 23:16:19,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2025-03-03 23:16:19,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969689312] [2025-03-03 23:16:19,536 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 23:16:19,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-03 23:16:19,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 23:16:19,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-03 23:16:19,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2025-03-03 23:16:19,538 INFO L87 Difference]: Start difference. First operand 73 states and 97 transitions. Second operand has 21 states, 21 states have (on average 2.380952380952381) internal successors, (50), 21 states have internal predecessors, (50), 4 states have call successors, (22), 3 states have call predecessors, (22), 5 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2025-03-03 23:16:33,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:16:33,684 INFO L93 Difference]: Finished difference Result 227 states and 297 transitions. [2025-03-03 23:16:33,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-03 23:16:33,686 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.380952380952381) internal successors, (50), 21 states have internal predecessors, (50), 4 states have call successors, (22), 3 states have call predecessors, (22), 5 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) Word has length 73 [2025-03-03 23:16:33,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:16:33,689 INFO L225 Difference]: With dead ends: 227 [2025-03-03 23:16:33,689 INFO L226 Difference]: Without dead ends: 157 [2025-03-03 23:16:33,690 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=392, Invalid=1090, Unknown=0, NotChecked=0, Total=1482 [2025-03-03 23:16:33,690 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 151 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2025-03-03 23:16:33,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 346 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2025-03-03 23:16:33,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-03-03 23:16:33,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 51. [2025-03-03 23:16:33,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 36 states have internal predecessors, (44), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-03 23:16:33,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 66 transitions. [2025-03-03 23:16:33,704 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 66 transitions. Word has length 73 [2025-03-03 23:16:33,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:16:33,704 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 66 transitions. [2025-03-03 23:16:33,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.380952380952381) internal successors, (50), 21 states have internal predecessors, (50), 4 states have call successors, (22), 3 states have call predecessors, (22), 5 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2025-03-03 23:16:33,705 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 66 transitions. [2025-03-03 23:16:33,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-03 23:16:33,706 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:16:33,706 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 23:16:33,712 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-03 23:16:33,909 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-03 23:16:33,909 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:16:33,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:16:33,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1175966989, now seen corresponding path program 1 times [2025-03-03 23:16:33,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:16:33,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1391076464] [2025-03-03 23:16:33,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:16:33,911 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-03 23:16:33,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:16:33,913 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-03 23:16:33,914 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-03 23:16:33,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-03 23:16:34,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-03 23:16:34,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:16:34,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:16:34,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-03 23:16:34,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:16:34,825 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 90 proven. 6 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-03-03 23:16:34,825 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 23:16:46,701 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-03 23:16:46,702 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 23:16:46,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1391076464] [2025-03-03 23:16:46,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1391076464] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 23:16:46,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 23:16:46,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 16 [2025-03-03 23:16:46,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623107262] [2025-03-03 23:16:46,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:16:46,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 23:16:46,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 23:16:46,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 23:16:46,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2025-03-03 23:16:46,703 INFO L87 Difference]: Start difference. First operand 51 states and 66 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11)