./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-12.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-12.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 0499f378fe2f7c6b53ba392652fadba715cc5ffbe1faa5de00e26792301d1a93 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 03:35:34,811 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 03:35:34,868 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 03:35:34,873 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 03:35:34,875 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 03:35:34,897 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 03:35:34,898 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 03:35:34,898 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 03:35:34,898 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 03:35:34,899 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 03:35:34,899 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 03:35:34,899 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 03:35:34,900 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 03:35:34,900 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 03:35:34,900 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 03:35:34,900 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 03:35:34,900 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 03:35:34,900 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 03:35:34,900 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 03:35:34,900 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 03:35:34,900 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 03:35:34,900 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 03:35:34,901 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 03:35:34,901 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 03:35:34,901 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 03:35:34,901 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 03:35:34,901 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 03:35:34,901 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 03:35:34,901 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 03:35:34,901 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 03:35:34,901 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 03:35:34,901 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 03:35:34,902 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:35:34,902 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 03:35:34,902 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 03:35:34,902 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 03:35:34,902 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 03:35:34,902 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 03:35:34,903 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 03:35:34,903 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 03:35:34,903 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 03:35:34,903 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 03:35:34,903 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 03:35:34,903 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 -> 0499f378fe2f7c6b53ba392652fadba715cc5ffbe1faa5de00e26792301d1a93 [2025-03-17 03:35:35,126 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 03:35:35,133 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 03:35:35,135 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 03:35:35,136 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 03:35:35,136 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 03:35:35,138 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-12.i [2025-03-17 03:35:36,311 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a65dbdc4/a2bfd7f25c614e9abd9d245e57b6e9dd/FLAG39d791d26 [2025-03-17 03:35:36,567 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 03:35:36,567 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-12.i [2025-03-17 03:35:36,574 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a65dbdc4/a2bfd7f25c614e9abd9d245e57b6e9dd/FLAG39d791d26 [2025-03-17 03:35:36,891 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a65dbdc4/a2bfd7f25c614e9abd9d245e57b6e9dd [2025-03-17 03:35:36,893 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 03:35:36,894 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 03:35:36,895 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 03:35:36,895 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 03:35:36,898 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 03:35:36,898 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:35:36" (1/1) ... [2025-03-17 03:35:36,899 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@300332b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:35:36, skipping insertion in model container [2025-03-17 03:35:36,899 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:35:36" (1/1) ... [2025-03-17 03:35:36,910 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 03:35:37,010 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-while_file-12.i[915,928] [2025-03-17 03:35:37,055 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:35:37,065 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 03:35:37,073 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-while_file-12.i[915,928] [2025-03-17 03:35:37,094 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:35:37,112 INFO L204 MainTranslator]: Completed translation [2025-03-17 03:35:37,112 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:35:37 WrapperNode [2025-03-17 03:35:37,113 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 03:35:37,114 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 03:35:37,115 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 03:35:37,115 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 03:35:37,119 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:35:37" (1/1) ... [2025-03-17 03:35:37,126 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:35:37" (1/1) ... [2025-03-17 03:35:37,147 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 111 [2025-03-17 03:35:37,147 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 03:35:37,148 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 03:35:37,148 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 03:35:37,148 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 03:35:37,161 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:35:37" (1/1) ... [2025-03-17 03:35:37,161 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:35:37" (1/1) ... [2025-03-17 03:35:37,163 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:35:37" (1/1) ... [2025-03-17 03:35:37,176 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-17 03:35:37,180 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:35:37" (1/1) ... [2025-03-17 03:35:37,180 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:35:37" (1/1) ... [2025-03-17 03:35:37,184 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:35:37" (1/1) ... [2025-03-17 03:35:37,186 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:35:37" (1/1) ... [2025-03-17 03:35:37,187 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:35:37" (1/1) ... [2025-03-17 03:35:37,189 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:35:37" (1/1) ... [2025-03-17 03:35:37,193 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 03:35:37,195 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 03:35:37,195 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 03:35:37,196 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 03:35:37,197 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:35:37" (1/1) ... [2025-03-17 03:35:37,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:35:37,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:35:37,224 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-17 03:35:37,228 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-17 03:35:37,246 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 03:35:37,247 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 03:35:37,247 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 03:35:37,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 03:35:37,247 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 03:35:37,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 03:35:37,302 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 03:35:37,304 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 03:35:37,498 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-17 03:35:37,499 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 03:35:37,505 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 03:35:37,507 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 03:35:37,507 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:35:37 BoogieIcfgContainer [2025-03-17 03:35:37,507 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 03:35:37,509 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 03:35:37,509 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 03:35:37,512 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 03:35:37,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:35:36" (1/3) ... [2025-03-17 03:35:37,513 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4102e95a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:35:37, skipping insertion in model container [2025-03-17 03:35:37,513 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:35:37" (2/3) ... [2025-03-17 03:35:37,513 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4102e95a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:35:37, skipping insertion in model container [2025-03-17 03:35:37,513 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:35:37" (3/3) ... [2025-03-17 03:35:37,514 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-12.i [2025-03-17 03:35:37,526 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 03:35:37,527 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-while_file-12.i that has 2 procedures, 45 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 03:35:37,579 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 03:35:37,590 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;@3261fd7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 03:35:37,591 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 03:35:37,595 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 27 states have internal predecessors, (36), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 03:35:37,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-17 03:35:37,602 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:35:37,603 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:35:37,605 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:35:37,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:35:37,611 INFO L85 PathProgramCache]: Analyzing trace with hash -2014483481, now seen corresponding path program 1 times [2025-03-17 03:35:37,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:35:37,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963683192] [2025-03-17 03:35:37,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:35:37,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:35:37,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-17 03:35:37,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-17 03:35:37,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:35:37,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:35:37,808 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-17 03:35:37,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:35:37,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963683192] [2025-03-17 03:35:37,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963683192] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:35:37,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35352837] [2025-03-17 03:35:37,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:35:37,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:35:37,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:35:37,812 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-17 03:35:37,814 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-17 03:35:37,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-17 03:35:37,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-17 03:35:37,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:35:37,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:35:37,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 03:35:37,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:35:37,945 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-17 03:35:37,947 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:35:37,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [35352837] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:35:37,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 03:35:37,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 03:35:37,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976927015] [2025-03-17 03:35:37,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:35:37,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 03:35:37,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:35:37,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 03:35:37,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:35:37,969 INFO L87 Difference]: Start difference. First operand has 45 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 27 states have internal predecessors, (36), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 03:35:37,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:35:37,990 INFO L93 Difference]: Finished difference Result 87 states and 150 transitions. [2025-03-17 03:35:37,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 03:35:37,992 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 98 [2025-03-17 03:35:37,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:35:37,996 INFO L225 Difference]: With dead ends: 87 [2025-03-17 03:35:37,997 INFO L226 Difference]: Without dead ends: 43 [2025-03-17 03:35:38,000 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 99 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-17 03:35:38,003 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:35:38,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:35:38,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-17 03:35:38,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-03-17 03:35:38,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 03:35:38,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 64 transitions. [2025-03-17 03:35:38,040 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 64 transitions. Word has length 98 [2025-03-17 03:35:38,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:35:38,041 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 64 transitions. [2025-03-17 03:35:38,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 03:35:38,042 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 64 transitions. [2025-03-17 03:35:38,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-17 03:35:38,044 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:35:38,045 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:35:38,051 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-17 03:35:38,245 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-17 03:35:38,246 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:35:38,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:35:38,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1392804147, now seen corresponding path program 1 times [2025-03-17 03:35:38,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:35:38,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031268827] [2025-03-17 03:35:38,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:35:38,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:35:38,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-17 03:35:38,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-17 03:35:38,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:35:38,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:35:38,751 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 15 proven. 30 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-17 03:35:38,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:35:38,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031268827] [2025-03-17 03:35:38,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031268827] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:35:38,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1878125906] [2025-03-17 03:35:38,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:35:38,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:35:38,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:35:38,755 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-17 03:35:38,756 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-17 03:35:38,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-17 03:35:38,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-17 03:35:38,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:35:38,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:35:38,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 03:35:38,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:35:39,029 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 225 proven. 30 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2025-03-17 03:35:39,030 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 03:35:39,211 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 15 proven. 30 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-17 03:35:39,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1878125906] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 03:35:39,213 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 03:35:39,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2025-03-17 03:35:39,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142303646] [2025-03-17 03:35:39,213 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 03:35:39,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 03:35:39,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:35:39,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 03:35:39,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-17 03:35:39,216 INFO L87 Difference]: Start difference. First operand 43 states and 64 transitions. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-17 03:35:39,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:35:39,474 INFO L93 Difference]: Finished difference Result 139 states and 200 transitions. [2025-03-17 03:35:39,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 03:35:39,475 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 98 [2025-03-17 03:35:39,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:35:39,477 INFO L225 Difference]: With dead ends: 139 [2025-03-17 03:35:39,478 INFO L226 Difference]: Without dead ends: 97 [2025-03-17 03:35:39,479 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 193 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2025-03-17 03:35:39,480 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 75 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 03:35:39,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 127 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 03:35:39,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-17 03:35:39,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 48. [2025-03-17 03:35:39,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 03:35:39,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 68 transitions. [2025-03-17 03:35:39,497 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 68 transitions. Word has length 98 [2025-03-17 03:35:39,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:35:39,497 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 68 transitions. [2025-03-17 03:35:39,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-17 03:35:39,497 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2025-03-17 03:35:39,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-17 03:35:39,498 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:35:39,498 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:35:39,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 03:35:39,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-17 03:35:39,699 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:35:39,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:35:39,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1392774356, now seen corresponding path program 1 times [2025-03-17 03:35:39,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:35:39,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981697662] [2025-03-17 03:35:39,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:35:39,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:35:39,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-17 03:35:39,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-17 03:35:39,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:35:39,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 03:35:39,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [831060771] [2025-03-17 03:35:39,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:35:39,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:35:39,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:35:39,754 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 03:35:39,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 03:35:39,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-17 03:35:39,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-17 03:35:39,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:35:39,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 03:35:39,825 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 03:35:39,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-17 03:35:39,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-17 03:35:39,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:35:39,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 03:35:39,880 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 03:35:39,880 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 03:35:39,881 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 03:35:39,891 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 03:35:40,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:35:40,086 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-17 03:35:40,142 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 03:35:40,144 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 03:35:40 BoogieIcfgContainer [2025-03-17 03:35:40,145 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 03:35:40,145 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 03:35:40,145 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 03:35:40,146 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 03:35:40,146 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:35:37" (3/4) ... [2025-03-17 03:35:40,148 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 03:35:40,148 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 03:35:40,149 INFO L158 Benchmark]: Toolchain (without parser) took 3254.67ms. Allocated memory is still 167.8MB. Free memory was 122.5MB in the beginning and 69.9MB in the end (delta: 52.6MB). Peak memory consumption was 51.7MB. Max. memory is 16.1GB. [2025-03-17 03:35:40,149 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 119.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:35:40,149 INFO L158 Benchmark]: CACSL2BoogieTranslator took 218.81ms. Allocated memory is still 167.8MB. Free memory was 122.5MB in the beginning and 109.7MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 03:35:40,149 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.19ms. Allocated memory is still 167.8MB. Free memory was 109.7MB in the beginning and 108.1MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 03:35:40,150 INFO L158 Benchmark]: Boogie Preprocessor took 45.36ms. Allocated memory is still 167.8MB. Free memory was 108.1MB in the beginning and 106.0MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:35:40,150 INFO L158 Benchmark]: IcfgBuilder took 312.48ms. Allocated memory is still 167.8MB. Free memory was 106.0MB in the beginning and 90.0MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 03:35:40,150 INFO L158 Benchmark]: TraceAbstraction took 2636.11ms. Allocated memory is still 167.8MB. Free memory was 89.6MB in the beginning and 69.9MB in the end (delta: 19.7MB). Peak memory consumption was 18.2MB. Max. memory is 16.1GB. [2025-03-17 03:35:40,150 INFO L158 Benchmark]: Witness Printer took 2.92ms. Allocated memory is still 167.8MB. Free memory was 69.9MB in the beginning and 69.9MB in the end (delta: 41.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:35:40,151 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.23ms. Allocated memory is still 201.3MB. Free memory is still 119.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 218.81ms. Allocated memory is still 167.8MB. Free memory was 122.5MB in the beginning and 109.7MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.19ms. Allocated memory is still 167.8MB. Free memory was 109.7MB in the beginning and 108.1MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.36ms. Allocated memory is still 167.8MB. Free memory was 108.1MB in the beginning and 106.0MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 312.48ms. Allocated memory is still 167.8MB. Free memory was 106.0MB in the beginning and 90.0MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2636.11ms. Allocated memory is still 167.8MB. Free memory was 89.6MB in the beginning and 69.9MB in the end (delta: 19.7MB). Peak memory consumption was 18.2MB. Max. memory is 16.1GB. * Witness Printer took 2.92ms. Allocated memory is still 167.8MB. Free memory was 69.9MB in the beginning and 69.9MB in the end (delta: 41.5kB). 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 76, overapproximation of someBinaryFLOATComparisonOperation at line 80, overapproximation of someBinaryFLOATComparisonOperation at line 97, overapproximation of someBinaryFLOATComparisonOperation at line 82, overapproximation of someBinaryFLOATComparisonOperation at line 84, overapproximation of someBinaryFLOATComparisonOperation at line 78, overapproximation of someBinaryArithmeticFLOAToperation at line 63. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] signed long int var_1_2 = -8; [L24] signed long int var_1_3 = 128; [L25] unsigned char var_1_5 = 0; [L26] float var_1_6 = 128.625; [L27] float var_1_7 = 2.625; [L28] float var_1_8 = 25.5; [L29] float var_1_9 = 4.75; [L30] float var_1_10 = 16.4; [L31] float var_1_11 = 0.2; [L32] float var_1_12 = 499.1; [L33] unsigned char var_1_13 = 0; [L34] signed long int var_1_14 = -8; [L35] unsigned char var_1_15 = 1; [L36] unsigned char last_1_var_1_13 = 0; [L101] isInitial = 1 [L102] FCALL initially() [L103] COND TRUE 1 [L104] CALL updateLastVariables() [L94] last_1_var_1_13 = var_1_13 [L104] RET updateLastVariables() [L105] CALL updateVariables() [L66] var_1_2 = __VERIFIER_nondet_long() [L67] CALL assume_abort_if_not(var_1_2 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=128, var_1_5=0, var_1_6=1029/8, var_1_7=21/8, var_1_8=51/2, var_1_9=19/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=128, var_1_5=0, var_1_6=1029/8, var_1_7=21/8, var_1_8=51/2, var_1_9=19/4] [L67] RET assume_abort_if_not(var_1_2 >= -2147483648) VAL [isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=128, var_1_5=0, var_1_6=1029/8, var_1_7=21/8, var_1_8=51/2, var_1_9=19/4] [L68] CALL assume_abort_if_not(var_1_2 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=128, var_1_5=0, var_1_6=1029/8, var_1_7=21/8, var_1_8=51/2, var_1_9=19/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=128, var_1_5=0, var_1_6=1029/8, var_1_7=21/8, var_1_8=51/2, var_1_9=19/4] [L68] RET assume_abort_if_not(var_1_2 <= 2147483647) VAL [isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=128, var_1_5=0, var_1_6=1029/8, var_1_7=21/8, var_1_8=51/2, var_1_9=19/4] [L69] var_1_3 = __VERIFIER_nondet_long() [L70] CALL assume_abort_if_not(var_1_3 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8, var_1_7=21/8, var_1_8=51/2, var_1_9=19/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8, var_1_7=21/8, var_1_8=51/2, var_1_9=19/4] [L70] RET assume_abort_if_not(var_1_3 >= -2147483648) VAL [isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8, var_1_7=21/8, var_1_8=51/2, var_1_9=19/4] [L71] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8, var_1_7=21/8, var_1_8=51/2, var_1_9=19/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8, var_1_7=21/8, var_1_8=51/2, var_1_9=19/4] [L71] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8, var_1_7=21/8, var_1_8=51/2, var_1_9=19/4] [L72] var_1_5 = __VERIFIER_nondet_uchar() [L73] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_6=1029/8, var_1_7=21/8, var_1_8=51/2, var_1_9=19/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_6=1029/8, var_1_7=21/8, var_1_8=51/2, var_1_9=19/4] [L73] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_6=1029/8, var_1_7=21/8, var_1_8=51/2, var_1_9=19/4] [L74] CALL assume_abort_if_not(var_1_5 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8, var_1_7=21/8, var_1_8=51/2, var_1_9=19/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8, var_1_7=21/8, var_1_8=51/2, var_1_9=19/4] [L74] RET assume_abort_if_not(var_1_5 <= 0) VAL [isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8, var_1_7=21/8, var_1_8=51/2, var_1_9=19/4] [L75] var_1_7 = __VERIFIER_nondet_float() [L76] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8, var_1_8=51/2, var_1_9=19/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8, var_1_8=51/2, var_1_9=19/4] [L76] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8, var_1_8=51/2, var_1_9=19/4] [L77] var_1_8 = __VERIFIER_nondet_float() [L78] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8, var_1_9=19/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8, var_1_9=19/4] [L78] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8, var_1_9=19/4] [L79] var_1_9 = __VERIFIER_nondet_float() [L80] CALL assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8] [L80] RET assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8] [L81] var_1_10 = __VERIFIER_nondet_float() [L82] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8] [L82] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8] [L83] var_1_12 = __VERIFIER_nondet_float() [L84] CALL assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1/5, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1/5, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8] [L84] RET assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1/5, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8] [L85] var_1_14 = __VERIFIER_nondet_long() [L86] CALL assume_abort_if_not(var_1_14 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1/5, var_1_13=0, var_1_14=1, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1/5, var_1_13=0, var_1_14=1, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8] [L86] RET assume_abort_if_not(var_1_14 >= -2147483648) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1/5, var_1_13=0, var_1_14=1, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8] [L87] CALL assume_abort_if_not(var_1_14 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1/5, var_1_13=0, var_1_14=1, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1/5, var_1_13=0, var_1_14=1, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8] [L87] RET assume_abort_if_not(var_1_14 <= 2147483647) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1/5, var_1_13=0, var_1_14=1, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8] [L88] CALL assume_abort_if_not(var_1_14 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1/5, var_1_13=0, var_1_14=1, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1/5, var_1_13=0, var_1_14=1, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8] [L88] RET assume_abort_if_not(var_1_14 != 0) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1/5, var_1_13=0, var_1_14=1, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8] [L89] var_1_15 = __VERIFIER_nondet_uchar() [L90] CALL assume_abort_if_not(var_1_15 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1/5, var_1_13=0, var_1_14=1, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1/5, var_1_13=0, var_1_14=1, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8] [L90] RET assume_abort_if_not(var_1_15 >= 1) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1/5, var_1_13=0, var_1_14=1, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8] [L91] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1/5, var_1_13=0, var_1_14=1, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1/5, var_1_13=0, var_1_14=1, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8] [L91] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1/5, var_1_13=0, var_1_14=1, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8] [L105] RET updateVariables() [L106] CALL step() [L40] signed long int stepLocal_1 = var_1_3; [L41] signed long int stepLocal_0 = var_1_2; VAL [isInitial=1, last_1_var_1_13=0, stepLocal_0=-1, stepLocal_1=0, var_1_11=1/5, var_1_13=0, var_1_14=1, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8] [L42] COND FALSE !(! (-50 < var_1_2)) VAL [isInitial=1, last_1_var_1_13=0, stepLocal_0=-1, stepLocal_1=0, var_1_11=1/5, var_1_13=0, var_1_14=1, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8] [L51] COND FALSE !(var_1_2 > (var_1_3 / var_1_14)) [L58] var_1_13 = var_1_5 VAL [isInitial=1, last_1_var_1_13=0, stepLocal_0=-1, stepLocal_1=0, var_1_11=1/5, var_1_13=0, var_1_14=1, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8] [L60] COND FALSE !(\read(var_1_13)) VAL [isInitial=1, last_1_var_1_13=0, stepLocal_0=-1, stepLocal_1=0, var_1_11=1/5, var_1_13=0, var_1_14=1, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8] [L63] var_1_11 = (((((2.5f) < (((((31.75f) > (var_1_12)) ? (31.75f) : (var_1_12))))) ? (2.5f) : (((((31.75f) > (var_1_12)) ? (31.75f) : (var_1_12)))))) + 0.125f) [L106] RET step() [L107] CALL, EXPR property() [L97-L98] return ((((! (-50 < var_1_2)) ? ((var_1_2 != var_1_3) ? ((var_1_3 <= var_1_2) ? (var_1_1 == ((unsigned char) (last_1_var_1_13 && var_1_5))) : 1) : (var_1_1 == ((unsigned char) var_1_5))) : 1) && (var_1_13 ? (var_1_6 == ((float) (((((((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8))) - var_1_9)) > (var_1_10)) ? ((((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8))) - var_1_9)) : (var_1_10))))) : 1)) && (var_1_11 == ((float) (((((2.5f) < (((((31.75f) > (var_1_12)) ? (31.75f) : (var_1_12))))) ? (2.5f) : (((((31.75f) > (var_1_12)) ? (31.75f) : (var_1_12)))))) + 0.125f)))) && ((var_1_2 > (var_1_3 / var_1_14)) ? (var_1_1 ? (var_1_13 == ((unsigned char) (! var_1_15))) : (var_1_13 == ((unsigned char) 0))) : (var_1_13 == ((unsigned char) var_1_5))) ; [L107] RET, EXPR property() [L107] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 45 locations, 84 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.5s, OverallIterations: 3, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 81 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 75 mSDsluCounter, 191 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 86 mSDsCounter, 43 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 140 IncrementalHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 43 mSolverCounterUnsat, 105 mSDtfsCounter, 140 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 310 GetRequests, 292 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=2, InterpolantAutomatonStates: 17, 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, 49 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 588 NumberOfCodeBlocks, 588 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 485 ConstructedInterpolants, 0 QuantifiedInterpolants, 943 SizeOfPredicates, 2 NumberOfNonLiveVariables, 472 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 2280/2400 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-17 03:35:40,165 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-12.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 0499f378fe2f7c6b53ba392652fadba715cc5ffbe1faa5de00e26792301d1a93 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 03:35:42,074 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 03:35:42,148 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 03:35:42,154 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 03:35:42,155 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 03:35:42,180 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 03:35:42,181 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 03:35:42,181 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 03:35:42,181 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 03:35:42,181 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 03:35:42,181 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 03:35:42,181 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 03:35:42,183 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 03:35:42,183 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 03:35:42,183 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 03:35:42,184 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 03:35:42,184 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 03:35:42,184 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 03:35:42,184 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 03:35:42,184 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 03:35:42,184 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 03:35:42,184 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 03:35:42,184 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 03:35:42,184 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 03:35:42,185 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 03:35:42,185 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 03:35:42,185 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 03:35:42,185 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 03:35:42,185 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 03:35:42,185 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 03:35:42,185 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 03:35:42,186 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 03:35:42,186 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 03:35:42,186 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 03:35:42,186 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:35:42,186 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 03:35:42,186 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 03:35:42,186 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 03:35:42,187 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 03:35:42,187 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 03:35:42,187 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 03:35:42,187 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 03:35:42,187 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 03:35:42,187 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 03:35:42,187 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 03:35:42,187 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 -> 0499f378fe2f7c6b53ba392652fadba715cc5ffbe1faa5de00e26792301d1a93 [2025-03-17 03:35:42,422 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 03:35:42,431 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 03:35:42,433 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 03:35:42,434 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 03:35:42,434 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 03:35:42,435 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-12.i [2025-03-17 03:35:43,657 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bd3c1343/da714c07b1834d18a9102c4b3afb87a9/FLAG69c856bd8 [2025-03-17 03:35:43,858 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 03:35:43,858 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-12.i [2025-03-17 03:35:43,867 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bd3c1343/da714c07b1834d18a9102c4b3afb87a9/FLAG69c856bd8 [2025-03-17 03:35:43,883 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bd3c1343/da714c07b1834d18a9102c4b3afb87a9 [2025-03-17 03:35:43,886 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 03:35:43,888 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 03:35:43,890 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 03:35:43,890 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 03:35:43,894 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 03:35:43,895 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:35:43" (1/1) ... [2025-03-17 03:35:43,895 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63209d77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:35:43, skipping insertion in model container [2025-03-17 03:35:43,895 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:35:43" (1/1) ... [2025-03-17 03:35:43,910 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 03:35:44,023 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-while_file-12.i[915,928] [2025-03-17 03:35:44,076 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:35:44,091 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 03:35:44,100 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-while_file-12.i[915,928] [2025-03-17 03:35:44,126 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:35:44,144 INFO L204 MainTranslator]: Completed translation [2025-03-17 03:35:44,146 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:35:44 WrapperNode [2025-03-17 03:35:44,146 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 03:35:44,147 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 03:35:44,147 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 03:35:44,148 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 03:35:44,153 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:35:44" (1/1) ... [2025-03-17 03:35:44,161 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:35:44" (1/1) ... [2025-03-17 03:35:44,184 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 108 [2025-03-17 03:35:44,185 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 03:35:44,185 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 03:35:44,185 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 03:35:44,185 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 03:35:44,192 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:35:44" (1/1) ... [2025-03-17 03:35:44,192 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:35:44" (1/1) ... [2025-03-17 03:35:44,194 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:35:44" (1/1) ... [2025-03-17 03:35:44,206 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-17 03:35:44,206 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:35:44" (1/1) ... [2025-03-17 03:35:44,207 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:35:44" (1/1) ... [2025-03-17 03:35:44,213 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:35:44" (1/1) ... [2025-03-17 03:35:44,214 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:35:44" (1/1) ... [2025-03-17 03:35:44,216 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:35:44" (1/1) ... [2025-03-17 03:35:44,216 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:35:44" (1/1) ... [2025-03-17 03:35:44,218 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 03:35:44,219 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 03:35:44,219 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 03:35:44,219 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 03:35:44,220 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:35:44" (1/1) ... [2025-03-17 03:35:44,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:35:44,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:35:44,248 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-17 03:35:44,253 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-17 03:35:44,267 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 03:35:44,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 03:35:44,267 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 03:35:44,267 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 03:35:44,267 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 03:35:44,267 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 03:35:44,329 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 03:35:44,331 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 03:35:45,059 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-17 03:35:45,059 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 03:35:45,067 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 03:35:45,067 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 03:35:45,067 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:35:45 BoogieIcfgContainer [2025-03-17 03:35:45,068 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 03:35:45,069 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 03:35:45,069 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 03:35:45,073 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 03:35:45,073 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:35:43" (1/3) ... [2025-03-17 03:35:45,074 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4824ee65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:35:45, skipping insertion in model container [2025-03-17 03:35:45,074 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:35:44" (2/3) ... [2025-03-17 03:35:45,074 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4824ee65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:35:45, skipping insertion in model container [2025-03-17 03:35:45,074 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:35:45" (3/3) ... [2025-03-17 03:35:45,075 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-12.i [2025-03-17 03:35:45,085 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 03:35:45,086 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-while_file-12.i that has 2 procedures, 45 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 03:35:45,131 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 03:35:45,139 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;@1ed2159f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 03:35:45,139 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 03:35:45,143 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 27 states have internal predecessors, (36), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 03:35:45,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-17 03:35:45,151 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:35:45,152 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:35:45,152 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:35:45,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:35:45,156 INFO L85 PathProgramCache]: Analyzing trace with hash -2014483481, now seen corresponding path program 1 times [2025-03-17 03:35:45,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:35:45,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [788613118] [2025-03-17 03:35:45,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:35:45,165 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-17 03:35:45,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:35:45,167 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-17 03:35:45,169 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-17 03:35:45,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-17 03:35:45,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-17 03:35:45,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:35:45,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:35:45,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 03:35:45,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:35:45,479 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2025-03-17 03:35:45,480 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:35:45,480 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 03:35:45,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [788613118] [2025-03-17 03:35:45,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [788613118] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:35:45,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:35:45,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 03:35:45,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379020723] [2025-03-17 03:35:45,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:35:45,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 03:35:45,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 03:35:45,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 03:35:45,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:35:45,505 INFO L87 Difference]: Start difference. First operand has 45 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 27 states have internal predecessors, (36), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 03:35:45,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:35:45,527 INFO L93 Difference]: Finished difference Result 87 states and 150 transitions. [2025-03-17 03:35:45,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 03:35:45,530 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, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 98 [2025-03-17 03:35:45,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:35:45,537 INFO L225 Difference]: With dead ends: 87 [2025-03-17 03:35:45,537 INFO L226 Difference]: Without dead ends: 43 [2025-03-17 03:35:45,541 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 97 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-17 03:35:45,545 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:35:45,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:35:45,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-17 03:35:45,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-03-17 03:35:45,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 03:35:45,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 64 transitions. [2025-03-17 03:35:45,585 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 64 transitions. Word has length 98 [2025-03-17 03:35:45,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:35:45,585 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 64 transitions. [2025-03-17 03:35:45,585 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, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 03:35:45,585 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 64 transitions. [2025-03-17 03:35:45,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-17 03:35:45,588 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:35:45,588 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:35:45,599 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-17 03:35:45,789 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-17 03:35:45,789 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:35:45,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:35:45,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1392804147, now seen corresponding path program 1 times [2025-03-17 03:35:45,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:35:45,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [995578163] [2025-03-17 03:35:45,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:35:45,792 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-17 03:35:45,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:35:45,794 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-17 03:35:45,796 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-17 03:35:45,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-17 03:35:46,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-17 03:35:46,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:35:46,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:35:46,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 03:35:46,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:35:46,338 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 225 proven. 30 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2025-03-17 03:35:46,338 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 03:35:46,589 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 15 proven. 30 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-17 03:35:46,591 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 03:35:46,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [995578163] [2025-03-17 03:35:46,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [995578163] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 03:35:46,591 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 03:35:46,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2025-03-17 03:35:46,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157700399] [2025-03-17 03:35:46,591 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 03:35:46,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 03:35:46,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 03:35:46,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 03:35:46,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-17 03:35:46,593 INFO L87 Difference]: Start difference. First operand 43 states and 64 transitions. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-17 03:35:47,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:35:47,532 INFO L93 Difference]: Finished difference Result 143 states and 204 transitions. [2025-03-17 03:35:47,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 03:35:47,533 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 98 [2025-03-17 03:35:47,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:35:47,534 INFO L225 Difference]: With dead ends: 143 [2025-03-17 03:35:47,534 INFO L226 Difference]: Without dead ends: 101 [2025-03-17 03:35:47,535 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 188 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2025-03-17 03:35:47,535 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 77 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 03:35:47,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 124 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 03:35:47,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-17 03:35:47,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 48. [2025-03-17 03:35:47,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 03:35:47,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 68 transitions. [2025-03-17 03:35:47,549 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 68 transitions. Word has length 98 [2025-03-17 03:35:47,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:35:47,550 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 68 transitions. [2025-03-17 03:35:47,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-17 03:35:47,550 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2025-03-17 03:35:47,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-17 03:35:47,557 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:35:47,557 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:35:47,567 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-17 03:35:47,757 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-17 03:35:47,758 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:35:47,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:35:47,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1392774356, now seen corresponding path program 1 times [2025-03-17 03:35:47,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:35:47,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [646786689] [2025-03-17 03:35:47,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:35:47,759 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-17 03:35:47,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:35:47,761 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-17 03:35:47,763 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-17 03:35:47,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-17 03:35:47,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-17 03:35:47,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:35:47,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:35:47,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-17 03:35:47,978 INFO L279 TraceCheckSpWp]: Computing forward predicates...