./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-41.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-41.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 d5b4a8e209cf444024fa31a61bed3ce1f6da7fc096b1acbd25409a9975d7dc6c --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 23:20:15,027 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 23:20:15,089 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 23:20:15,095 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 23:20:15,098 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 23:20:15,116 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 23:20:15,116 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 23:20:15,116 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 23:20:15,116 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 23:20:15,117 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 23:20:15,117 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 23:20:15,117 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 23:20:15,117 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 23:20:15,117 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 23:20:15,117 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 23:20:15,117 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 23:20:15,117 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 23:20:15,117 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 23:20:15,118 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 23:20:15,118 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 23:20:15,118 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 23:20:15,118 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 23:20:15,118 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 23:20:15,118 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 23:20:15,118 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 23:20:15,118 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 23:20:15,118 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 23:20:15,118 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 23:20:15,118 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 23:20:15,119 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 23:20:15,119 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 23:20:15,119 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 23:20:15,119 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:20:15,119 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 23:20:15,119 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 23:20:15,119 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 23:20:15,119 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 23:20:15,119 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 23:20:15,119 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 23:20:15,119 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 23:20:15,120 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 23:20:15,120 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 23:20:15,120 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 23:20:15,120 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 -> d5b4a8e209cf444024fa31a61bed3ce1f6da7fc096b1acbd25409a9975d7dc6c [2025-03-03 23:20:15,336 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 23:20:15,345 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 23:20:15,347 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 23:20:15,348 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 23:20:15,348 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 23:20:15,349 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-41.i [2025-03-03 23:20:16,493 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5a02e87a/9a4893fecea9461584d86f78a0d7640f/FLAGdb4195ead [2025-03-03 23:20:16,728 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 23:20:16,730 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-41.i [2025-03-03 23:20:16,742 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5a02e87a/9a4893fecea9461584d86f78a0d7640f/FLAGdb4195ead [2025-03-03 23:20:17,061 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5a02e87a/9a4893fecea9461584d86f78a0d7640f [2025-03-03 23:20:17,063 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 23:20:17,064 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 23:20:17,065 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 23:20:17,065 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 23:20:17,069 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 23:20:17,069 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:20:17" (1/1) ... [2025-03-03 23:20:17,070 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ff0434a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:20:17, skipping insertion in model container [2025-03-03 23:20:17,070 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:20:17" (1/1) ... [2025-03-03 23:20:17,081 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 23:20:17,180 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-41.i[915,928] [2025-03-03 23:20:17,207 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:20:17,218 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 23:20:17,226 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-41.i[915,928] [2025-03-03 23:20:17,244 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:20:17,260 INFO L204 MainTranslator]: Completed translation [2025-03-03 23:20:17,260 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:20:17 WrapperNode [2025-03-03 23:20:17,260 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 23:20:17,262 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 23:20:17,262 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 23:20:17,262 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 23:20:17,267 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:20:17" (1/1) ... [2025-03-03 23:20:17,272 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:20:17" (1/1) ... [2025-03-03 23:20:17,284 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 100 [2025-03-03 23:20:17,288 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 23:20:17,288 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 23:20:17,288 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 23:20:17,288 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 23:20:17,294 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:20:17" (1/1) ... [2025-03-03 23:20:17,294 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:20:17" (1/1) ... [2025-03-03 23:20:17,295 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:20:17" (1/1) ... [2025-03-03 23:20:17,313 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 23:20:17,313 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:20:17" (1/1) ... [2025-03-03 23:20:17,314 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:20:17" (1/1) ... [2025-03-03 23:20:17,316 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:20:17" (1/1) ... [2025-03-03 23:20:17,317 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:20:17" (1/1) ... [2025-03-03 23:20:17,320 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:20:17" (1/1) ... [2025-03-03 23:20:17,321 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:20:17" (1/1) ... [2025-03-03 23:20:17,322 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 23:20:17,326 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 23:20:17,326 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 23:20:17,326 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 23:20:17,326 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:20:17" (1/1) ... [2025-03-03 23:20:17,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:20:17,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:20:17,352 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 23:20:17,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 23:20:17,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 23:20:17,375 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 23:20:17,375 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 23:20:17,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 23:20:17,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 23:20:17,375 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 23:20:17,429 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 23:20:17,430 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 23:20:17,608 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-03 23:20:17,611 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 23:20:17,620 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 23:20:17,620 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 23:20:17,620 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:20:17 BoogieIcfgContainer [2025-03-03 23:20:17,620 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 23:20:17,623 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 23:20:17,623 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 23:20:17,626 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 23:20:17,626 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:20:17" (1/3) ... [2025-03-03 23:20:17,627 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@948a29a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:20:17, skipping insertion in model container [2025-03-03 23:20:17,627 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:20:17" (2/3) ... [2025-03-03 23:20:17,627 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@948a29a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:20:17, skipping insertion in model container [2025-03-03 23:20:17,628 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:20:17" (3/3) ... [2025-03-03 23:20:17,629 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-41.i [2025-03-03 23:20:17,640 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 23:20:17,641 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-while_file-41.i that has 2 procedures, 50 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 23:20:17,688 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 23:20:17,697 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;@c405d9c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 23:20:17,698 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 23:20:17,701 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 32 states have internal predecessors, (41), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-03 23:20:17,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-03 23:20:17,710 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:20:17,710 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:20:17,711 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:20:17,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:20:17,715 INFO L85 PathProgramCache]: Analyzing trace with hash 2143645408, now seen corresponding path program 1 times [2025-03-03 23:20:17,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:20:17,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460996291] [2025-03-03 23:20:17,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:20:17,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:20:17,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-03 23:20:17,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-03 23:20:17,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:20:17,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:20:17,884 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-03 23:20:17,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:20:17,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460996291] [2025-03-03 23:20:17,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460996291] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:20:17,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273494807] [2025-03-03 23:20:17,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:20:17,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:20:17,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:20:17,888 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 23:20:17,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 23:20:17,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-03 23:20:17,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-03 23:20:17,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:20:17,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:20:18,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 23:20:18,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:20:18,018 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-03 23:20:18,018 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:20:18,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1273494807] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:20:18,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 23:20:18,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 23:20:18,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829693606] [2025-03-03 23:20:18,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:20:18,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 23:20:18,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:20:18,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 23:20:18,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:20:18,036 INFO L87 Difference]: Start difference. First operand has 50 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 32 states have internal predecessors, (41), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 23:20:18,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:20:18,049 INFO L93 Difference]: Finished difference Result 93 states and 155 transitions. [2025-03-03 23:20:18,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 23:20:18,051 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 103 [2025-03-03 23:20:18,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:20:18,055 INFO L225 Difference]: With dead ends: 93 [2025-03-03 23:20:18,055 INFO L226 Difference]: Without dead ends: 46 [2025-03-03 23:20:18,057 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:20:18,058 INFO L435 NwaCegarLoop]: 65 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, 65 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-03 23:20:18,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:20:18,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-03 23:20:18,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-03-03 23:20:18,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-03 23:20:18,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 65 transitions. [2025-03-03 23:20:18,086 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 65 transitions. Word has length 103 [2025-03-03 23:20:18,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:20:18,087 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 65 transitions. [2025-03-03 23:20:18,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 23:20:18,088 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 65 transitions. [2025-03-03 23:20:18,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-03 23:20:18,091 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:20:18,091 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:20:18,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 23:20:18,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 23:20:18,292 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:20:18,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:20:18,292 INFO L85 PathProgramCache]: Analyzing trace with hash 556269280, now seen corresponding path program 1 times [2025-03-03 23:20:18,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:20:18,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874022284] [2025-03-03 23:20:18,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:20:18,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:20:18,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-03 23:20:18,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-03 23:20:18,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:20:18,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:20:19,582 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-03 23:20:19,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:20:19,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874022284] [2025-03-03 23:20:19,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874022284] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:20:19,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:20:19,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 23:20:19,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775161767] [2025-03-03 23:20:19,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:20:19,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 23:20:19,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:20:19,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 23:20:19,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-03 23:20:19,587 INFO L87 Difference]: Start difference. First operand 46 states and 65 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-03 23:20:19,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:20:19,879 INFO L93 Difference]: Finished difference Result 113 states and 148 transitions. [2025-03-03 23:20:19,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 23:20:19,879 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 103 [2025-03-03 23:20:19,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:20:19,881 INFO L225 Difference]: With dead ends: 113 [2025-03-03 23:20:19,882 INFO L226 Difference]: Without dead ends: 111 [2025-03-03 23:20:19,883 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-03 23:20:19,883 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 97 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 23:20:19,884 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 370 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 23:20:19,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-03 23:20:19,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 92. [2025-03-03 23:20:19,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 62 states have (on average 1.1935483870967742) internal successors, (74), 64 states have internal predecessors, (74), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-03 23:20:19,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 126 transitions. [2025-03-03 23:20:19,913 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 126 transitions. Word has length 103 [2025-03-03 23:20:19,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:20:19,914 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 126 transitions. [2025-03-03 23:20:19,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-03 23:20:19,914 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 126 transitions. [2025-03-03 23:20:19,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-03 23:20:19,918 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:20:19,918 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:20:19,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 23:20:19,919 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:20:19,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:20:19,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1995887681, now seen corresponding path program 1 times [2025-03-03 23:20:19,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:20:19,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299531742] [2025-03-03 23:20:19,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:20:19,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:20:19,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-03 23:20:19,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-03 23:20:19,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:20:19,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:20:20,772 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-03 23:20:20,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:20:20,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299531742] [2025-03-03 23:20:20,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299531742] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:20:20,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:20:20,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 23:20:20,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231471796] [2025-03-03 23:20:20,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:20:20,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 23:20:20,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:20:20,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 23:20:20,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-03 23:20:20,777 INFO L87 Difference]: Start difference. First operand 92 states and 126 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-03 23:20:20,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:20:20,970 INFO L93 Difference]: Finished difference Result 193 states and 261 transitions. [2025-03-03 23:20:20,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 23:20:20,971 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 103 [2025-03-03 23:20:20,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:20:20,972 INFO L225 Difference]: With dead ends: 193 [2025-03-03 23:20:20,972 INFO L226 Difference]: Without dead ends: 104 [2025-03-03 23:20:20,973 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-03 23:20:20,974 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 73 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 23:20:20,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 421 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 23:20:20,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-03 23:20:20,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 81. [2025-03-03 23:20:20,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 55 states have (on average 1.1818181818181819) internal successors, (65), 56 states have internal predecessors, (65), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-03 23:20:20,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 109 transitions. [2025-03-03 23:20:20,994 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 109 transitions. Word has length 103 [2025-03-03 23:20:20,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:20:20,994 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 109 transitions. [2025-03-03 23:20:20,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-03 23:20:20,995 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 109 transitions. [2025-03-03 23:20:20,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-03 23:20:20,995 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:20:20,996 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:20:20,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 23:20:20,996 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:20:20,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:20:20,996 INFO L85 PathProgramCache]: Analyzing trace with hash 359755775, now seen corresponding path program 1 times [2025-03-03 23:20:20,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:20:20,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275368312] [2025-03-03 23:20:20,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:20:20,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:20:21,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-03 23:20:21,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-03 23:20:21,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:20:21,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:20:21,653 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-03 23:20:21,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:20:21,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275368312] [2025-03-03 23:20:21,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275368312] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:20:21,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:20:21,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 23:20:21,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422422366] [2025-03-03 23:20:21,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:20:21,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 23:20:21,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:20:21,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 23:20:21,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-03 23:20:21,655 INFO L87 Difference]: Start difference. First operand 81 states and 109 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-03 23:20:21,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:20:21,815 INFO L93 Difference]: Finished difference Result 110 states and 140 transitions. [2025-03-03 23:20:21,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 23:20:21,816 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 103 [2025-03-03 23:20:21,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:20:21,817 INFO L225 Difference]: With dead ends: 110 [2025-03-03 23:20:21,817 INFO L226 Difference]: Without dead ends: 108 [2025-03-03 23:20:21,818 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-03 23:20:21,818 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 36 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 23:20:21,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 312 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 23:20:21,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-03-03 23:20:21,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 88. [2025-03-03 23:20:21,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 62 states have (on average 1.1935483870967742) internal successors, (74), 63 states have internal predecessors, (74), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-03 23:20:21,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 118 transitions. [2025-03-03 23:20:21,834 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 118 transitions. Word has length 103 [2025-03-03 23:20:21,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:20:21,835 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 118 transitions. [2025-03-03 23:20:21,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-03 23:20:21,835 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 118 transitions. [2025-03-03 23:20:21,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-03 23:20:21,836 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:20:21,836 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:20:21,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 23:20:21,836 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:20:21,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:20:21,837 INFO L85 PathProgramCache]: Analyzing trace with hash 2102566110, now seen corresponding path program 1 times [2025-03-03 23:20:21,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:20:21,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634993523] [2025-03-03 23:20:21,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:20:21,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:20:21,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-03 23:20:21,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-03 23:20:21,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:20:21,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:20:22,438 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-03 23:20:22,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:20:22,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634993523] [2025-03-03 23:20:22,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634993523] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:20:22,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:20:22,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 23:20:22,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755973486] [2025-03-03 23:20:22,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:20:22,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 23:20:22,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:20:22,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 23:20:22,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-03 23:20:22,441 INFO L87 Difference]: Start difference. First operand 88 states and 118 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-03 23:20:22,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:20:22,620 INFO L93 Difference]: Finished difference Result 110 states and 140 transitions. [2025-03-03 23:20:22,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 23:20:22,620 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 103 [2025-03-03 23:20:22,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:20:22,621 INFO L225 Difference]: With dead ends: 110 [2025-03-03 23:20:22,621 INFO L226 Difference]: Without dead ends: 108 [2025-03-03 23:20:22,625 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-03 23:20:22,626 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 36 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 23:20:22,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 294 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 23:20:22,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-03-03 23:20:22,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 84. [2025-03-03 23:20:22,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 58 states have (on average 1.1724137931034482) internal successors, (68), 59 states have internal predecessors, (68), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-03 23:20:22,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 112 transitions. [2025-03-03 23:20:22,643 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 112 transitions. Word has length 103 [2025-03-03 23:20:22,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:20:22,643 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 112 transitions. [2025-03-03 23:20:22,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-03 23:20:22,643 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 112 transitions. [2025-03-03 23:20:22,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-03 23:20:22,644 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:20:22,644 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:20:22,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 23:20:22,647 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:20:22,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:20:22,649 INFO L85 PathProgramCache]: Analyzing trace with hash 94092709, now seen corresponding path program 1 times [2025-03-03 23:20:22,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:20:22,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136874375] [2025-03-03 23:20:22,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:20:22,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:20:22,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-03 23:20:22,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-03 23:20:22,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:20:22,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:20:22,714 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-03 23:20:22,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:20:22,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136874375] [2025-03-03 23:20:22,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136874375] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:20:22,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:20:22,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 23:20:22,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932085047] [2025-03-03 23:20:22,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:20:22,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 23:20:22,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:20:22,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 23:20:22,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 23:20:22,716 INFO L87 Difference]: Start difference. First operand 84 states and 112 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-03 23:20:22,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:20:22,728 INFO L93 Difference]: Finished difference Result 154 states and 207 transitions. [2025-03-03 23:20:22,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 23:20:22,729 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 104 [2025-03-03 23:20:22,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:20:22,729 INFO L225 Difference]: With dead ends: 154 [2025-03-03 23:20:22,729 INFO L226 Difference]: Without dead ends: 0 [2025-03-03 23:20:22,730 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 23:20:22,731 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 0 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:20:22,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:20:22,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-03 23:20:22,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-03 23:20:22,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 23:20:22,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-03 23:20:22,732 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 104 [2025-03-03 23:20:22,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:20:22,732 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-03 23:20:22,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-03 23:20:22,732 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-03 23:20:22,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-03 23:20:22,734 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 23:20:22,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 23:20:22,736 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-03 23:20:22,738 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-03 23:20:23,042 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 23:20:23,051 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 11:20:23 BoogieIcfgContainer [2025-03-03 23:20:23,051 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 23:20:23,051 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 23:20:23,051 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 23:20:23,052 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 23:20:23,052 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:20:17" (3/4) ... [2025-03-03 23:20:23,053 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-03 23:20:23,057 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-03-03 23:20:23,060 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2025-03-03 23:20:23,060 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-03 23:20:23,060 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-03 23:20:23,061 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-03 23:20:23,117 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 23:20:23,118 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 23:20:23,118 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 23:20:23,119 INFO L158 Benchmark]: Toolchain (without parser) took 6054.05ms. Allocated memory was 142.6MB in the beginning and 394.3MB in the end (delta: 251.7MB). Free memory was 106.4MB in the beginning and 335.9MB in the end (delta: -229.5MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB. [2025-03-03 23:20:23,119 INFO L158 Benchmark]: CDTParser took 0.93ms. Allocated memory is still 201.3MB. Free memory is still 116.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:20:23,119 INFO L158 Benchmark]: CACSL2BoogieTranslator took 196.23ms. Allocated memory is still 142.6MB. Free memory was 106.4MB in the beginning and 94.7MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 23:20:23,120 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.92ms. Allocated memory is still 142.6MB. Free memory was 94.7MB in the beginning and 93.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:20:23,120 INFO L158 Benchmark]: Boogie Preprocessor took 33.53ms. Allocated memory is still 142.6MB. Free memory was 93.1MB in the beginning and 91.2MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 23:20:23,121 INFO L158 Benchmark]: IcfgBuilder took 294.50ms. Allocated memory is still 142.6MB. Free memory was 91.2MB in the beginning and 76.3MB in the end (delta: 14.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 23:20:23,121 INFO L158 Benchmark]: TraceAbstraction took 5427.96ms. Allocated memory was 142.6MB in the beginning and 394.3MB in the end (delta: 251.7MB). Free memory was 76.3MB in the beginning and 344.2MB in the end (delta: -267.9MB). Peak memory consumption was 202.1MB. Max. memory is 16.1GB. [2025-03-03 23:20:23,121 INFO L158 Benchmark]: Witness Printer took 66.28ms. Allocated memory is still 394.3MB. Free memory was 344.2MB in the beginning and 335.9MB in the end (delta: 8.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:20:23,122 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.93ms. Allocated memory is still 201.3MB. Free memory is still 116.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 196.23ms. Allocated memory is still 142.6MB. Free memory was 106.4MB in the beginning and 94.7MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.92ms. Allocated memory is still 142.6MB. Free memory was 94.7MB in the beginning and 93.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.53ms. Allocated memory is still 142.6MB. Free memory was 93.1MB in the beginning and 91.2MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 294.50ms. Allocated memory is still 142.6MB. Free memory was 91.2MB in the beginning and 76.3MB in the end (delta: 14.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 5427.96ms. Allocated memory was 142.6MB in the beginning and 394.3MB in the end (delta: 251.7MB). Free memory was 76.3MB in the beginning and 344.2MB in the end (delta: -267.9MB). Peak memory consumption was 202.1MB. Max. memory is 16.1GB. * Witness Printer took 66.28ms. Allocated memory is still 394.3MB. Free memory was 344.2MB in the beginning and 335.9MB in the end (delta: 8.3MB). 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 50 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.1s, OverallIterations: 6, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 244 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 242 mSDsluCounter, 1577 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1149 mSDsCounter, 42 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 385 IncrementalHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 42 mSolverCounterUnsat, 428 mSDtfsCounter, 385 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 151 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=92occurred in iteration=2, InterpolantAutomatonStates: 37, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 86 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 722 NumberOfCodeBlocks, 722 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 715 ConstructedInterpolants, 0 QuantifiedInterpolants, 2029 SizeOfPredicates, 0 NumberOfNonLiveVariables, 233 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 7 InterpolantComputations, 6 PerfectInterpolantSequences, 3330/3360 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 97]: Location Invariant Derived location invariant: (((((var_1_8 == 1) && (var_1_9 != 0)) || (var_1_8 == 0)) && ((var_1_8 != 0) || (var_1_9 == 0))) || (var_1_5 == 0)) RESULT: Ultimate proved your program to be correct! [2025-03-03 23:20:23,137 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE