./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-61.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-1loop_file-61.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 317e245cce74eed7803564fb6a0f2b3d37b179d0249fa4ec085167b7c54282b4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 03:30:07,132 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 03:30:07,177 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 03:30:07,181 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 03:30:07,184 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 03:30:07,203 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 03:30:07,204 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 03:30:07,204 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 03:30:07,204 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 03:30:07,208 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 03:30:07,208 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 03:30:07,208 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 03:30:07,208 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 03:30:07,208 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 03:30:07,208 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 03:30:07,208 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 03:30:07,208 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 03:30:07,209 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 03:30:07,209 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 03:30:07,209 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 03:30:07,209 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 03:30:07,209 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 03:30:07,209 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 03:30:07,209 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 03:30:07,209 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 03:30:07,209 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 03:30:07,209 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 03:30:07,209 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 03:30:07,209 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 03:30:07,209 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 03:30:07,209 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 03:30:07,209 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 03:30:07,209 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:30:07,209 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 03:30:07,210 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 03:30:07,210 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 03:30:07,210 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 03:30:07,210 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 03:30:07,210 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 03:30:07,210 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 03:30:07,210 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 03:30:07,210 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 03:30:07,210 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 03:30:07,210 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 -> 317e245cce74eed7803564fb6a0f2b3d37b179d0249fa4ec085167b7c54282b4 [2025-03-17 03:30:07,599 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 03:30:07,609 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 03:30:07,611 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 03:30:07,612 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 03:30:07,613 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 03:30:07,613 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-61.i [2025-03-17 03:30:08,859 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41ad820b2/d37a9c55b25b45699f77820194eac4e8/FLAGee7dec99d [2025-03-17 03:30:09,118 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 03:30:09,119 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-61.i [2025-03-17 03:30:09,127 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41ad820b2/d37a9c55b25b45699f77820194eac4e8/FLAGee7dec99d [2025-03-17 03:30:09,138 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41ad820b2/d37a9c55b25b45699f77820194eac4e8 [2025-03-17 03:30:09,140 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 03:30:09,141 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 03:30:09,142 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 03:30:09,142 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 03:30:09,145 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 03:30:09,146 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:30:09" (1/1) ... [2025-03-17 03:30:09,147 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c621b36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:30:09, skipping insertion in model container [2025-03-17 03:30:09,147 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:30:09" (1/1) ... [2025-03-17 03:30:09,157 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 03:30:09,237 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-61.i[915,928] [2025-03-17 03:30:09,264 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:30:09,271 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 03:30:09,277 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-61.i[915,928] [2025-03-17 03:30:09,288 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:30:09,299 INFO L204 MainTranslator]: Completed translation [2025-03-17 03:30:09,300 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:30:09 WrapperNode [2025-03-17 03:30:09,300 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 03:30:09,301 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 03:30:09,301 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 03:30:09,301 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 03:30:09,305 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:30:09" (1/1) ... [2025-03-17 03:30:09,310 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:30:09" (1/1) ... [2025-03-17 03:30:09,343 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 116 [2025-03-17 03:30:09,344 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 03:30:09,345 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 03:30:09,345 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 03:30:09,345 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 03:30:09,353 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:30:09" (1/1) ... [2025-03-17 03:30:09,354 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:30:09" (1/1) ... [2025-03-17 03:30:09,356 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:30:09" (1/1) ... [2025-03-17 03:30:09,374 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:30:09,374 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:30:09" (1/1) ... [2025-03-17 03:30:09,374 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:30:09" (1/1) ... [2025-03-17 03:30:09,387 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:30:09" (1/1) ... [2025-03-17 03:30:09,388 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:30:09" (1/1) ... [2025-03-17 03:30:09,389 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:30:09" (1/1) ... [2025-03-17 03:30:09,392 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:30:09" (1/1) ... [2025-03-17 03:30:09,394 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 03:30:09,395 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 03:30:09,395 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 03:30:09,395 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 03:30:09,399 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:30:09" (1/1) ... [2025-03-17 03:30:09,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:30:09,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:30:09,448 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:30:09,461 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:30:09,487 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 03:30:09,487 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 03:30:09,487 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 03:30:09,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 03:30:09,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 03:30:09,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 03:30:09,561 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 03:30:09,563 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 03:30:09,815 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L84: havoc property_#t~ite13#1;havoc property_#t~bitwise12#1;havoc property_#t~short14#1; [2025-03-17 03:30:09,836 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-03-17 03:30:09,836 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 03:30:09,854 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 03:30:09,855 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 03:30:09,855 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:30:09 BoogieIcfgContainer [2025-03-17 03:30:09,856 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 03:30:09,859 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 03:30:09,859 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 03:30:09,863 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 03:30:09,863 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:30:09" (1/3) ... [2025-03-17 03:30:09,864 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c0329fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:30:09, skipping insertion in model container [2025-03-17 03:30:09,865 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:30:09" (2/3) ... [2025-03-17 03:30:09,865 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c0329fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:30:09, skipping insertion in model container [2025-03-17 03:30:09,865 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:30:09" (3/3) ... [2025-03-17 03:30:09,866 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-61.i [2025-03-17 03:30:09,879 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 03:30:09,880 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-61.i that has 2 procedures, 49 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 03:30:09,929 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 03:30:09,939 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;@3aa71df, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 03:30:09,940 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 03:30:09,943 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 34 states have (on average 1.411764705882353) internal successors, (48), 35 states have internal predecessors, (48), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 03:30:09,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-17 03:30:09,952 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:30:09,953 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:09,953 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:30:09,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:30:09,960 INFO L85 PathProgramCache]: Analyzing trace with hash -858678018, now seen corresponding path program 1 times [2025-03-17 03:30:09,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:30:09,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677280002] [2025-03-17 03:30:09,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:30:09,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:30:10,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-17 03:30:10,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-17 03:30:10,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:30:10,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:30:10,200 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-03-17 03:30:10,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:30:10,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677280002] [2025-03-17 03:30:10,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677280002] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:30:10,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1893698473] [2025-03-17 03:30:10,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:30:10,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:30:10,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:30:10,204 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:30:10,205 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:30:10,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-17 03:30:10,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-17 03:30:10,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:30:10,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:30:10,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 03:30:10,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:30:10,333 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-03-17 03:30:10,335 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:30:10,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1893698473] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:30:10,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 03:30:10,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 03:30:10,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197675808] [2025-03-17 03:30:10,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:30:10,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 03:30:10,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:30:10,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 03:30:10,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:30:10,357 INFO L87 Difference]: Start difference. First operand has 49 states, 34 states have (on average 1.411764705882353) internal successors, (48), 35 states have internal predecessors, (48), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) 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, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-17 03:30:10,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:30:10,376 INFO L93 Difference]: Finished difference Result 97 states and 155 transitions. [2025-03-17 03:30:10,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 03:30:10,382 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, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 80 [2025-03-17 03:30:10,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:30:10,386 INFO L225 Difference]: With dead ends: 97 [2025-03-17 03:30:10,386 INFO L226 Difference]: Without dead ends: 47 [2025-03-17 03:30:10,388 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 81 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:30:10,390 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:30:10,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:30:10,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-03-17 03:30:10,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-03-17 03:30:10,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 33 states have internal predecessors, (44), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 03:30:10,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 68 transitions. [2025-03-17 03:30:10,432 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 68 transitions. Word has length 80 [2025-03-17 03:30:10,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:30:10,433 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 68 transitions. [2025-03-17 03:30:10,433 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, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-17 03:30:10,433 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 68 transitions. [2025-03-17 03:30:10,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-17 03:30:10,435 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:30:10,435 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:10,441 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:30:10,635 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:30:10,636 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:30:10,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:30:10,637 INFO L85 PathProgramCache]: Analyzing trace with hash 288469916, now seen corresponding path program 1 times [2025-03-17 03:30:10,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:30:10,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619060982] [2025-03-17 03:30:10,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:30:10,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:30:10,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-17 03:30:10,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-17 03:30:10,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:30:10,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:30:10,964 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 18 proven. 15 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-03-17 03:30:10,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:30:10,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619060982] [2025-03-17 03:30:10,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619060982] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:30:10,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [134220304] [2025-03-17 03:30:10,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:30:10,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:30:10,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:30:10,967 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:30:10,969 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:30:11,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-17 03:30:11,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-17 03:30:11,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:30:11,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:30:11,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 03:30:11,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:30:11,164 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 143 proven. 15 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-03-17 03:30:11,165 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 03:30:11,362 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 18 proven. 15 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-03-17 03:30:11,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [134220304] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 03:30:11,362 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 03:30:11,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-17 03:30:11,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605936155] [2025-03-17 03:30:11,363 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 03:30:11,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 03:30:11,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:30:11,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 03:30:11,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 03:30:11,366 INFO L87 Difference]: Start difference. First operand 47 states and 68 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 03:30:11,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:30:11,553 INFO L93 Difference]: Finished difference Result 112 states and 159 transitions. [2025-03-17 03:30:11,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 03:30:11,553 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 80 [2025-03-17 03:30:11,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:30:11,558 INFO L225 Difference]: With dead ends: 112 [2025-03-17 03:30:11,558 INFO L226 Difference]: Without dead ends: 66 [2025-03-17 03:30:11,559 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 157 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-17 03:30:11,559 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 41 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 03:30:11,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 164 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 03:30:11,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-03-17 03:30:11,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 61. [2025-03-17 03:30:11,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 40 states have (on average 1.25) internal successors, (50), 41 states have internal predecessors, (50), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 03:30:11,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 86 transitions. [2025-03-17 03:30:11,574 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 86 transitions. Word has length 80 [2025-03-17 03:30:11,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:30:11,574 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 86 transitions. [2025-03-17 03:30:11,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 03:30:11,574 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 86 transitions. [2025-03-17 03:30:11,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-17 03:30:11,575 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:30:11,575 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:11,585 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:30:11,776 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:30:11,776 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:30:11,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:30:11,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1292953711, now seen corresponding path program 1 times [2025-03-17 03:30:11,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:30:11,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455727429] [2025-03-17 03:30:11,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:30:11,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:30:11,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-17 03:30:11,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-17 03:30:11,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:30:11,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 03:30:11,856 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 03:30:11,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-17 03:30:11,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-17 03:30:11,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:30:11,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 03:30:11,948 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 03:30:11,948 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 03:30:11,949 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 03:30:11,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 03:30:11,961 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-17 03:30:12,007 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 03:30:12,009 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 03:30:12 BoogieIcfgContainer [2025-03-17 03:30:12,010 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 03:30:12,010 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 03:30:12,010 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 03:30:12,010 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 03:30:12,011 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:30:09" (3/4) ... [2025-03-17 03:30:12,012 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 03:30:12,013 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 03:30:12,014 INFO L158 Benchmark]: Toolchain (without parser) took 2872.48ms. Allocated memory is still 142.6MB. Free memory was 111.1MB in the beginning and 83.9MB in the end (delta: 27.3MB). Peak memory consumption was 28.3MB. Max. memory is 16.1GB. [2025-03-17 03:30:12,014 INFO L158 Benchmark]: CDTParser took 0.98ms. Allocated memory is still 201.3MB. Free memory is still 130.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:30:12,014 INFO L158 Benchmark]: CACSL2BoogieTranslator took 158.21ms. Allocated memory is still 142.6MB. Free memory was 111.1MB in the beginning and 99.0MB in the end (delta: 12.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 03:30:12,014 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.29ms. Allocated memory is still 142.6MB. Free memory was 99.0MB in the beginning and 96.3MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:30:12,014 INFO L158 Benchmark]: Boogie Preprocessor took 49.69ms. Allocated memory is still 142.6MB. Free memory was 96.3MB in the beginning and 92.7MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:30:12,015 INFO L158 Benchmark]: IcfgBuilder took 460.86ms. Allocated memory is still 142.6MB. Free memory was 92.7MB in the beginning and 73.8MB in the end (delta: 18.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-17 03:30:12,015 INFO L158 Benchmark]: TraceAbstraction took 2150.51ms. Allocated memory is still 142.6MB. Free memory was 72.9MB in the beginning and 83.9MB in the end (delta: -11.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:30:12,015 INFO L158 Benchmark]: Witness Printer took 2.99ms. Allocated memory is still 142.6MB. Free memory was 83.9MB in the beginning and 83.9MB in the end (delta: 37.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:30:12,019 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.98ms. Allocated memory is still 201.3MB. Free memory is still 130.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 158.21ms. Allocated memory is still 142.6MB. Free memory was 111.1MB in the beginning and 99.0MB in the end (delta: 12.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.29ms. Allocated memory is still 142.6MB. Free memory was 99.0MB in the beginning and 96.3MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 49.69ms. Allocated memory is still 142.6MB. Free memory was 96.3MB in the beginning and 92.7MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 460.86ms. Allocated memory is still 142.6MB. Free memory was 92.7MB in the beginning and 73.8MB in the end (delta: 18.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 2150.51ms. Allocated memory is still 142.6MB. Free memory was 72.9MB in the beginning and 83.9MB in the end (delta: -11.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.99ms. Allocated memory is still 142.6MB. Free memory was 83.9MB in the beginning and 83.9MB in the end (delta: 37.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 84, overapproximation of someBinaryFLOATComparisonOperation at line 64, overapproximation of someBinaryFLOATComparisonOperation at line 45, overapproximation of someBinaryFLOATComparisonOperation at line 35, overapproximation of someBinaryFLOATComparisonOperation at line 54, overapproximation of someBinaryFLOATComparisonOperation at line 62. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] float var_1_2 = 128.6; [L24] float var_1_3 = 49.4; [L25] unsigned char var_1_4 = 0; [L26] unsigned char var_1_5 = 0; [L27] unsigned char var_1_6 = 0; [L28] unsigned char var_1_7 = 8; [L29] unsigned char var_1_8 = 128; [L30] unsigned char var_1_9 = 64; [L31] signed short int var_1_10 = 5; [L88] isInitial = 1 [L89] FCALL initially() [L90] int k_loop; [L91] k_loop = 0 VAL [isInitial=1, k_loop=0, var_1_10=5, var_1_1=0, var_1_2=643/5, var_1_3=247/5, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=8, var_1_8=128, var_1_9=64] [L91] COND TRUE k_loop < 1 [L92] FCALL updateLastVariables() [L93] CALL updateVariables() [L61] var_1_2 = __VERIFIER_nondet_float() [L62] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_3=247/5, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=8, var_1_8=128, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_3=247/5, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=8, var_1_8=128, var_1_9=64] [L62] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=5, var_1_1=0, var_1_3=247/5, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=8, var_1_8=128, var_1_9=64] [L63] var_1_3 = __VERIFIER_nondet_float() [L64] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=8, var_1_8=128, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=8, var_1_8=128, var_1_9=64] [L64] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=8, var_1_8=128, var_1_9=64] [L65] var_1_4 = __VERIFIER_nondet_uchar() [L66] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=8, var_1_8=128, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=8, var_1_8=128, var_1_9=64] [L66] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=5, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=8, var_1_8=128, var_1_9=64] [L67] CALL assume_abort_if_not(var_1_4 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=8, var_1_8=128, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=8, var_1_8=128, var_1_9=64] [L67] RET assume_abort_if_not(var_1_4 <= 0) VAL [isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=8, var_1_8=128, var_1_9=64] [L68] var_1_5 = __VERIFIER_nondet_uchar() [L69] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_6=0, var_1_7=8, var_1_8=128, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_6=0, var_1_7=8, var_1_8=128, var_1_9=64] [L69] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_6=0, var_1_7=8, var_1_8=128, var_1_9=64] [L70] CALL assume_abort_if_not(var_1_5 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=8, var_1_8=128, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=8, var_1_8=128, var_1_9=64] [L70] RET assume_abort_if_not(var_1_5 <= 0) VAL [isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=8, var_1_8=128, var_1_9=64] [L71] var_1_6 = __VERIFIER_nondet_uchar() [L72] CALL assume_abort_if_not(var_1_6 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8, var_1_8=128, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8, var_1_8=128, var_1_9=64] [L72] RET assume_abort_if_not(var_1_6 >= 1) VAL [isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8, var_1_8=128, var_1_9=64] [L73] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8, var_1_8=128, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8, var_1_8=128, var_1_9=64] [L73] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8, var_1_8=128, var_1_9=64] [L74] var_1_8 = __VERIFIER_nondet_uchar() [L75] CALL assume_abort_if_not(var_1_8 >= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8, var_1_8=-2, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8, var_1_8=-2, var_1_9=64] [L75] RET assume_abort_if_not(var_1_8 >= 127) VAL [isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8, var_1_8=-2, var_1_9=64] [L76] CALL assume_abort_if_not(var_1_8 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8, var_1_8=-2, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8, var_1_8=-2, var_1_9=64] [L76] RET assume_abort_if_not(var_1_8 <= 254) VAL [isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8, var_1_8=-2, var_1_9=64] [L77] var_1_9 = __VERIFIER_nondet_uchar() [L78] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8, var_1_8=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8, var_1_8=-2] [L78] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8, var_1_8=-2] [L79] CALL assume_abort_if_not(var_1_9 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8, var_1_8=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8, var_1_8=-2, var_1_9=1] [L79] RET assume_abort_if_not(var_1_9 <= 127) VAL [isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8, var_1_8=-2, var_1_9=1] [L93] RET updateVariables() [L94] CALL step() [L35] COND TRUE var_1_2 < var_1_3 [L36] var_1_1 = (var_1_4 || var_1_5) VAL [isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8, var_1_8=-2, var_1_9=1] [L44] COND TRUE \read(var_1_6) VAL [isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8, var_1_8=-2, var_1_9=1] [L45] COND TRUE var_1_3 != 15.8f [L46] var_1_7 = (var_1_8 - var_1_9) VAL [isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=253, var_1_8=-2, var_1_9=1] [L53] EXPR (var_1_9 / 32) << var_1_8 VAL [isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=253, var_1_8=-2, var_1_9=1] [L53] signed long int stepLocal_0 = (var_1_9 / 32) << var_1_8; [L54] COND FALSE !(! (var_1_3 < var_1_2)) VAL [isInitial=1, stepLocal_0=0, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=253, var_1_8=-2, var_1_9=1] [L94] RET step() [L95] CALL, EXPR property() [L84] EXPR (((var_1_2 < var_1_3) ? (var_1_1 == ((unsigned char) (var_1_4 || var_1_5))) : ((var_1_3 >= var_1_2) ? (var_1_1 == ((unsigned char) var_1_5)) : (var_1_1 == ((unsigned char) var_1_6)))) && (var_1_6 ? ((var_1_3 != 15.8f) ? (var_1_7 == ((unsigned char) (var_1_8 - var_1_9))) : (var_1_7 == ((unsigned char) ((((var_1_8) > (var_1_9)) ? (var_1_8) : (var_1_9)))))) : (var_1_7 == ((unsigned char) var_1_8)))) && ((! (var_1_3 < var_1_2)) ? ((((var_1_9 / 32) << var_1_8) == var_1_7) ? (var_1_10 == ((signed short int) (var_1_7 - var_1_8))) : 1) : 1) VAL [isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=253, var_1_8=-2, var_1_9=1] [L84-L85] return (((var_1_2 < var_1_3) ? (var_1_1 == ((unsigned char) (var_1_4 || var_1_5))) : ((var_1_3 >= var_1_2) ? (var_1_1 == ((unsigned char) var_1_5)) : (var_1_1 == ((unsigned char) var_1_6)))) && (var_1_6 ? ((var_1_3 != 15.8f) ? (var_1_7 == ((unsigned char) (var_1_8 - var_1_9))) : (var_1_7 == ((unsigned char) ((((var_1_8) > (var_1_9)) ? (var_1_8) : (var_1_9)))))) : (var_1_7 == ((unsigned char) var_1_8)))) && ((! (var_1_3 < var_1_2)) ? ((((var_1_9 / 32) << var_1_8) == var_1_7) ? (var_1_10 == ((signed short int) (var_1_7 - var_1_8))) : 1) : 1) ; [L95] RET, EXPR property() [L95] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=253, var_1_8=-2, var_1_9=1] [L19] reach_error() VAL [isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=253, var_1_8=-2, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 49 locations, 84 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.0s, OverallIterations: 3, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 47 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 41 mSDsluCounter, 232 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 102 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 156 IncrementalHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 130 mSDtfsCounter, 156 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 248 GetRequests, 238 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61occurred in iteration=2, InterpolantAutomatonStates: 11, 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, 5 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 401 NumberOfCodeBlocks, 401 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 395 ConstructedInterpolants, 0 QuantifiedInterpolants, 641 SizeOfPredicates, 0 NumberOfNonLiveVariables, 378 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 1253/1320 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:30:12,033 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-61.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 317e245cce74eed7803564fb6a0f2b3d37b179d0249fa4ec085167b7c54282b4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 03:30:14,187 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 03:30:14,270 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 03:30:14,276 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 03:30:14,278 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 03:30:14,301 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 03:30:14,302 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 03:30:14,302 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 03:30:14,302 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 03:30:14,302 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 03:30:14,303 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 03:30:14,303 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 03:30:14,304 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 03:30:14,304 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 03:30:14,304 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 03:30:14,304 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 03:30:14,304 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 03:30:14,304 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 03:30:14,304 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 03:30:14,304 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 03:30:14,304 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 03:30:14,304 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 03:30:14,304 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 03:30:14,305 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 03:30:14,305 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 03:30:14,305 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 03:30:14,305 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 03:30:14,305 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 03:30:14,305 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 03:30:14,305 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 03:30:14,305 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 03:30:14,306 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 03:30:14,306 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 03:30:14,306 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 03:30:14,306 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:30:14,306 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 03:30:14,306 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 03:30:14,306 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 03:30:14,306 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 03:30:14,306 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 03:30:14,306 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 03:30:14,307 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 03:30:14,307 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 03:30:14,307 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 03:30:14,307 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 03:30:14,307 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 -> 317e245cce74eed7803564fb6a0f2b3d37b179d0249fa4ec085167b7c54282b4 [2025-03-17 03:30:14,563 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 03:30:14,571 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 03:30:14,573 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 03:30:14,573 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 03:30:14,574 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 03:30:14,575 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-61.i [2025-03-17 03:30:15,789 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/beb091c92/1c3839a54bb342e998b1ce7f10f27337/FLAG2781511b4 [2025-03-17 03:30:15,977 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 03:30:15,977 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-61.i [2025-03-17 03:30:15,984 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/beb091c92/1c3839a54bb342e998b1ce7f10f27337/FLAG2781511b4 [2025-03-17 03:30:15,997 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/beb091c92/1c3839a54bb342e998b1ce7f10f27337 [2025-03-17 03:30:16,000 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 03:30:16,002 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 03:30:16,003 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 03:30:16,004 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 03:30:16,007 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 03:30:16,008 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:30:15" (1/1) ... [2025-03-17 03:30:16,009 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47fbc333 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:30:16, skipping insertion in model container [2025-03-17 03:30:16,009 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:30:15" (1/1) ... [2025-03-17 03:30:16,022 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 03:30:16,137 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-61.i[915,928] [2025-03-17 03:30:16,177 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:30:16,193 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 03:30:16,201 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-61.i[915,928] [2025-03-17 03:30:16,224 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:30:16,239 INFO L204 MainTranslator]: Completed translation [2025-03-17 03:30:16,241 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:30:16 WrapperNode [2025-03-17 03:30:16,241 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 03:30:16,242 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 03:30:16,242 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 03:30:16,242 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 03:30:16,247 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:30:16" (1/1) ... [2025-03-17 03:30:16,257 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:30:16" (1/1) ... [2025-03-17 03:30:16,276 INFO L138 Inliner]: procedures = 27, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 93 [2025-03-17 03:30:16,279 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 03:30:16,280 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 03:30:16,280 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 03:30:16,280 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 03:30:16,287 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:30:16" (1/1) ... [2025-03-17 03:30:16,288 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:30:16" (1/1) ... [2025-03-17 03:30:16,292 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:30:16" (1/1) ... [2025-03-17 03:30:16,302 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:30:16,302 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:30:16" (1/1) ... [2025-03-17 03:30:16,302 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:30:16" (1/1) ... [2025-03-17 03:30:16,311 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:30:16" (1/1) ... [2025-03-17 03:30:16,312 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:30:16" (1/1) ... [2025-03-17 03:30:16,313 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:30:16" (1/1) ... [2025-03-17 03:30:16,317 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:30:16" (1/1) ... [2025-03-17 03:30:16,319 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 03:30:16,320 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 03:30:16,320 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 03:30:16,320 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 03:30:16,321 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:30:16" (1/1) ... [2025-03-17 03:30:16,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:30:16,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:30:16,358 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:30:16,362 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:30:16,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 03:30:16,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 03:30:16,383 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 03:30:16,383 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 03:30:16,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 03:30:16,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 03:30:16,452 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 03:30:16,454 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 03:30:16,745 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-17 03:30:16,746 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 03:30:16,754 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 03:30:16,754 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 03:30:16,754 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:30:16 BoogieIcfgContainer [2025-03-17 03:30:16,755 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 03:30:16,757 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 03:30:16,757 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 03:30:16,763 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 03:30:16,764 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:30:15" (1/3) ... [2025-03-17 03:30:16,764 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a07f0cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:30:16, skipping insertion in model container [2025-03-17 03:30:16,765 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:30:16" (2/3) ... [2025-03-17 03:30:16,765 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a07f0cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:30:16, skipping insertion in model container [2025-03-17 03:30:16,765 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:30:16" (3/3) ... [2025-03-17 03:30:16,767 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-61.i [2025-03-17 03:30:16,780 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 03:30:16,781 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-61.i that has 2 procedures, 39 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 03:30:16,824 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 03:30:16,835 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;@1df08993, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 03:30:16,835 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 03:30:16,839 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 25 states have internal predecessors, (34), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 03:30:16,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-17 03:30:16,845 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:30:16,845 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:16,846 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:30:16,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:30:16,849 INFO L85 PathProgramCache]: Analyzing trace with hash -2127442430, now seen corresponding path program 1 times [2025-03-17 03:30:16,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:30:16,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [868778706] [2025-03-17 03:30:16,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:30:16,860 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:30:16,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:30:16,865 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:30:16,866 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:30:16,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-17 03:30:17,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-17 03:30:17,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:30:17,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:30:17,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 03:30:17,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:30:17,072 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-03-17 03:30:17,072 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:30:17,074 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 03:30:17,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [868778706] [2025-03-17 03:30:17,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [868778706] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:30:17,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:30:17,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 03:30:17,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404522319] [2025-03-17 03:30:17,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:30:17,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 03:30:17,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 03:30:17,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 03:30:17,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:30:17,102 INFO L87 Difference]: Start difference. First operand has 39 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 25 states have internal predecessors, (34), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-17 03:30:17,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:30:17,116 INFO L93 Difference]: Finished difference Result 77 states and 127 transitions. [2025-03-17 03:30:17,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 03:30:17,117 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 76 [2025-03-17 03:30:17,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:30:17,121 INFO L225 Difference]: With dead ends: 77 [2025-03-17 03:30:17,121 INFO L226 Difference]: Without dead ends: 37 [2025-03-17 03:30:17,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 75 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:30:17,125 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:30:17,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:30:17,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-17 03:30:17,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-03-17 03:30:17,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 03:30:17,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 54 transitions. [2025-03-17 03:30:17,158 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 54 transitions. Word has length 76 [2025-03-17 03:30:17,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:30:17,158 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 54 transitions. [2025-03-17 03:30:17,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-17 03:30:17,159 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 54 transitions. [2025-03-17 03:30:17,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-17 03:30:17,162 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:30:17,162 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:17,169 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:30:17,363 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:30:17,363 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:30:17,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:30:17,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1962009504, now seen corresponding path program 1 times [2025-03-17 03:30:17,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:30:17,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1745647936] [2025-03-17 03:30:17,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:30:17,365 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:30:17,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:30:17,367 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:30:17,368 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:30:17,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-17 03:30:17,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-17 03:30:17,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:30:17,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:30:17,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 03:30:17,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:30:17,666 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 143 proven. 15 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-03-17 03:30:17,666 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 03:30:17,847 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 18 proven. 15 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-03-17 03:30:17,847 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 03:30:17,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1745647936] [2025-03-17 03:30:17,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1745647936] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 03:30:17,848 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 03:30:17,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2025-03-17 03:30:17,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299070074] [2025-03-17 03:30:17,848 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 03:30:17,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 03:30:17,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 03:30:17,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 03:30:17,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 03:30:17,852 INFO L87 Difference]: Start difference. First operand 37 states and 54 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 2 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 03:30:18,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:30:18,075 INFO L93 Difference]: Finished difference Result 92 states and 131 transitions. [2025-03-17 03:30:18,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 03:30:18,076 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 2 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 76 [2025-03-17 03:30:18,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:30:18,077 INFO L225 Difference]: With dead ends: 92 [2025-03-17 03:30:18,077 INFO L226 Difference]: Without dead ends: 56 [2025-03-17 03:30:18,078 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 144 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-17 03:30:18,078 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 48 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 03:30:18,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 102 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 03:30:18,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-17 03:30:18,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 51. [2025-03-17 03:30:18,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 30 states have (on average 1.2) internal successors, (36), 31 states have internal predecessors, (36), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 03:30:18,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 72 transitions. [2025-03-17 03:30:18,088 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 72 transitions. Word has length 76 [2025-03-17 03:30:18,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:30:18,088 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 72 transitions. [2025-03-17 03:30:18,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 2 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 03:30:18,088 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 72 transitions. [2025-03-17 03:30:18,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-17 03:30:18,090 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:30:18,090 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:18,096 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:30:18,290 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:30:18,291 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:30:18,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:30:18,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1609929953, now seen corresponding path program 1 times [2025-03-17 03:30:18,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:30:18,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [113524784] [2025-03-17 03:30:18,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:30:18,292 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:30:18,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:30:18,294 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:30:18,295 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:30:18,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-17 03:30:18,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-17 03:30:18,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:30:18,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:30:18,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 03:30:18,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:30:18,961 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 143 proven. 15 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-03-17 03:30:18,961 INFO L312 TraceCheckSpWp]: Computing backward predicates...