./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.7.ufo.BOUNDED-14.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.7.ufo.BOUNDED-14.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 84bce40124007e6e483bf8a05621b58460eab347da71074e5760fdf76654ee7f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 20:05:47,569 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 20:05:47,645 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 20:05:47,652 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 20:05:47,654 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 20:05:47,701 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 20:05:47,702 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 20:05:47,702 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 20:05:47,703 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 20:05:47,704 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 20:05:47,704 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 20:05:47,705 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 20:05:47,705 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 20:05:47,706 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 20:05:47,707 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 20:05:47,708 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 20:05:47,708 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 20:05:47,708 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 20:05:47,709 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 20:05:47,709 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 20:05:47,709 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 20:05:47,713 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 20:05:47,714 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 20:05:47,714 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 20:05:47,714 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 20:05:47,714 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 20:05:47,715 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 20:05:47,715 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 20:05:47,715 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 20:05:47,715 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 20:05:47,716 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 20:05:47,716 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 20:05:47,716 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:05:47,716 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 20:05:47,717 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 20:05:47,717 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 20:05:47,717 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 20:05:47,717 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 20:05:47,718 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 20:05:47,718 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 20:05:47,718 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 20:05:47,720 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 20:05:47,720 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 -> 84bce40124007e6e483bf8a05621b58460eab347da71074e5760fdf76654ee7f [2024-10-12 20:05:47,975 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 20:05:48,001 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 20:05:48,005 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 20:05:48,006 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 20:05:48,006 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 20:05:48,008 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.7.ufo.BOUNDED-14.pals.c [2024-10-12 20:05:49,440 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 20:05:49,688 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 20:05:49,689 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.7.ufo.BOUNDED-14.pals.c [2024-10-12 20:05:49,706 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac1635b5e/1971173234484126a5ca8ebc31f636b9/FLAGa36bdd2eb [2024-10-12 20:05:50,005 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac1635b5e/1971173234484126a5ca8ebc31f636b9 [2024-10-12 20:05:50,008 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 20:05:50,009 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 20:05:50,010 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 20:05:50,010 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 20:05:50,015 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 20:05:50,015 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:05:50" (1/1) ... [2024-10-12 20:05:50,016 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73bdcb55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:05:50, skipping insertion in model container [2024-10-12 20:05:50,016 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:05:50" (1/1) ... [2024-10-12 20:05:50,054 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 20:05:50,338 WARN L248 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.7.ufo.BOUNDED-14.pals.c[20019,20032] [2024-10-12 20:05:50,343 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:05:50,365 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 20:05:50,426 WARN L248 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.7.ufo.BOUNDED-14.pals.c[20019,20032] [2024-10-12 20:05:50,427 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:05:50,454 INFO L204 MainTranslator]: Completed translation [2024-10-12 20:05:50,454 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:05:50 WrapperNode [2024-10-12 20:05:50,455 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 20:05:50,456 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 20:05:50,456 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 20:05:50,456 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 20:05:50,464 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:05:50" (1/1) ... [2024-10-12 20:05:50,476 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:05:50" (1/1) ... [2024-10-12 20:05:50,515 INFO L138 Inliner]: procedures = 26, calls = 18, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 460 [2024-10-12 20:05:50,515 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 20:05:50,516 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 20:05:50,516 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 20:05:50,516 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 20:05:50,533 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:05:50" (1/1) ... [2024-10-12 20:05:50,534 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:05:50" (1/1) ... [2024-10-12 20:05:50,537 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:05:50" (1/1) ... [2024-10-12 20:05:50,565 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-10-12 20:05:50,565 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:05:50" (1/1) ... [2024-10-12 20:05:50,566 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:05:50" (1/1) ... [2024-10-12 20:05:50,576 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:05:50" (1/1) ... [2024-10-12 20:05:50,583 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:05:50" (1/1) ... [2024-10-12 20:05:50,586 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:05:50" (1/1) ... [2024-10-12 20:05:50,590 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:05:50" (1/1) ... [2024-10-12 20:05:50,594 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 20:05:50,596 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 20:05:50,597 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 20:05:50,597 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 20:05:50,598 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:05:50" (1/1) ... [2024-10-12 20:05:50,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:05:50,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:05:50,635 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-10-12 20:05:50,638 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-10-12 20:05:50,687 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 20:05:50,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 20:05:50,688 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 20:05:50,688 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 20:05:50,802 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 20:05:50,805 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 20:05:51,404 INFO L? ?]: Removed 50 outVars from TransFormulas that were not future-live. [2024-10-12 20:05:51,406 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 20:05:51,468 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 20:05:51,469 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 20:05:51,469 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:05:51 BoogieIcfgContainer [2024-10-12 20:05:51,469 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 20:05:51,471 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 20:05:51,472 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 20:05:51,475 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 20:05:51,475 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 08:05:50" (1/3) ... [2024-10-12 20:05:51,476 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52233cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:05:51, skipping insertion in model container [2024-10-12 20:05:51,476 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:05:50" (2/3) ... [2024-10-12 20:05:51,478 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52233cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:05:51, skipping insertion in model container [2024-10-12 20:05:51,478 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:05:51" (3/3) ... [2024-10-12 20:05:51,479 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.ufo.BOUNDED-14.pals.c [2024-10-12 20:05:51,495 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 20:05:51,496 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 20:05:51,556 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 20:05:51,562 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;@65371b31, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 20:05:51,562 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 20:05:51,566 INFO L276 IsEmpty]: Start isEmpty. Operand has 109 states, 107 states have (on average 1.8224299065420562) internal successors, (195), 108 states have internal predecessors, (195), 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-10-12 20:05:51,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-12 20:05:51,574 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:05:51,575 INFO L215 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] [2024-10-12 20:05:51,575 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:05:51,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:05:51,581 INFO L85 PathProgramCache]: Analyzing trace with hash 61708070, now seen corresponding path program 1 times [2024-10-12 20:05:51,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:05:51,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755102394] [2024-10-12 20:05:51,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:05:51,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:05:51,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:05:51,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:05:51,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:05:51,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755102394] [2024-10-12 20:05:51,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755102394] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:05:51,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:05:51,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 20:05:51,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209449579] [2024-10-12 20:05:51,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:05:51,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 20:05:51,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:05:51,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 20:05:51,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 20:05:51,911 INFO L87 Difference]: Start difference. First operand has 109 states, 107 states have (on average 1.8224299065420562) internal successors, (195), 108 states have internal predecessors, (195), 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 12.0) internal successors, (24), 2 states have internal predecessors, (24), 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-10-12 20:05:51,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:05:51,957 INFO L93 Difference]: Finished difference Result 165 states and 286 transitions. [2024-10-12 20:05:51,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 20:05:51,960 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 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 24 [2024-10-12 20:05:51,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:05:51,967 INFO L225 Difference]: With dead ends: 165 [2024-10-12 20:05:51,968 INFO L226 Difference]: Without dead ends: 107 [2024-10-12 20:05:51,970 INFO L431 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-10-12 20:05:51,973 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:05:51,974 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 188 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:05:51,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-10-12 20:05:52,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-10-12 20:05:52,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 106 states have (on average 1.7924528301886793) internal successors, (190), 106 states have internal predecessors, (190), 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-10-12 20:05:52,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 190 transitions. [2024-10-12 20:05:52,010 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 190 transitions. Word has length 24 [2024-10-12 20:05:52,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:05:52,011 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 190 transitions. [2024-10-12 20:05:52,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 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-10-12 20:05:52,011 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 190 transitions. [2024-10-12 20:05:52,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-12 20:05:52,012 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:05:52,012 INFO L215 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] [2024-10-12 20:05:52,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 20:05:52,013 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:05:52,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:05:52,014 INFO L85 PathProgramCache]: Analyzing trace with hash 484409896, now seen corresponding path program 1 times [2024-10-12 20:05:52,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:05:52,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322721176] [2024-10-12 20:05:52,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:05:52,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:05:52,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:05:52,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:05:52,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:05:52,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322721176] [2024-10-12 20:05:52,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322721176] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:05:52,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:05:52,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:05:52,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337519272] [2024-10-12 20:05:52,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:05:52,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:05:52,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:05:52,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:05:52,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:05:52,239 INFO L87 Difference]: Start difference. First operand 107 states and 190 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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-10-12 20:05:52,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:05:52,382 INFO L93 Difference]: Finished difference Result 163 states and 279 transitions. [2024-10-12 20:05:52,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:05:52,383 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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 24 [2024-10-12 20:05:52,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:05:52,386 INFO L225 Difference]: With dead ends: 163 [2024-10-12 20:05:52,386 INFO L226 Difference]: Without dead ends: 107 [2024-10-12 20:05:52,386 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:05:52,388 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 0 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:05:52,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 508 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:05:52,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-10-12 20:05:52,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-10-12 20:05:52,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 106 states have (on average 1.320754716981132) internal successors, (140), 106 states have internal predecessors, (140), 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-10-12 20:05:52,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 140 transitions. [2024-10-12 20:05:52,402 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 140 transitions. Word has length 24 [2024-10-12 20:05:52,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:05:52,403 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 140 transitions. [2024-10-12 20:05:52,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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-10-12 20:05:52,403 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 140 transitions. [2024-10-12 20:05:52,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-12 20:05:52,406 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:05:52,406 INFO L215 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] [2024-10-12 20:05:52,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 20:05:52,407 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:05:52,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:05:52,408 INFO L85 PathProgramCache]: Analyzing trace with hash 456528988, now seen corresponding path program 1 times [2024-10-12 20:05:52,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:05:52,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734631501] [2024-10-12 20:05:52,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:05:52,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:05:52,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:05:52,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:05:52,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:05:52,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734631501] [2024-10-12 20:05:52,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734631501] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:05:52,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:05:52,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 20:05:52,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264384462] [2024-10-12 20:05:52,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:05:52,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 20:05:52,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:05:52,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 20:05:52,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-12 20:05:52,786 INFO L87 Difference]: Start difference. First operand 107 states and 140 transitions. Second operand has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 9 states have internal predecessors, (73), 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-10-12 20:05:53,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:05:53,325 INFO L93 Difference]: Finished difference Result 849 states and 1344 transitions. [2024-10-12 20:05:53,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 20:05:53,326 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 9 states have internal predecessors, (73), 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 73 [2024-10-12 20:05:53,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:05:53,334 INFO L225 Difference]: With dead ends: 849 [2024-10-12 20:05:53,334 INFO L226 Difference]: Without dead ends: 796 [2024-10-12 20:05:53,338 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=256, Unknown=0, NotChecked=0, Total=380 [2024-10-12 20:05:53,339 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 1483 mSDsluCounter, 2856 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1483 SdHoareTripleChecker+Valid, 2989 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 20:05:53,341 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1483 Valid, 2989 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 20:05:53,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2024-10-12 20:05:53,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 158. [2024-10-12 20:05:53,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 157 states have (on average 1.4203821656050954) internal successors, (223), 157 states have internal predecessors, (223), 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-10-12 20:05:53,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 223 transitions. [2024-10-12 20:05:53,382 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 223 transitions. Word has length 73 [2024-10-12 20:05:53,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:05:53,385 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 223 transitions. [2024-10-12 20:05:53,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 9 states have internal predecessors, (73), 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-10-12 20:05:53,385 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 223 transitions. [2024-10-12 20:05:53,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-12 20:05:53,386 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:05:53,387 INFO L215 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] [2024-10-12 20:05:53,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 20:05:53,387 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:05:53,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:05:53,389 INFO L85 PathProgramCache]: Analyzing trace with hash -122926772, now seen corresponding path program 1 times [2024-10-12 20:05:53,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:05:53,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990033817] [2024-10-12 20:05:53,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:05:53,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:05:53,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:05:53,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:05:53,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:05:53,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990033817] [2024-10-12 20:05:53,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990033817] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:05:53,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:05:53,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:05:53,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124795730] [2024-10-12 20:05:53,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:05:53,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:05:53,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:05:53,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:05:53,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:05:53,587 INFO L87 Difference]: Start difference. First operand 158 states and 223 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:53,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:05:53,612 INFO L93 Difference]: Finished difference Result 355 states and 542 transitions. [2024-10-12 20:05:53,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:05:53,612 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2024-10-12 20:05:53,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:05:53,614 INFO L225 Difference]: With dead ends: 355 [2024-10-12 20:05:53,614 INFO L226 Difference]: Without dead ends: 251 [2024-10-12 20:05:53,616 INFO L431 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-10-12 20:05:53,618 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 58 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:05:53,619 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 215 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:05:53,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-10-12 20:05:53,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 249. [2024-10-12 20:05:53,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 248 states have (on average 1.4879032258064515) internal successors, (369), 248 states have internal predecessors, (369), 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-10-12 20:05:53,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 369 transitions. [2024-10-12 20:05:53,638 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 369 transitions. Word has length 75 [2024-10-12 20:05:53,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:05:53,639 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 369 transitions. [2024-10-12 20:05:53,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:53,640 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 369 transitions. [2024-10-12 20:05:53,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-12 20:05:53,645 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:05:53,646 INFO L215 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] [2024-10-12 20:05:53,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 20:05:53,646 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:05:53,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:05:53,647 INFO L85 PathProgramCache]: Analyzing trace with hash -120781820, now seen corresponding path program 1 times [2024-10-12 20:05:53,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:05:53,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082769683] [2024-10-12 20:05:53,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:05:53,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:05:53,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:05:54,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:05:54,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:05:54,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082769683] [2024-10-12 20:05:54,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082769683] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:05:54,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:05:54,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 20:05:54,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602727494] [2024-10-12 20:05:54,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:05:54,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 20:05:54,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:05:54,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 20:05:54,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-12 20:05:54,194 INFO L87 Difference]: Start difference. First operand 249 states and 369 transitions. Second operand has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:54,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:05:54,576 INFO L93 Difference]: Finished difference Result 446 states and 685 transitions. [2024-10-12 20:05:54,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 20:05:54,577 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2024-10-12 20:05:54,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:05:54,578 INFO L225 Difference]: With dead ends: 446 [2024-10-12 20:05:54,578 INFO L226 Difference]: Without dead ends: 251 [2024-10-12 20:05:54,579 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2024-10-12 20:05:54,579 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 119 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:05:54,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 709 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:05:54,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-10-12 20:05:54,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 249. [2024-10-12 20:05:54,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 248 states have (on average 1.4798387096774193) internal successors, (367), 248 states have internal predecessors, (367), 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-10-12 20:05:54,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 367 transitions. [2024-10-12 20:05:54,597 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 367 transitions. Word has length 75 [2024-10-12 20:05:54,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:05:54,597 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 367 transitions. [2024-10-12 20:05:54,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:54,598 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 367 transitions. [2024-10-12 20:05:54,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-12 20:05:54,599 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:05:54,599 INFO L215 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] [2024-10-12 20:05:54,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 20:05:54,600 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:05:54,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:05:54,600 INFO L85 PathProgramCache]: Analyzing trace with hash 536658470, now seen corresponding path program 1 times [2024-10-12 20:05:54,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:05:54,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490823869] [2024-10-12 20:05:54,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:05:54,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:05:54,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:05:54,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:05:54,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:05:54,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490823869] [2024-10-12 20:05:54,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490823869] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:05:54,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:05:54,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:05:54,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618436848] [2024-10-12 20:05:54,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:05:54,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:05:54,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:05:54,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:05:54,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:05:54,805 INFO L87 Difference]: Start difference. First operand 249 states and 367 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:54,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:05:54,835 INFO L93 Difference]: Finished difference Result 255 states and 374 transitions. [2024-10-12 20:05:54,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:05:54,837 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2024-10-12 20:05:54,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:05:54,839 INFO L225 Difference]: With dead ends: 255 [2024-10-12 20:05:54,840 INFO L226 Difference]: Without dead ends: 253 [2024-10-12 20:05:54,840 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:05:54,841 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:05:54,843 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 400 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:05:54,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2024-10-12 20:05:54,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2024-10-12 20:05:54,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 252 states have (on average 1.4682539682539681) internal successors, (370), 252 states have internal predecessors, (370), 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-10-12 20:05:54,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 370 transitions. [2024-10-12 20:05:54,855 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 370 transitions. Word has length 76 [2024-10-12 20:05:54,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:05:54,857 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 370 transitions. [2024-10-12 20:05:54,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:54,857 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 370 transitions. [2024-10-12 20:05:54,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-12 20:05:54,859 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:05:54,859 INFO L215 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] [2024-10-12 20:05:54,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 20:05:54,859 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:05:54,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:05:54,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1846932892, now seen corresponding path program 1 times [2024-10-12 20:05:54,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:05:54,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169216131] [2024-10-12 20:05:54,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:05:54,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:05:54,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:05:54,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:05:54,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:05:54,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169216131] [2024-10-12 20:05:54,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169216131] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:05:54,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:05:54,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:05:54,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436701936] [2024-10-12 20:05:54,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:05:54,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:05:54,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:05:54,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:05:54,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:05:54,951 INFO L87 Difference]: Start difference. First operand 253 states and 370 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:54,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:05:54,974 INFO L93 Difference]: Finished difference Result 463 states and 703 transitions. [2024-10-12 20:05:54,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:05:54,975 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-10-12 20:05:54,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:05:54,976 INFO L225 Difference]: With dead ends: 463 [2024-10-12 20:05:54,977 INFO L226 Difference]: Without dead ends: 355 [2024-10-12 20:05:54,977 INFO L431 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-10-12 20:05:54,978 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 76 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:05:54,978 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 293 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:05:54,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2024-10-12 20:05:54,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 353. [2024-10-12 20:05:54,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 352 states have (on average 1.4971590909090908) internal successors, (527), 352 states have internal predecessors, (527), 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-10-12 20:05:54,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 527 transitions. [2024-10-12 20:05:54,996 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 527 transitions. Word has length 77 [2024-10-12 20:05:54,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:05:54,996 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 527 transitions. [2024-10-12 20:05:54,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:54,997 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 527 transitions. [2024-10-12 20:05:54,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-12 20:05:54,997 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:05:54,998 INFO L215 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] [2024-10-12 20:05:54,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 20:05:54,998 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:05:54,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:05:54,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1501935516, now seen corresponding path program 1 times [2024-10-12 20:05:54,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:05:54,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9452359] [2024-10-12 20:05:54,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:05:54,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:05:55,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:05:55,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:05:55,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:05:55,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9452359] [2024-10-12 20:05:55,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9452359] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:05:55,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:05:55,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:05:55,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359071646] [2024-10-12 20:05:55,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:05:55,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:05:55,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:05:55,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:05:55,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:05:55,055 INFO L87 Difference]: Start difference. First operand 353 states and 527 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:55,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:05:55,083 INFO L93 Difference]: Finished difference Result 923 states and 1427 transitions. [2024-10-12 20:05:55,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:05:55,084 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-10-12 20:05:55,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:05:55,087 INFO L225 Difference]: With dead ends: 923 [2024-10-12 20:05:55,087 INFO L226 Difference]: Without dead ends: 626 [2024-10-12 20:05:55,087 INFO L431 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-10-12 20:05:55,088 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 72 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:05:55,088 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 293 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:05:55,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2024-10-12 20:05:55,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 624. [2024-10-12 20:05:55,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 624 states, 623 states have (on average 1.5232744783306582) internal successors, (949), 623 states have internal predecessors, (949), 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-10-12 20:05:55,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 949 transitions. [2024-10-12 20:05:55,105 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 949 transitions. Word has length 77 [2024-10-12 20:05:55,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:05:55,105 INFO L471 AbstractCegarLoop]: Abstraction has 624 states and 949 transitions. [2024-10-12 20:05:55,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:55,105 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 949 transitions. [2024-10-12 20:05:55,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-12 20:05:55,106 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:05:55,106 INFO L215 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] [2024-10-12 20:05:55,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 20:05:55,107 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:05:55,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:05:55,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1770518684, now seen corresponding path program 1 times [2024-10-12 20:05:55,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:05:55,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092778731] [2024-10-12 20:05:55,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:05:55,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:05:55,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:05:55,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:05:55,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:05:55,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092778731] [2024-10-12 20:05:55,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092778731] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:05:55,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:05:55,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:05:55,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504375925] [2024-10-12 20:05:55,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:05:55,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:05:55,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:05:55,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:05:55,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:05:55,171 INFO L87 Difference]: Start difference. First operand 624 states and 949 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:55,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:05:55,207 INFO L93 Difference]: Finished difference Result 1712 states and 2651 transitions. [2024-10-12 20:05:55,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:05:55,211 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-10-12 20:05:55,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:05:55,215 INFO L225 Difference]: With dead ends: 1712 [2024-10-12 20:05:55,216 INFO L226 Difference]: Without dead ends: 1144 [2024-10-12 20:05:55,217 INFO L431 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-10-12 20:05:55,218 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 70 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:05:55,219 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 295 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:05:55,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1144 states. [2024-10-12 20:05:55,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1144 to 1142. [2024-10-12 20:05:55,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1142 states, 1141 states have (on average 1.5293602103418054) internal successors, (1745), 1141 states have internal predecessors, (1745), 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-10-12 20:05:55,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1142 states to 1142 states and 1745 transitions. [2024-10-12 20:05:55,251 INFO L78 Accepts]: Start accepts. Automaton has 1142 states and 1745 transitions. Word has length 77 [2024-10-12 20:05:55,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:05:55,252 INFO L471 AbstractCegarLoop]: Abstraction has 1142 states and 1745 transitions. [2024-10-12 20:05:55,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:55,252 INFO L276 IsEmpty]: Start isEmpty. Operand 1142 states and 1745 transitions. [2024-10-12 20:05:55,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-12 20:05:55,252 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:05:55,253 INFO L215 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] [2024-10-12 20:05:55,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 20:05:55,253 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:05:55,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:05:55,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1938736484, now seen corresponding path program 1 times [2024-10-12 20:05:55,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:05:55,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208214464] [2024-10-12 20:05:55,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:05:55,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:05:55,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:05:55,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:05:55,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:05:55,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208214464] [2024-10-12 20:05:55,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208214464] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:05:55,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:05:55,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:05:55,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087364141] [2024-10-12 20:05:55,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:05:55,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:05:55,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:05:55,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:05:55,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:05:55,322 INFO L87 Difference]: Start difference. First operand 1142 states and 1745 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:55,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:05:55,409 INFO L93 Difference]: Finished difference Result 3218 states and 4955 transitions. [2024-10-12 20:05:55,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:05:55,410 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-10-12 20:05:55,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:05:55,418 INFO L225 Difference]: With dead ends: 3218 [2024-10-12 20:05:55,418 INFO L226 Difference]: Without dead ends: 2132 [2024-10-12 20:05:55,420 INFO L431 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-10-12 20:05:55,421 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 66 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:05:55,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 291 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:05:55,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2132 states. [2024-10-12 20:05:55,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2132 to 2130. [2024-10-12 20:05:55,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2130 states, 2129 states have (on average 1.5223109441052136) internal successors, (3241), 2129 states have internal predecessors, (3241), 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-10-12 20:05:55,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2130 states to 2130 states and 3241 transitions. [2024-10-12 20:05:55,492 INFO L78 Accepts]: Start accepts. Automaton has 2130 states and 3241 transitions. Word has length 77 [2024-10-12 20:05:55,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:05:55,493 INFO L471 AbstractCegarLoop]: Abstraction has 2130 states and 3241 transitions. [2024-10-12 20:05:55,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:55,493 INFO L276 IsEmpty]: Start isEmpty. Operand 2130 states and 3241 transitions. [2024-10-12 20:05:55,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-12 20:05:55,494 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:05:55,494 INFO L215 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] [2024-10-12 20:05:55,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 20:05:55,494 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:05:55,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:05:55,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1467497372, now seen corresponding path program 1 times [2024-10-12 20:05:55,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:05:55,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643087408] [2024-10-12 20:05:55,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:05:55,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:05:55,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:05:55,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:05:55,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:05:55,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643087408] [2024-10-12 20:05:55,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643087408] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:05:55,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:05:55,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:05:55,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478897713] [2024-10-12 20:05:55,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:05:55,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:05:55,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:05:55,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:05:55,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:05:55,566 INFO L87 Difference]: Start difference. First operand 2130 states and 3241 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:55,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:05:55,648 INFO L93 Difference]: Finished difference Result 6086 states and 9275 transitions. [2024-10-12 20:05:55,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:05:55,649 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-10-12 20:05:55,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:05:55,664 INFO L225 Difference]: With dead ends: 6086 [2024-10-12 20:05:55,664 INFO L226 Difference]: Without dead ends: 4012 [2024-10-12 20:05:55,670 INFO L431 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-10-12 20:05:55,671 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 64 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:05:55,672 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 293 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:05:55,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4012 states. [2024-10-12 20:05:55,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4012 to 4010. [2024-10-12 20:05:55,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4010 states, 4009 states have (on average 1.5068595659765527) internal successors, (6041), 4009 states have internal predecessors, (6041), 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-10-12 20:05:55,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4010 states to 4010 states and 6041 transitions. [2024-10-12 20:05:55,794 INFO L78 Accepts]: Start accepts. Automaton has 4010 states and 6041 transitions. Word has length 77 [2024-10-12 20:05:55,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:05:55,795 INFO L471 AbstractCegarLoop]: Abstraction has 4010 states and 6041 transitions. [2024-10-12 20:05:55,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:55,795 INFO L276 IsEmpty]: Start isEmpty. Operand 4010 states and 6041 transitions. [2024-10-12 20:05:55,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-12 20:05:55,796 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:05:55,796 INFO L215 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] [2024-10-12 20:05:55,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 20:05:55,796 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:05:55,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:05:55,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1730574748, now seen corresponding path program 1 times [2024-10-12 20:05:55,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:05:55,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552696572] [2024-10-12 20:05:55,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:05:55,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:05:55,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:05:55,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:05:55,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:05:55,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552696572] [2024-10-12 20:05:55,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552696572] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:05:55,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:05:55,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:05:55,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075401478] [2024-10-12 20:05:55,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:05:55,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:05:55,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:05:55,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:05:55,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:05:55,881 INFO L87 Difference]: Start difference. First operand 4010 states and 6041 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:56,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:05:56,014 INFO L93 Difference]: Finished difference Result 11534 states and 17339 transitions. [2024-10-12 20:05:56,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:05:56,015 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-10-12 20:05:56,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:05:56,042 INFO L225 Difference]: With dead ends: 11534 [2024-10-12 20:05:56,043 INFO L226 Difference]: Without dead ends: 7580 [2024-10-12 20:05:56,050 INFO L431 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-10-12 20:05:56,051 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 68 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:05:56,051 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 297 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:05:56,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7580 states. [2024-10-12 20:05:56,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7580 to 7578. [2024-10-12 20:05:56,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7578 states, 7577 states have (on average 1.4856803484228587) internal successors, (11257), 7577 states have internal predecessors, (11257), 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-10-12 20:05:56,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7578 states to 7578 states and 11257 transitions. [2024-10-12 20:05:56,270 INFO L78 Accepts]: Start accepts. Automaton has 7578 states and 11257 transitions. Word has length 77 [2024-10-12 20:05:56,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:05:56,270 INFO L471 AbstractCegarLoop]: Abstraction has 7578 states and 11257 transitions. [2024-10-12 20:05:56,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:56,270 INFO L276 IsEmpty]: Start isEmpty. Operand 7578 states and 11257 transitions. [2024-10-12 20:05:56,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-12 20:05:56,271 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:05:56,271 INFO L215 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] [2024-10-12 20:05:56,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 20:05:56,272 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:05:56,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:05:56,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1091548828, now seen corresponding path program 1 times [2024-10-12 20:05:56,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:05:56,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82214620] [2024-10-12 20:05:56,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:05:56,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:05:56,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:05:56,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:05:56,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:05:56,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82214620] [2024-10-12 20:05:56,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82214620] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:05:56,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:05:56,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:05:56,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702897340] [2024-10-12 20:05:56,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:05:56,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:05:56,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:05:56,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:05:56,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:05:56,358 INFO L87 Difference]: Start difference. First operand 7578 states and 11257 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:56,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:05:56,595 INFO L93 Difference]: Finished difference Result 21854 states and 32315 transitions. [2024-10-12 20:05:56,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:05:56,595 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-10-12 20:05:56,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:05:56,658 INFO L225 Difference]: With dead ends: 21854 [2024-10-12 20:05:56,658 INFO L226 Difference]: Without dead ends: 14332 [2024-10-12 20:05:56,671 INFO L431 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-10-12 20:05:56,672 INFO L432 NwaCegarLoop]: 209 mSDtfsCounter, 74 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:05:56,672 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 299 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:05:56,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14332 states. [2024-10-12 20:05:57,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14332 to 14330. [2024-10-12 20:05:57,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14330 states, 14329 states have (on average 1.4600460604368763) internal successors, (20921), 14329 states have internal predecessors, (20921), 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-10-12 20:05:57,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14330 states to 14330 states and 20921 transitions. [2024-10-12 20:05:57,094 INFO L78 Accepts]: Start accepts. Automaton has 14330 states and 20921 transitions. Word has length 77 [2024-10-12 20:05:57,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:05:57,134 INFO L471 AbstractCegarLoop]: Abstraction has 14330 states and 20921 transitions. [2024-10-12 20:05:57,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:57,135 INFO L276 IsEmpty]: Start isEmpty. Operand 14330 states and 20921 transitions. [2024-10-12 20:05:57,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-12 20:05:57,139 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:05:57,140 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:05:57,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 20:05:57,140 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:05:57,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:05:57,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1778428204, now seen corresponding path program 1 times [2024-10-12 20:05:57,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:05:57,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272745302] [2024-10-12 20:05:57,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:05:57,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:05:57,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:05:57,436 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 20:05:57,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:05:57,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272745302] [2024-10-12 20:05:57,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272745302] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:05:57,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:05:57,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 20:05:57,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387856510] [2024-10-12 20:05:57,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:05:57,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 20:05:57,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:05:57,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 20:05:57,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 20:05:57,439 INFO L87 Difference]: Start difference. First operand 14330 states and 20921 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 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-10-12 20:05:59,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:05:59,286 INFO L93 Difference]: Finished difference Result 112842 states and 164865 transitions. [2024-10-12 20:05:59,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 20:05:59,287 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 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 99 [2024-10-12 20:05:59,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:05:59,628 INFO L225 Difference]: With dead ends: 112842 [2024-10-12 20:05:59,629 INFO L226 Difference]: Without dead ends: 102856 [2024-10-12 20:05:59,690 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-10-12 20:05:59,691 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 1217 mSDsluCounter, 1222 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1217 SdHoareTripleChecker+Valid, 1440 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:05:59,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1217 Valid, 1440 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:05:59,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102856 states. [2024-10-12 20:06:01,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102856 to 26490. [2024-10-12 20:06:01,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26490 states, 26489 states have (on average 1.454226282607875) internal successors, (38521), 26489 states have internal predecessors, (38521), 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-10-12 20:06:01,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26490 states to 26490 states and 38521 transitions. [2024-10-12 20:06:01,313 INFO L78 Accepts]: Start accepts. Automaton has 26490 states and 38521 transitions. Word has length 99 [2024-10-12 20:06:01,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:06:01,314 INFO L471 AbstractCegarLoop]: Abstraction has 26490 states and 38521 transitions. [2024-10-12 20:06:01,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 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-10-12 20:06:01,315 INFO L276 IsEmpty]: Start isEmpty. Operand 26490 states and 38521 transitions. [2024-10-12 20:06:01,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-12 20:06:01,320 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:06:01,320 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:06:01,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 20:06:01,321 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:06:01,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:06:01,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1433430828, now seen corresponding path program 1 times [2024-10-12 20:06:01,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:06:01,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868969772] [2024-10-12 20:06:01,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:06:01,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:06:01,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:06:01,757 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 20:06:01,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:06:01,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868969772] [2024-10-12 20:06:01,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868969772] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:06:01,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:06:01,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 20:06:01,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649677184] [2024-10-12 20:06:01,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:06:01,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 20:06:01,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:06:01,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 20:06:01,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 20:06:01,759 INFO L87 Difference]: Start difference. First operand 26490 states and 38521 transitions. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 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-10-12 20:06:03,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:06:03,786 INFO L93 Difference]: Finished difference Result 127114 states and 185601 transitions. [2024-10-12 20:06:03,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 20:06:03,787 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 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 99 [2024-10-12 20:06:03,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:06:04,009 INFO L225 Difference]: With dead ends: 127114 [2024-10-12 20:06:04,010 INFO L226 Difference]: Without dead ends: 112840 [2024-10-12 20:06:04,196 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-10-12 20:06:04,197 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 1280 mSDsluCounter, 1307 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1280 SdHoareTripleChecker+Valid, 1525 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:06:04,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1280 Valid, 1525 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 20:06:04,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112840 states. [2024-10-12 20:06:05,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112840 to 45754. [2024-10-12 20:06:05,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45754 states, 45753 states have (on average 1.4504185517889536) internal successors, (66361), 45753 states have internal predecessors, (66361), 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-10-12 20:06:05,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45754 states to 45754 states and 66361 transitions. [2024-10-12 20:06:05,864 INFO L78 Accepts]: Start accepts. Automaton has 45754 states and 66361 transitions. Word has length 99 [2024-10-12 20:06:05,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:06:05,864 INFO L471 AbstractCegarLoop]: Abstraction has 45754 states and 66361 transitions. [2024-10-12 20:06:05,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 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-10-12 20:06:05,865 INFO L276 IsEmpty]: Start isEmpty. Operand 45754 states and 66361 transitions. [2024-10-12 20:06:05,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-12 20:06:05,870 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:06:05,870 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:06:05,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 20:06:05,871 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:06:05,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:06:05,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1702013996, now seen corresponding path program 1 times [2024-10-12 20:06:05,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:06:05,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949716618] [2024-10-12 20:06:05,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:06:05,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:06:05,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:06:06,116 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-12 20:06:06,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:06:06,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949716618] [2024-10-12 20:06:06,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949716618] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:06:06,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:06:06,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 20:06:06,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881267099] [2024-10-12 20:06:06,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:06:06,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 20:06:06,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:06:06,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 20:06:06,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 20:06:06,118 INFO L87 Difference]: Start difference. First operand 45754 states and 66361 transitions. Second operand has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 9 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-10-12 20:06:08,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:06:08,641 INFO L93 Difference]: Finished difference Result 141386 states and 206273 transitions. [2024-10-12 20:06:08,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 20:06:08,642 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 9 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 99 [2024-10-12 20:06:08,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:06:08,889 INFO L225 Difference]: With dead ends: 141386 [2024-10-12 20:06:08,889 INFO L226 Difference]: Without dead ends: 127112 [2024-10-12 20:06:08,938 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-10-12 20:06:08,940 INFO L432 NwaCegarLoop]: 216 mSDtfsCounter, 1377 mSDsluCounter, 1180 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1377 SdHoareTripleChecker+Valid, 1396 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:06:08,940 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1377 Valid, 1396 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:06:09,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127112 states. [2024-10-12 20:06:10,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127112 to 60026. [2024-10-12 20:06:11,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60026 states, 60025 states have (on average 1.4499458558933778) internal successors, (87033), 60025 states have internal predecessors, (87033), 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-10-12 20:06:11,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60026 states to 60026 states and 87033 transitions. [2024-10-12 20:06:11,147 INFO L78 Accepts]: Start accepts. Automaton has 60026 states and 87033 transitions. Word has length 99 [2024-10-12 20:06:11,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:06:11,148 INFO L471 AbstractCegarLoop]: Abstraction has 60026 states and 87033 transitions. [2024-10-12 20:06:11,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 9 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-10-12 20:06:11,148 INFO L276 IsEmpty]: Start isEmpty. Operand 60026 states and 87033 transitions. [2024-10-12 20:06:11,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-12 20:06:11,158 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:06:11,159 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:06:11,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 20:06:11,159 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:06:11,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:06:11,160 INFO L85 PathProgramCache]: Analyzing trace with hash 2007241172, now seen corresponding path program 1 times [2024-10-12 20:06:11,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:06:11,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906711534] [2024-10-12 20:06:11,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:06:11,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:06:11,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:06:11,580 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 20:06:11,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:06:11,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906711534] [2024-10-12 20:06:11,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906711534] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:06:11,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:06:11,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 20:06:11,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765579172] [2024-10-12 20:06:11,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:06:11,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 20:06:11,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:06:11,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 20:06:11,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 20:06:11,583 INFO L87 Difference]: Start difference. First operand 60026 states and 87033 transitions. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 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-10-12 20:06:14,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:06:14,520 INFO L93 Difference]: Finished difference Result 155658 states and 226945 transitions. [2024-10-12 20:06:14,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 20:06:14,521 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 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 99 [2024-10-12 20:06:14,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:06:14,726 INFO L225 Difference]: With dead ends: 155658 [2024-10-12 20:06:14,727 INFO L226 Difference]: Without dead ends: 141384 [2024-10-12 20:06:14,760 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-10-12 20:06:14,763 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 1460 mSDsluCounter, 1212 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1460 SdHoareTripleChecker+Valid, 1426 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:06:14,763 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1460 Valid, 1426 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:06:14,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141384 states. [2024-10-12 20:06:16,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141384 to 74298. [2024-10-12 20:06:17,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74298 states, 74297 states have (on average 1.4496547639877788) internal successors, (107705), 74297 states have internal predecessors, (107705), 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-10-12 20:06:17,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74298 states to 74298 states and 107705 transitions. [2024-10-12 20:06:17,137 INFO L78 Accepts]: Start accepts. Automaton has 74298 states and 107705 transitions. Word has length 99 [2024-10-12 20:06:17,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:06:17,137 INFO L471 AbstractCegarLoop]: Abstraction has 74298 states and 107705 transitions. [2024-10-12 20:06:17,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 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-10-12 20:06:17,138 INFO L276 IsEmpty]: Start isEmpty. Operand 74298 states and 107705 transitions. [2024-10-12 20:06:17,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-12 20:06:17,146 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:06:17,147 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:06:17,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 20:06:17,148 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:06:17,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:06:17,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1398992684, now seen corresponding path program 1 times [2024-10-12 20:06:17,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:06:17,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727602730] [2024-10-12 20:06:17,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:06:17,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:06:17,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:06:17,434 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-12 20:06:17,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:06:17,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727602730] [2024-10-12 20:06:17,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727602730] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:06:17,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:06:17,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 20:06:17,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000019396] [2024-10-12 20:06:17,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:06:17,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 20:06:17,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:06:17,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 20:06:17,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 20:06:17,437 INFO L87 Difference]: Start difference. First operand 74298 states and 107705 transitions. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 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-10-12 20:06:20,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:06:20,952 INFO L93 Difference]: Finished difference Result 169930 states and 247617 transitions. [2024-10-12 20:06:20,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 20:06:20,953 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 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 99 [2024-10-12 20:06:20,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:06:21,305 INFO L225 Difference]: With dead ends: 169930 [2024-10-12 20:06:21,305 INFO L226 Difference]: Without dead ends: 155656 [2024-10-12 20:06:21,331 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-10-12 20:06:21,331 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 1331 mSDsluCounter, 1243 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1331 SdHoareTripleChecker+Valid, 1457 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:06:21,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1331 Valid, 1457 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 20:06:21,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155656 states. [2024-10-12 20:06:24,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155656 to 88570. [2024-10-12 20:06:24,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88570 states, 88569 states have (on average 1.449457485124592) internal successors, (128377), 88569 states have internal predecessors, (128377), 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-10-12 20:06:24,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88570 states to 88570 states and 128377 transitions. [2024-10-12 20:06:24,259 INFO L78 Accepts]: Start accepts. Automaton has 88570 states and 128377 transitions. Word has length 99 [2024-10-12 20:06:24,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:06:24,259 INFO L471 AbstractCegarLoop]: Abstraction has 88570 states and 128377 transitions. [2024-10-12 20:06:24,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 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-10-12 20:06:24,260 INFO L276 IsEmpty]: Start isEmpty. Operand 88570 states and 128377 transitions. [2024-10-12 20:06:24,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-12 20:06:24,267 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:06:24,267 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:06:24,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-12 20:06:24,268 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:06:24,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:06:24,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1662070060, now seen corresponding path program 1 times [2024-10-12 20:06:24,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:06:24,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151591282] [2024-10-12 20:06:24,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:06:24,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:06:24,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:06:24,524 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-12 20:06:24,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:06:24,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151591282] [2024-10-12 20:06:24,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151591282] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:06:24,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:06:24,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 20:06:24,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330305820] [2024-10-12 20:06:24,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:06:24,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 20:06:24,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:06:24,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 20:06:24,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 20:06:24,528 INFO L87 Difference]: Start difference. First operand 88570 states and 128377 transitions. Second operand has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 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-10-12 20:06:28,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:06:28,593 INFO L93 Difference]: Finished difference Result 184202 states and 268289 transitions. [2024-10-12 20:06:28,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 20:06:28,594 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 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 99 [2024-10-12 20:06:28,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:06:28,820 INFO L225 Difference]: With dead ends: 184202 [2024-10-12 20:06:28,821 INFO L226 Difference]: Without dead ends: 169928 [2024-10-12 20:06:28,859 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-10-12 20:06:28,860 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 1211 mSDsluCounter, 1429 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1211 SdHoareTripleChecker+Valid, 1643 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:06:28,860 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1211 Valid, 1643 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 20:06:28,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169928 states. [2024-10-12 20:06:32,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169928 to 102842. [2024-10-12 20:06:32,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102842 states, 102841 states have (on average 1.4493149619315253) internal successors, (149049), 102841 states have internal predecessors, (149049), 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-10-12 20:06:32,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102842 states to 102842 states and 149049 transitions. [2024-10-12 20:06:32,384 INFO L78 Accepts]: Start accepts. Automaton has 102842 states and 149049 transitions. Word has length 99 [2024-10-12 20:06:32,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:06:32,385 INFO L471 AbstractCegarLoop]: Abstraction has 102842 states and 149049 transitions. [2024-10-12 20:06:32,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 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-10-12 20:06:32,385 INFO L276 IsEmpty]: Start isEmpty. Operand 102842 states and 149049 transitions. [2024-10-12 20:06:32,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-12 20:06:32,393 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:06:32,393 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:06:32,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-12 20:06:32,394 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:06:32,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:06:32,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1023044140, now seen corresponding path program 1 times [2024-10-12 20:06:32,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:06:32,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007233399] [2024-10-12 20:06:32,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:06:32,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:06:32,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:06:32,651 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 20:06:32,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:06:32,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007233399] [2024-10-12 20:06:32,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007233399] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:06:32,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:06:32,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 20:06:32,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196255692] [2024-10-12 20:06:32,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:06:32,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 20:06:32,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:06:32,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 20:06:32,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 20:06:32,654 INFO L87 Difference]: Start difference. First operand 102842 states and 149049 transitions. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 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)