./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.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 e2c31a6d36722edb2a8cb670626aeeca5f235139fff7eadbabd05db5fa398d5d --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 21:29:05,254 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 21:29:05,336 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 21:29:05,341 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 21:29:05,344 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 21:29:05,366 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 21:29:05,367 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 21:29:05,367 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 21:29:05,368 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 21:29:05,369 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 21:29:05,369 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 21:29:05,370 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 21:29:05,370 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 21:29:05,370 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 21:29:05,370 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 21:29:05,371 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 21:29:05,371 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 21:29:05,374 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 21:29:05,374 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 21:29:05,374 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 21:29:05,374 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 21:29:05,375 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 21:29:05,375 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 21:29:05,375 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 21:29:05,375 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 21:29:05,375 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 21:29:05,376 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 21:29:05,376 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 21:29:05,376 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 21:29:05,376 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 21:29:05,376 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 21:29:05,376 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 21:29:05,377 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 21:29:05,377 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 21:29:05,377 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 21:29:05,377 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 21:29:05,377 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 21:29:05,377 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 21:29:05,377 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 21:29:05,378 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 21:29:05,378 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 21:29:05,379 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 21:29:05,379 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 -> e2c31a6d36722edb2a8cb670626aeeca5f235139fff7eadbabd05db5fa398d5d [2024-11-11 21:29:05,621 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 21:29:05,641 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 21:29:05,650 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 21:29:05,651 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 21:29:05,651 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 21:29:05,653 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2024-11-11 21:29:06,854 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 21:29:07,068 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 21:29:07,069 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2024-11-11 21:29:07,094 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17c369a6f/e18f153798834644a455dfec32b56ed1/FLAGeff712bec [2024-11-11 21:29:07,107 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17c369a6f/e18f153798834644a455dfec32b56ed1 [2024-11-11 21:29:07,109 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 21:29:07,110 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 21:29:07,112 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 21:29:07,112 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 21:29:07,116 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 21:29:07,116 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 09:29:07" (1/1) ... [2024-11-11 21:29:07,117 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f2f5800 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:29:07, skipping insertion in model container [2024-11-11 21:29:07,117 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 09:29:07" (1/1) ... [2024-11-11 21:29:07,164 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 21:29:07,513 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c[14519,14532] [2024-11-11 21:29:07,591 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 21:29:07,601 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 21:29:07,672 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c[14519,14532] [2024-11-11 21:29:07,711 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 21:29:07,729 INFO L204 MainTranslator]: Completed translation [2024-11-11 21:29:07,730 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:29:07 WrapperNode [2024-11-11 21:29:07,730 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 21:29:07,731 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 21:29:07,731 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 21:29:07,731 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 21:29:07,736 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:29:07" (1/1) ... [2024-11-11 21:29:07,750 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:29:07" (1/1) ... [2024-11-11 21:29:07,794 INFO L138 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1250 [2024-11-11 21:29:07,794 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 21:29:07,795 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 21:29:07,795 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 21:29:07,795 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 21:29:07,807 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:29:07" (1/1) ... [2024-11-11 21:29:07,808 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:29:07" (1/1) ... [2024-11-11 21:29:07,812 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:29:07" (1/1) ... [2024-11-11 21:29:07,828 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-11 21:29:07,832 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:29:07" (1/1) ... [2024-11-11 21:29:07,832 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:29:07" (1/1) ... [2024-11-11 21:29:07,843 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:29:07" (1/1) ... [2024-11-11 21:29:07,849 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:29:07" (1/1) ... [2024-11-11 21:29:07,852 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:29:07" (1/1) ... [2024-11-11 21:29:07,855 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:29:07" (1/1) ... [2024-11-11 21:29:07,859 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 21:29:07,863 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 21:29:07,863 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 21:29:07,863 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 21:29:07,863 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:29:07" (1/1) ... [2024-11-11 21:29:07,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 21:29:07,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:29:07,905 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 21:29:07,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 21:29:07,948 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 21:29:07,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 21:29:07,948 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 21:29:07,948 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 21:29:08,049 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 21:29:08,051 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 21:29:08,859 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-11-11 21:29:08,859 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 21:29:08,878 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 21:29:08,878 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-11 21:29:08,879 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 09:29:08 BoogieIcfgContainer [2024-11-11 21:29:08,879 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 21:29:08,880 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 21:29:08,880 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 21:29:08,883 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 21:29:08,883 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 09:29:07" (1/3) ... [2024-11-11 21:29:08,884 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22f92273 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 09:29:08, skipping insertion in model container [2024-11-11 21:29:08,884 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:29:07" (2/3) ... [2024-11-11 21:29:08,884 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22f92273 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 09:29:08, skipping insertion in model container [2024-11-11 21:29:08,884 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 09:29:08" (3/3) ... [2024-11-11 21:29:08,885 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2024-11-11 21:29:08,898 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 21:29:08,898 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 21:29:08,964 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 21:29:08,972 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;@1cc0640a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 21:29:08,973 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 21:29:08,980 INFO L276 IsEmpty]: Start isEmpty. Operand has 305 states, 303 states have (on average 1.7854785478547854) internal successors, (541), 304 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:29:08,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-11 21:29:08,997 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:29:08,997 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:29:08,999 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:29:09,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:29:09,005 INFO L85 PathProgramCache]: Analyzing trace with hash 574427721, now seen corresponding path program 1 times [2024-11-11 21:29:09,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:29:09,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014583684] [2024-11-11 21:29:09,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:29:09,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:29:09,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:29:09,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:29:09,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:29:09,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014583684] [2024-11-11 21:29:09,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014583684] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:29:09,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:29:09,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:29:09,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837771584] [2024-11-11 21:29:09,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:29:09,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:29:09,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:29:09,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:29:09,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:29:09,615 INFO L87 Difference]: Start difference. First operand has 305 states, 303 states have (on average 1.7854785478547854) internal successors, (541), 304 states have internal predecessors, (541), 0 states have call successors, (0), 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 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:29:09,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:29:09,774 INFO L93 Difference]: Finished difference Result 612 states and 1078 transitions. [2024-11-11 21:29:09,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:29:09,780 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 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 144 [2024-11-11 21:29:09,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:29:09,795 INFO L225 Difference]: With dead ends: 612 [2024-11-11 21:29:09,795 INFO L226 Difference]: Without dead ends: 495 [2024-11-11 21:29:09,798 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:29:09,802 INFO L435 NwaCegarLoop]: 510 mSDtfsCounter, 361 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 895 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:29:09,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 895 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:29:09,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2024-11-11 21:29:09,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 493. [2024-11-11 21:29:09,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 492 states have (on average 1.4959349593495934) internal successors, (736), 492 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:29:09,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 736 transitions. [2024-11-11 21:29:09,862 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 736 transitions. Word has length 144 [2024-11-11 21:29:09,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:29:09,862 INFO L471 AbstractCegarLoop]: Abstraction has 493 states and 736 transitions. [2024-11-11 21:29:09,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:29:09,863 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 736 transitions. [2024-11-11 21:29:09,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-11 21:29:09,865 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:29:09,866 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:29:09,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 21:29:09,867 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:29:09,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:29:09,868 INFO L85 PathProgramCache]: Analyzing trace with hash 505056235, now seen corresponding path program 1 times [2024-11-11 21:29:09,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:29:09,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870464178] [2024-11-11 21:29:09,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:29:09,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:29:09,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:29:10,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:29:10,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:29:10,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870464178] [2024-11-11 21:29:10,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870464178] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:29:10,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:29:10,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:29:10,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323821763] [2024-11-11 21:29:10,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:29:10,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:29:10,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:29:10,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:29:10,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:29:10,057 INFO L87 Difference]: Start difference. First operand 493 states and 736 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:29:10,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:29:10,145 INFO L93 Difference]: Finished difference Result 1063 states and 1633 transitions. [2024-11-11 21:29:10,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:29:10,145 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 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 144 [2024-11-11 21:29:10,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:29:10,149 INFO L225 Difference]: With dead ends: 1063 [2024-11-11 21:29:10,149 INFO L226 Difference]: Without dead ends: 865 [2024-11-11 21:29:10,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:29:10,152 INFO L435 NwaCegarLoop]: 411 mSDtfsCounter, 274 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:29:10,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 726 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:29:10,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2024-11-11 21:29:10,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 863. [2024-11-11 21:29:10,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 863 states, 862 states have (on average 1.5081206496519721) internal successors, (1300), 862 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:29:10,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1300 transitions. [2024-11-11 21:29:10,177 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1300 transitions. Word has length 144 [2024-11-11 21:29:10,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:29:10,178 INFO L471 AbstractCegarLoop]: Abstraction has 863 states and 1300 transitions. [2024-11-11 21:29:10,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:29:10,178 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1300 transitions. [2024-11-11 21:29:10,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-11 21:29:10,181 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:29:10,181 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:29:10,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 21:29:10,182 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:29:10,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:29:10,185 INFO L85 PathProgramCache]: Analyzing trace with hash 459957428, now seen corresponding path program 1 times [2024-11-11 21:29:10,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:29:10,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743535063] [2024-11-11 21:29:10,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:29:10,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:29:10,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:29:10,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:29:10,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:29:10,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743535063] [2024-11-11 21:29:10,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743535063] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:29:10,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:29:10,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:29:10,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213690786] [2024-11-11 21:29:10,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:29:10,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:29:10,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:29:10,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:29:10,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:29:10,653 INFO L87 Difference]: Start difference. First operand 863 states and 1300 transitions. Second operand has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:29:10,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:29:10,764 INFO L93 Difference]: Finished difference Result 4182 states and 6281 transitions. [2024-11-11 21:29:10,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:29:10,765 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 0 states have call successors, (0), 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 144 [2024-11-11 21:29:10,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:29:10,775 INFO L225 Difference]: With dead ends: 4182 [2024-11-11 21:29:10,775 INFO L226 Difference]: Without dead ends: 3328 [2024-11-11 21:29:10,779 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:29:10,780 INFO L435 NwaCegarLoop]: 756 mSDtfsCounter, 1257 mSDsluCounter, 1144 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1257 SdHoareTripleChecker+Valid, 1900 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:29:10,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1257 Valid, 1900 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:29:10,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3328 states. [2024-11-11 21:29:10,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3328 to 1668. [2024-11-11 21:29:10,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1668 states, 1667 states have (on average 1.4913017396520696) internal successors, (2486), 1667 states have internal predecessors, (2486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:29:10,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1668 states to 1668 states and 2486 transitions. [2024-11-11 21:29:10,834 INFO L78 Accepts]: Start accepts. Automaton has 1668 states and 2486 transitions. Word has length 144 [2024-11-11 21:29:10,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:29:10,834 INFO L471 AbstractCegarLoop]: Abstraction has 1668 states and 2486 transitions. [2024-11-11 21:29:10,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:29:10,836 INFO L276 IsEmpty]: Start isEmpty. Operand 1668 states and 2486 transitions. [2024-11-11 21:29:10,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-11 21:29:10,839 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:29:10,839 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:29:10,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 21:29:10,840 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:29:10,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:29:10,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1789583768, now seen corresponding path program 1 times [2024-11-11 21:29:10,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:29:10,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465997441] [2024-11-11 21:29:10,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:29:10,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:29:10,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:29:10,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:29:10,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:29:10,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465997441] [2024-11-11 21:29:10,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465997441] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:29:10,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:29:10,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:29:10,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821753263] [2024-11-11 21:29:10,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:29:10,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:29:10,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:29:10,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:29:10,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:29:10,914 INFO L87 Difference]: Start difference. First operand 1668 states and 2486 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:29:10,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:29:10,937 INFO L93 Difference]: Finished difference Result 3310 states and 4929 transitions. [2024-11-11 21:29:10,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:29:10,937 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 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 145 [2024-11-11 21:29:10,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:29:10,942 INFO L225 Difference]: With dead ends: 3310 [2024-11-11 21:29:10,942 INFO L226 Difference]: Without dead ends: 1670 [2024-11-11 21:29:10,945 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:29:10,946 INFO L435 NwaCegarLoop]: 444 mSDtfsCounter, 0 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:29:10,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 882 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:29:10,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1670 states. [2024-11-11 21:29:10,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1670 to 1670. [2024-11-11 21:29:10,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1670 states, 1669 states have (on average 1.4907130017974835) internal successors, (2488), 1669 states have internal predecessors, (2488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:29:10,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1670 states to 1670 states and 2488 transitions. [2024-11-11 21:29:10,979 INFO L78 Accepts]: Start accepts. Automaton has 1670 states and 2488 transitions. Word has length 145 [2024-11-11 21:29:10,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:29:10,980 INFO L471 AbstractCegarLoop]: Abstraction has 1670 states and 2488 transitions. [2024-11-11 21:29:10,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:29:10,980 INFO L276 IsEmpty]: Start isEmpty. Operand 1670 states and 2488 transitions. [2024-11-11 21:29:10,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-11 21:29:10,982 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:29:10,982 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:29:10,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 21:29:10,982 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:29:10,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:29:10,983 INFO L85 PathProgramCache]: Analyzing trace with hash 338353525, now seen corresponding path program 1 times [2024-11-11 21:29:10,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:29:10,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327410637] [2024-11-11 21:29:10,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:29:10,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:29:11,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:29:11,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-11-11 21:29:11,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:29:11,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327410637] [2024-11-11 21:29:11,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327410637] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:29:11,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:29:11,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:29:11,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722136587] [2024-11-11 21:29:11,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:29:11,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:29:11,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:29:11,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:29:11,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:29:11,360 INFO L87 Difference]: Start difference. First operand 1670 states and 2488 transitions. Second operand has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:29:11,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:29:11,389 INFO L93 Difference]: Finished difference Result 3326 states and 4955 transitions. [2024-11-11 21:29:11,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 21:29:11,390 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 0 states have call successors, (0), 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 146 [2024-11-11 21:29:11,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:29:11,395 INFO L225 Difference]: With dead ends: 3326 [2024-11-11 21:29:11,395 INFO L226 Difference]: Without dead ends: 1670 [2024-11-11 21:29:11,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:29:11,399 INFO L435 NwaCegarLoop]: 480 mSDtfsCounter, 20 mSDsluCounter, 914 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 1394 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-11-11 21:29:11,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 1394 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:29:11,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1670 states. [2024-11-11 21:29:11,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1670 to 1669. [2024-11-11 21:29:11,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1669 states, 1668 states have (on average 1.4898081534772183) internal successors, (2485), 1668 states have internal predecessors, (2485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:29:11,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 2485 transitions. [2024-11-11 21:29:11,451 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 2485 transitions. Word has length 146 [2024-11-11 21:29:11,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:29:11,452 INFO L471 AbstractCegarLoop]: Abstraction has 1669 states and 2485 transitions. [2024-11-11 21:29:11,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:29:11,452 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2485 transitions. [2024-11-11 21:29:11,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-11 21:29:11,454 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:29:11,454 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:29:11,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 21:29:11,455 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:29:11,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:29:11,455 INFO L85 PathProgramCache]: Analyzing trace with hash -2057553317, now seen corresponding path program 1 times [2024-11-11 21:29:11,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:29:11,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983338649] [2024-11-11 21:29:11,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:29:11,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:29:11,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:29:11,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:29:11,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:29:11,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983338649] [2024-11-11 21:29:11,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983338649] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:29:11,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:29:11,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:29:11,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628735569] [2024-11-11 21:29:11,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:29:11,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:29:11,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:29:11,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:29:11,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:29:11,546 INFO L87 Difference]: Start difference. First operand 1669 states and 2485 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:29:11,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:29:11,590 INFO L93 Difference]: Finished difference Result 4401 states and 6556 transitions. [2024-11-11 21:29:11,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:29:11,593 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 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 146 [2024-11-11 21:29:11,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:29:11,601 INFO L225 Difference]: With dead ends: 4401 [2024-11-11 21:29:11,601 INFO L226 Difference]: Without dead ends: 2909 [2024-11-11 21:29:11,603 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:29:11,603 INFO L435 NwaCegarLoop]: 797 mSDtfsCounter, 369 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 1198 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:29:11,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 1198 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:29:11,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2909 states. [2024-11-11 21:29:11,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2909 to 2907. [2024-11-11 21:29:11,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2907 states, 2906 states have (on average 1.4686854783207157) internal successors, (4268), 2906 states have internal predecessors, (4268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:29:11,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2907 states to 2907 states and 4268 transitions. [2024-11-11 21:29:11,647 INFO L78 Accepts]: Start accepts. Automaton has 2907 states and 4268 transitions. Word has length 146 [2024-11-11 21:29:11,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:29:11,647 INFO L471 AbstractCegarLoop]: Abstraction has 2907 states and 4268 transitions. [2024-11-11 21:29:11,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:29:11,647 INFO L276 IsEmpty]: Start isEmpty. Operand 2907 states and 4268 transitions. [2024-11-11 21:29:11,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-11 21:29:11,650 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:29:11,650 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:29:11,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 21:29:11,651 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:29:11,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:29:11,651 INFO L85 PathProgramCache]: Analyzing trace with hash -720713928, now seen corresponding path program 1 times [2024-11-11 21:29:11,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:29:11,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319767400] [2024-11-11 21:29:11,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:29:11,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:29:11,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:29:12,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:29:12,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:29:12,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319767400] [2024-11-11 21:29:12,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319767400] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:29:12,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:29:12,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:29:12,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386525805] [2024-11-11 21:29:12,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:29:12,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:29:12,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:29:12,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:29:12,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:29:12,014 INFO L87 Difference]: Start difference. First operand 2907 states and 4268 transitions. Second operand has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:29:12,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:29:12,044 INFO L93 Difference]: Finished difference Result 5213 states and 7677 transitions. [2024-11-11 21:29:12,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 21:29:12,045 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 0 states have call successors, (0), 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 146 [2024-11-11 21:29:12,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:29:12,051 INFO L225 Difference]: With dead ends: 5213 [2024-11-11 21:29:12,051 INFO L226 Difference]: Without dead ends: 2473 [2024-11-11 21:29:12,055 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:29:12,057 INFO L435 NwaCegarLoop]: 483 mSDtfsCounter, 23 mSDsluCounter, 915 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 1398 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-11-11 21:29:12,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 1398 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:29:12,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2473 states. [2024-11-11 21:29:12,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2473 to 2473. [2024-11-11 21:29:12,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2473 states, 2472 states have (on average 1.468042071197411) internal successors, (3629), 2472 states have internal predecessors, (3629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:29:12,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2473 states to 2473 states and 3629 transitions. [2024-11-11 21:29:12,099 INFO L78 Accepts]: Start accepts. Automaton has 2473 states and 3629 transitions. Word has length 146 [2024-11-11 21:29:12,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:29:12,100 INFO L471 AbstractCegarLoop]: Abstraction has 2473 states and 3629 transitions. [2024-11-11 21:29:12,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:29:12,100 INFO L276 IsEmpty]: Start isEmpty. Operand 2473 states and 3629 transitions. [2024-11-11 21:29:12,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-11 21:29:12,103 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:29:12,103 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:29:12,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 21:29:12,103 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:29:12,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:29:12,104 INFO L85 PathProgramCache]: Analyzing trace with hash 2082628409, now seen corresponding path program 1 times [2024-11-11 21:29:12,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:29:12,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235148904] [2024-11-11 21:29:12,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:29:12,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:29:12,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:29:12,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:29:12,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:29:12,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235148904] [2024-11-11 21:29:12,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235148904] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:29:12,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:29:12,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:29:12,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710135787] [2024-11-11 21:29:12,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:29:12,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:29:12,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:29:12,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:29:12,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:29:12,210 INFO L87 Difference]: Start difference. First operand 2473 states and 3629 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:29:12,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:29:12,397 INFO L93 Difference]: Finished difference Result 6622 states and 9825 transitions. [2024-11-11 21:29:12,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:29:12,398 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 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 152 [2024-11-11 21:29:12,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:29:12,409 INFO L225 Difference]: With dead ends: 6622 [2024-11-11 21:29:12,410 INFO L226 Difference]: Without dead ends: 4572 [2024-11-11 21:29:12,414 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:29:12,414 INFO L435 NwaCegarLoop]: 432 mSDtfsCounter, 296 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 756 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 21:29:12,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 756 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 21:29:12,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4572 states. [2024-11-11 21:29:12,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4572 to 4570. [2024-11-11 21:29:12,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4570 states, 4569 states have (on average 1.4690304224119064) internal successors, (6712), 4569 states have internal predecessors, (6712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:29:12,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4570 states to 4570 states and 6712 transitions. [2024-11-11 21:29:12,490 INFO L78 Accepts]: Start accepts. Automaton has 4570 states and 6712 transitions. Word has length 152 [2024-11-11 21:29:12,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:29:12,491 INFO L471 AbstractCegarLoop]: Abstraction has 4570 states and 6712 transitions. [2024-11-11 21:29:12,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:29:12,491 INFO L276 IsEmpty]: Start isEmpty. Operand 4570 states and 6712 transitions. [2024-11-11 21:29:12,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-11 21:29:12,496 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:29:12,496 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:29:12,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 21:29:12,496 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:29:12,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:29:12,497 INFO L85 PathProgramCache]: Analyzing trace with hash 243591764, now seen corresponding path program 1 times [2024-11-11 21:29:12,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:29:12,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573032104] [2024-11-11 21:29:12,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:29:12,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:29:12,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:29:12,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:29:12,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:29:12,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573032104] [2024-11-11 21:29:12,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573032104] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:29:12,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:29:12,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:29:12,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625577464] [2024-11-11 21:29:12,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:29:12,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:29:12,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:29:12,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:29:12,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:29:12,807 INFO L87 Difference]: Start difference. First operand 4570 states and 6712 transitions. Second operand has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:29:12,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:29:12,902 INFO L93 Difference]: Finished difference Result 11892 states and 17462 transitions. [2024-11-11 21:29:12,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:29:12,905 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 0 states have call successors, (0), 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 152 [2024-11-11 21:29:12,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:29:12,927 INFO L225 Difference]: With dead ends: 11892 [2024-11-11 21:29:12,930 INFO L226 Difference]: Without dead ends: 7349 [2024-11-11 21:29:12,936 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:29:12,936 INFO L435 NwaCegarLoop]: 754 mSDtfsCounter, 377 mSDsluCounter, 1123 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 1877 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:29:12,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 1877 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:29:12,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7349 states. [2024-11-11 21:29:13,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7349 to 7347. [2024-11-11 21:29:13,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7347 states, 7346 states have (on average 1.452627280152464) internal successors, (10671), 7346 states have internal predecessors, (10671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:29:13,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7347 states to 7347 states and 10671 transitions. [2024-11-11 21:29:13,052 INFO L78 Accepts]: Start accepts. Automaton has 7347 states and 10671 transitions. Word has length 152 [2024-11-11 21:29:13,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:29:13,052 INFO L471 AbstractCegarLoop]: Abstraction has 7347 states and 10671 transitions. [2024-11-11 21:29:13,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:29:13,052 INFO L276 IsEmpty]: Start isEmpty. Operand 7347 states and 10671 transitions. [2024-11-11 21:29:13,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-11 21:29:13,059 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:29:13,060 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:29:13,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 21:29:13,060 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:29:13,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:29:13,060 INFO L85 PathProgramCache]: Analyzing trace with hash -781954579, now seen corresponding path program 1 times [2024-11-11 21:29:13,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:29:13,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523543338] [2024-11-11 21:29:13,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:29:13,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:29:13,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:29:13,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:29:13,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:29:13,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523543338] [2024-11-11 21:29:13,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523543338] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:29:13,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:29:13,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:29:13,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853481231] [2024-11-11 21:29:13,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:29:13,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:29:13,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:29:13,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:29:13,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:29:13,142 INFO L87 Difference]: Start difference. First operand 7347 states and 10671 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:29:13,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:29:13,206 INFO L93 Difference]: Finished difference Result 18332 states and 26629 transitions. [2024-11-11 21:29:13,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:29:13,206 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 154 [2024-11-11 21:29:13,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:29:13,234 INFO L225 Difference]: With dead ends: 18332 [2024-11-11 21:29:13,234 INFO L226 Difference]: Without dead ends: 11458 [2024-11-11 21:29:13,243 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:29:13,244 INFO L435 NwaCegarLoop]: 798 mSDtfsCounter, 367 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 1191 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:29:13,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 1191 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:29:13,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11458 states. [2024-11-11 21:29:13,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11458 to 11456. [2024-11-11 21:29:13,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11456 states, 11455 states have (on average 1.4302051505892623) internal successors, (16383), 11455 states have internal predecessors, (16383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:29:13,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11456 states to 11456 states and 16383 transitions. [2024-11-11 21:29:13,452 INFO L78 Accepts]: Start accepts. Automaton has 11456 states and 16383 transitions. Word has length 154 [2024-11-11 21:29:13,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:29:13,452 INFO L471 AbstractCegarLoop]: Abstraction has 11456 states and 16383 transitions. [2024-11-11 21:29:13,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:29:13,453 INFO L276 IsEmpty]: Start isEmpty. Operand 11456 states and 16383 transitions. [2024-11-11 21:29:13,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-11 21:29:13,463 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:29:13,463 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:29:13,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 21:29:13,463 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:29:13,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:29:13,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1626762016, now seen corresponding path program 1 times [2024-11-11 21:29:13,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:29:13,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774535667] [2024-11-11 21:29:13,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:29:13,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:29:13,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:29:14,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:29:14,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:29:14,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774535667] [2024-11-11 21:29:14,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774535667] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:29:14,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:29:14,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 21:29:14,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275118581] [2024-11-11 21:29:14,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:29:14,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 21:29:14,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:29:14,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 21:29:14,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:29:14,045 INFO L87 Difference]: Start difference. First operand 11456 states and 16383 transitions. Second operand has 9 states, 9 states have (on average 17.77777777777778) internal successors, (160), 9 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:29:14,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:29:14,279 INFO L93 Difference]: Finished difference Result 26982 states and 39603 transitions. [2024-11-11 21:29:14,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 21:29:14,280 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 17.77777777777778) internal successors, (160), 9 states have internal predecessors, (160), 0 states have call successors, (0), 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 160 [2024-11-11 21:29:14,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:29:14,316 INFO L225 Difference]: With dead ends: 26982 [2024-11-11 21:29:14,316 INFO L226 Difference]: Without dead ends: 21668 [2024-11-11 21:29:14,394 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:29:14,395 INFO L435 NwaCegarLoop]: 405 mSDtfsCounter, 565 mSDsluCounter, 2409 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 565 SdHoareTripleChecker+Valid, 2814 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 21:29:14,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [565 Valid, 2814 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 21:29:14,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21668 states. [2024-11-11 21:29:14,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21668 to 21666. [2024-11-11 21:29:14,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21666 states, 21665 states have (on average 1.4312947149780753) internal successors, (31009), 21665 states have internal predecessors, (31009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:29:14,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21666 states to 21666 states and 31009 transitions. [2024-11-11 21:29:14,630 INFO L78 Accepts]: Start accepts. Automaton has 21666 states and 31009 transitions. Word has length 160 [2024-11-11 21:29:14,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:29:14,630 INFO L471 AbstractCegarLoop]: Abstraction has 21666 states and 31009 transitions. [2024-11-11 21:29:14,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.77777777777778) internal successors, (160), 9 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:29:14,631 INFO L276 IsEmpty]: Start isEmpty. Operand 21666 states and 31009 transitions. [2024-11-11 21:29:14,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-11 21:29:14,647 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:29:14,647 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:29:14,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 21:29:14,648 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:29:14,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:29:14,648 INFO L85 PathProgramCache]: Analyzing trace with hash 145948848, now seen corresponding path program 1 times [2024-11-11 21:29:14,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:29:14,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750484385] [2024-11-11 21:29:14,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:29:14,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:29:14,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:29:14,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:29:14,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:29:14,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750484385] [2024-11-11 21:29:14,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750484385] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:29:14,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:29:14,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 21:29:14,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926194083] [2024-11-11 21:29:14,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:29:14,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:29:14,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:29:14,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:29:14,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:29:14,857 INFO L87 Difference]: Start difference. First operand 21666 states and 31009 transitions. Second operand has 5 states, 5 states have (on average 32.0) internal successors, (160), 5 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:29:15,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:29:15,082 INFO L93 Difference]: Finished difference Result 34010 states and 50881 transitions. [2024-11-11 21:29:15,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:29:15,082 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.0) internal successors, (160), 5 states have internal predecessors, (160), 0 states have call successors, (0), 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 160 [2024-11-11 21:29:15,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:29:15,132 INFO L225 Difference]: With dead ends: 34010 [2024-11-11 21:29:15,132 INFO L226 Difference]: Without dead ends: 29512 [2024-11-11 21:29:15,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:29:15,150 INFO L435 NwaCegarLoop]: 788 mSDtfsCounter, 844 mSDsluCounter, 1209 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 844 SdHoareTripleChecker+Valid, 1997 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:29:15,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [844 Valid, 1997 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:29:15,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29512 states. [2024-11-11 21:29:15,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29512 to 25026. [2024-11-11 21:29:15,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25026 states, 25025 states have (on average 1.4537862137862139) internal successors, (36381), 25025 states have internal predecessors, (36381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:29:15,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25026 states to 25026 states and 36381 transitions. [2024-11-11 21:29:15,598 INFO L78 Accepts]: Start accepts. Automaton has 25026 states and 36381 transitions. Word has length 160 [2024-11-11 21:29:15,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:29:15,598 INFO L471 AbstractCegarLoop]: Abstraction has 25026 states and 36381 transitions. [2024-11-11 21:29:15,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.0) internal successors, (160), 5 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:29:15,599 INFO L276 IsEmpty]: Start isEmpty. Operand 25026 states and 36381 transitions. [2024-11-11 21:29:15,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-11 21:29:15,612 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:29:15,612 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:29:15,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 21:29:15,613 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:29:15,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:29:15,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1252114169, now seen corresponding path program 1 times [2024-11-11 21:29:15,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:29:15,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419876638] [2024-11-11 21:29:15,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:29:15,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:29:15,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:29:15,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:29:15,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:29:15,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419876638] [2024-11-11 21:29:15,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419876638] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:29:15,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:29:15,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:29:15,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744422422] [2024-11-11 21:29:15,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:29:15,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:29:15,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:29:15,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:29:15,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:29:15,965 INFO L87 Difference]: Start difference. First operand 25026 states and 36381 transitions. Second operand has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:29:16,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:29:16,129 INFO L93 Difference]: Finished difference Result 35294 states and 52663 transitions. [2024-11-11 21:29:16,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 21:29:16,130 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 0 states have call successors, (0), 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 160 [2024-11-11 21:29:16,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:29:16,175 INFO L225 Difference]: With dead ends: 35294 [2024-11-11 21:29:16,175 INFO L226 Difference]: Without dead ends: 25028 [2024-11-11 21:29:16,195 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:29:16,196 INFO L435 NwaCegarLoop]: 442 mSDtfsCounter, 539 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 539 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:29:16,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [539 Valid, 892 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:29:16,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25028 states. [2024-11-11 21:29:16,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25028 to 25026. [2024-11-11 21:29:16,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25026 states, 25025 states have (on average 1.4467532467532467) internal successors, (36205), 25025 states have internal predecessors, (36205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:29:16,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25026 states to 25026 states and 36205 transitions. [2024-11-11 21:29:16,679 INFO L78 Accepts]: Start accepts. Automaton has 25026 states and 36205 transitions. Word has length 160 [2024-11-11 21:29:16,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:29:16,679 INFO L471 AbstractCegarLoop]: Abstraction has 25026 states and 36205 transitions. [2024-11-11 21:29:16,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:29:16,680 INFO L276 IsEmpty]: Start isEmpty. Operand 25026 states and 36205 transitions. [2024-11-11 21:29:16,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-11 21:29:16,693 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:29:16,693 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:29:16,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-11 21:29:16,694 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:29:16,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:29:16,694 INFO L85 PathProgramCache]: Analyzing trace with hash -93042081, now seen corresponding path program 1 times [2024-11-11 21:29:16,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:29:16,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479301548] [2024-11-11 21:29:16,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:29:16,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:29:16,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:29:16,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:29:16,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:29:16,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479301548] [2024-11-11 21:29:16,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479301548] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:29:16,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:29:16,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:29:16,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314160558] [2024-11-11 21:29:16,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:29:16,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:29:16,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:29:16,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:29:16,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:29:16,916 INFO L87 Difference]: Start difference. First operand 25026 states and 36205 transitions. Second operand has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:29:17,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:29:17,205 INFO L93 Difference]: Finished difference Result 96710 states and 139424 transitions. [2024-11-11 21:29:17,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 21:29:17,206 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 0 states have call successors, (0), 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 160 [2024-11-11 21:29:17,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:29:17,320 INFO L225 Difference]: With dead ends: 96710 [2024-11-11 21:29:17,320 INFO L226 Difference]: Without dead ends: 71735 [2024-11-11 21:29:17,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:29:17,359 INFO L435 NwaCegarLoop]: 735 mSDtfsCounter, 812 mSDsluCounter, 769 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 812 SdHoareTripleChecker+Valid, 1504 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:29:17,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [812 Valid, 1504 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:29:17,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71735 states. [2024-11-11 21:29:18,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71735 to 48383. [2024-11-11 21:29:18,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48383 states, 48382 states have (on average 1.4286511512545987) internal successors, (69121), 48382 states have internal predecessors, (69121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:29:18,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48383 states to 48383 states and 69121 transitions. [2024-11-11 21:29:18,301 INFO L78 Accepts]: Start accepts. Automaton has 48383 states and 69121 transitions. Word has length 160 [2024-11-11 21:29:18,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:29:18,301 INFO L471 AbstractCegarLoop]: Abstraction has 48383 states and 69121 transitions. [2024-11-11 21:29:18,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:29:18,301 INFO L276 IsEmpty]: Start isEmpty. Operand 48383 states and 69121 transitions. [2024-11-11 21:29:18,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-11 21:29:18,326 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:29:18,326 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:29:18,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 21:29:18,327 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:29:18,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:29:18,328 INFO L85 PathProgramCache]: Analyzing trace with hash 521996501, now seen corresponding path program 1 times [2024-11-11 21:29:18,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:29:18,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685438535] [2024-11-11 21:29:18,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:29:18,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:29:18,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:29:18,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:29:18,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:29:18,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685438535] [2024-11-11 21:29:18,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685438535] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:29:18,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:29:18,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:29:18,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376111888] [2024-11-11 21:29:18,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:29:18,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:29:18,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:29:18,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:29:18,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:29:18,387 INFO L87 Difference]: Start difference. First operand 48383 states and 69121 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:29:18,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:29:18,564 INFO L93 Difference]: Finished difference Result 96667 states and 138110 transitions. [2024-11-11 21:29:18,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:29:18,565 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 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 161 [2024-11-11 21:29:18,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:29:18,643 INFO L225 Difference]: With dead ends: 96667 [2024-11-11 21:29:18,643 INFO L226 Difference]: Without dead ends: 48389 [2024-11-11 21:29:18,681 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:29:18,682 INFO L435 NwaCegarLoop]: 440 mSDtfsCounter, 0 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 874 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:29:18,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 874 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:29:18,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48389 states. [2024-11-11 21:29:19,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48389 to 48389. [2024-11-11 21:29:19,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48389 states, 48388 states have (on average 1.4285979995040092) internal successors, (69127), 48388 states have internal predecessors, (69127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:29:19,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48389 states to 48389 states and 69127 transitions. [2024-11-11 21:29:19,734 INFO L78 Accepts]: Start accepts. Automaton has 48389 states and 69127 transitions. Word has length 161 [2024-11-11 21:29:19,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:29:19,735 INFO L471 AbstractCegarLoop]: Abstraction has 48389 states and 69127 transitions. [2024-11-11 21:29:19,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:29:19,735 INFO L276 IsEmpty]: Start isEmpty. Operand 48389 states and 69127 transitions. [2024-11-11 21:29:19,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-11 21:29:19,763 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:29:19,764 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:29:19,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-11 21:29:19,764 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:29:19,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:29:19,765 INFO L85 PathProgramCache]: Analyzing trace with hash -239709974, now seen corresponding path program 1 times [2024-11-11 21:29:19,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:29:19,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310563220] [2024-11-11 21:29:19,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:29:19,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:29:19,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:29:20,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:29:20,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:29:20,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310563220] [2024-11-11 21:29:20,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310563220] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:29:20,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:29:20,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:29:20,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096871540] [2024-11-11 21:29:20,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:29:20,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:29:20,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:29:20,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:29:20,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:29:20,012 INFO L87 Difference]: Start difference. First operand 48389 states and 69127 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:29:20,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:29:20,469 INFO L93 Difference]: Finished difference Result 130318 states and 185462 transitions. [2024-11-11 21:29:20,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:29:20,470 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 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 162 [2024-11-11 21:29:20,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:29:20,593 INFO L225 Difference]: With dead ends: 130318 [2024-11-11 21:29:20,594 INFO L226 Difference]: Without dead ends: 82872 [2024-11-11 21:29:20,616 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:29:20,617 INFO L435 NwaCegarLoop]: 809 mSDtfsCounter, 356 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 1208 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:29:20,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 1208 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:29:20,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82872 states. [2024-11-11 21:29:21,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82872 to 82870. [2024-11-11 21:29:21,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82870 states, 82869 states have (on average 1.4027440900698693) internal successors, (116244), 82869 states have internal predecessors, (116244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:29:22,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82870 states to 82870 states and 116244 transitions. [2024-11-11 21:29:22,036 INFO L78 Accepts]: Start accepts. Automaton has 82870 states and 116244 transitions. Word has length 162 [2024-11-11 21:29:22,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:29:22,036 INFO L471 AbstractCegarLoop]: Abstraction has 82870 states and 116244 transitions. [2024-11-11 21:29:22,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:29:22,036 INFO L276 IsEmpty]: Start isEmpty. Operand 82870 states and 116244 transitions. [2024-11-11 21:29:22,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-11 21:29:22,070 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:29:22,070 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:29:22,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-11 21:29:22,071 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:29:22,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:29:22,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1156613561, now seen corresponding path program 1 times [2024-11-11 21:29:22,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:29:22,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962112732] [2024-11-11 21:29:22,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:29:22,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:29:22,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:29:22,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:29:22,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:29:22,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962112732] [2024-11-11 21:29:22,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962112732] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:29:22,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:29:22,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:29:22,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355560687] [2024-11-11 21:29:22,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:29:22,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:29:22,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:29:22,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:29:22,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:29:22,486 INFO L87 Difference]: Start difference. First operand 82870 states and 116244 transitions. Second operand has 4 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:29:22,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:29:22,791 INFO L93 Difference]: Finished difference Result 153820 states and 216042 transitions. [2024-11-11 21:29:22,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 21:29:22,791 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 0 states have call successors, (0), 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 162 [2024-11-11 21:29:22,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:29:22,885 INFO L225 Difference]: With dead ends: 153820 [2024-11-11 21:29:22,886 INFO L226 Difference]: Without dead ends: 71775 [2024-11-11 21:29:22,951 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:29:22,951 INFO L435 NwaCegarLoop]: 471 mSDtfsCounter, 15 mSDsluCounter, 901 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 1372 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-11-11 21:29:22,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 1372 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:29:22,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71775 states. [2024-11-11 21:29:24,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71775 to 71775. [2024-11-11 21:29:24,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71775 states, 71774 states have (on average 1.4041853596009697) internal successors, (100784), 71774 states have internal predecessors, (100784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:29:24,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71775 states to 71775 states and 100784 transitions. [2024-11-11 21:29:24,286 INFO L78 Accepts]: Start accepts. Automaton has 71775 states and 100784 transitions. Word has length 162 [2024-11-11 21:29:24,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:29:24,286 INFO L471 AbstractCegarLoop]: Abstraction has 71775 states and 100784 transitions. [2024-11-11 21:29:24,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:29:24,286 INFO L276 IsEmpty]: Start isEmpty. Operand 71775 states and 100784 transitions. [2024-11-11 21:29:24,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-11 21:29:24,314 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:29:24,314 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:29:24,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-11 21:29:24,314 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:29:24,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:29:24,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1760978964, now seen corresponding path program 1 times [2024-11-11 21:29:24,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:29:24,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567713824] [2024-11-11 21:29:24,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:29:24,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:29:24,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:29:24,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:29:24,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:29:24,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567713824] [2024-11-11 21:29:24,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567713824] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:29:24,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:29:24,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 21:29:24,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652649678] [2024-11-11 21:29:24,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:29:24,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:29:24,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:29:24,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:29:24,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:29:24,448 INFO L87 Difference]: Start difference. First operand 71775 states and 100784 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:29:25,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:29:25,284 INFO L93 Difference]: Finished difference Result 177435 states and 265970 transitions. [2024-11-11 21:29:25,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 21:29:25,284 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 0 states have call successors, (0), 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 168 [2024-11-11 21:29:25,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:29:25,474 INFO L225 Difference]: With dead ends: 177435 [2024-11-11 21:29:25,474 INFO L226 Difference]: Without dead ends: 141993 [2024-11-11 21:29:25,536 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-11 21:29:25,537 INFO L435 NwaCegarLoop]: 545 mSDtfsCounter, 1290 mSDsluCounter, 1158 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1290 SdHoareTripleChecker+Valid, 1703 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 21:29:25,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1290 Valid, 1703 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 21:29:25,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141993 states. [2024-11-11 21:29:27,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141993 to 99951. [2024-11-11 21:29:27,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99951 states, 99950 states have (on average 1.439719859929965) internal successors, (143900), 99950 states have internal predecessors, (143900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:29:27,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99951 states to 99951 states and 143900 transitions. [2024-11-11 21:29:27,585 INFO L78 Accepts]: Start accepts. Automaton has 99951 states and 143900 transitions. Word has length 168 [2024-11-11 21:29:27,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:29:27,586 INFO L471 AbstractCegarLoop]: Abstraction has 99951 states and 143900 transitions. [2024-11-11 21:29:27,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:29:27,586 INFO L276 IsEmpty]: Start isEmpty. Operand 99951 states and 143900 transitions. [2024-11-11 21:29:27,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-11 21:29:27,923 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:29:27,923 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:29:27,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-11 21:29:27,924 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:29:27,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:29:27,924 INFO L85 PathProgramCache]: Analyzing trace with hash 699483931, now seen corresponding path program 1 times [2024-11-11 21:29:27,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:29:27,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126291190] [2024-11-11 21:29:27,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:29:27,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:29:27,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:29:28,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:29:28,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:29:28,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126291190] [2024-11-11 21:29:28,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126291190] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:29:28,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:29:28,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 21:29:28,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761854272] [2024-11-11 21:29:28,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:29:28,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:29:28,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:29:28,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:29:28,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:29:28,113 INFO L87 Difference]: Start difference. First operand 99951 states and 143900 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:29:28,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:29:28,600 INFO L93 Difference]: Finished difference Result 167015 states and 248076 transitions. [2024-11-11 21:29:28,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:29:28,601 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 0 states have call successors, (0), 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 168 [2024-11-11 21:29:28,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:29:28,791 INFO L225 Difference]: With dead ends: 167015 [2024-11-11 21:29:28,791 INFO L226 Difference]: Without dead ends: 141461 [2024-11-11 21:29:28,852 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:29:28,852 INFO L435 NwaCegarLoop]: 791 mSDtfsCounter, 799 mSDsluCounter, 899 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 799 SdHoareTripleChecker+Valid, 1690 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:29:28,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [799 Valid, 1690 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:29:28,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141461 states. [2024-11-11 21:29:30,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141461 to 109551. [2024-11-11 21:29:30,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109551 states, 109550 states have (on average 1.4492743039707896) internal successors, (158768), 109550 states have internal predecessors, (158768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:29:30,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109551 states to 109551 states and 158768 transitions. [2024-11-11 21:29:30,767 INFO L78 Accepts]: Start accepts. Automaton has 109551 states and 158768 transitions. Word has length 168 [2024-11-11 21:29:30,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:29:30,768 INFO L471 AbstractCegarLoop]: Abstraction has 109551 states and 158768 transitions. [2024-11-11 21:29:30,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:29:30,768 INFO L276 IsEmpty]: Start isEmpty. Operand 109551 states and 158768 transitions. [2024-11-11 21:29:30,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-11 21:29:30,794 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:29:30,794 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:29:30,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-11 21:29:30,795 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:29:30,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:29:30,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1542004675, now seen corresponding path program 1 times [2024-11-11 21:29:30,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:29:30,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668394114] [2024-11-11 21:29:30,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:29:30,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:29:31,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:29:31,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:29:31,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:29:31,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668394114] [2024-11-11 21:29:31,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668394114] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:29:31,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:29:31,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:29:31,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581750061] [2024-11-11 21:29:31,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:29:31,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 21:29:31,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:29:31,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 21:29:31,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-11 21:29:31,541 INFO L87 Difference]: Start difference. First operand 109551 states and 158768 transitions. Second operand has 8 states, 8 states have (on average 21.0) internal successors, (168), 8 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:29:32,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:29:32,065 INFO L93 Difference]: Finished difference Result 178451 states and 264562 transitions. [2024-11-11 21:29:32,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 21:29:32,065 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 21.0) internal successors, (168), 8 states have internal predecessors, (168), 0 states have call successors, (0), 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 168 [2024-11-11 21:29:32,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:29:32,231 INFO L225 Difference]: With dead ends: 178451 [2024-11-11 21:29:32,232 INFO L226 Difference]: Without dead ends: 109553 [2024-11-11 21:29:32,302 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:29:32,302 INFO L435 NwaCegarLoop]: 596 mSDtfsCounter, 657 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 657 SdHoareTripleChecker+Valid, 1233 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:29:32,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [657 Valid, 1233 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:29:32,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109553 states. [2024-11-11 21:29:33,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109553 to 103151. [2024-11-11 21:29:33,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103151 states, 103150 states have (on average 1.4365874939408627) internal successors, (148184), 103150 states have internal predecessors, (148184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:29:34,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103151 states to 103151 states and 148184 transitions. [2024-11-11 21:29:34,121 INFO L78 Accepts]: Start accepts. Automaton has 103151 states and 148184 transitions. Word has length 168 [2024-11-11 21:29:34,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:29:34,121 INFO L471 AbstractCegarLoop]: Abstraction has 103151 states and 148184 transitions. [2024-11-11 21:29:34,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.0) internal successors, (168), 8 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:29:34,122 INFO L276 IsEmpty]: Start isEmpty. Operand 103151 states and 148184 transitions. [2024-11-11 21:29:34,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-11 21:29:34,148 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:29:34,148 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:29:34,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-11 21:29:34,148 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:29:34,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:29:34,149 INFO L85 PathProgramCache]: Analyzing trace with hash -685642807, now seen corresponding path program 1 times [2024-11-11 21:29:34,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:29:34,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504641772] [2024-11-11 21:29:34,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:29:34,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:29:34,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:29:34,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:29:34,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:29:34,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504641772] [2024-11-11 21:29:34,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504641772] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:29:34,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:29:34,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 21:29:34,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055986077] [2024-11-11 21:29:34,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:29:34,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-11 21:29:34,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:29:34,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-11 21:29:34,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-11 21:29:34,456 INFO L87 Difference]: Start difference. First operand 103151 states and 148184 transitions. Second operand has 10 states, 10 states have (on average 16.8) internal successors, (168), 9 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:29:35,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:29:35,337 INFO L93 Difference]: Finished difference Result 193259 states and 277685 transitions. [2024-11-11 21:29:35,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:29:35,337 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 16.8) internal successors, (168), 9 states have internal predecessors, (168), 0 states have call successors, (0), 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 168 [2024-11-11 21:29:35,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:29:35,478 INFO L225 Difference]: With dead ends: 193259 [2024-11-11 21:29:35,478 INFO L226 Difference]: Without dead ends: 103151 [2024-11-11 21:29:35,511 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-11-11 21:29:35,512 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 2842 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2842 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:29:35,512 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2842 Valid, 622 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:29:35,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103151 states. [2024-11-11 21:29:36,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103151 to 103151. [2024-11-11 21:29:36,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103151 states, 103150 states have (on average 1.4187300048473097) internal successors, (146342), 103150 states have internal predecessors, (146342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:29:37,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103151 states to 103151 states and 146342 transitions. [2024-11-11 21:29:37,045 INFO L78 Accepts]: Start accepts. Automaton has 103151 states and 146342 transitions. Word has length 168 [2024-11-11 21:29:37,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:29:37,045 INFO L471 AbstractCegarLoop]: Abstraction has 103151 states and 146342 transitions. [2024-11-11 21:29:37,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.8) internal successors, (168), 9 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:29:37,046 INFO L276 IsEmpty]: Start isEmpty. Operand 103151 states and 146342 transitions. [2024-11-11 21:29:37,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-11 21:29:37,082 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:29:37,082 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:29:37,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-11 21:29:37,083 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:29:37,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:29:37,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1392447726, now seen corresponding path program 1 times [2024-11-11 21:29:37,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:29:37,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121116929] [2024-11-11 21:29:37,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:29:37,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:29:37,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:29:37,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:29:37,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:29:37,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121116929] [2024-11-11 21:29:37,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121116929] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:29:37,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:29:37,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:29:37,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421487056] [2024-11-11 21:29:37,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:29:37,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:29:37,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:29:37,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:29:37,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:29:37,382 INFO L87 Difference]: Start difference. First operand 103151 states and 146342 transitions. Second operand has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:29:38,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:29:38,193 INFO L93 Difference]: Finished difference Result 167215 states and 237080 transitions. [2024-11-11 21:29:38,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 21:29:38,193 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 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 168 [2024-11-11 21:29:38,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:29:38,309 INFO L225 Difference]: With dead ends: 167215 [2024-11-11 21:29:38,309 INFO L226 Difference]: Without dead ends: 91247 [2024-11-11 21:29:38,372 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:29:38,373 INFO L435 NwaCegarLoop]: 719 mSDtfsCounter, 363 mSDsluCounter, 742 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 1461 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:29:38,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 1461 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:29:38,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91247 states. [2024-11-11 21:29:39,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91247 to 91080. [2024-11-11 21:29:39,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91080 states, 91079 states have (on average 1.4143435918268756) internal successors, (128817), 91079 states have internal predecessors, (128817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:29:39,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91080 states to 91080 states and 128817 transitions. [2024-11-11 21:29:39,619 INFO L78 Accepts]: Start accepts. Automaton has 91080 states and 128817 transitions. Word has length 168 [2024-11-11 21:29:39,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:29:39,619 INFO L471 AbstractCegarLoop]: Abstraction has 91080 states and 128817 transitions. [2024-11-11 21:29:39,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:29:39,619 INFO L276 IsEmpty]: Start isEmpty. Operand 91080 states and 128817 transitions. [2024-11-11 21:29:39,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-11 21:29:39,644 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:29:39,644 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:29:39,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-11 21:29:39,645 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:29:39,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:29:39,645 INFO L85 PathProgramCache]: Analyzing trace with hash -462245595, now seen corresponding path program 1 times [2024-11-11 21:29:39,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:29:39,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406804908] [2024-11-11 21:29:39,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:29:39,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:29:39,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:29:39,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:29:39,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:29:39,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406804908] [2024-11-11 21:29:39,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406804908] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:29:39,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:29:39,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:29:39,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935274509] [2024-11-11 21:29:39,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:29:39,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:29:39,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:29:39,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:29:39,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:29:39,699 INFO L87 Difference]: Start difference. First operand 91080 states and 128817 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:29:40,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:29:40,566 INFO L93 Difference]: Finished difference Result 204070 states and 288193 transitions. [2024-11-11 21:29:40,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:29:40,567 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 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 169 [2024-11-11 21:29:40,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:29:40,746 INFO L225 Difference]: With dead ends: 204070 [2024-11-11 21:29:40,746 INFO L226 Difference]: Without dead ends: 134990 [2024-11-11 21:29:40,787 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:29:40,788 INFO L435 NwaCegarLoop]: 732 mSDtfsCounter, 396 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 1158 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:29:40,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 1158 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:29:40,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134990 states. [2024-11-11 21:29:42,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134990 to 91080. [2024-11-11 21:29:42,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91080 states, 91079 states have (on average 1.4143106533888163) internal successors, (128814), 91079 states have internal predecessors, (128814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:29:42,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91080 states to 91080 states and 128814 transitions. [2024-11-11 21:29:42,475 INFO L78 Accepts]: Start accepts. Automaton has 91080 states and 128814 transitions. Word has length 169 [2024-11-11 21:29:42,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:29:42,476 INFO L471 AbstractCegarLoop]: Abstraction has 91080 states and 128814 transitions. [2024-11-11 21:29:42,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:29:42,476 INFO L276 IsEmpty]: Start isEmpty. Operand 91080 states and 128814 transitions. [2024-11-11 21:29:42,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-11 21:29:42,507 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:29:42,508 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:29:42,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-11 21:29:42,508 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:29:42,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:29:42,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1988174699, now seen corresponding path program 1 times [2024-11-11 21:29:42,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:29:42,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756923563] [2024-11-11 21:29:42,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:29:42,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:29:42,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:29:43,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:29:43,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:29:43,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756923563] [2024-11-11 21:29:43,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756923563] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:29:43,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:29:43,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:29:43,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29839073] [2024-11-11 21:29:43,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:29:43,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:29:43,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:29:43,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:29:43,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:29:43,154 INFO L87 Difference]: Start difference. First operand 91080 states and 128814 transitions. Second operand has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:29:43,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:29:43,543 INFO L93 Difference]: Finished difference Result 193471 states and 273776 transitions. [2024-11-11 21:29:43,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 21:29:43,544 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 170 [2024-11-11 21:29:43,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:29:43,700 INFO L225 Difference]: With dead ends: 193471 [2024-11-11 21:29:43,700 INFO L226 Difference]: Without dead ends: 125167 [2024-11-11 21:29:43,770 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:29:43,771 INFO L435 NwaCegarLoop]: 698 mSDtfsCounter, 726 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 726 SdHoareTripleChecker+Valid, 1428 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:29:43,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [726 Valid, 1428 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:29:43,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125167 states. [2024-11-11 21:29:45,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125167 to 91231. [2024-11-11 21:29:45,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91231 states, 91230 states have (on average 1.4139098980598488) internal successors, (128991), 91230 states have internal predecessors, (128991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:29:45,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91231 states to 91231 states and 128991 transitions. [2024-11-11 21:29:45,582 INFO L78 Accepts]: Start accepts. Automaton has 91231 states and 128991 transitions. Word has length 170 [2024-11-11 21:29:45,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:29:45,582 INFO L471 AbstractCegarLoop]: Abstraction has 91231 states and 128991 transitions. [2024-11-11 21:29:45,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:29:45,583 INFO L276 IsEmpty]: Start isEmpty. Operand 91231 states and 128991 transitions. [2024-11-11 21:29:45,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-11 21:29:45,608 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:29:45,608 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:29:45,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-11 21:29:45,608 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:29:45,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:29:45,609 INFO L85 PathProgramCache]: Analyzing trace with hash -419745207, now seen corresponding path program 1 times [2024-11-11 21:29:45,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:29:45,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602756583] [2024-11-11 21:29:45,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:29:45,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:29:45,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:29:45,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:29:45,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:29:45,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602756583] [2024-11-11 21:29:45,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602756583] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:29:45,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:29:45,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:29:45,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436035943] [2024-11-11 21:29:45,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:29:45,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:29:45,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:29:45,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:29:45,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:29:45,665 INFO L87 Difference]: Start difference. First operand 91231 states and 128991 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:29:45,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:29:45,971 INFO L93 Difference]: Finished difference Result 182066 states and 257504 transitions. [2024-11-11 21:29:45,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:29:45,971 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 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 171 [2024-11-11 21:29:45,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:29:46,073 INFO L225 Difference]: With dead ends: 182066 [2024-11-11 21:29:46,074 INFO L226 Difference]: Without dead ends: 91253 [2024-11-11 21:29:46,141 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:29:46,141 INFO L435 NwaCegarLoop]: 432 mSDtfsCounter, 0 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 858 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:29:46,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 858 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:29:46,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91253 states. [2024-11-11 21:29:47,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91253 to 91253. [2024-11-11 21:29:47,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91253 states, 91252 states have (on average 1.4138101082715995) internal successors, (129013), 91252 states have internal predecessors, (129013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:29:47,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91253 states to 91253 states and 129013 transitions. [2024-11-11 21:29:47,639 INFO L78 Accepts]: Start accepts. Automaton has 91253 states and 129013 transitions. Word has length 171 [2024-11-11 21:29:47,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:29:47,639 INFO L471 AbstractCegarLoop]: Abstraction has 91253 states and 129013 transitions. [2024-11-11 21:29:47,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:29:47,639 INFO L276 IsEmpty]: Start isEmpty. Operand 91253 states and 129013 transitions. [2024-11-11 21:29:47,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-11 21:29:47,663 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:29:47,663 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:29:47,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-11 21:29:47,663 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:29:47,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:29:47,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1437606036, now seen corresponding path program 1 times [2024-11-11 21:29:47,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:29:47,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773940126] [2024-11-11 21:29:47,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:29:47,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:29:47,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:29:48,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:29:48,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:29:48,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773940126] [2024-11-11 21:29:48,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773940126] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:29:48,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:29:48,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:29:48,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688934849] [2024-11-11 21:29:48,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:29:48,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:29:48,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:29:48,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:29:48,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:29:48,297 INFO L87 Difference]: Start difference. First operand 91253 states and 129013 transitions. Second operand has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:29:48,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:29:48,615 INFO L93 Difference]: Finished difference Result 182371 states and 257838 transitions. [2024-11-11 21:29:48,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 21:29:48,616 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 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 172 [2024-11-11 21:29:48,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:29:48,730 INFO L225 Difference]: With dead ends: 182371 [2024-11-11 21:29:48,731 INFO L226 Difference]: Without dead ends: 91231 [2024-11-11 21:29:48,802 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:29:48,803 INFO L435 NwaCegarLoop]: 451 mSDtfsCounter, 4 mSDsluCounter, 873 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1324 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-11-11 21:29:48,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1324 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:29:48,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91231 states. [2024-11-11 21:29:49,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91231 to 91225. [2024-11-11 21:29:49,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91225 states, 91224 states have (on average 1.4137836534245374) internal successors, (128971), 91224 states have internal predecessors, (128971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:29:50,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91225 states to 91225 states and 128971 transitions. [2024-11-11 21:29:50,109 INFO L78 Accepts]: Start accepts. Automaton has 91225 states and 128971 transitions. Word has length 172 [2024-11-11 21:29:50,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:29:50,109 INFO L471 AbstractCegarLoop]: Abstraction has 91225 states and 128971 transitions. [2024-11-11 21:29:50,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:29:50,110 INFO L276 IsEmpty]: Start isEmpty. Operand 91225 states and 128971 transitions. [2024-11-11 21:29:50,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-11 21:29:50,136 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:29:50,136 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:29:50,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-11 21:29:50,136 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:29:50,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:29:50,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1590934886, now seen corresponding path program 1 times [2024-11-11 21:29:50,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:29:50,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592956401] [2024-11-11 21:29:50,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:29:50,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:29:50,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:29:50,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:29:50,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:29:50,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592956401] [2024-11-11 21:29:50,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592956401] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:29:50,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:29:50,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 21:29:50,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059990706] [2024-11-11 21:29:50,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:29:50,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:29:50,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:29:50,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:29:50,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:29:50,363 INFO L87 Difference]: Start difference. First operand 91225 states and 128971 transitions. Second operand has 5 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)