./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c --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/seq-mthreaded/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c -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 76982ccfa15d5420010caf48ff31900a394710bc42d46403e291e5b0b2cbfb5b --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 19:07:48,455 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:07:48,504 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 19:07:48,508 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:07:48,511 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:07:48,528 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:07:48,529 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:07:48,529 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:07:48,529 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:07:48,530 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:07:48,530 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:07:48,530 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:07:48,530 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:07:48,530 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:07:48,531 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:07:48,531 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:07:48,531 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:07:48,531 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:07:48,531 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:07:48,531 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:07:48,531 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:07:48,531 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:07:48,531 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:07:48,531 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:07:48,531 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:07:48,531 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:07:48,531 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:07:48,531 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:07:48,531 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:07:48,531 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:07:48,532 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:07:48,532 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:07:48,532 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:07:48,532 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:07:48,532 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:07:48,532 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:07:48,532 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:07:48,532 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:07:48,532 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:07:48,532 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:07:48,532 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:07:48,532 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:07:48,532 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:07:48,532 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 -> 76982ccfa15d5420010caf48ff31900a394710bc42d46403e291e5b0b2cbfb5b [2025-03-16 19:07:48,737 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:07:48,744 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:07:48,746 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:07:48,747 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:07:48,747 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:07:48,748 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c [2025-03-16 19:07:49,852 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74063efff/cc8eed0497584605b0d683e690e958a0/FLAGa7fdb3350 [2025-03-16 19:07:50,064 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:07:50,065 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c [2025-03-16 19:07:50,071 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74063efff/cc8eed0497584605b0d683e690e958a0/FLAGa7fdb3350 [2025-03-16 19:07:50,416 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74063efff/cc8eed0497584605b0d683e690e958a0 [2025-03-16 19:07:50,418 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:07:50,419 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:07:50,420 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:07:50,420 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:07:50,423 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:07:50,423 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:07:50" (1/1) ... [2025-03-16 19:07:50,425 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4596bcce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:07:50, skipping insertion in model container [2025-03-16 19:07:50,425 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:07:50" (1/1) ... [2025-03-16 19:07:50,441 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:07:50,565 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/seq-mthreaded/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c[6803,6816] [2025-03-16 19:07:50,568 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:07:50,576 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:07:50,603 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/seq-mthreaded/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c[6803,6816] [2025-03-16 19:07:50,604 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:07:50,616 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:07:50,617 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:07:50 WrapperNode [2025-03-16 19:07:50,617 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:07:50,618 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:07:50,618 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:07:50,618 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:07:50,622 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:07:50" (1/1) ... [2025-03-16 19:07:50,627 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:07:50" (1/1) ... [2025-03-16 19:07:50,642 INFO L138 Inliner]: procedures = 21, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 246 [2025-03-16 19:07:50,642 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:07:50,643 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:07:50,643 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:07:50,643 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:07:50,648 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:07:50" (1/1) ... [2025-03-16 19:07:50,649 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:07:50" (1/1) ... [2025-03-16 19:07:50,650 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:07:50" (1/1) ... [2025-03-16 19:07:50,663 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-16 19:07:50,663 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:07:50" (1/1) ... [2025-03-16 19:07:50,663 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:07:50" (1/1) ... [2025-03-16 19:07:50,667 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:07:50" (1/1) ... [2025-03-16 19:07:50,668 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:07:50" (1/1) ... [2025-03-16 19:07:50,669 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:07:50" (1/1) ... [2025-03-16 19:07:50,669 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:07:50" (1/1) ... [2025-03-16 19:07:50,671 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:07:50,671 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:07:50,671 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:07:50,671 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:07:50,672 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:07:50" (1/1) ... [2025-03-16 19:07:50,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:07:50,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:07:50,703 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-16 19:07:50,706 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-16 19:07:50,727 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:07:50,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:07:50,728 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:07:50,728 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:07:50,794 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:07:50,796 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:07:51,015 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2025-03-16 19:07:51,015 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:07:51,024 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:07:51,024 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:07:51,024 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:07:51 BoogieIcfgContainer [2025-03-16 19:07:51,024 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:07:51,026 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:07:51,027 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:07:51,032 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:07:51,032 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:07:50" (1/3) ... [2025-03-16 19:07:51,033 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2627ad7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:07:51, skipping insertion in model container [2025-03-16 19:07:51,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:07:50" (2/3) ... [2025-03-16 19:07:51,033 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2627ad7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:07:51, skipping insertion in model container [2025-03-16 19:07:51,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:07:51" (3/3) ... [2025-03-16 19:07:51,034 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c [2025-03-16 19:07:51,045 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:07:51,047 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c that has 1 procedures, 62 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 19:07:51,083 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:07:51,094 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;@32d31998, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:07:51,095 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 19:07:51,097 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 60 states have (on average 1.75) internal successors, (105), 61 states have internal predecessors, (105), 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-16 19:07:51,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-16 19:07:51,101 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:07:51,101 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:07:51,101 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:07:51,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:07:51,105 INFO L85 PathProgramCache]: Analyzing trace with hash -653703504, now seen corresponding path program 1 times [2025-03-16 19:07:51,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:07:51,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886783703] [2025-03-16 19:07:51,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:07:51,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:07:51,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-16 19:07:51,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-16 19:07:51,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:07:51,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:07:51,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:07:51,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:07:51,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886783703] [2025-03-16 19:07:51,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886783703] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:07:51,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:07:51,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 19:07:51,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135444687] [2025-03-16 19:07:51,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:07:51,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 19:07:51,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:07:51,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 19:07:51,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 19:07:51,284 INFO L87 Difference]: Start difference. First operand has 62 states, 60 states have (on average 1.75) internal successors, (105), 61 states have internal predecessors, (105), 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) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 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-16 19:07:51,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:07:51,295 INFO L93 Difference]: Finished difference Result 104 states and 172 transitions. [2025-03-16 19:07:51,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 19:07:51,296 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 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) Word has length 22 [2025-03-16 19:07:51,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:07:51,300 INFO L225 Difference]: With dead ends: 104 [2025-03-16 19:07:51,301 INFO L226 Difference]: Without dead ends: 60 [2025-03-16 19:07:51,302 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-16 19:07:51,304 INFO L435 NwaCegarLoop]: 103 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, 103 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-16 19:07:51,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:07:51,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-16 19:07:51,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-03-16 19:07:51,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.7118644067796611) internal successors, (101), 59 states have internal predecessors, (101), 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-16 19:07:51,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 101 transitions. [2025-03-16 19:07:51,325 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 101 transitions. Word has length 22 [2025-03-16 19:07:51,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:07:51,325 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 101 transitions. [2025-03-16 19:07:51,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 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-16 19:07:51,325 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 101 transitions. [2025-03-16 19:07:51,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-16 19:07:51,326 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:07:51,326 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:07:51,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 19:07:51,326 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:07:51,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:07:51,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1498175375, now seen corresponding path program 1 times [2025-03-16 19:07:51,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:07:51,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342965710] [2025-03-16 19:07:51,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:07:51,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:07:51,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-16 19:07:51,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-16 19:07:51,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:07:51,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:07:51,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:07:51,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:07:51,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342965710] [2025-03-16 19:07:51,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342965710] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:07:51,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:07:51,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:07:51,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496875555] [2025-03-16 19:07:51,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:07:51,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:07:51,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:07:51,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:07:51,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:07:51,503 INFO L87 Difference]: Start difference. First operand 60 states and 101 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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-16 19:07:51,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:07:51,566 INFO L93 Difference]: Finished difference Result 141 states and 230 transitions. [2025-03-16 19:07:51,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:07:51,566 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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) Word has length 22 [2025-03-16 19:07:51,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:07:51,568 INFO L225 Difference]: With dead ends: 141 [2025-03-16 19:07:51,568 INFO L226 Difference]: Without dead ends: 99 [2025-03-16 19:07:51,569 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:07:51,569 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 62 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:07:51,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 272 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:07:51,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-16 19:07:51,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 60. [2025-03-16 19:07:51,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.423728813559322) internal successors, (84), 59 states have internal predecessors, (84), 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-16 19:07:51,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 84 transitions. [2025-03-16 19:07:51,574 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 84 transitions. Word has length 22 [2025-03-16 19:07:51,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:07:51,574 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 84 transitions. [2025-03-16 19:07:51,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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-16 19:07:51,574 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 84 transitions. [2025-03-16 19:07:51,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-16 19:07:51,576 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:07:51,576 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:07:51,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:07:51,576 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:07:51,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:07:51,577 INFO L85 PathProgramCache]: Analyzing trace with hash 326440033, now seen corresponding path program 1 times [2025-03-16 19:07:51,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:07:51,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158669683] [2025-03-16 19:07:51,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:07:51,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:07:51,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-16 19:07:51,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-16 19:07:51,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:07:51,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:07:51,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:07:51,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:07:51,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158669683] [2025-03-16 19:07:51,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158669683] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:07:51,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:07:51,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:07:51,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937408097] [2025-03-16 19:07:51,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:07:51,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:07:51,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:07:51,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:07:51,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:07:51,703 INFO L87 Difference]: Start difference. First operand 60 states and 84 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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-16 19:07:51,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:07:51,728 INFO L93 Difference]: Finished difference Result 130 states and 196 transitions. [2025-03-16 19:07:51,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:07:51,730 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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) Word has length 38 [2025-03-16 19:07:51,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:07:51,731 INFO L225 Difference]: With dead ends: 130 [2025-03-16 19:07:51,731 INFO L226 Difference]: Without dead ends: 91 [2025-03-16 19:07:51,731 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-16 19:07:51,732 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 51 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:07:51,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 189 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:07:51,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-16 19:07:51,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 89. [2025-03-16 19:07:51,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 88 states have (on average 1.4886363636363635) internal successors, (131), 88 states have internal predecessors, (131), 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-16 19:07:51,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 131 transitions. [2025-03-16 19:07:51,740 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 131 transitions. Word has length 38 [2025-03-16 19:07:51,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:07:51,741 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 131 transitions. [2025-03-16 19:07:51,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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-16 19:07:51,741 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 131 transitions. [2025-03-16 19:07:51,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-16 19:07:51,741 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:07:51,741 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:07:51,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 19:07:51,742 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:07:51,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:07:51,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1025271444, now seen corresponding path program 1 times [2025-03-16 19:07:51,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:07:51,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368195800] [2025-03-16 19:07:51,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:07:51,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:07:51,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-16 19:07:51,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-16 19:07:51,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:07:51,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:07:51,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:07:51,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:07:51,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368195800] [2025-03-16 19:07:51,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368195800] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:07:51,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:07:51,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:07:51,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599521119] [2025-03-16 19:07:51,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:07:51,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:07:51,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:07:51,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:07:51,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:07:51,825 INFO L87 Difference]: Start difference. First operand 89 states and 131 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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-16 19:07:51,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:07:51,843 INFO L93 Difference]: Finished difference Result 209 states and 323 transitions. [2025-03-16 19:07:51,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:07:51,843 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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) Word has length 38 [2025-03-16 19:07:51,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:07:51,844 INFO L225 Difference]: With dead ends: 209 [2025-03-16 19:07:51,844 INFO L226 Difference]: Without dead ends: 141 [2025-03-16 19:07:51,845 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-16 19:07:51,848 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 47 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:07:51,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 186 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:07:51,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-03-16 19:07:51,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 139. [2025-03-16 19:07:51,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 138 states have (on average 1.5217391304347827) internal successors, (210), 138 states have internal predecessors, (210), 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-16 19:07:51,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 210 transitions. [2025-03-16 19:07:51,861 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 210 transitions. Word has length 38 [2025-03-16 19:07:51,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:07:51,861 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 210 transitions. [2025-03-16 19:07:51,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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-16 19:07:51,862 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 210 transitions. [2025-03-16 19:07:51,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-16 19:07:51,862 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:07:51,862 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:07:51,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 19:07:51,863 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:07:51,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:07:51,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1261254073, now seen corresponding path program 1 times [2025-03-16 19:07:51,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:07:51,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899663720] [2025-03-16 19:07:51,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:07:51,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:07:51,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-16 19:07:51,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-16 19:07:51,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:07:51,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:07:51,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:07:51,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:07:51,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899663720] [2025-03-16 19:07:51,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899663720] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:07:51,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:07:51,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:07:51,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127185473] [2025-03-16 19:07:51,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:07:51,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:07:51,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:07:51,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:07:51,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:07:51,929 INFO L87 Difference]: Start difference. First operand 139 states and 210 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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-16 19:07:51,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:07:51,946 INFO L93 Difference]: Finished difference Result 343 states and 532 transitions. [2025-03-16 19:07:51,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:07:51,947 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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) Word has length 38 [2025-03-16 19:07:51,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:07:51,948 INFO L225 Difference]: With dead ends: 343 [2025-03-16 19:07:51,948 INFO L226 Difference]: Without dead ends: 225 [2025-03-16 19:07:51,948 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-16 19:07:51,949 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 43 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:07:51,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 183 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:07:51,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2025-03-16 19:07:51,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 223. [2025-03-16 19:07:51,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 222 states have (on average 1.5225225225225225) internal successors, (338), 222 states have internal predecessors, (338), 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-16 19:07:51,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 338 transitions. [2025-03-16 19:07:51,963 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 338 transitions. Word has length 38 [2025-03-16 19:07:51,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:07:51,963 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 338 transitions. [2025-03-16 19:07:51,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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-16 19:07:51,963 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 338 transitions. [2025-03-16 19:07:51,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-16 19:07:51,964 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:07:51,964 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:07:51,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 19:07:51,964 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:07:51,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:07:51,964 INFO L85 PathProgramCache]: Analyzing trace with hash -740491398, now seen corresponding path program 1 times [2025-03-16 19:07:51,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:07:51,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928625148] [2025-03-16 19:07:51,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:07:51,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:07:51,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-16 19:07:51,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-16 19:07:51,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:07:51,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:07:52,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:07:52,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:07:52,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928625148] [2025-03-16 19:07:52,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928625148] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:07:52,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:07:52,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:07:52,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193206159] [2025-03-16 19:07:52,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:07:52,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:07:52,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:07:52,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:07:52,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:07:52,062 INFO L87 Difference]: Start difference. First operand 223 states and 338 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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-16 19:07:52,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:07:52,155 INFO L93 Difference]: Finished difference Result 1031 states and 1606 transitions. [2025-03-16 19:07:52,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:07:52,155 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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) Word has length 38 [2025-03-16 19:07:52,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:07:52,160 INFO L225 Difference]: With dead ends: 1031 [2025-03-16 19:07:52,160 INFO L226 Difference]: Without dead ends: 829 [2025-03-16 19:07:52,161 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:07:52,162 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 318 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:07:52,162 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 416 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:07:52,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2025-03-16 19:07:52,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 423. [2025-03-16 19:07:52,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 422 states have (on average 1.5118483412322274) internal successors, (638), 422 states have internal predecessors, (638), 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-16 19:07:52,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 638 transitions. [2025-03-16 19:07:52,206 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 638 transitions. Word has length 38 [2025-03-16 19:07:52,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:07:52,206 INFO L471 AbstractCegarLoop]: Abstraction has 423 states and 638 transitions. [2025-03-16 19:07:52,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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-16 19:07:52,207 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 638 transitions. [2025-03-16 19:07:52,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-16 19:07:52,208 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:07:52,208 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:07:52,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 19:07:52,208 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:07:52,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:07:52,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1479441590, now seen corresponding path program 1 times [2025-03-16 19:07:52,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:07:52,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568856838] [2025-03-16 19:07:52,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:07:52,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:07:52,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-16 19:07:52,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-16 19:07:52,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:07:52,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:07:52,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:07:52,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:07:52,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568856838] [2025-03-16 19:07:52,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568856838] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:07:52,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:07:52,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:07:52,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608417388] [2025-03-16 19:07:52,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:07:52,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:07:52,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:07:52,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:07:52,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:07:52,394 INFO L87 Difference]: Start difference. First operand 423 states and 638 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 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-16 19:07:52,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:07:52,425 INFO L93 Difference]: Finished difference Result 457 states and 687 transitions. [2025-03-16 19:07:52,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:07:52,426 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 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) Word has length 39 [2025-03-16 19:07:52,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:07:52,428 INFO L225 Difference]: With dead ends: 457 [2025-03-16 19:07:52,428 INFO L226 Difference]: Without dead ends: 455 [2025-03-16 19:07:52,428 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:07:52,429 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 0 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:07:52,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 387 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:07:52,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2025-03-16 19:07:52,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 455. [2025-03-16 19:07:52,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 454 states have (on average 1.475770925110132) internal successors, (670), 454 states have internal predecessors, (670), 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-16 19:07:52,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 670 transitions. [2025-03-16 19:07:52,449 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 670 transitions. Word has length 39 [2025-03-16 19:07:52,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:07:52,449 INFO L471 AbstractCegarLoop]: Abstraction has 455 states and 670 transitions. [2025-03-16 19:07:52,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 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-16 19:07:52,449 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 670 transitions. [2025-03-16 19:07:52,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-16 19:07:52,450 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:07:52,450 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:07:52,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 19:07:52,450 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:07:52,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:07:52,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1384812858, now seen corresponding path program 1 times [2025-03-16 19:07:52,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:07:52,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738479845] [2025-03-16 19:07:52,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:07:52,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:07:52,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-16 19:07:52,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-16 19:07:52,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:07:52,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:07:52,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:07:52,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:07:52,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738479845] [2025-03-16 19:07:52,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738479845] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:07:52,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:07:52,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:07:52,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770347944] [2025-03-16 19:07:52,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:07:52,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:07:52,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:07:52,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:07:52,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:07:52,515 INFO L87 Difference]: Start difference. First operand 455 states and 670 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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-16 19:07:52,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:07:52,536 INFO L93 Difference]: Finished difference Result 1085 states and 1610 transitions. [2025-03-16 19:07:52,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:07:52,537 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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) Word has length 40 [2025-03-16 19:07:52,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:07:52,540 INFO L225 Difference]: With dead ends: 1085 [2025-03-16 19:07:52,540 INFO L226 Difference]: Without dead ends: 651 [2025-03-16 19:07:52,541 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-16 19:07:52,541 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 36 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:07:52,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 165 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:07:52,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2025-03-16 19:07:52,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 649. [2025-03-16 19:07:52,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 648 states have (on average 1.4691358024691359) internal successors, (952), 648 states have internal predecessors, (952), 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-16 19:07:52,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 952 transitions. [2025-03-16 19:07:52,562 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 952 transitions. Word has length 40 [2025-03-16 19:07:52,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:07:52,562 INFO L471 AbstractCegarLoop]: Abstraction has 649 states and 952 transitions. [2025-03-16 19:07:52,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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-16 19:07:52,563 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 952 transitions. [2025-03-16 19:07:52,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-16 19:07:52,564 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:07:52,564 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:07:52,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 19:07:52,564 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:07:52,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:07:52,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1011731155, now seen corresponding path program 1 times [2025-03-16 19:07:52,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:07:52,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756501201] [2025-03-16 19:07:52,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:07:52,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:07:52,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-16 19:07:52,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-16 19:07:52,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:07:52,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:07:52,699 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 19:07:52,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:07:52,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756501201] [2025-03-16 19:07:52,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756501201] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:07:52,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1676255908] [2025-03-16 19:07:52,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:07:52,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:07:52,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:07:52,703 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-16 19:07:52,708 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-16 19:07:52,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-16 19:07:52,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-16 19:07:52,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:07:52,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:07:52,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-16 19:07:52,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:07:53,078 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:07:53,079 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:07:53,467 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:07:53,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1676255908] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:07:53,467 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:07:53,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 7] total 12 [2025-03-16 19:07:53,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29785185] [2025-03-16 19:07:53,467 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:07:53,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-16 19:07:53,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:07:53,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-16 19:07:53,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:07:53,468 INFO L87 Difference]: Start difference. First operand 649 states and 952 transitions. Second operand has 12 states, 12 states have (on average 12.833333333333334) internal successors, (154), 12 states have internal predecessors, (154), 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-16 19:07:53,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:07:53,939 INFO L93 Difference]: Finished difference Result 2711 states and 3999 transitions. [2025-03-16 19:07:53,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-16 19:07:53,940 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 12.833333333333334) internal successors, (154), 12 states have internal predecessors, (154), 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) Word has length 58 [2025-03-16 19:07:53,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:07:53,947 INFO L225 Difference]: With dead ends: 2711 [2025-03-16 19:07:53,947 INFO L226 Difference]: Without dead ends: 2277 [2025-03-16 19:07:53,948 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=236, Invalid=694, Unknown=0, NotChecked=0, Total=930 [2025-03-16 19:07:53,949 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 632 mSDsluCounter, 678 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 632 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:07:53,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [632 Valid, 778 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:07:53,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2277 states. [2025-03-16 19:07:53,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2277 to 2265. [2025-03-16 19:07:53,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2265 states, 2264 states have (on average 1.4558303886925794) internal successors, (3296), 2264 states have internal predecessors, (3296), 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-16 19:07:54,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2265 states to 2265 states and 3296 transitions. [2025-03-16 19:07:54,003 INFO L78 Accepts]: Start accepts. Automaton has 2265 states and 3296 transitions. Word has length 58 [2025-03-16 19:07:54,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:07:54,003 INFO L471 AbstractCegarLoop]: Abstraction has 2265 states and 3296 transitions. [2025-03-16 19:07:54,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.833333333333334) internal successors, (154), 12 states have internal predecessors, (154), 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-16 19:07:54,003 INFO L276 IsEmpty]: Start isEmpty. Operand 2265 states and 3296 transitions. [2025-03-16 19:07:54,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-16 19:07:54,004 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:07:54,005 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:07:54,012 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-16 19:07:54,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:07:54,209 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:07:54,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:07:54,210 INFO L85 PathProgramCache]: Analyzing trace with hash 844458002, now seen corresponding path program 1 times [2025-03-16 19:07:54,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:07:54,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48306939] [2025-03-16 19:07:54,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:07:54,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:07:54,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-16 19:07:54,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-16 19:07:54,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:07:54,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:07:54,289 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 19:07:54,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:07:54,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48306939] [2025-03-16 19:07:54,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48306939] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:07:54,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:07:54,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:07:54,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896207209] [2025-03-16 19:07:54,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:07:54,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:07:54,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:07:54,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:07:54,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:07:54,291 INFO L87 Difference]: Start difference. First operand 2265 states and 3296 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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-16 19:07:54,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:07:54,402 INFO L93 Difference]: Finished difference Result 5425 states and 7960 transitions. [2025-03-16 19:07:54,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:07:54,402 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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) Word has length 59 [2025-03-16 19:07:54,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:07:54,417 INFO L225 Difference]: With dead ends: 5425 [2025-03-16 19:07:54,417 INFO L226 Difference]: Without dead ends: 4443 [2025-03-16 19:07:54,420 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:07:54,421 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 213 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:07:54,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 393 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:07:54,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4443 states. [2025-03-16 19:07:54,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4443 to 3269. [2025-03-16 19:07:54,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3269 states, 3268 states have (on average 1.4479804161566707) internal successors, (4732), 3268 states have internal predecessors, (4732), 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-16 19:07:54,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3269 states to 3269 states and 4732 transitions. [2025-03-16 19:07:54,529 INFO L78 Accepts]: Start accepts. Automaton has 3269 states and 4732 transitions. Word has length 59 [2025-03-16 19:07:54,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:07:54,529 INFO L471 AbstractCegarLoop]: Abstraction has 3269 states and 4732 transitions. [2025-03-16 19:07:54,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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-16 19:07:54,529 INFO L276 IsEmpty]: Start isEmpty. Operand 3269 states and 4732 transitions. [2025-03-16 19:07:54,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-16 19:07:54,530 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:07:54,530 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:07:54,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 19:07:54,530 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:07:54,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:07:54,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1625558437, now seen corresponding path program 1 times [2025-03-16 19:07:54,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:07:54,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918620342] [2025-03-16 19:07:54,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:07:54,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:07:54,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-16 19:07:54,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-16 19:07:54,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:07:54,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:07:54,625 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 19:07:54,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:07:54,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918620342] [2025-03-16 19:07:54,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918620342] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:07:54,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:07:54,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:07:54,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233663583] [2025-03-16 19:07:54,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:07:54,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:07:54,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:07:54,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:07:54,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:07:54,627 INFO L87 Difference]: Start difference. First operand 3269 states and 4732 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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-16 19:07:54,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:07:54,722 INFO L93 Difference]: Finished difference Result 6609 states and 9668 transitions. [2025-03-16 19:07:54,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:07:54,723 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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) Word has length 59 [2025-03-16 19:07:54,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:07:54,739 INFO L225 Difference]: With dead ends: 6609 [2025-03-16 19:07:54,739 INFO L226 Difference]: Without dead ends: 5439 [2025-03-16 19:07:54,742 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:07:54,743 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 213 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:07:54,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 382 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:07:54,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5439 states. [2025-03-16 19:07:54,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5439 to 4381. [2025-03-16 19:07:54,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4381 states, 4380 states have (on average 1.445662100456621) internal successors, (6332), 4380 states have internal predecessors, (6332), 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-16 19:07:54,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4381 states to 4381 states and 6332 transitions. [2025-03-16 19:07:54,864 INFO L78 Accepts]: Start accepts. Automaton has 4381 states and 6332 transitions. Word has length 59 [2025-03-16 19:07:54,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:07:54,864 INFO L471 AbstractCegarLoop]: Abstraction has 4381 states and 6332 transitions. [2025-03-16 19:07:54,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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-16 19:07:54,864 INFO L276 IsEmpty]: Start isEmpty. Operand 4381 states and 6332 transitions. [2025-03-16 19:07:54,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-16 19:07:54,865 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:07:54,865 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:07:54,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 19:07:54,865 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:07:54,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:07:54,866 INFO L85 PathProgramCache]: Analyzing trace with hash 435319992, now seen corresponding path program 1 times [2025-03-16 19:07:54,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:07:54,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314140392] [2025-03-16 19:07:54,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:07:54,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:07:54,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-16 19:07:54,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-16 19:07:54,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:07:54,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:07:54,927 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 19:07:54,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:07:54,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314140392] [2025-03-16 19:07:54,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314140392] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:07:54,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:07:54,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:07:54,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499620657] [2025-03-16 19:07:54,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:07:54,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:07:54,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:07:54,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:07:54,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:07:54,928 INFO L87 Difference]: Start difference. First operand 4381 states and 6332 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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-16 19:07:55,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:07:55,061 INFO L93 Difference]: Finished difference Result 7721 states and 11268 transitions. [2025-03-16 19:07:55,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:07:55,061 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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) Word has length 59 [2025-03-16 19:07:55,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:07:55,081 INFO L225 Difference]: With dead ends: 7721 [2025-03-16 19:07:55,081 INFO L226 Difference]: Without dead ends: 6551 [2025-03-16 19:07:55,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:07:55,083 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 220 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:07:55,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 395 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:07:55,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6551 states. [2025-03-16 19:07:55,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6551 to 5493. [2025-03-16 19:07:55,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5493 states, 5492 states have (on average 1.4442825928623453) internal successors, (7932), 5492 states have internal predecessors, (7932), 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-16 19:07:55,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5493 states to 5493 states and 7932 transitions. [2025-03-16 19:07:55,215 INFO L78 Accepts]: Start accepts. Automaton has 5493 states and 7932 transitions. Word has length 59 [2025-03-16 19:07:55,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:07:55,215 INFO L471 AbstractCegarLoop]: Abstraction has 5493 states and 7932 transitions. [2025-03-16 19:07:55,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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-16 19:07:55,215 INFO L276 IsEmpty]: Start isEmpty. Operand 5493 states and 7932 transitions. [2025-03-16 19:07:55,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-16 19:07:55,216 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:07:55,216 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:07:55,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 19:07:55,216 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:07:55,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:07:55,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1261101984, now seen corresponding path program 1 times [2025-03-16 19:07:55,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:07:55,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563163061] [2025-03-16 19:07:55,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:07:55,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:07:55,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-16 19:07:55,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-16 19:07:55,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:07:55,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:07:55,585 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:07:55,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:07:55,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563163061] [2025-03-16 19:07:55,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563163061] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:07:55,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1988332293] [2025-03-16 19:07:55,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:07:55,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:07:55,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:07:55,587 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-16 19:07:55,589 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-16 19:07:55,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-16 19:07:55,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-16 19:07:55,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:07:55,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:07:55,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-16 19:07:55,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:07:56,622 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:07:56,623 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:07:57,682 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:07:57,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1988332293] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:07:57,683 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:07:57,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 12] total 29 [2025-03-16 19:07:57,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310933447] [2025-03-16 19:07:57,683 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:07:57,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-16 19:07:57,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:07:57,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-16 19:07:57,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=656, Unknown=0, NotChecked=0, Total=812 [2025-03-16 19:07:57,685 INFO L87 Difference]: Start difference. First operand 5493 states and 7932 transitions. Second operand has 29 states, 29 states have (on average 5.862068965517241) internal successors, (170), 29 states have internal predecessors, (170), 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-16 19:08:01,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:08:01,223 INFO L93 Difference]: Finished difference Result 58083 states and 84822 transitions. [2025-03-16 19:08:01,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2025-03-16 19:08:01,224 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 5.862068965517241) internal successors, (170), 29 states have internal predecessors, (170), 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) Word has length 62 [2025-03-16 19:08:01,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:08:01,320 INFO L225 Difference]: With dead ends: 58083 [2025-03-16 19:08:01,320 INFO L226 Difference]: Without dead ends: 52613 [2025-03-16 19:08:01,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4647 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2545, Invalid=10337, Unknown=0, NotChecked=0, Total=12882 [2025-03-16 19:08:01,336 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 3672 mSDsluCounter, 1250 mSDsCounter, 0 mSdLazyCounter, 1231 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3672 SdHoareTripleChecker+Valid, 1337 SdHoareTripleChecker+Invalid, 1347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 1231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 19:08:01,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3672 Valid, 1337 Invalid, 1347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 1231 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 19:08:01,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52613 states. [2025-03-16 19:08:02,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52613 to 22195. [2025-03-16 19:08:02,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22195 states, 22194 states have (on average 1.4369649454807605) internal successors, (31892), 22194 states have internal predecessors, (31892), 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-16 19:08:02,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22195 states to 22195 states and 31892 transitions. [2025-03-16 19:08:02,076 INFO L78 Accepts]: Start accepts. Automaton has 22195 states and 31892 transitions. Word has length 62 [2025-03-16 19:08:02,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:08:02,076 INFO L471 AbstractCegarLoop]: Abstraction has 22195 states and 31892 transitions. [2025-03-16 19:08:02,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 5.862068965517241) internal successors, (170), 29 states have internal predecessors, (170), 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-16 19:08:02,077 INFO L276 IsEmpty]: Start isEmpty. Operand 22195 states and 31892 transitions. [2025-03-16 19:08:02,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-16 19:08:02,078 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:08:02,078 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:08:02,085 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 19:08:02,279 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,SelfDestructingSolverStorable12 [2025-03-16 19:08:02,279 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:08:02,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:08:02,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1781864659, now seen corresponding path program 1 times [2025-03-16 19:08:02,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:08:02,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295172738] [2025-03-16 19:08:02,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:08:02,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:08:02,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-16 19:08:02,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-16 19:08:02,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:08:02,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:08:02,341 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:08:02,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:08:02,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295172738] [2025-03-16 19:08:02,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295172738] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:08:02,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:08:02,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:08:02,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397529756] [2025-03-16 19:08:02,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:08:02,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:08:02,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:08:02,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:08:02,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:08:02,344 INFO L87 Difference]: Start difference. First operand 22195 states and 31892 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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-16 19:08:02,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:08:02,651 INFO L93 Difference]: Finished difference Result 44369 states and 63762 transitions. [2025-03-16 19:08:02,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:08:02,652 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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) Word has length 62 [2025-03-16 19:08:02,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:08:02,683 INFO L225 Difference]: With dead ends: 44369 [2025-03-16 19:08:02,684 INFO L226 Difference]: Without dead ends: 22197 [2025-03-16 19:08:02,698 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-16 19:08:02,698 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 35 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:08:02,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 174 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:08:02,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22197 states. [2025-03-16 19:08:03,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22197 to 20841. [2025-03-16 19:08:03,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20841 states, 20840 states have (on average 1.4137236084452975) internal successors, (29462), 20840 states have internal predecessors, (29462), 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-16 19:08:03,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20841 states to 20841 states and 29462 transitions. [2025-03-16 19:08:03,251 INFO L78 Accepts]: Start accepts. Automaton has 20841 states and 29462 transitions. Word has length 62 [2025-03-16 19:08:03,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:08:03,251 INFO L471 AbstractCegarLoop]: Abstraction has 20841 states and 29462 transitions. [2025-03-16 19:08:03,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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-16 19:08:03,252 INFO L276 IsEmpty]: Start isEmpty. Operand 20841 states and 29462 transitions. [2025-03-16 19:08:03,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-16 19:08:03,253 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:08:03,253 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:08:03,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 19:08:03,253 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:08:03,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:08:03,254 INFO L85 PathProgramCache]: Analyzing trace with hash 70863539, now seen corresponding path program 1 times [2025-03-16 19:08:03,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:08:03,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965163131] [2025-03-16 19:08:03,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:08:03,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:08:03,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-16 19:08:03,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-16 19:08:03,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:08:03,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:08:03,653 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:08:03,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:08:03,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965163131] [2025-03-16 19:08:03,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965163131] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:08:03,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [680378179] [2025-03-16 19:08:03,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:08:03,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:08:03,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:08:03,656 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:08:03,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 19:08:03,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-16 19:08:03,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-16 19:08:03,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:08:03,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:08:03,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-16 19:08:03,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:08:05,746 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:08:05,746 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:08:07,377 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:08:07,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [680378179] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:08:07,378 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:08:07,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 18, 22] total 46 [2025-03-16 19:08:07,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726505770] [2025-03-16 19:08:07,378 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:08:07,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-03-16 19:08:07,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:08:07,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-03-16 19:08:07,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=339, Invalid=1823, Unknown=0, NotChecked=0, Total=2162 [2025-03-16 19:08:07,379 INFO L87 Difference]: Start difference. First operand 20841 states and 29462 transitions. Second operand has 47 states, 47 states have (on average 3.5531914893617023) internal successors, (167), 46 states have internal predecessors, (167), 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-16 19:08:23,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:08:23,942 INFO L93 Difference]: Finished difference Result 209752 states and 294625 transitions. [2025-03-16 19:08:23,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 186 states. [2025-03-16 19:08:23,943 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 3.5531914893617023) internal successors, (167), 46 states have internal predecessors, (167), 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) Word has length 62 [2025-03-16 19:08:23,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:08:24,189 INFO L225 Difference]: With dead ends: 209752 [2025-03-16 19:08:24,189 INFO L226 Difference]: Without dead ends: 188934 [2025-03-16 19:08:24,246 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 227 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22010 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=10877, Invalid=41335, Unknown=0, NotChecked=0, Total=52212 [2025-03-16 19:08:24,247 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 6356 mSDsluCounter, 2864 mSDsCounter, 0 mSdLazyCounter, 3938 mSolverCounterSat, 269 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6356 SdHoareTripleChecker+Valid, 2961 SdHoareTripleChecker+Invalid, 4207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 269 IncrementalHoareTripleChecker+Valid, 3938 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:08:24,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6356 Valid, 2961 Invalid, 4207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [269 Valid, 3938 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-16 19:08:24,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188934 states. [2025-03-16 19:08:26,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188934 to 71690. [2025-03-16 19:08:26,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71690 states, 71689 states have (on average 1.3902830280796217) internal successors, (99668), 71689 states have internal predecessors, (99668), 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-16 19:08:26,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71690 states to 71690 states and 99668 transitions. [2025-03-16 19:08:26,590 INFO L78 Accepts]: Start accepts. Automaton has 71690 states and 99668 transitions. Word has length 62 [2025-03-16 19:08:26,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:08:26,591 INFO L471 AbstractCegarLoop]: Abstraction has 71690 states and 99668 transitions. [2025-03-16 19:08:26,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 3.5531914893617023) internal successors, (167), 46 states have internal predecessors, (167), 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-16 19:08:26,591 INFO L276 IsEmpty]: Start isEmpty. Operand 71690 states and 99668 transitions. [2025-03-16 19:08:26,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-16 19:08:26,593 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:08:26,594 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:08:26,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-16 19:08:26,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:08:26,795 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:08:26,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:08:26,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1130176282, now seen corresponding path program 1 times [2025-03-16 19:08:26,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:08:26,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777505303] [2025-03-16 19:08:26,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:08:26,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:08:26,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-16 19:08:26,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-16 19:08:26,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:08:26,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:08:26,833 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:08:26,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:08:26,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777505303] [2025-03-16 19:08:26,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777505303] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:08:26,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:08:26,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:08:26,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292117912] [2025-03-16 19:08:26,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:08:26,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:08:26,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:08:26,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:08:26,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:08:26,836 INFO L87 Difference]: Start difference. First operand 71690 states and 99668 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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-16 19:08:29,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:08:29,965 INFO L93 Difference]: Finished difference Result 194797 states and 268974 transitions. [2025-03-16 19:08:29,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:08:29,966 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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) Word has length 63 [2025-03-16 19:08:29,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:08:30,140 INFO L225 Difference]: With dead ends: 194797 [2025-03-16 19:08:30,140 INFO L226 Difference]: Without dead ends: 123130 [2025-03-16 19:08:30,172 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-16 19:08:30,174 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 34 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:08:30,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 171 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:08:30,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123130 states. [2025-03-16 19:08:33,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123130 to 123128. [2025-03-16 19:08:33,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123128 states, 123127 states have (on average 1.3518805785895864) internal successors, (166453), 123127 states have internal predecessors, (166453), 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-16 19:08:33,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123128 states to 123128 states and 166453 transitions. [2025-03-16 19:08:33,616 INFO L78 Accepts]: Start accepts. Automaton has 123128 states and 166453 transitions. Word has length 63 [2025-03-16 19:08:33,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:08:33,616 INFO L471 AbstractCegarLoop]: Abstraction has 123128 states and 166453 transitions. [2025-03-16 19:08:33,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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-16 19:08:33,616 INFO L276 IsEmpty]: Start isEmpty. Operand 123128 states and 166453 transitions. [2025-03-16 19:08:33,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-16 19:08:33,620 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:08:33,620 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:08:33,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 19:08:33,620 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:08:33,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:08:33,621 INFO L85 PathProgramCache]: Analyzing trace with hash 2062234293, now seen corresponding path program 1 times [2025-03-16 19:08:33,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:08:33,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180047075] [2025-03-16 19:08:33,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:08:33,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:08:33,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-16 19:08:33,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-16 19:08:33,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:08:33,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:08:33,661 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:08:33,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:08:33,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180047075] [2025-03-16 19:08:33,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180047075] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:08:33,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:08:33,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:08:33,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677655815] [2025-03-16 19:08:33,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:08:33,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:08:33,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:08:33,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:08:33,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:08:33,663 INFO L87 Difference]: Start difference. First operand 123128 states and 166453 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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-16 19:08:36,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:08:36,713 INFO L93 Difference]: Finished difference Result 249093 states and 335395 transitions. [2025-03-16 19:08:36,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:08:36,714 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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) Word has length 63 [2025-03-16 19:08:36,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:08:36,883 INFO L225 Difference]: With dead ends: 249093 [2025-03-16 19:08:36,883 INFO L226 Difference]: Without dead ends: 125988 [2025-03-16 19:08:36,944 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-16 19:08:36,945 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 33 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:08:36,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 211 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:08:37,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125988 states. [2025-03-16 19:08:40,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125988 to 114425. [2025-03-16 19:08:40,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114425 states, 114424 states have (on average 1.3236383975389778) internal successors, (151456), 114424 states have internal predecessors, (151456), 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-16 19:08:41,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114425 states to 114425 states and 151456 transitions. [2025-03-16 19:08:41,048 INFO L78 Accepts]: Start accepts. Automaton has 114425 states and 151456 transitions. Word has length 63 [2025-03-16 19:08:41,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:08:41,048 INFO L471 AbstractCegarLoop]: Abstraction has 114425 states and 151456 transitions. [2025-03-16 19:08:41,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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-16 19:08:41,048 INFO L276 IsEmpty]: Start isEmpty. Operand 114425 states and 151456 transitions. [2025-03-16 19:08:41,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-16 19:08:41,052 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:08:41,052 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:08:41,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 19:08:41,052 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:08:41,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:08:41,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1896565560, now seen corresponding path program 1 times [2025-03-16 19:08:41,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:08:41,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429279110] [2025-03-16 19:08:41,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:08:41,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:08:41,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-16 19:08:41,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-16 19:08:41,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:08:41,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:08:41,088 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:08:41,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:08:41,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429279110]