./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr.8_overflow.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.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.8_overflow.ufo.UNBOUNDED.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 55ec916898aa0c4eb40269e81429fc0273ca07ec4caf7be0cd441cce0028ad79 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 21:19:38,498 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 21:19:38,557 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 21:19:38,560 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 21:19:38,560 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 21:19:38,577 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 21:19:38,577 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 21:19:38,578 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 21:19:38,579 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 21:19:38,579 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 21:19:38,580 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 21:19:38,580 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 21:19:38,581 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 21:19:38,581 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 21:19:38,583 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 21:19:38,583 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 21:19:38,583 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 21:19:38,584 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 21:19:38,584 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 21:19:38,584 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 21:19:38,584 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 21:19:38,587 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 21:19:38,587 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 21:19:38,588 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 21:19:38,588 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 21:19:38,588 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 21:19:38,588 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 21:19:38,588 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 21:19:38,588 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 21:19:38,589 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 21:19:38,589 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 21:19:38,589 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 21:19:38,589 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 21:19:38,589 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 21:19:38,589 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 21:19:38,590 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 21:19:38,590 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 21:19:38,590 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 21:19:38,590 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 21:19:38,590 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 21:19:38,590 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 21:19:38,593 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 21:19:38,593 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 55ec916898aa0c4eb40269e81429fc0273ca07ec4caf7be0cd441cce0028ad79 [2024-11-11 21:19:38,819 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 21:19:38,837 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 21:19:38,839 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 21:19:38,840 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 21:19:38,840 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 21:19:38,841 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.8_overflow.ufo.UNBOUNDED.pals.c [2024-11-11 21:19:40,271 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 21:19:40,445 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 21:19:40,446 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.8_overflow.ufo.UNBOUNDED.pals.c [2024-11-11 21:19:40,456 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bc6c8ea0/f709e842fea84b9d820260654d09322a/FLAGa33d798b8 [2024-11-11 21:19:40,841 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bc6c8ea0/f709e842fea84b9d820260654d09322a [2024-11-11 21:19:40,843 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 21:19:40,844 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 21:19:40,845 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 21:19:40,846 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 21:19:40,857 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 21:19:40,858 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 09:19:40" (1/1) ... [2024-11-11 21:19:40,859 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49b4849b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:19:40, skipping insertion in model container [2024-11-11 21:19:40,859 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 09:19:40" (1/1) ... [2024-11-11 21:19:40,888 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 21:19:41,099 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.8_overflow.ufo.UNBOUNDED.pals.c[26555,26568] [2024-11-11 21:19:41,105 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 21:19:41,118 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 21:19:41,186 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.8_overflow.ufo.UNBOUNDED.pals.c[26555,26568] [2024-11-11 21:19:41,187 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 21:19:41,208 INFO L204 MainTranslator]: Completed translation [2024-11-11 21:19:41,209 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:19:41 WrapperNode [2024-11-11 21:19:41,209 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 21:19:41,210 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 21:19:41,210 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 21:19:41,210 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 21:19:41,216 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:19:41" (1/1) ... [2024-11-11 21:19:41,231 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:19:41" (1/1) ... [2024-11-11 21:19:41,299 INFO L138 Inliner]: procedures = 28, calls = 19, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 528 [2024-11-11 21:19:41,300 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 21:19:41,301 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 21:19:41,301 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 21:19:41,304 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 21:19:41,331 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:19:41" (1/1) ... [2024-11-11 21:19:41,331 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:19:41" (1/1) ... [2024-11-11 21:19:41,339 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:19:41" (1/1) ... [2024-11-11 21:19:41,406 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]. [2024-11-11 21:19:41,407 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:19:41" (1/1) ... [2024-11-11 21:19:41,407 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:19:41" (1/1) ... [2024-11-11 21:19:41,424 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:19:41" (1/1) ... [2024-11-11 21:19:41,442 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:19:41" (1/1) ... [2024-11-11 21:19:41,452 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:19:41" (1/1) ... [2024-11-11 21:19:41,454 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:19:41" (1/1) ... [2024-11-11 21:19:41,466 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 21:19:41,471 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 21:19:41,475 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 21:19:41,475 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 21:19:41,476 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:19:41" (1/1) ... [2024-11-11 21:19:41,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 21:19:41,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:19:41,557 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) [2024-11-11 21:19:41,571 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 [2024-11-11 21:19:41,643 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 21:19:41,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 21:19:41,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 21:19:41,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 21:19:41,757 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 21:19:41,759 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 21:19:42,131 INFO L? ?]: Removed 55 outVars from TransFormulas that were not future-live. [2024-11-11 21:19:42,131 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 21:19:42,142 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 21:19:42,143 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-11 21:19:42,143 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 09:19:42 BoogieIcfgContainer [2024-11-11 21:19:42,143 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 21:19:42,145 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 21:19:42,145 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 21:19:42,147 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 21:19:42,147 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 09:19:40" (1/3) ... [2024-11-11 21:19:42,148 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b7be685 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 09:19:42, skipping insertion in model container [2024-11-11 21:19:42,148 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:19:41" (2/3) ... [2024-11-11 21:19:42,148 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b7be685 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 09:19:42, skipping insertion in model container [2024-11-11 21:19:42,149 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 09:19:42" (3/3) ... [2024-11-11 21:19:42,150 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.8_overflow.ufo.UNBOUNDED.pals.c [2024-11-11 21:19:42,162 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 21:19:42,163 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 21:19:42,211 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 21:19:42,216 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;@ada507a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 21:19:42,216 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 21:19:42,221 INFO L276 IsEmpty]: Start isEmpty. Operand has 131 states, 129 states have (on average 1.7984496124031009) internal successors, (232), 130 states have internal predecessors, (232), 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) [2024-11-11 21:19:42,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-11 21:19:42,228 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:19:42,229 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] [2024-11-11 21:19:42,230 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:19:42,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:19:42,235 INFO L85 PathProgramCache]: Analyzing trace with hash 721418122, now seen corresponding path program 1 times [2024-11-11 21:19:42,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:19:42,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129073592] [2024-11-11 21:19:42,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:19:42,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:19:42,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:19:42,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:19:42,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:19:42,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129073592] [2024-11-11 21:19:42,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129073592] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:19:42,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:19:42,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 21:19:42,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598968616] [2024-11-11 21:19:42,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:19:42,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-11 21:19:42,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:19:42,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-11 21:19:42,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-11 21:19:42,575 INFO L87 Difference]: Start difference. First operand has 131 states, 129 states have (on average 1.7984496124031009) internal successors, (232), 130 states have internal predecessors, (232), 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 14.5) internal successors, (29), 2 states have internal predecessors, (29), 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) [2024-11-11 21:19:42,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:19:42,595 INFO L93 Difference]: Finished difference Result 192 states and 333 transitions. [2024-11-11 21:19:42,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 21:19:42,597 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 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 29 [2024-11-11 21:19:42,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:19:42,604 INFO L225 Difference]: With dead ends: 192 [2024-11-11 21:19:42,604 INFO L226 Difference]: Without dead ends: 127 [2024-11-11 21:19:42,607 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 [2024-11-11 21:19:42,609 INFO L435 NwaCegarLoop]: 225 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, 225 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 [2024-11-11 21:19:42,610 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:19:42,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-11 21:19:42,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2024-11-11 21:19:42,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 126 states have (on average 1.7857142857142858) internal successors, (225), 126 states have internal predecessors, (225), 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) [2024-11-11 21:19:42,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 225 transitions. [2024-11-11 21:19:42,651 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 225 transitions. Word has length 29 [2024-11-11 21:19:42,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:19:42,651 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 225 transitions. [2024-11-11 21:19:42,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 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) [2024-11-11 21:19:42,652 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 225 transitions. [2024-11-11 21:19:42,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-11 21:19:42,653 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:19:42,653 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] [2024-11-11 21:19:42,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 21:19:42,655 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:19:42,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:19:42,656 INFO L85 PathProgramCache]: Analyzing trace with hash 587404616, now seen corresponding path program 1 times [2024-11-11 21:19:42,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:19:42,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129626260] [2024-11-11 21:19:42,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:19:42,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:19:42,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:19:42,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:19:42,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:19:42,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129626260] [2024-11-11 21:19:42,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129626260] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:19:42,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:19:42,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 21:19:42,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723716644] [2024-11-11 21:19:42,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:19:43,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:19:43,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:19:43,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:19:43,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:19:43,002 INFO L87 Difference]: Start difference. First operand 127 states and 225 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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) [2024-11-11 21:19:43,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:19:43,121 INFO L93 Difference]: Finished difference Result 191 states and 326 transitions. [2024-11-11 21:19:43,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:19:43,121 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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 29 [2024-11-11 21:19:43,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:19:43,122 INFO L225 Difference]: With dead ends: 191 [2024-11-11 21:19:43,124 INFO L226 Difference]: Without dead ends: 127 [2024-11-11 21:19:43,124 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:19:43,126 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 0 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 826 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:19:43,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 826 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:19:43,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-11 21:19:43,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2024-11-11 21:19:43,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 126 states have (on average 1.3015873015873016) internal successors, (164), 126 states have internal predecessors, (164), 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) [2024-11-11 21:19:43,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 164 transitions. [2024-11-11 21:19:43,138 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 164 transitions. Word has length 29 [2024-11-11 21:19:43,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:19:43,139 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 164 transitions. [2024-11-11 21:19:43,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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) [2024-11-11 21:19:43,140 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 164 transitions. [2024-11-11 21:19:43,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-11 21:19:43,144 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:19:43,144 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:19:43,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 21:19:43,144 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:19:43,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:19:43,146 INFO L85 PathProgramCache]: Analyzing trace with hash -891757768, now seen corresponding path program 1 times [2024-11-11 21:19:43,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:19:43,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145529158] [2024-11-11 21:19:43,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:19:43,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:19:43,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:19:43,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:19:43,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:19:43,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145529158] [2024-11-11 21:19:43,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145529158] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:19:43,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:19:43,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-11 21:19:43,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937942199] [2024-11-11 21:19:43,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:19:43,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-11 21:19:43,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:19:43,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-11 21:19:43,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-11 21:19:43,522 INFO L87 Difference]: Start difference. First operand 127 states and 164 transitions. Second operand has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 states have internal predecessors, (89), 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) [2024-11-11 21:19:44,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:19:44,044 INFO L93 Difference]: Finished difference Result 1087 states and 1716 transitions. [2024-11-11 21:19:44,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-11 21:19:44,044 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 states have internal predecessors, (89), 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 89 [2024-11-11 21:19:44,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:19:44,049 INFO L225 Difference]: With dead ends: 1087 [2024-11-11 21:19:44,049 INFO L226 Difference]: Without dead ends: 1027 [2024-11-11 21:19:44,050 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=344, Unknown=0, NotChecked=0, Total=506 [2024-11-11 21:19:44,051 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 1859 mSDsluCounter, 5108 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1859 SdHoareTripleChecker+Valid, 5268 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 21:19:44,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1859 Valid, 5268 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 21:19:44,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1027 states. [2024-11-11 21:19:44,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1027 to 185. [2024-11-11 21:19:44,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 184 states have (on average 1.4021739130434783) internal successors, (258), 184 states have internal predecessors, (258), 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) [2024-11-11 21:19:44,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 258 transitions. [2024-11-11 21:19:44,073 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 258 transitions. Word has length 89 [2024-11-11 21:19:44,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:19:44,074 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 258 transitions. [2024-11-11 21:19:44,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 states have internal predecessors, (89), 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) [2024-11-11 21:19:44,074 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 258 transitions. [2024-11-11 21:19:44,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-11 21:19:44,076 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:19:44,076 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:19:44,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 21:19:44,076 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:19:44,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:19:44,077 INFO L85 PathProgramCache]: Analyzing trace with hash 598555528, now seen corresponding path program 1 times [2024-11-11 21:19:44,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:19:44,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676788093] [2024-11-11 21:19:44,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:19:44,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:19:44,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:19:44,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:19:44,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:19:44,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676788093] [2024-11-11 21:19:44,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676788093] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:19:44,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:19:44,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:19:44,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404415150] [2024-11-11 21:19:44,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:19:44,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:19:44,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:19:44,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:19:44,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:19:44,306 INFO L87 Difference]: Start difference. First operand 185 states and 258 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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) [2024-11-11 21:19:44,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:19:44,326 INFO L93 Difference]: Finished difference Result 410 states and 621 transitions. [2024-11-11 21:19:44,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:19:44,327 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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 91 [2024-11-11 21:19:44,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:19:44,329 INFO L225 Difference]: With dead ends: 410 [2024-11-11 21:19:44,330 INFO L226 Difference]: Without dead ends: 292 [2024-11-11 21:19:44,331 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 [2024-11-11 21:19:44,333 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 67 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:19:44,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 254 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:19:44,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2024-11-11 21:19:44,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 290. [2024-11-11 21:19:44,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 289 states have (on average 1.4740484429065743) internal successors, (426), 289 states have internal predecessors, (426), 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) [2024-11-11 21:19:44,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 426 transitions. [2024-11-11 21:19:44,350 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 426 transitions. Word has length 91 [2024-11-11 21:19:44,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:19:44,351 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 426 transitions. [2024-11-11 21:19:44,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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) [2024-11-11 21:19:44,351 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 426 transitions. [2024-11-11 21:19:44,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-11 21:19:44,353 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:19:44,354 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:19:44,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 21:19:44,354 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:19:44,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:19:44,355 INFO L85 PathProgramCache]: Analyzing trace with hash 665049040, now seen corresponding path program 1 times [2024-11-11 21:19:44,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:19:44,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440827090] [2024-11-11 21:19:44,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:19:44,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:19:44,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:19:44,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:19:44,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:19:44,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440827090] [2024-11-11 21:19:44,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440827090] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:19:44,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:19:44,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-11 21:19:44,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264316859] [2024-11-11 21:19:44,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:19:44,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-11 21:19:44,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:19:44,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-11 21:19:44,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-11 21:19:44,849 INFO L87 Difference]: Start difference. First operand 290 states and 426 transitions. Second operand has 10 states, 10 states have (on average 9.1) internal successors, (91), 10 states have internal predecessors, (91), 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) [2024-11-11 21:19:45,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:19:45,244 INFO L93 Difference]: Finished difference Result 515 states and 786 transitions. [2024-11-11 21:19:45,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 21:19:45,245 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.1) internal successors, (91), 10 states have internal predecessors, (91), 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 91 [2024-11-11 21:19:45,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:19:45,246 INFO L225 Difference]: With dead ends: 515 [2024-11-11 21:19:45,246 INFO L226 Difference]: Without dead ends: 292 [2024-11-11 21:19:45,247 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2024-11-11 21:19:45,247 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 419 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:19:45,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 815 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:19:45,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2024-11-11 21:19:45,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 290. [2024-11-11 21:19:45,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 289 states have (on average 1.467128027681661) internal successors, (424), 289 states have internal predecessors, (424), 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) [2024-11-11 21:19:45,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 424 transitions. [2024-11-11 21:19:45,255 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 424 transitions. Word has length 91 [2024-11-11 21:19:45,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:19:45,255 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 424 transitions. [2024-11-11 21:19:45,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.1) internal successors, (91), 10 states have internal predecessors, (91), 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) [2024-11-11 21:19:45,255 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 424 transitions. [2024-11-11 21:19:45,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-11 21:19:45,257 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:19:45,258 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:19:45,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 21:19:45,258 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:19:45,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:19:45,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1273039064, now seen corresponding path program 1 times [2024-11-11 21:19:45,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:19:45,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007082056] [2024-11-11 21:19:45,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:19:45,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:19:45,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:19:45,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:19:45,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:19:45,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007082056] [2024-11-11 21:19:45,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007082056] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:19:45,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:19:45,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:19:45,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576345654] [2024-11-11 21:19:45,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:19:45,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 21:19:45,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:19:45,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 21:19:45,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-11 21:19:45,572 INFO L87 Difference]: Start difference. First operand 290 states and 424 transitions. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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) [2024-11-11 21:19:45,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:19:45,608 INFO L93 Difference]: Finished difference Result 298 states and 433 transitions. [2024-11-11 21:19:45,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 21:19:45,608 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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 92 [2024-11-11 21:19:45,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:19:45,611 INFO L225 Difference]: With dead ends: 298 [2024-11-11 21:19:45,611 INFO L226 Difference]: Without dead ends: 296 [2024-11-11 21:19:45,611 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-11 21:19:45,612 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 0 mSDsluCounter, 935 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1093 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:19:45,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1093 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:19:45,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2024-11-11 21:19:45,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2024-11-11 21:19:45,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 295 states have (on average 1.4542372881355932) internal successors, (429), 295 states have internal predecessors, (429), 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) [2024-11-11 21:19:45,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 429 transitions. [2024-11-11 21:19:45,627 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 429 transitions. Word has length 92 [2024-11-11 21:19:45,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:19:45,628 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 429 transitions. [2024-11-11 21:19:45,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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) [2024-11-11 21:19:45,628 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 429 transitions. [2024-11-11 21:19:45,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-11 21:19:45,630 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:19:45,630 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:19:45,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 21:19:45,630 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:19:45,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:19:45,630 INFO L85 PathProgramCache]: Analyzing trace with hash -559062096, now seen corresponding path program 1 times [2024-11-11 21:19:45,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:19:45,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911478036] [2024-11-11 21:19:45,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:19:45,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:19:45,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:19:45,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:19:45,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:19:45,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911478036] [2024-11-11 21:19:45,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911478036] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:19:45,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:19:45,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:19:45,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735691476] [2024-11-11 21:19:45,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:19:45,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:19:45,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:19:45,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:19:45,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:19:45,720 INFO L87 Difference]: Start difference. First operand 296 states and 429 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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) [2024-11-11 21:19:45,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:19:45,738 INFO L93 Difference]: Finished difference Result 538 states and 810 transitions. [2024-11-11 21:19:45,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:19:45,738 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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 93 [2024-11-11 21:19:45,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:19:45,741 INFO L225 Difference]: With dead ends: 538 [2024-11-11 21:19:45,741 INFO L226 Difference]: Without dead ends: 414 [2024-11-11 21:19:45,741 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 [2024-11-11 21:19:45,742 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 87 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 344 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 [2024-11-11 21:19:45,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 344 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:19:45,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2024-11-11 21:19:45,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 412. [2024-11-11 21:19:45,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 411 states have (on average 1.4841849148418491) internal successors, (610), 411 states have internal predecessors, (610), 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) [2024-11-11 21:19:45,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 610 transitions. [2024-11-11 21:19:45,753 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 610 transitions. Word has length 93 [2024-11-11 21:19:45,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:19:45,753 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 610 transitions. [2024-11-11 21:19:45,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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) [2024-11-11 21:19:45,753 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 610 transitions. [2024-11-11 21:19:45,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-11 21:19:45,754 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:19:45,754 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:19:45,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 21:19:45,755 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:19:45,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:19:45,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1753924784, now seen corresponding path program 1 times [2024-11-11 21:19:45,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:19:45,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170468606] [2024-11-11 21:19:45,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:19:45,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:19:45,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:19:45,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:19:45,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:19:45,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170468606] [2024-11-11 21:19:45,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170468606] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:19:45,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:19:45,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:19:45,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448915574] [2024-11-11 21:19:45,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:19:45,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:19:45,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:19:45,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:19:45,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:19:45,838 INFO L87 Difference]: Start difference. First operand 412 states and 610 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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) [2024-11-11 21:19:45,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:19:45,859 INFO L93 Difference]: Finished difference Result 1074 states and 1650 transitions. [2024-11-11 21:19:45,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:19:45,859 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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 93 [2024-11-11 21:19:45,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:19:45,862 INFO L225 Difference]: With dead ends: 1074 [2024-11-11 21:19:45,862 INFO L226 Difference]: Without dead ends: 731 [2024-11-11 21:19:45,863 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 [2024-11-11 21:19:45,864 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 85 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 350 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 [2024-11-11 21:19:45,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 350 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:19:45,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2024-11-11 21:19:45,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 729. [2024-11-11 21:19:45,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 729 states, 728 states have (on average 1.5137362637362637) internal successors, (1102), 728 states have internal predecessors, (1102), 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) [2024-11-11 21:19:45,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 1102 transitions. [2024-11-11 21:19:45,883 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 1102 transitions. Word has length 93 [2024-11-11 21:19:45,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:19:45,884 INFO L471 AbstractCegarLoop]: Abstraction has 729 states and 1102 transitions. [2024-11-11 21:19:45,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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) [2024-11-11 21:19:45,884 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 1102 transitions. [2024-11-11 21:19:45,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-11 21:19:45,884 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:19:45,884 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:19:45,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 21:19:45,885 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:19:45,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:19:45,885 INFO L85 PathProgramCache]: Analyzing trace with hash -598973008, now seen corresponding path program 1 times [2024-11-11 21:19:45,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:19:45,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137024060] [2024-11-11 21:19:45,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:19:45,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:19:45,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:19:46,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:19:46,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:19:46,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137024060] [2024-11-11 21:19:46,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137024060] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:19:46,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:19:46,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:19:46,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35388863] [2024-11-11 21:19:46,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:19:46,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:19:46,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:19:46,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:19:46,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:19:46,018 INFO L87 Difference]: Start difference. First operand 729 states and 1102 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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) [2024-11-11 21:19:46,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:19:46,073 INFO L93 Difference]: Finished difference Result 2001 states and 3084 transitions. [2024-11-11 21:19:46,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:19:46,075 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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 93 [2024-11-11 21:19:46,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:19:46,079 INFO L225 Difference]: With dead ends: 2001 [2024-11-11 21:19:46,079 INFO L226 Difference]: Without dead ends: 1341 [2024-11-11 21:19:46,080 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 [2024-11-11 21:19:46,080 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 83 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 352 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 [2024-11-11 21:19:46,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 352 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:19:46,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1341 states. [2024-11-11 21:19:46,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1341 to 1339. [2024-11-11 21:19:46,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1339 states, 1338 states have (on average 1.5231689088191331) internal successors, (2038), 1338 states have internal predecessors, (2038), 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) [2024-11-11 21:19:46,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1339 states to 1339 states and 2038 transitions. [2024-11-11 21:19:46,103 INFO L78 Accepts]: Start accepts. Automaton has 1339 states and 2038 transitions. Word has length 93 [2024-11-11 21:19:46,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:19:46,103 INFO L471 AbstractCegarLoop]: Abstraction has 1339 states and 2038 transitions. [2024-11-11 21:19:46,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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) [2024-11-11 21:19:46,103 INFO L276 IsEmpty]: Start isEmpty. Operand 1339 states and 2038 transitions. [2024-11-11 21:19:46,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-11 21:19:46,104 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:19:46,104 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:19:46,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 21:19:46,104 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:19:46,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:19:46,104 INFO L85 PathProgramCache]: Analyzing trace with hash -436058448, now seen corresponding path program 1 times [2024-11-11 21:19:46,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:19:46,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685679055] [2024-11-11 21:19:46,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:19:46,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:19:46,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:19:46,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:19:46,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:19:46,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685679055] [2024-11-11 21:19:46,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685679055] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:19:46,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:19:46,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:19:46,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436302482] [2024-11-11 21:19:46,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:19:46,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:19:46,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:19:46,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:19:46,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:19:46,169 INFO L87 Difference]: Start difference. First operand 1339 states and 2038 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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) [2024-11-11 21:19:46,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:19:46,227 INFO L93 Difference]: Finished difference Result 3783 states and 5808 transitions. [2024-11-11 21:19:46,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:19:46,228 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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 93 [2024-11-11 21:19:46,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:19:46,234 INFO L225 Difference]: With dead ends: 3783 [2024-11-11 21:19:46,235 INFO L226 Difference]: Without dead ends: 2513 [2024-11-11 21:19:46,236 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 [2024-11-11 21:19:46,236 INFO L435 NwaCegarLoop]: 244 mSDtfsCounter, 81 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 354 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 [2024-11-11 21:19:46,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 354 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:19:46,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2513 states. [2024-11-11 21:19:46,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2513 to 2511. [2024-11-11 21:19:46,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2511 states, 2510 states have (on average 1.5195219123505976) internal successors, (3814), 2510 states have internal predecessors, (3814), 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) [2024-11-11 21:19:46,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2511 states to 2511 states and 3814 transitions. [2024-11-11 21:19:46,281 INFO L78 Accepts]: Start accepts. Automaton has 2511 states and 3814 transitions. Word has length 93 [2024-11-11 21:19:46,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:19:46,281 INFO L471 AbstractCegarLoop]: Abstraction has 2511 states and 3814 transitions. [2024-11-11 21:19:46,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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) [2024-11-11 21:19:46,281 INFO L276 IsEmpty]: Start isEmpty. Operand 2511 states and 3814 transitions. [2024-11-11 21:19:46,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-11 21:19:46,282 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:19:46,282 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:19:46,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 21:19:46,282 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:19:46,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:19:46,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1066059952, now seen corresponding path program 1 times [2024-11-11 21:19:46,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:19:46,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131942690] [2024-11-11 21:19:46,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:19:46,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:19:46,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:19:46,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:19:46,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:19:46,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131942690] [2024-11-11 21:19:46,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131942690] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:19:46,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:19:46,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:19:46,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331565945] [2024-11-11 21:19:46,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:19:46,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:19:46,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:19:46,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:19:46,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:19:46,346 INFO L87 Difference]: Start difference. First operand 2511 states and 3814 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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) [2024-11-11 21:19:46,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:19:46,404 INFO L93 Difference]: Finished difference Result 7203 states and 10968 transitions. [2024-11-11 21:19:46,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:19:46,405 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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 93 [2024-11-11 21:19:46,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:19:46,417 INFO L225 Difference]: With dead ends: 7203 [2024-11-11 21:19:46,417 INFO L226 Difference]: Without dead ends: 4761 [2024-11-11 21:19:46,420 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 [2024-11-11 21:19:46,421 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 77 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 350 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 [2024-11-11 21:19:46,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 350 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:19:46,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4761 states. [2024-11-11 21:19:46,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4761 to 4759. [2024-11-11 21:19:46,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4759 states, 4758 states have (on average 1.5077763766288357) internal successors, (7174), 4758 states have internal predecessors, (7174), 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) [2024-11-11 21:19:46,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4759 states to 4759 states and 7174 transitions. [2024-11-11 21:19:46,510 INFO L78 Accepts]: Start accepts. Automaton has 4759 states and 7174 transitions. Word has length 93 [2024-11-11 21:19:46,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:19:46,511 INFO L471 AbstractCegarLoop]: Abstraction has 4759 states and 7174 transitions. [2024-11-11 21:19:46,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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) [2024-11-11 21:19:46,511 INFO L276 IsEmpty]: Start isEmpty. Operand 4759 states and 7174 transitions. [2024-11-11 21:19:46,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-11 21:19:46,511 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:19:46,512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:19:46,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 21:19:46,512 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:19:46,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:19:46,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1149408848, now seen corresponding path program 1 times [2024-11-11 21:19:46,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:19:46,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85081423] [2024-11-11 21:19:46,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:19:46,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:19:46,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:19:46,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:19:46,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:19:46,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85081423] [2024-11-11 21:19:46,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85081423] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:19:46,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:19:46,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:19:46,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232625060] [2024-11-11 21:19:46,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:19:46,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:19:46,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:19:46,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:19:46,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:19:46,572 INFO L87 Difference]: Start difference. First operand 4759 states and 7174 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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) [2024-11-11 21:19:46,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:19:46,745 INFO L93 Difference]: Finished difference Result 13755 states and 20712 transitions. [2024-11-11 21:19:46,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:19:46,746 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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 93 [2024-11-11 21:19:46,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:19:46,771 INFO L225 Difference]: With dead ends: 13755 [2024-11-11 21:19:46,771 INFO L226 Difference]: Without dead ends: 9065 [2024-11-11 21:19:46,778 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 [2024-11-11 21:19:46,778 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 75 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 352 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 [2024-11-11 21:19:46,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 352 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:19:46,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9065 states. [2024-11-11 21:19:46,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9065 to 9063. [2024-11-11 21:19:46,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9063 states, 9062 states have (on average 1.490840873979254) internal successors, (13510), 9062 states have internal predecessors, (13510), 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) [2024-11-11 21:19:46,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9063 states to 9063 states and 13510 transitions. [2024-11-11 21:19:46,985 INFO L78 Accepts]: Start accepts. Automaton has 9063 states and 13510 transitions. Word has length 93 [2024-11-11 21:19:46,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:19:46,985 INFO L471 AbstractCegarLoop]: Abstraction has 9063 states and 13510 transitions. [2024-11-11 21:19:46,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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) [2024-11-11 21:19:46,985 INFO L276 IsEmpty]: Start isEmpty. Operand 9063 states and 13510 transitions. [2024-11-11 21:19:46,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-11 21:19:46,986 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:19:46,986 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:19:46,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 21:19:46,986 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:19:46,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:19:46,986 INFO L85 PathProgramCache]: Analyzing trace with hash 631524016, now seen corresponding path program 1 times [2024-11-11 21:19:46,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:19:46,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962439473] [2024-11-11 21:19:46,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:19:46,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:19:47,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:19:47,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:19:47,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:19:47,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962439473] [2024-11-11 21:19:47,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962439473] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:19:47,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:19:47,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:19:47,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555027477] [2024-11-11 21:19:47,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:19:47,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:19:47,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:19:47,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:19:47,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:19:47,051 INFO L87 Difference]: Start difference. First operand 9063 states and 13510 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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) [2024-11-11 21:19:47,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:19:47,301 INFO L93 Difference]: Finished difference Result 26283 states and 39048 transitions. [2024-11-11 21:19:47,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:19:47,301 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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 93 [2024-11-11 21:19:47,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:19:47,335 INFO L225 Difference]: With dead ends: 26283 [2024-11-11 21:19:47,336 INFO L226 Difference]: Without dead ends: 17289 [2024-11-11 21:19:47,342 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 [2024-11-11 21:19:47,343 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 73 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 354 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 [2024-11-11 21:19:47,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 354 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:19:47,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17289 states. [2024-11-11 21:19:47,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17289 to 17287. [2024-11-11 21:19:47,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17287 states, 17286 states have (on average 1.4702071040148097) internal successors, (25414), 17286 states have internal predecessors, (25414), 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) [2024-11-11 21:19:47,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17287 states to 17287 states and 25414 transitions. [2024-11-11 21:19:47,630 INFO L78 Accepts]: Start accepts. Automaton has 17287 states and 25414 transitions. Word has length 93 [2024-11-11 21:19:47,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:19:47,631 INFO L471 AbstractCegarLoop]: Abstraction has 17287 states and 25414 transitions. [2024-11-11 21:19:47,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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) [2024-11-11 21:19:47,631 INFO L276 IsEmpty]: Start isEmpty. Operand 17287 states and 25414 transitions. [2024-11-11 21:19:47,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-11 21:19:47,631 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:19:47,632 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:19:47,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-11 21:19:47,632 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:19:47,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:19:47,632 INFO L85 PathProgramCache]: Analyzing trace with hash -172202064, now seen corresponding path program 1 times [2024-11-11 21:19:47,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:19:47,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538970774] [2024-11-11 21:19:47,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:19:47,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:19:47,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:19:47,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:19:47,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:19:47,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538970774] [2024-11-11 21:19:47,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538970774] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:19:47,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:19:47,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:19:47,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684877005] [2024-11-11 21:19:47,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:19:47,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:19:47,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:19:47,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:19:47,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:19:47,776 INFO L87 Difference]: Start difference. First operand 17287 states and 25414 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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) [2024-11-11 21:19:48,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:19:48,031 INFO L93 Difference]: Finished difference Result 50187 states and 73416 transitions. [2024-11-11 21:19:48,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:19:48,031 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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 93 [2024-11-11 21:19:48,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:19:48,090 INFO L225 Difference]: With dead ends: 50187 [2024-11-11 21:19:48,090 INFO L226 Difference]: Without dead ends: 32969 [2024-11-11 21:19:48,116 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 [2024-11-11 21:19:48,117 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 79 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 356 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 [2024-11-11 21:19:48,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 356 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:19:48,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32969 states. [2024-11-11 21:19:48,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32969 to 32967. [2024-11-11 21:19:48,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32967 states, 32966 states have (on average 1.446520657647273) internal successors, (47686), 32966 states have internal predecessors, (47686), 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) [2024-11-11 21:19:49,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32967 states to 32967 states and 47686 transitions. [2024-11-11 21:19:49,024 INFO L78 Accepts]: Start accepts. Automaton has 32967 states and 47686 transitions. Word has length 93 [2024-11-11 21:19:49,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:19:49,024 INFO L471 AbstractCegarLoop]: Abstraction has 32967 states and 47686 transitions. [2024-11-11 21:19:49,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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) [2024-11-11 21:19:49,025 INFO L276 IsEmpty]: Start isEmpty. Operand 32967 states and 47686 transitions. [2024-11-11 21:19:49,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-11 21:19:49,035 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:19:49,036 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2024-11-11 21:19:49,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 21:19:49,036 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:19:49,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:19:49,037 INFO L85 PathProgramCache]: Analyzing trace with hash 2039542488, now seen corresponding path program 1 times [2024-11-11 21:19:49,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:19:49,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388325207] [2024-11-11 21:19:49,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:19:49,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:19:49,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:19:49,344 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-11 21:19:49,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:19:49,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388325207] [2024-11-11 21:19:49,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388325207] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:19:49,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:19:49,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-11 21:19:49,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148801196] [2024-11-11 21:19:49,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:19:49,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-11 21:19:49,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:19:49,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-11 21:19:49,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-11 21:19:49,347 INFO L87 Difference]: Start difference. First operand 32967 states and 47686 transitions. Second operand has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 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) [2024-11-11 21:19:53,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:19:53,092 INFO L93 Difference]: Finished difference Result 292953 states and 423759 transitions. [2024-11-11 21:19:53,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 21:19:53,094 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 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 118 [2024-11-11 21:19:53,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:19:53,959 INFO L225 Difference]: With dead ends: 292953 [2024-11-11 21:19:53,959 INFO L226 Difference]: Without dead ends: 269911 [2024-11-11 21:19:54,063 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-11-11 21:19:54,064 INFO L435 NwaCegarLoop]: 262 mSDtfsCounter, 1639 mSDsluCounter, 2244 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1639 SdHoareTripleChecker+Valid, 2506 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:19:54,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1639 Valid, 2506 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:19:54,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269911 states. [2024-11-11 21:19:57,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269911 to 60999. [2024-11-11 21:19:57,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60999 states, 60998 states have (on average 1.4406701859077347) internal successors, (87878), 60998 states have internal predecessors, (87878), 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) [2024-11-11 21:19:57,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60999 states to 60999 states and 87878 transitions. [2024-11-11 21:19:57,513 INFO L78 Accepts]: Start accepts. Automaton has 60999 states and 87878 transitions. Word has length 118 [2024-11-11 21:19:57,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:19:57,514 INFO L471 AbstractCegarLoop]: Abstraction has 60999 states and 87878 transitions. [2024-11-11 21:19:57,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 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) [2024-11-11 21:19:57,514 INFO L276 IsEmpty]: Start isEmpty. Operand 60999 states and 87878 transitions. [2024-11-11 21:19:57,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-11 21:19:57,522 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:19:57,522 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2024-11-11 21:19:57,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-11 21:19:57,523 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:19:57,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:19:57,523 INFO L85 PathProgramCache]: Analyzing trace with hash 57562072, now seen corresponding path program 1 times [2024-11-11 21:19:57,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:19:57,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952234025] [2024-11-11 21:19:57,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:19:57,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:19:57,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:19:57,806 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-11 21:19:57,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:19:57,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952234025] [2024-11-11 21:19:57,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952234025] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:19:57,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:19:57,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-11 21:19:57,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591423495] [2024-11-11 21:19:57,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:19:57,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-11 21:19:57,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:19:57,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-11 21:19:57,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-11 21:19:57,810 INFO L87 Difference]: Start difference. First operand 60999 states and 87878 transitions. Second operand has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 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) [2024-11-11 21:20:02,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:20:02,299 INFO L93 Difference]: Finished difference Result 325849 states and 471119 transitions. [2024-11-11 21:20:02,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 21:20:02,300 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 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 118 [2024-11-11 21:20:02,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:20:02,870 INFO L225 Difference]: With dead ends: 325849 [2024-11-11 21:20:02,871 INFO L226 Difference]: Without dead ends: 292951 [2024-11-11 21:20:02,955 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-11-11 21:20:02,955 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 1639 mSDsluCounter, 2225 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1639 SdHoareTripleChecker+Valid, 2486 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 21:20:02,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1639 Valid, 2486 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 21:20:03,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292951 states. [2024-11-11 21:20:07,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292951 to 105415. [2024-11-11 21:20:07,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105415 states, 105414 states have (on average 1.4371335875690137) internal successors, (151494), 105414 states have internal predecessors, (151494), 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) [2024-11-11 21:20:07,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105415 states to 105415 states and 151494 transitions. [2024-11-11 21:20:07,925 INFO L78 Accepts]: Start accepts. Automaton has 105415 states and 151494 transitions. Word has length 118 [2024-11-11 21:20:07,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:20:07,926 INFO L471 AbstractCegarLoop]: Abstraction has 105415 states and 151494 transitions. [2024-11-11 21:20:07,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 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) [2024-11-11 21:20:07,927 INFO L276 IsEmpty]: Start isEmpty. Operand 105415 states and 151494 transitions. [2024-11-11 21:20:07,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-11 21:20:07,954 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:20:07,955 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2024-11-11 21:20:07,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-11 21:20:07,955 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:20:07,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:20:07,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1999631576, now seen corresponding path program 1 times [2024-11-11 21:20:07,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:20:07,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390570604] [2024-11-11 21:20:07,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:20:07,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:20:08,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:20:08,637 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-11 21:20:08,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:20:08,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390570604] [2024-11-11 21:20:08,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390570604] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:20:08,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:20:08,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-11 21:20:08,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742103690] [2024-11-11 21:20:08,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:20:08,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-11 21:20:08,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:20:08,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-11 21:20:08,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-11 21:20:08,639 INFO L87 Difference]: Start difference. First operand 105415 states and 151494 transitions. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 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) [2024-11-11 21:20:14,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:20:14,698 INFO L93 Difference]: Finished difference Result 358745 states and 518351 transitions. [2024-11-11 21:20:14,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 21:20:14,699 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 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 118 [2024-11-11 21:20:14,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:20:15,314 INFO L225 Difference]: With dead ends: 358745 [2024-11-11 21:20:15,315 INFO L226 Difference]: Without dead ends: 325847 [2024-11-11 21:20:15,407 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-11-11 21:20:15,408 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 1661 mSDsluCounter, 2142 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1661 SdHoareTripleChecker+Valid, 2401 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 21:20:15,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1661 Valid, 2401 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 21:20:15,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325847 states. [2024-11-11 21:20:20,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325847 to 138311. [2024-11-11 21:20:20,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138311 states, 138310 states have (on average 1.4368158484563662) internal successors, (198726), 138310 states have internal predecessors, (198726), 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) [2024-11-11 21:20:21,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138311 states to 138311 states and 198726 transitions. [2024-11-11 21:20:21,011 INFO L78 Accepts]: Start accepts. Automaton has 138311 states and 198726 transitions. Word has length 118 [2024-11-11 21:20:21,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:20:21,012 INFO L471 AbstractCegarLoop]: Abstraction has 138311 states and 198726 transitions. [2024-11-11 21:20:21,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 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) [2024-11-11 21:20:21,012 INFO L276 IsEmpty]: Start isEmpty. Operand 138311 states and 198726 transitions. [2024-11-11 21:20:21,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-11 21:20:21,022 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:20:21,022 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2024-11-11 21:20:21,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-11 21:20:21,022 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:20:21,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:20:21,023 INFO L85 PathProgramCache]: Analyzing trace with hash -2132421160, now seen corresponding path program 1 times [2024-11-11 21:20:21,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:20:21,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539432652] [2024-11-11 21:20:21,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:20:21,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:20:21,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:20:21,477 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-11 21:20:21,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:20:21,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539432652] [2024-11-11 21:20:21,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539432652] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:20:21,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:20:21,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-11 21:20:21,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450566664] [2024-11-11 21:20:21,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:20:21,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-11 21:20:21,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:20:21,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-11 21:20:21,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-11 21:20:21,479 INFO L87 Difference]: Start difference. First operand 138311 states and 198726 transitions. Second operand has 10 states, 10 states have (on average 11.1) internal successors, (111), 10 states have internal predecessors, (111), 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) [2024-11-11 21:20:28,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:20:28,565 INFO L93 Difference]: Finished difference Result 391641 states and 565583 transitions. [2024-11-11 21:20:28,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 21:20:28,566 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.1) internal successors, (111), 10 states have internal predecessors, (111), 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 118 [2024-11-11 21:20:28,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:20:29,426 INFO L225 Difference]: With dead ends: 391641 [2024-11-11 21:20:29,427 INFO L226 Difference]: Without dead ends: 358743 [2024-11-11 21:20:29,492 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-11-11 21:20:29,493 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 1751 mSDsluCounter, 2057 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1751 SdHoareTripleChecker+Valid, 2314 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 21:20:29,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1751 Valid, 2314 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 21:20:29,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358743 states. [2024-11-11 21:20:36,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358743 to 171207. [2024-11-11 21:20:36,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171207 states, 171206 states have (on average 1.4366202119084612) internal successors, (245958), 171206 states have internal predecessors, (245958), 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) [2024-11-11 21:20:36,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171207 states to 171207 states and 245958 transitions. [2024-11-11 21:20:36,577 INFO L78 Accepts]: Start accepts. Automaton has 171207 states and 245958 transitions. Word has length 118 [2024-11-11 21:20:36,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:20:36,577 INFO L471 AbstractCegarLoop]: Abstraction has 171207 states and 245958 transitions. [2024-11-11 21:20:36,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.1) internal successors, (111), 10 states have internal predecessors, (111), 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) [2024-11-11 21:20:36,578 INFO L276 IsEmpty]: Start isEmpty. Operand 171207 states and 245958 transitions. [2024-11-11 21:20:36,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-11 21:20:36,589 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:20:36,590 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2024-11-11 21:20:36,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-11 21:20:36,590 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:20:36,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:20:36,591 INFO L85 PathProgramCache]: Analyzing trace with hash -630302760, now seen corresponding path program 1 times [2024-11-11 21:20:36,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:20:36,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836593536] [2024-11-11 21:20:36,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:20:36,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:20:36,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:20:36,808 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 21:20:36,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:20:36,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836593536] [2024-11-11 21:20:36,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836593536] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:20:36,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:20:36,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-11 21:20:36,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703201647] [2024-11-11 21:20:36,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:20:36,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-11 21:20:36,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:20:36,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-11 21:20:36,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-11 21:20:36,810 INFO L87 Difference]: Start difference. First operand 171207 states and 245958 transitions. Second operand has 10 states, 10 states have (on average 10.7) internal successors, (107), 10 states have internal predecessors, (107), 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)