./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.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.6.2.ufo.BOUNDED-12.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 648a34748ee6f317001c61f0628c2e00b2100c77ff87e7d85b52ec2f91d6d096 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 19:08:50,340 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:08:50,376 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 19:08:50,380 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:08:50,380 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:08:50,402 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:08:50,404 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:08:50,404 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:08:50,404 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:08:50,405 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:08:50,405 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:08:50,405 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:08:50,406 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:08:50,406 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:08:50,406 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:08:50,407 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:08:50,407 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:08:50,407 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:08:50,407 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:08:50,407 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:08:50,407 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:08:50,407 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:08:50,407 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:08:50,407 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:08:50,407 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:08:50,407 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:08:50,407 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:08:50,407 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:08:50,408 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:08:50,408 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:08:50,408 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:08:50,408 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:08:50,408 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:08:50,408 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:08:50,408 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:08:50,408 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:08:50,409 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:08:50,409 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:08:50,409 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:08:50,409 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:08:50,409 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:08:50,409 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:08:50,409 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:08:50,409 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 -> 648a34748ee6f317001c61f0628c2e00b2100c77ff87e7d85b52ec2f91d6d096 [2025-03-16 19:08:50,667 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:08:50,673 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:08:50,675 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:08:50,675 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:08:50,676 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:08:50,677 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.6.2.ufo.BOUNDED-12.pals.c [2025-03-16 19:08:51,894 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ea8beebf/e31152e66b4e4498a9c6a6c4df76f451/FLAG57eef02dc [2025-03-16 19:08:52,105 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:08:52,106 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c [2025-03-16 19:08:52,113 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ea8beebf/e31152e66b4e4498a9c6a6c4df76f451/FLAG57eef02dc [2025-03-16 19:08:52,123 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ea8beebf/e31152e66b4e4498a9c6a6c4df76f451 [2025-03-16 19:08:52,125 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:08:52,126 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:08:52,127 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:08:52,127 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:08:52,130 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:08:52,130 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:08:52" (1/1) ... [2025-03-16 19:08:52,131 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1101b47c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:08:52, skipping insertion in model container [2025-03-16 19:08:52,131 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:08:52" (1/1) ... [2025-03-16 19:08:52,152 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:08:52,341 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.6.2.ufo.BOUNDED-12.pals.c[16824,16837] [2025-03-16 19:08:52,344 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:08:52,355 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:08:52,419 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.6.2.ufo.BOUNDED-12.pals.c[16824,16837] [2025-03-16 19:08:52,420 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:08:52,435 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:08:52,436 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:08:52 WrapperNode [2025-03-16 19:08:52,436 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:08:52,437 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:08:52,437 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:08:52,437 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:08:52,442 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:08:52" (1/1) ... [2025-03-16 19:08:52,449 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:08:52" (1/1) ... [2025-03-16 19:08:52,483 INFO L138 Inliner]: procedures = 25, calls = 17, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 450 [2025-03-16 19:08:52,488 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:08:52,488 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:08:52,488 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:08:52,488 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:08:52,496 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:08:52" (1/1) ... [2025-03-16 19:08:52,496 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:08:52" (1/1) ... [2025-03-16 19:08:52,503 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:08:52" (1/1) ... [2025-03-16 19:08:52,517 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:08:52,517 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:08:52" (1/1) ... [2025-03-16 19:08:52,517 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:08:52" (1/1) ... [2025-03-16 19:08:52,523 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:08:52" (1/1) ... [2025-03-16 19:08:52,524 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:08:52" (1/1) ... [2025-03-16 19:08:52,525 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:08:52" (1/1) ... [2025-03-16 19:08:52,527 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:08:52" (1/1) ... [2025-03-16 19:08:52,529 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:08:52,529 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:08:52,529 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:08:52,529 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:08:52,530 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:08:52" (1/1) ... [2025-03-16 19:08:52,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:08:52,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:08:52,566 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:08:52,569 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:08:52,588 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:08:52,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:08:52,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:08:52,588 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:08:52,671 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:08:52,672 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:08:53,101 INFO L? ?]: Removed 48 outVars from TransFormulas that were not future-live. [2025-03-16 19:08:53,102 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:08:53,115 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:08:53,116 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:08:53,116 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:08:53 BoogieIcfgContainer [2025-03-16 19:08:53,117 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:08:53,118 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:08:53,119 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:08:53,124 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:08:53,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:08:52" (1/3) ... [2025-03-16 19:08:53,125 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d10e861 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:08:53, skipping insertion in model container [2025-03-16 19:08:53,125 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:08:52" (2/3) ... [2025-03-16 19:08:53,125 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d10e861 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:08:53, skipping insertion in model container [2025-03-16 19:08:53,125 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:08:53" (3/3) ... [2025-03-16 19:08:53,126 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c [2025-03-16 19:08:53,138 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:08:53,141 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c that has 1 procedures, 115 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 19:08:53,188 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:08:53,197 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;@42723e71, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:08:53,198 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 19:08:53,201 INFO L276 IsEmpty]: Start isEmpty. Operand has 115 states, 113 states have (on average 1.7876106194690264) internal successors, (202), 114 states have internal predecessors, (202), 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:53,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-16 19:08:53,207 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:08:53,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] [2025-03-16 19:08:53,208 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:08:53,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:08:53,213 INFO L85 PathProgramCache]: Analyzing trace with hash -699590523, now seen corresponding path program 1 times [2025-03-16 19:08:53,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:08:53,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110401011] [2025-03-16 19:08:53,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:08:53,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:08:53,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-16 19:08:53,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-16 19:08:53,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:08:53,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:08:53,450 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:08:53,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:08:53,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110401011] [2025-03-16 19:08:53,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110401011] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:08:53,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:08:53,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 19:08:53,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860966663] [2025-03-16 19:08:53,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:08:53,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 19:08:53,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:08:53,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 19:08:53,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 19:08:53,474 INFO L87 Difference]: Start difference. First operand has 115 states, 113 states have (on average 1.7876106194690264) internal successors, (202), 114 states have internal predecessors, (202), 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 17.0) internal successors, (34), 2 states have internal predecessors, (34), 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:53,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:08:53,489 INFO L93 Difference]: Finished difference Result 186 states and 318 transitions. [2025-03-16 19:08:53,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 19:08:53,491 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 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 34 [2025-03-16 19:08:53,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:08:53,497 INFO L225 Difference]: With dead ends: 186 [2025-03-16 19:08:53,497 INFO L226 Difference]: Without dead ends: 113 [2025-03-16 19:08:53,499 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:08:53,501 INFO L435 NwaCegarLoop]: 200 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, 200 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:08:53,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:08:53,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-03-16 19:08:53,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2025-03-16 19:08:53,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 112 states have (on average 1.7678571428571428) internal successors, (198), 112 states have internal predecessors, (198), 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:53,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 198 transitions. [2025-03-16 19:08:53,533 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 198 transitions. Word has length 34 [2025-03-16 19:08:53,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:08:53,533 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 198 transitions. [2025-03-16 19:08:53,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 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:53,534 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 198 transitions. [2025-03-16 19:08:53,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-16 19:08:53,535 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:08:53,536 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] [2025-03-16 19:08:53,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 19:08:53,536 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:08:53,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:08:53,538 INFO L85 PathProgramCache]: Analyzing trace with hash -348790586, now seen corresponding path program 1 times [2025-03-16 19:08:53,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:08:53,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451552313] [2025-03-16 19:08:53,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:08:53,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:08:53,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-16 19:08:53,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-16 19:08:53,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:08:53,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:08:53,745 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:08:53,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:08:53,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451552313] [2025-03-16 19:08:53,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451552313] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:08:53,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:08:53,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:08:53,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912606730] [2025-03-16 19:08:53,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:08:53,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:08:53,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:08:53,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:08:53,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:08:53,747 INFO L87 Difference]: Start difference. First operand 113 states and 198 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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:53,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:08:53,814 INFO L93 Difference]: Finished difference Result 184 states and 313 transitions. [2025-03-16 19:08:53,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:08:53,814 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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 34 [2025-03-16 19:08:53,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:08:53,815 INFO L225 Difference]: With dead ends: 184 [2025-03-16 19:08:53,815 INFO L226 Difference]: Without dead ends: 113 [2025-03-16 19:08:53,817 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:08:53,818 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 0 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:08:53,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 546 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:08:53,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-03-16 19:08:53,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2025-03-16 19:08:53,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 112 states have (on average 1.4017857142857142) internal successors, (157), 112 states have internal predecessors, (157), 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:53,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 157 transitions. [2025-03-16 19:08:53,825 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 157 transitions. Word has length 34 [2025-03-16 19:08:53,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:08:53,825 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 157 transitions. [2025-03-16 19:08:53,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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:53,826 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 157 transitions. [2025-03-16 19:08:53,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-16 19:08:53,827 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:08:53,827 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:08:53,827 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:08:53,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:08:53,828 INFO L85 PathProgramCache]: Analyzing trace with hash -763884258, now seen corresponding path program 1 times [2025-03-16 19:08:53,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:08:53,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364678753] [2025-03-16 19:08:53,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:08:53,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:08:53,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-16 19:08:53,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-16 19:08:53,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:08:53,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:08:53,981 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:08:53,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:08:53,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364678753] [2025-03-16 19:08:53,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364678753] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:08:53,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:08:53,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:08:53,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875655273] [2025-03-16 19:08:53,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:08:53,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:08:53,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:08:53,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:08:53,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:08:53,985 INFO L87 Difference]: Start difference. First operand 113 states and 157 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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:54,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:08:54,019 INFO L93 Difference]: Finished difference Result 241 states and 367 transitions. [2025-03-16 19:08:54,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:08:54,020 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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 74 [2025-03-16 19:08:54,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:08:54,021 INFO L225 Difference]: With dead ends: 241 [2025-03-16 19:08:54,024 INFO L226 Difference]: Without dead ends: 173 [2025-03-16 19:08:54,024 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:54,025 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 88 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 323 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:08:54,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 323 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:08:54,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-03-16 19:08:54,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 171. [2025-03-16 19:08:54,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 170 states have (on average 1.488235294117647) internal successors, (253), 170 states have internal predecessors, (253), 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:54,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 253 transitions. [2025-03-16 19:08:54,040 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 253 transitions. Word has length 74 [2025-03-16 19:08:54,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:08:54,040 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 253 transitions. [2025-03-16 19:08:54,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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:54,040 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 253 transitions. [2025-03-16 19:08:54,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-16 19:08:54,043 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:08:54,043 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 19:08:54,043 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:08:54,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:08:54,044 INFO L85 PathProgramCache]: Analyzing trace with hash -65052847, now seen corresponding path program 1 times [2025-03-16 19:08:54,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:08:54,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321674714] [2025-03-16 19:08:54,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:08:54,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:08:54,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-16 19:08:54,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-16 19:08:54,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:08:54,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:08:54,161 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:08:54,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:08:54,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321674714] [2025-03-16 19:08:54,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321674714] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:08:54,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:08:54,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:08:54,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128281388] [2025-03-16 19:08:54,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:08:54,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:08:54,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:08:54,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:08:54,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:08:54,163 INFO L87 Difference]: Start difference. First operand 171 states and 253 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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:54,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:08:54,190 INFO L93 Difference]: Finished difference Result 407 states and 641 transitions. [2025-03-16 19:08:54,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:08:54,190 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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 74 [2025-03-16 19:08:54,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:08:54,194 INFO L225 Difference]: With dead ends: 407 [2025-03-16 19:08:54,194 INFO L226 Difference]: Without dead ends: 281 [2025-03-16 19:08:54,195 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:54,195 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 84 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 320 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:08:54,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 320 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:08:54,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2025-03-16 19:08:54,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 279. [2025-03-16 19:08:54,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 278 states have (on average 1.5467625899280575) internal successors, (430), 278 states have internal predecessors, (430), 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:54,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 430 transitions. [2025-03-16 19:08:54,215 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 430 transitions. Word has length 74 [2025-03-16 19:08:54,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:08:54,215 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 430 transitions. [2025-03-16 19:08:54,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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:54,216 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 430 transitions. [2025-03-16 19:08:54,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-16 19:08:54,218 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:08:54,219 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 19:08:54,219 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:08:54,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:08:54,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1943388932, now seen corresponding path program 1 times [2025-03-16 19:08:54,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:08:54,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790417768] [2025-03-16 19:08:54,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:08:54,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:08:54,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-16 19:08:54,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-16 19:08:54,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:08:54,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:08:54,347 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:08:54,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:08:54,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790417768] [2025-03-16 19:08:54,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790417768] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:08:54,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:08:54,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:08:54,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046362637] [2025-03-16 19:08:54,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:08:54,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:08:54,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:08:54,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:08:54,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:08:54,351 INFO L87 Difference]: Start difference. First operand 279 states and 430 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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:54,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:08:54,370 INFO L93 Difference]: Finished difference Result 715 states and 1144 transitions. [2025-03-16 19:08:54,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:08:54,373 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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 74 [2025-03-16 19:08:54,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:08:54,375 INFO L225 Difference]: With dead ends: 715 [2025-03-16 19:08:54,375 INFO L226 Difference]: Without dead ends: 481 [2025-03-16 19:08:54,375 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:54,376 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 80 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 317 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:08:54,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 317 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:08:54,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2025-03-16 19:08:54,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 479. [2025-03-16 19:08:54,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 478 states have (on average 1.5774058577405858) internal successors, (754), 478 states have internal predecessors, (754), 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:54,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 754 transitions. [2025-03-16 19:08:54,398 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 754 transitions. Word has length 74 [2025-03-16 19:08:54,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:08:54,398 INFO L471 AbstractCegarLoop]: Abstraction has 479 states and 754 transitions. [2025-03-16 19:08:54,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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:54,398 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 754 transitions. [2025-03-16 19:08:54,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-16 19:08:54,399 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:08:54,399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 19:08:54,399 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:08:54,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:08:54,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1830815689, now seen corresponding path program 1 times [2025-03-16 19:08:54,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:08:54,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591944128] [2025-03-16 19:08:54,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:08:54,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:08:54,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-16 19:08:54,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-16 19:08:54,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:08:54,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:08:54,604 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:08:54,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:08:54,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591944128] [2025-03-16 19:08:54,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591944128] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:08:54,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:08:54,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:08:54,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018740997] [2025-03-16 19:08:54,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:08:54,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:08:54,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:08:54,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:08:54,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:08:54,606 INFO L87 Difference]: Start difference. First operand 479 states and 754 transitions. Second operand has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 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:54,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:08:54,818 INFO L93 Difference]: Finished difference Result 3517 states and 5717 transitions. [2025-03-16 19:08:54,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:08:54,819 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 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 74 [2025-03-16 19:08:54,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:08:54,830 INFO L225 Difference]: With dead ends: 3517 [2025-03-16 19:08:54,830 INFO L226 Difference]: Without dead ends: 3083 [2025-03-16 19:08:54,832 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:08:54,832 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 1416 mSDsluCounter, 1426 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1416 SdHoareTripleChecker+Valid, 1579 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:08:54,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1416 Valid, 1579 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:08:54,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3083 states. [2025-03-16 19:08:54,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3083 to 911. [2025-03-16 19:08:54,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 911 states, 910 states have (on average 1.589010989010989) internal successors, (1446), 910 states have internal predecessors, (1446), 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:54,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 911 states to 911 states and 1446 transitions. [2025-03-16 19:08:54,877 INFO L78 Accepts]: Start accepts. Automaton has 911 states and 1446 transitions. Word has length 74 [2025-03-16 19:08:54,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:08:54,878 INFO L471 AbstractCegarLoop]: Abstraction has 911 states and 1446 transitions. [2025-03-16 19:08:54,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 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:54,879 INFO L276 IsEmpty]: Start isEmpty. Operand 911 states and 1446 transitions. [2025-03-16 19:08:54,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-16 19:08:54,880 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:08:54,881 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 19:08:54,881 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:08:54,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:08:54,881 INFO L85 PathProgramCache]: Analyzing trace with hash -919756243, now seen corresponding path program 1 times [2025-03-16 19:08:54,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:08:54,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702245577] [2025-03-16 19:08:54,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:08:54,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:08:54,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-16 19:08:54,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-16 19:08:54,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:08:54,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:08:55,149 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:08:55,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:08:55,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702245577] [2025-03-16 19:08:55,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702245577] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:08:55,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:08:55,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:08:55,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964385257] [2025-03-16 19:08:55,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:08:55,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:08:55,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:08:55,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:08:55,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:08:55,152 INFO L87 Difference]: Start difference. First operand 911 states and 1446 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 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:55,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:08:55,200 INFO L93 Difference]: Finished difference Result 945 states and 1495 transitions. [2025-03-16 19:08:55,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:08:55,201 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 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 75 [2025-03-16 19:08:55,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:08:55,203 INFO L225 Difference]: With dead ends: 945 [2025-03-16 19:08:55,204 INFO L226 Difference]: Without dead ends: 943 [2025-03-16 19:08:55,204 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:08:55,204 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:08:55,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 755 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:08:55,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2025-03-16 19:08:55,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 943. [2025-03-16 19:08:55,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 943 states, 942 states have (on average 1.5690021231422506) internal successors, (1478), 942 states have internal predecessors, (1478), 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:55,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1478 transitions. [2025-03-16 19:08:55,239 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 1478 transitions. Word has length 75 [2025-03-16 19:08:55,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:08:55,239 INFO L471 AbstractCegarLoop]: Abstraction has 943 states and 1478 transitions. [2025-03-16 19:08:55,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 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:55,239 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1478 transitions. [2025-03-16 19:08:55,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-16 19:08:55,240 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:08:55,240 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 19:08:55,241 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:08:55,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:08:55,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1555189431, now seen corresponding path program 1 times [2025-03-16 19:08:55,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:08:55,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877269330] [2025-03-16 19:08:55,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:08:55,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:08:55,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-16 19:08:55,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-16 19:08:55,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:08:55,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:08:55,320 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:08:55,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:08:55,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877269330] [2025-03-16 19:08:55,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877269330] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:08:55,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:08:55,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:08:55,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243135052] [2025-03-16 19:08:55,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:08:55,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:08:55,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:08:55,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:08:55,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:08:55,322 INFO L87 Difference]: Start difference. First operand 943 states and 1478 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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:55,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:08:55,363 INFO L93 Difference]: Finished difference Result 2627 states and 4152 transitions. [2025-03-16 19:08:55,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:08:55,364 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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 76 [2025-03-16 19:08:55,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:08:55,370 INFO L225 Difference]: With dead ends: 2627 [2025-03-16 19:08:55,370 INFO L226 Difference]: Without dead ends: 1729 [2025-03-16 19:08:55,371 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:55,371 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 73 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 266 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:08:55,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 266 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:08:55,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1729 states. [2025-03-16 19:08:55,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1729 to 1727. [2025-03-16 19:08:55,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1727 states, 1726 states have (on average 1.5654692931633836) internal successors, (2702), 1726 states have internal predecessors, (2702), 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:55,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1727 states to 1727 states and 2702 transitions. [2025-03-16 19:08:55,420 INFO L78 Accepts]: Start accepts. Automaton has 1727 states and 2702 transitions. Word has length 76 [2025-03-16 19:08:55,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:08:55,420 INFO L471 AbstractCegarLoop]: Abstraction has 1727 states and 2702 transitions. [2025-03-16 19:08:55,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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:55,421 INFO L276 IsEmpty]: Start isEmpty. Operand 1727 states and 2702 transitions. [2025-03-16 19:08:55,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-16 19:08:55,423 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:08:55,423 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 19:08:55,423 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:08:55,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:08:55,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1977985282, now seen corresponding path program 1 times [2025-03-16 19:08:55,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:08:55,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747235661] [2025-03-16 19:08:55,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:08:55,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:08:55,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-16 19:08:55,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-16 19:08:55,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:08:55,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:08:55,489 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:08:55,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:08:55,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747235661] [2025-03-16 19:08:55,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747235661] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:08:55,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:08:55,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:08:55,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022280647] [2025-03-16 19:08:55,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:08:55,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:08:55,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:08:55,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:08:55,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:08:55,491 INFO L87 Difference]: Start difference. First operand 1727 states and 2702 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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:55,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:08:55,530 INFO L93 Difference]: Finished difference Result 3413 states and 5379 transitions. [2025-03-16 19:08:55,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:08:55,530 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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 76 [2025-03-16 19:08:55,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:08:55,538 INFO L225 Difference]: With dead ends: 3413 [2025-03-16 19:08:55,538 INFO L226 Difference]: Without dead ends: 2515 [2025-03-16 19:08:55,540 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:55,540 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 100 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 361 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:08:55,540 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 361 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:08:55,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2515 states. [2025-03-16 19:08:55,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2515 to 2513. [2025-03-16 19:08:55,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2513 states, 2512 states have (on average 1.5636942675159236) internal successors, (3928), 2512 states have internal predecessors, (3928), 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:55,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2513 states to 2513 states and 3928 transitions. [2025-03-16 19:08:55,593 INFO L78 Accepts]: Start accepts. Automaton has 2513 states and 3928 transitions. Word has length 76 [2025-03-16 19:08:55,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:08:55,593 INFO L471 AbstractCegarLoop]: Abstraction has 2513 states and 3928 transitions. [2025-03-16 19:08:55,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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:55,594 INFO L276 IsEmpty]: Start isEmpty. Operand 2513 states and 3928 transitions. [2025-03-16 19:08:55,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-16 19:08:55,594 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:08:55,594 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 19:08:55,594 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:08:55,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:08:55,595 INFO L85 PathProgramCache]: Analyzing trace with hash -651635174, now seen corresponding path program 1 times [2025-03-16 19:08:55,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:08:55,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696981244] [2025-03-16 19:08:55,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:08:55,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:08:55,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-16 19:08:55,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-16 19:08:55,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:08:55,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:08:55,645 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:08:55,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:08:55,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696981244] [2025-03-16 19:08:55,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696981244] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:08:55,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:08:55,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:08:55,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631958539] [2025-03-16 19:08:55,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:08:55,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:08:55,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:08:55,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:08:55,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:08:55,647 INFO L87 Difference]: Start difference. First operand 2513 states and 3928 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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:55,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:08:55,739 INFO L93 Difference]: Finished difference Result 7061 states and 11018 transitions. [2025-03-16 19:08:55,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:08:55,740 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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 77 [2025-03-16 19:08:55,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:08:55,754 INFO L225 Difference]: With dead ends: 7061 [2025-03-16 19:08:55,755 INFO L226 Difference]: Without dead ends: 4595 [2025-03-16 19:08:55,757 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:55,757 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 92 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 346 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:08:55,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 346 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:08:55,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4595 states. [2025-03-16 19:08:55,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4595 to 4593. [2025-03-16 19:08:55,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4593 states, 4592 states have (on average 1.543554006968641) internal successors, (7088), 4592 states have internal predecessors, (7088), 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:55,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4593 states to 4593 states and 7088 transitions. [2025-03-16 19:08:55,853 INFO L78 Accepts]: Start accepts. Automaton has 4593 states and 7088 transitions. Word has length 77 [2025-03-16 19:08:55,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:08:55,853 INFO L471 AbstractCegarLoop]: Abstraction has 4593 states and 7088 transitions. [2025-03-16 19:08:55,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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:55,853 INFO L276 IsEmpty]: Start isEmpty. Operand 4593 states and 7088 transitions. [2025-03-16 19:08:55,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-16 19:08:55,854 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:08:55,854 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 19:08:55,854 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:08:55,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:08:55,854 INFO L85 PathProgramCache]: Analyzing trace with hash -689236915, now seen corresponding path program 1 times [2025-03-16 19:08:55,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:08:55,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325917671] [2025-03-16 19:08:55,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:08:55,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:08:55,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-16 19:08:55,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-16 19:08:55,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:08:55,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:08:55,896 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:08:55,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:08:55,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325917671] [2025-03-16 19:08:55,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325917671] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:08:55,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:08:55,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:08:55,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127691241] [2025-03-16 19:08:55,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:08:55,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:08:55,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:08:55,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:08:55,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:08:55,898 INFO L87 Difference]: Start difference. First operand 4593 states and 7088 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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:56,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:08:56,003 INFO L93 Difference]: Finished difference Result 12917 states and 19826 transitions. [2025-03-16 19:08:56,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:08:56,004 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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 77 [2025-03-16 19:08:56,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:08:56,028 INFO L225 Difference]: With dead ends: 12917 [2025-03-16 19:08:56,028 INFO L226 Difference]: Without dead ends: 8371 [2025-03-16 19:08:56,035 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:56,036 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 96 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 359 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:08:56,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 359 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:08:56,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8371 states. [2025-03-16 19:08:56,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8371 to 8369. [2025-03-16 19:08:56,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8369 states, 8368 states have (on average 1.5162523900573615) internal successors, (12688), 8368 states have internal predecessors, (12688), 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:56,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8369 states to 8369 states and 12688 transitions. [2025-03-16 19:08:56,264 INFO L78 Accepts]: Start accepts. Automaton has 8369 states and 12688 transitions. Word has length 77 [2025-03-16 19:08:56,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:08:56,264 INFO L471 AbstractCegarLoop]: Abstraction has 8369 states and 12688 transitions. [2025-03-16 19:08:56,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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:56,265 INFO L276 IsEmpty]: Start isEmpty. Operand 8369 states and 12688 transitions. [2025-03-16 19:08:56,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-16 19:08:56,273 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:08:56,273 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 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:56,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 19:08:56,273 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:08:56,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:08:56,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1015139675, now seen corresponding path program 1 times [2025-03-16 19:08:56,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:08:56,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815394721] [2025-03-16 19:08:56,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:08:56,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:08:56,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-16 19:08:56,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-16 19:08:56,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:08:56,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:08:56,384 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:08:56,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:08:56,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815394721] [2025-03-16 19:08:56,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815394721] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:08:56,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:08:56,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:08:56,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850328243] [2025-03-16 19:08:56,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:08:56,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:08:56,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:08:56,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:08:56,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:08:56,385 INFO L87 Difference]: Start difference. First operand 8369 states and 12688 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 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:56,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:08:56,499 INFO L93 Difference]: Finished difference Result 16693 states and 25330 transitions. [2025-03-16 19:08:56,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:08:56,500 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 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 106 [2025-03-16 19:08:56,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:08:56,519 INFO L225 Difference]: With dead ends: 16693 [2025-03-16 19:08:56,519 INFO L226 Difference]: Without dead ends: 8371 [2025-03-16 19:08:56,528 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:56,528 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 78 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 351 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:56,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 351 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:56,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8371 states. [2025-03-16 19:08:56,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8371 to 8369. [2025-03-16 19:08:56,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8369 states, 8368 states have (on average 1.5047801147227533) internal successors, (12592), 8368 states have internal predecessors, (12592), 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:56,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8369 states to 8369 states and 12592 transitions. [2025-03-16 19:08:56,745 INFO L78 Accepts]: Start accepts. Automaton has 8369 states and 12592 transitions. Word has length 106 [2025-03-16 19:08:56,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:08:56,746 INFO L471 AbstractCegarLoop]: Abstraction has 8369 states and 12592 transitions. [2025-03-16 19:08:56,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 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:56,746 INFO L276 IsEmpty]: Start isEmpty. Operand 8369 states and 12592 transitions. [2025-03-16 19:08:56,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-16 19:08:56,748 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:08:56,748 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 19:08:56,749 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:08:56,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:08:56,749 INFO L85 PathProgramCache]: Analyzing trace with hash -859218200, now seen corresponding path program 1 times [2025-03-16 19:08:56,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:08:56,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796023467] [2025-03-16 19:08:56,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:08:56,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:08:56,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-16 19:08:56,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-16 19:08:56,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:08:56,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:08:56,841 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:08:56,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:08:56,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796023467] [2025-03-16 19:08:56,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796023467] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:08:56,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:08:56,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:08:56,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317075513] [2025-03-16 19:08:56,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:08:56,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:08:56,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:08:56,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:08:56,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:08:56,843 INFO L87 Difference]: Start difference. First operand 8369 states and 12592 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 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:56,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:08:56,962 INFO L93 Difference]: Finished difference Result 12533 states and 18866 transitions. [2025-03-16 19:08:56,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:08:56,962 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 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 106 [2025-03-16 19:08:56,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:08:56,969 INFO L225 Difference]: With dead ends: 12533 [2025-03-16 19:08:56,970 INFO L226 Difference]: Without dead ends: 4211 [2025-03-16 19:08:56,975 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:56,976 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 72 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 332 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:56,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 332 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:56,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4211 states. [2025-03-16 19:08:57,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4211 to 4209. [2025-03-16 19:08:57,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4209 states, 4208 states have (on average 1.4904942965779469) internal successors, (6272), 4208 states have internal predecessors, (6272), 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:57,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4209 states to 4209 states and 6272 transitions. [2025-03-16 19:08:57,048 INFO L78 Accepts]: Start accepts. Automaton has 4209 states and 6272 transitions. Word has length 106 [2025-03-16 19:08:57,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:08:57,049 INFO L471 AbstractCegarLoop]: Abstraction has 4209 states and 6272 transitions. [2025-03-16 19:08:57,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 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:57,049 INFO L276 IsEmpty]: Start isEmpty. Operand 4209 states and 6272 transitions. [2025-03-16 19:08:57,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-16 19:08:57,051 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:08:57,051 INFO L218 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 19:08:57,051 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:08:57,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:08:57,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1938407157, now seen corresponding path program 1 times [2025-03-16 19:08:57,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:08:57,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935643021] [2025-03-16 19:08:57,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:08:57,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:08:57,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-16 19:08:57,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-16 19:08:57,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:08:57,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:08:57,247 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 19:08:57,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:08:57,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935643021] [2025-03-16 19:08:57,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935643021] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:08:57,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915615302] [2025-03-16 19:08:57,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:08:57,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:08:57,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:08:57,250 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:08:57,252 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:08:57,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-16 19:08:57,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-16 19:08:57,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:08:57,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:08:57,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-16 19:08:57,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:08:58,069 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:08:58,070 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:08:58,867 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:08:58,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [915615302] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:08:58,868 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:08:58,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 15 [2025-03-16 19:08:58,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705850595] [2025-03-16 19:08:58,868 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:08:58,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-16 19:08:58,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:08:58,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-16 19:08:58,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2025-03-16 19:08:58,869 INFO L87 Difference]: Start difference. First operand 4209 states and 6272 transitions. Second operand has 15 states, 15 states have (on average 20.533333333333335) internal successors, (308), 15 states have internal predecessors, (308), 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:59,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:08:59,511 INFO L93 Difference]: Finished difference Result 18172 states and 27200 transitions. [2025-03-16 19:08:59,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-16 19:08:59,512 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 20.533333333333335) internal successors, (308), 15 states have internal predecessors, (308), 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 106 [2025-03-16 19:08:59,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:08:59,535 INFO L225 Difference]: With dead ends: 18172 [2025-03-16 19:08:59,536 INFO L226 Difference]: Without dead ends: 14010 [2025-03-16 19:08:59,545 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=228, Invalid=528, Unknown=0, NotChecked=0, Total=756 [2025-03-16 19:08:59,545 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 2636 mSDsluCounter, 1458 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2636 SdHoareTripleChecker+Valid, 1651 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:08:59,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2636 Valid, 1651 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:08:59,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14010 states. [2025-03-16 19:08:59,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14010 to 13986. [2025-03-16 19:08:59,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13986 states, 13985 states have (on average 1.4840185913478727) internal successors, (20754), 13985 states have internal predecessors, (20754), 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:59,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13986 states to 13986 states and 20754 transitions. [2025-03-16 19:08:59,815 INFO L78 Accepts]: Start accepts. Automaton has 13986 states and 20754 transitions. Word has length 106 [2025-03-16 19:08:59,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:08:59,815 INFO L471 AbstractCegarLoop]: Abstraction has 13986 states and 20754 transitions. [2025-03-16 19:08:59,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 20.533333333333335) internal successors, (308), 15 states have internal predecessors, (308), 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:59,816 INFO L276 IsEmpty]: Start isEmpty. Operand 13986 states and 20754 transitions. [2025-03-16 19:08:59,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-16 19:08:59,816 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:08:59,816 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59,824 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:09:00,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-16 19:09:00,017 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:09:00,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:09:00,018 INFO L85 PathProgramCache]: Analyzing trace with hash -146657391, now seen corresponding path program 1 times [2025-03-16 19:09:00,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:09:00,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996383809] [2025-03-16 19:09:00,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:00,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:09:00,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-16 19:09:00,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-16 19:09:00,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:00,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:00,175 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 19:09:00,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:09:00,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996383809] [2025-03-16 19:09:00,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996383809] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:09:00,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:09:00,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:09:00,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812138551] [2025-03-16 19:09:00,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:09:00,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:09:00,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:09:00,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:09:00,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:09:00,178 INFO L87 Difference]: Start difference. First operand 13986 states and 20754 transitions. Second operand has 8 states, 8 states have (on average 13.25) internal successors, (106), 8 states have internal predecessors, (106), 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:09:00,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:09:00,806 INFO L93 Difference]: Finished difference Result 56126 states and 83912 transitions. [2025-03-16 19:09:00,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:09:00,807 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 8 states have internal predecessors, (106), 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 107 [2025-03-16 19:09:00,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:09:00,882 INFO L225 Difference]: With dead ends: 56126 [2025-03-16 19:09:00,883 INFO L226 Difference]: Without dead ends: 49116 [2025-03-16 19:09:00,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:09:00,896 INFO L435 NwaCegarLoop]: 279 mSDtfsCounter, 1131 mSDsluCounter, 1761 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1131 SdHoareTripleChecker+Valid, 2040 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:09:00,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1131 Valid, 2040 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:09:00,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49116 states. [2025-03-16 19:09:01,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49116 to 20904. [2025-03-16 19:09:01,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20904 states, 20903 states have (on average 1.4802181505047123) internal successors, (30941), 20903 states have internal predecessors, (30941), 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:09:01,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20904 states to 20904 states and 30941 transitions. [2025-03-16 19:09:01,580 INFO L78 Accepts]: Start accepts. Automaton has 20904 states and 30941 transitions. Word has length 107 [2025-03-16 19:09:01,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:09:01,580 INFO L471 AbstractCegarLoop]: Abstraction has 20904 states and 30941 transitions. [2025-03-16 19:09:01,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 8 states have internal predecessors, (106), 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:09:01,580 INFO L276 IsEmpty]: Start isEmpty. Operand 20904 states and 30941 transitions. [2025-03-16 19:09:01,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-16 19:09:01,581 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:09:01,582 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:01,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 19:09:01,582 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:09:01,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:09:01,582 INFO L85 PathProgramCache]: Analyzing trace with hash 691933348, now seen corresponding path program 1 times [2025-03-16 19:09:01,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:09:01,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331267603] [2025-03-16 19:09:01,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:01,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:09:01,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-16 19:09:01,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-16 19:09:01,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:01,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:01,755 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 19:09:01,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:09:01,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331267603] [2025-03-16 19:09:01,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331267603] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:09:01,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:09:01,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:09:01,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770066119] [2025-03-16 19:09:01,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:09:01,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:09:01,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:09:01,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:09:01,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:09:01,757 INFO L87 Difference]: Start difference. First operand 20904 states and 30941 transitions. Second operand has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 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:09:02,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:09:02,588 INFO L93 Difference]: Finished difference Result 63044 states and 94099 transitions. [2025-03-16 19:09:02,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:09:02,589 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 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) Word has length 107 [2025-03-16 19:09:02,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:09:02,771 INFO L225 Difference]: With dead ends: 63044 [2025-03-16 19:09:02,771 INFO L226 Difference]: Without dead ends: 56034 [2025-03-16 19:09:02,781 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:09:02,781 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 1133 mSDsluCounter, 1600 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1133 SdHoareTripleChecker+Valid, 1873 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:09:02,782 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1133 Valid, 1873 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:09:02,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56034 states. [2025-03-16 19:09:03,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56034 to 27822. [2025-03-16 19:09:03,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27822 states, 27821 states have (on average 1.4783077531361202) internal successors, (41128), 27821 states have internal predecessors, (41128), 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:09:03,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27822 states to 27822 states and 41128 transitions. [2025-03-16 19:09:03,362 INFO L78 Accepts]: Start accepts. Automaton has 27822 states and 41128 transitions. Word has length 107 [2025-03-16 19:09:03,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:09:03,362 INFO L471 AbstractCegarLoop]: Abstraction has 27822 states and 41128 transitions. [2025-03-16 19:09:03,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 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:09:03,362 INFO L276 IsEmpty]: Start isEmpty. Operand 27822 states and 41128 transitions. [2025-03-16 19:09:03,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-16 19:09:03,363 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:09:03,363 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:03,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 19:09:03,364 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:09:03,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:09:03,364 INFO L85 PathProgramCache]: Analyzing trace with hash 681800503, now seen corresponding path program 1 times [2025-03-16 19:09:03,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:09:03,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993182158] [2025-03-16 19:09:03,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:03,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:09:03,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-16 19:09:03,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-16 19:09:03,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:03,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:03,571 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 19:09:03,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:09:03,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993182158] [2025-03-16 19:09:03,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993182158] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:09:03,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:09:03,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:09:03,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270978248] [2025-03-16 19:09:03,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:09:03,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:09:03,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:09:03,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:09:03,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:09:03,573 INFO L87 Difference]: Start difference. First operand 27822 states and 41128 transitions. Second operand has 8 states, 8 states have (on average 13.0) internal successors, (104), 8 states have internal predecessors, (104), 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:09:04,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:09:04,664 INFO L93 Difference]: Finished difference Result 69955 states and 104275 transitions. [2025-03-16 19:09:04,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:09:04,664 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.0) internal successors, (104), 8 states have internal predecessors, (104), 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 107 [2025-03-16 19:09:04,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:09:04,743 INFO L225 Difference]: With dead ends: 69955 [2025-03-16 19:09:04,744 INFO L226 Difference]: Without dead ends: 62945 [2025-03-16 19:09:04,764 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:09:04,764 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 1182 mSDsluCounter, 1531 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1182 SdHoareTripleChecker+Valid, 1801 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:09:04,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1182 Valid, 1801 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:09:04,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62945 states. [2025-03-16 19:09:05,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62945 to 34733. [2025-03-16 19:09:05,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34733 states, 34732 states have (on average 1.4771392375906944) internal successors, (51304), 34732 states have internal predecessors, (51304), 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:09:05,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34733 states to 34733 states and 51304 transitions. [2025-03-16 19:09:05,877 INFO L78 Accepts]: Start accepts. Automaton has 34733 states and 51304 transitions. Word has length 107 [2025-03-16 19:09:05,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:09:05,878 INFO L471 AbstractCegarLoop]: Abstraction has 34733 states and 51304 transitions. [2025-03-16 19:09:05,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.0) internal successors, (104), 8 states have internal predecessors, (104), 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:09:05,878 INFO L276 IsEmpty]: Start isEmpty. Operand 34733 states and 51304 transitions. [2025-03-16 19:09:05,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-16 19:09:05,879 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:09:05,879 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:05,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 19:09:05,879 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:09:05,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:09:05,880 INFO L85 PathProgramCache]: Analyzing trace with hash 2104432458, now seen corresponding path program 1 times [2025-03-16 19:09:05,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:09:05,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934155521] [2025-03-16 19:09:05,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:05,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:09:05,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-16 19:09:05,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-16 19:09:05,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:05,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:06,065 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-16 19:09:06,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:09:06,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934155521] [2025-03-16 19:09:06,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934155521] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:09:06,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:09:06,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:09:06,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257420046] [2025-03-16 19:09:06,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:09:06,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:09:06,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:09:06,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:09:06,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:09:06,068 INFO L87 Difference]: Start difference. First operand 34733 states and 51304 transitions. Second operand has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 states have internal predecessors, (103), 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:09:06,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:09:06,969 INFO L93 Difference]: Finished difference Result 76816 states and 114378 transitions. [2025-03-16 19:09:06,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:09:06,970 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 states have internal predecessors, (103), 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 107 [2025-03-16 19:09:06,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:09:07,056 INFO L225 Difference]: With dead ends: 76816 [2025-03-16 19:09:07,057 INFO L226 Difference]: Without dead ends: 69826 [2025-03-16 19:09:07,085 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:09:07,085 INFO L435 NwaCegarLoop]: 267 mSDtfsCounter, 1233 mSDsluCounter, 1510 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1233 SdHoareTripleChecker+Valid, 1777 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:09:07,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1233 Valid, 1777 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:09:07,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69826 states. [2025-03-16 19:09:08,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69826 to 41572. [2025-03-16 19:09:08,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41572 states, 41571 states have (on average 1.476510067114094) internal successors, (61380), 41571 states have internal predecessors, (61380), 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:09:08,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41572 states to 41572 states and 61380 transitions. [2025-03-16 19:09:08,108 INFO L78 Accepts]: Start accepts. Automaton has 41572 states and 61380 transitions. Word has length 107 [2025-03-16 19:09:08,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:09:08,109 INFO L471 AbstractCegarLoop]: Abstraction has 41572 states and 61380 transitions. [2025-03-16 19:09:08,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 states have internal predecessors, (103), 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:09:08,109 INFO L276 IsEmpty]: Start isEmpty. Operand 41572 states and 61380 transitions. [2025-03-16 19:09:08,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-16 19:09:08,110 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:09:08,110 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:08,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 19:09:08,110 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:09:08,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:09:08,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1409434403, now seen corresponding path program 1 times [2025-03-16 19:09:08,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:09:08,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586655500] [2025-03-16 19:09:08,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:08,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:09:08,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-16 19:09:08,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-16 19:09:08,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:08,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:08,241 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-16 19:09:08,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:09:08,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586655500] [2025-03-16 19:09:08,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586655500] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:09:08,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:09:08,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:09:08,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788979429] [2025-03-16 19:09:08,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:09:08,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:09:08,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:09:08,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:09:08,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:09:08,243 INFO L87 Difference]: Start difference. First operand 41572 states and 61380 transitions. Second operand has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 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:09:09,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:09:09,352 INFO L93 Difference]: Finished difference Result 83626 states and 124409 transitions. [2025-03-16 19:09:09,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:09:09,352 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 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 107 [2025-03-16 19:09:09,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:09:09,442 INFO L225 Difference]: With dead ends: 83626 [2025-03-16 19:09:09,443 INFO L226 Difference]: Without dead ends: 76636 [2025-03-16 19:09:09,469 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:09:09,470 INFO L435 NwaCegarLoop]: 264 mSDtfsCounter, 1301 mSDsluCounter, 1546 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1301 SdHoareTripleChecker+Valid, 1810 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:09:09,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1301 Valid, 1810 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:09:09,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76636 states. [2025-03-16 19:09:11,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76636 to 48402. [2025-03-16 19:09:11,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48402 states, 48401 states have (on average 1.4760025619305386) internal successors, (71440), 48401 states have internal predecessors, (71440), 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:09:11,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48402 states to 48402 states and 71440 transitions. [2025-03-16 19:09:11,123 INFO L78 Accepts]: Start accepts. Automaton has 48402 states and 71440 transitions. Word has length 107 [2025-03-16 19:09:11,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:09:11,123 INFO L471 AbstractCegarLoop]: Abstraction has 48402 states and 71440 transitions. [2025-03-16 19:09:11,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 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:09:11,123 INFO L276 IsEmpty]: Start isEmpty. Operand 48402 states and 71440 transitions. [2025-03-16 19:09:11,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-16 19:09:11,125 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:09:11,125 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:11,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 19:09:11,125 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:09:11,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:09:11,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1695294448, now seen corresponding path program 1 times [2025-03-16 19:09:11,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:09:11,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862471330] [2025-03-16 19:09:11,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:11,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:09:11,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-16 19:09:11,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-16 19:09:11,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:11,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:11,264 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 19:09:11,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:09:11,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862471330] [2025-03-16 19:09:11,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862471330] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:09:11,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:09:11,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:09:11,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276364777] [2025-03-16 19:09:11,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:09:11,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:09:11,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:09:11,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:09:11,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:09:11,266 INFO L87 Difference]: Start difference. First operand 48402 states and 71440 transitions. Second operand has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 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:09:12,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:09:12,915 INFO L93 Difference]: Finished difference Result 90416 states and 134411 transitions. [2025-03-16 19:09:12,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:09:12,919 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 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) Word has length 107 [2025-03-16 19:09:12,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:09:12,999 INFO L225 Difference]: With dead ends: 90416 [2025-03-16 19:09:12,999 INFO L226 Difference]: Without dead ends: 83426 [2025-03-16 19:09:13,011 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:09:13,012 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 1151 mSDsluCounter, 1752 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1151 SdHoareTripleChecker+Valid, 2025 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:09:13,012 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1151 Valid, 2025 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:09:13,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83426 states. [2025-03-16 19:09:14,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83426 to 55214. [2025-03-16 19:09:14,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55214 states, 55213 states have (on average 1.4755220690779345) internal successors, (81468), 55213 states have internal predecessors, (81468), 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:09:14,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55214 states to 55214 states and 81468 transitions. [2025-03-16 19:09:14,311 INFO L78 Accepts]: Start accepts. Automaton has 55214 states and 81468 transitions. Word has length 107 [2025-03-16 19:09:14,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:09:14,311 INFO L471 AbstractCegarLoop]: Abstraction has 55214 states and 81468 transitions. [2025-03-16 19:09:14,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 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:09:14,311 INFO L276 IsEmpty]: Start isEmpty. Operand 55214 states and 81468 transitions. [2025-03-16 19:09:14,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-16 19:09:14,316 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:09:14,316 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:14,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 19:09:14,316 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:09:14,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:09:14,316 INFO L85 PathProgramCache]: Analyzing trace with hash 648989576, now seen corresponding path program 1 times [2025-03-16 19:09:14,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:09:14,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540559780] [2025-03-16 19:09:14,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:14,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:09:14,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-16 19:09:14,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-16 19:09:14,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:14,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:14,631 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:09:14,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:09:14,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540559780] [2025-03-16 19:09:14,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540559780] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:09:14,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1438124417] [2025-03-16 19:09:14,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:14,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:09:14,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:09:14,634 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:09:14,635 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:09:14,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-16 19:09:14,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-16 19:09:14,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:14,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:14,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-16 19:09:14,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:09:15,195 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:09:15,195 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:09:16,298 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:09:16,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1438124417] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:09:16,298 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:09:16,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2025-03-16 19:09:16,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215062612] [2025-03-16 19:09:16,299 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:09:16,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-16 19:09:16,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:09:16,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-16 19:09:16,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=441, Unknown=0, NotChecked=0, Total=506 [2025-03-16 19:09:16,300 INFO L87 Difference]: Start difference. First operand 55214 states and 81468 transitions. Second operand has 23 states, 23 states have (on average 13.478260869565217) internal successors, (310), 22 states have internal predecessors, (310), 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:09:24,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:09:24,374 INFO L93 Difference]: Finished difference Result 477757 states and 714524 transitions. [2025-03-16 19:09:24,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2025-03-16 19:09:24,375 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 13.478260869565217) internal successors, (310), 22 states have internal predecessors, (310), 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 110 [2025-03-16 19:09:24,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:09:25,070 INFO L225 Difference]: With dead ends: 477757 [2025-03-16 19:09:25,070 INFO L226 Difference]: Without dead ends: 422972 [2025-03-16 19:09:25,129 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2127 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1260, Invalid=6222, Unknown=0, NotChecked=0, Total=7482 [2025-03-16 19:09:25,129 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 8388 mSDsluCounter, 1988 mSDsCounter, 0 mSdLazyCounter, 1855 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8388 SdHoareTripleChecker+Valid, 2189 SdHoareTripleChecker+Invalid, 1925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1855 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:09:25,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8388 Valid, 2189 Invalid, 1925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1855 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 19:09:25,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422972 states.