./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-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 a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-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-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 20:16:04,396 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 20:16:04,451 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 20:16:04,455 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 20:16:04,456 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 20:16:04,479 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 20:16:04,481 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 20:16:04,481 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 20:16:04,482 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 20:16:04,482 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 20:16:04,483 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 20:16:04,484 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 20:16:04,484 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 20:16:04,484 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 20:16:04,485 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 20:16:04,486 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 20:16:04,486 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 20:16:04,486 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 20:16:04,486 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 20:16:04,486 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 20:16:04,486 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 20:16:04,489 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 20:16:04,489 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 20:16:04,489 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 20:16:04,489 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 20:16:04,489 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 20:16:04,490 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 20:16:04,490 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 20:16:04,491 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 20:16:04,491 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 20:16:04,491 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 20:16:04,491 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 20:16:04,491 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:16:04,492 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 20:16:04,492 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 20:16:04,492 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 20:16:04,493 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 20:16:04,493 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 20:16:04,493 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 20:16:04,493 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 20:16:04,493 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 20:16:04,494 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 20:16:04,494 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-10-12 20:16:04,703 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 20:16:04,728 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 20:16:04,731 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 20:16:04,732 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 20:16:04,732 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 20:16:04,734 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2024-10-12 20:16:06,158 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 20:16:06,429 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 20:16:06,432 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-10-12 20:16:06,445 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35a060a1b/509d5e7ed6d14527aab5d98eec31cc3e/FLAG1d0373da4 [2024-10-12 20:16:06,763 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35a060a1b/509d5e7ed6d14527aab5d98eec31cc3e [2024-10-12 20:16:06,765 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 20:16:06,766 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 20:16:06,767 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 20:16:06,767 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 20:16:06,771 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 20:16:06,772 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:16:06" (1/1) ... [2024-10-12 20:16:06,772 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a6e736f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:16:06, skipping insertion in model container [2024-10-12 20:16:06,774 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:16:06" (1/1) ... [2024-10-12 20:16:06,818 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 20:16:07,165 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c[14519,14532] [2024-10-12 20:16:07,215 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:16:07,232 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 20:16:07,306 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c[14519,14532] [2024-10-12 20:16:07,347 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:16:07,364 INFO L204 MainTranslator]: Completed translation [2024-10-12 20:16:07,365 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:16:07 WrapperNode [2024-10-12 20:16:07,365 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 20:16:07,366 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 20:16:07,366 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 20:16:07,366 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 20:16:07,371 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:16:07" (1/1) ... [2024-10-12 20:16:07,386 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:16:07" (1/1) ... [2024-10-12 20:16:07,422 INFO L138 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1250 [2024-10-12 20:16:07,423 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 20:16:07,423 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 20:16:07,423 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 20:16:07,423 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 20:16:07,435 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:16:07" (1/1) ... [2024-10-12 20:16:07,435 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:16:07" (1/1) ... [2024-10-12 20:16:07,440 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:16:07" (1/1) ... [2024-10-12 20:16:07,463 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 20:16:07,464 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:16:07" (1/1) ... [2024-10-12 20:16:07,464 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:16:07" (1/1) ... [2024-10-12 20:16:07,488 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:16:07" (1/1) ... [2024-10-12 20:16:07,502 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:16:07" (1/1) ... [2024-10-12 20:16:07,510 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:16:07" (1/1) ... [2024-10-12 20:16:07,521 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:16:07" (1/1) ... [2024-10-12 20:16:07,531 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 20:16:07,532 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 20:16:07,532 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 20:16:07,536 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 20:16:07,537 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:16:07" (1/1) ... [2024-10-12 20:16:07,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:16:07,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:16:07,578 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 20:16:07,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 20:16:07,631 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 20:16:07,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 20:16:07,633 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 20:16:07,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 20:16:07,763 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 20:16:07,765 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 20:16:08,554 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-10-12 20:16:08,554 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 20:16:08,614 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 20:16:08,615 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-12 20:16:08,615 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:16:08 BoogieIcfgContainer [2024-10-12 20:16:08,615 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 20:16:08,617 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 20:16:08,617 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 20:16:08,621 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 20:16:08,621 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 08:16:06" (1/3) ... [2024-10-12 20:16:08,622 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1be41837 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:16:08, skipping insertion in model container [2024-10-12 20:16:08,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:16:07" (2/3) ... [2024-10-12 20:16:08,623 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1be41837 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:16:08, skipping insertion in model container [2024-10-12 20:16:08,623 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:16:08" (3/3) ... [2024-10-12 20:16:08,624 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2024-10-12 20:16:08,640 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 20:16:08,640 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 20:16:08,738 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 20:16:08,743 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;@3570d671, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 20:16:08,743 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 20:16:08,749 INFO L276 IsEmpty]: Start isEmpty. Operand has 303 states, 301 states have (on average 1.7906976744186047) internal successors, (539), 302 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:16:08,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-12 20:16:08,761 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:16:08,761 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:16:08,762 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:16:08,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:16:08,766 INFO L85 PathProgramCache]: Analyzing trace with hash 383113583, now seen corresponding path program 1 times [2024-10-12 20:16:08,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:16:08,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298657750] [2024-10-12 20:16:08,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:16:08,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:16:09,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:16:09,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:16:09,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:16:09,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298657750] [2024-10-12 20:16:09,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298657750] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:16:09,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:16:09,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:16:09,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724311984] [2024-10-12 20:16:09,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:16:09,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:16:09,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:16:09,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:16:09,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:16:09,305 INFO L87 Difference]: Start difference. First operand has 303 states, 301 states have (on average 1.7906976744186047) internal successors, (539), 302 states have internal predecessors, (539), 0 states have call successors, (0), 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 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:16:09,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:16:09,462 INFO L93 Difference]: Finished difference Result 608 states and 1074 transitions. [2024-10-12 20:16:09,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:16:09,465 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 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 143 [2024-10-12 20:16:09,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:16:09,477 INFO L225 Difference]: With dead ends: 608 [2024-10-12 20:16:09,477 INFO L226 Difference]: Without dead ends: 494 [2024-10-12 20:16:09,482 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:16:09,486 INFO L432 NwaCegarLoop]: 504 mSDtfsCounter, 360 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 887 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:16:09,488 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 887 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:16:09,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2024-10-12 20:16:09,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 492. [2024-10-12 20:16:09,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 491 states have (on average 1.4969450101832993) internal successors, (735), 491 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:16:09,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 735 transitions. [2024-10-12 20:16:09,553 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 735 transitions. Word has length 143 [2024-10-12 20:16:09,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:16:09,554 INFO L471 AbstractCegarLoop]: Abstraction has 492 states and 735 transitions. [2024-10-12 20:16:09,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:16:09,554 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 735 transitions. [2024-10-12 20:16:09,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-12 20:16:09,557 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:16:09,557 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:16:09,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 20:16:09,558 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:16:09,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:16:09,559 INFO L85 PathProgramCache]: Analyzing trace with hash 313742097, now seen corresponding path program 1 times [2024-10-12 20:16:09,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:16:09,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807282318] [2024-10-12 20:16:09,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:16:09,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:16:09,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:16:09,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:16:09,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:16:09,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807282318] [2024-10-12 20:16:09,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807282318] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:16:09,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:16:09,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:16:09,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466662462] [2024-10-12 20:16:09,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:16:09,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:16:09,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:16:09,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:16:09,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:16:09,772 INFO L87 Difference]: Start difference. First operand 492 states and 735 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:16:09,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:16:09,879 INFO L93 Difference]: Finished difference Result 1062 states and 1632 transitions. [2024-10-12 20:16:09,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:16:09,880 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 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 143 [2024-10-12 20:16:09,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:16:09,885 INFO L225 Difference]: With dead ends: 1062 [2024-10-12 20:16:09,885 INFO L226 Difference]: Without dead ends: 864 [2024-10-12 20:16:09,890 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:16:09,891 INFO L432 NwaCegarLoop]: 409 mSDtfsCounter, 274 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:16:09,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 724 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:16:09,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2024-10-12 20:16:09,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 862. [2024-10-12 20:16:09,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 862 states, 861 states have (on average 1.5087108013937283) internal successors, (1299), 861 states have internal predecessors, (1299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:16:09,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 862 states and 1299 transitions. [2024-10-12 20:16:09,921 INFO L78 Accepts]: Start accepts. Automaton has 862 states and 1299 transitions. Word has length 143 [2024-10-12 20:16:09,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:16:09,926 INFO L471 AbstractCegarLoop]: Abstraction has 862 states and 1299 transitions. [2024-10-12 20:16:09,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:16:09,926 INFO L276 IsEmpty]: Start isEmpty. Operand 862 states and 1299 transitions. [2024-10-12 20:16:09,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-12 20:16:09,930 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:16:09,930 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:16:09,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 20:16:09,930 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:16:09,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:16:09,931 INFO L85 PathProgramCache]: Analyzing trace with hash 268643290, now seen corresponding path program 1 times [2024-10-12 20:16:09,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:16:09,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312054511] [2024-10-12 20:16:09,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:16:09,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:16:10,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:16:10,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:16:10,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:16:10,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312054511] [2024-10-12 20:16:10,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312054511] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:16:10,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:16:10,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:16:10,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482027200] [2024-10-12 20:16:10,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:16:10,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:16:10,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:16:10,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:16:10,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:16:10,408 INFO L87 Difference]: Start difference. First operand 862 states and 1299 transitions. Second operand has 4 states, 4 states have (on average 35.75) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:16:10,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:16:10,534 INFO L93 Difference]: Finished difference Result 4181 states and 6280 transitions. [2024-10-12 20:16:10,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:16:10,534 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 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 143 [2024-10-12 20:16:10,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:16:10,544 INFO L225 Difference]: With dead ends: 4181 [2024-10-12 20:16:10,544 INFO L226 Difference]: Without dead ends: 3327 [2024-10-12 20:16:10,548 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-10-12 20:16:10,549 INFO L432 NwaCegarLoop]: 754 mSDtfsCounter, 1257 mSDsluCounter, 1144 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1257 SdHoareTripleChecker+Valid, 1898 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:16:10,551 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1257 Valid, 1898 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:16:10,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3327 states. [2024-10-12 20:16:10,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3327 to 1667. [2024-10-12 20:16:10,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1667 states, 1666 states have (on average 1.4915966386554622) internal successors, (2485), 1666 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-10-12 20:16:10,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1667 states to 1667 states and 2485 transitions. [2024-10-12 20:16:10,619 INFO L78 Accepts]: Start accepts. Automaton has 1667 states and 2485 transitions. Word has length 143 [2024-10-12 20:16:10,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:16:10,619 INFO L471 AbstractCegarLoop]: Abstraction has 1667 states and 2485 transitions. [2024-10-12 20:16:10,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:16:10,622 INFO L276 IsEmpty]: Start isEmpty. Operand 1667 states and 2485 transitions. [2024-10-12 20:16:10,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-12 20:16:10,627 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:16:10,628 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:16:10,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 20:16:10,628 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:16:10,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:16:10,629 INFO L85 PathProgramCache]: Analyzing trace with hash 869612546, now seen corresponding path program 1 times [2024-10-12 20:16:10,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:16:10,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656609808] [2024-10-12 20:16:10,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:16:10,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:16:10,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:16:10,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:16:10,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:16:10,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656609808] [2024-10-12 20:16:10,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656609808] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:16:10,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:16:10,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:16:10,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382635382] [2024-10-12 20:16:10,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:16:10,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:16:10,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:16:10,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:16:10,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:16:10,714 INFO L87 Difference]: Start difference. First operand 1667 states and 2485 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-10-12 20:16:10,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:16:10,757 INFO L93 Difference]: Finished difference Result 3309 states and 4928 transitions. [2024-10-12 20:16:10,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:16:10,758 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-10-12 20:16:10,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:16:10,762 INFO L225 Difference]: With dead ends: 3309 [2024-10-12 20:16:10,762 INFO L226 Difference]: Without dead ends: 1669 [2024-10-12 20:16:10,763 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:16:10,764 INFO L432 NwaCegarLoop]: 442 mSDtfsCounter, 0 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 879 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:16:10,764 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 879 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:16:10,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1669 states. [2024-10-12 20:16:10,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1669 to 1669. [2024-10-12 20:16:10,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1669 states, 1668 states have (on average 1.4910071942446044) internal successors, (2487), 1668 states have internal predecessors, (2487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:16:10,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 2487 transitions. [2024-10-12 20:16:10,805 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 2487 transitions. Word has length 144 [2024-10-12 20:16:10,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:16:10,805 INFO L471 AbstractCegarLoop]: Abstraction has 1669 states and 2487 transitions. [2024-10-12 20:16:10,805 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-10-12 20:16:10,806 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2487 transitions. [2024-10-12 20:16:10,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-12 20:16:10,807 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:16:10,808 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:16:10,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 20:16:10,808 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:16:10,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:16:10,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1169060635, now seen corresponding path program 1 times [2024-10-12 20:16:10,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:16:10,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414955372] [2024-10-12 20:16:10,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:16:10,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:16:10,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:16:11,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:16:11,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:16:11,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414955372] [2024-10-12 20:16:11,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414955372] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:16:11,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:16:11,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:16:11,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976000395] [2024-10-12 20:16:11,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:16:11,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:16:11,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:16:11,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:16:11,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:16:11,182 INFO L87 Difference]: Start difference. First operand 1669 states and 2487 transitions. Second operand has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 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-10-12 20:16:11,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:16:11,214 INFO L93 Difference]: Finished difference Result 3325 states and 4954 transitions. [2024-10-12 20:16:11,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:16:11,214 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 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-10-12 20:16:11,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:16:11,218 INFO L225 Difference]: With dead ends: 3325 [2024-10-12 20:16:11,218 INFO L226 Difference]: Without dead ends: 1669 [2024-10-12 20:16:11,220 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:16:11,220 INFO L432 NwaCegarLoop]: 478 mSDtfsCounter, 20 mSDsluCounter, 912 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 1390 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:16:11,223 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 1390 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:16:11,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1669 states. [2024-10-12 20:16:11,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1669 to 1668. [2024-10-12 20:16:11,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1668 states, 1667 states have (on average 1.490101979604079) internal successors, (2484), 1667 states have internal predecessors, (2484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:16:11,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1668 states to 1668 states and 2484 transitions. [2024-10-12 20:16:11,245 INFO L78 Accepts]: Start accepts. Automaton has 1668 states and 2484 transitions. Word has length 145 [2024-10-12 20:16:11,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:16:11,246 INFO L471 AbstractCegarLoop]: Abstraction has 1668 states and 2484 transitions. [2024-10-12 20:16:11,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 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-10-12 20:16:11,246 INFO L276 IsEmpty]: Start isEmpty. Operand 1668 states and 2484 transitions. [2024-10-12 20:16:11,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-12 20:16:11,248 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:16:11,248 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:16:11,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 20:16:11,249 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:16:11,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:16:11,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1226846207, now seen corresponding path program 1 times [2024-10-12 20:16:11,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:16:11,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903992058] [2024-10-12 20:16:11,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:16:11,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:16:11,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:16:11,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:16:11,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:16:11,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903992058] [2024-10-12 20:16:11,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903992058] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:16:11,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:16:11,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:16:11,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61248658] [2024-10-12 20:16:11,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:16:11,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:16:11,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:16:11,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:16:11,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:16:11,331 INFO L87 Difference]: Start difference. First operand 1668 states and 2484 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-10-12 20:16:11,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:16:11,380 INFO L93 Difference]: Finished difference Result 4400 states and 6555 transitions. [2024-10-12 20:16:11,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:16:11,381 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-10-12 20:16:11,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:16:11,391 INFO L225 Difference]: With dead ends: 4400 [2024-10-12 20:16:11,391 INFO L226 Difference]: Without dead ends: 2908 [2024-10-12 20:16:11,393 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:16:11,395 INFO L432 NwaCegarLoop]: 795 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, 1196 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-10-12 20:16:11,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 1196 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:16:11,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2908 states. [2024-10-12 20:16:11,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2908 to 2906. [2024-10-12 20:16:11,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2906 states, 2905 states have (on average 1.4688468158347676) internal successors, (4267), 2905 states have internal predecessors, (4267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:16:11,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2906 states to 2906 states and 4267 transitions. [2024-10-12 20:16:11,473 INFO L78 Accepts]: Start accepts. Automaton has 2906 states and 4267 transitions. Word has length 145 [2024-10-12 20:16:11,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:16:11,473 INFO L471 AbstractCegarLoop]: Abstraction has 2906 states and 4267 transitions. [2024-10-12 20:16:11,474 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-10-12 20:16:11,474 INFO L276 IsEmpty]: Start isEmpty. Operand 2906 states and 4267 transitions. [2024-10-12 20:16:11,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-12 20:16:11,477 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:16:11,477 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:16:11,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 20:16:11,478 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:16:11,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:16:11,478 INFO L85 PathProgramCache]: Analyzing trace with hash 109993182, now seen corresponding path program 1 times [2024-10-12 20:16:11,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:16:11,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510634270] [2024-10-12 20:16:11,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:16:11,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:16:11,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:16:11,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:16:11,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:16:11,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510634270] [2024-10-12 20:16:11,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510634270] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:16:11,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:16:11,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:16:11,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709789921] [2024-10-12 20:16:11,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:16:11,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:16:11,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:16:11,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:16:11,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:16:11,743 INFO L87 Difference]: Start difference. First operand 2906 states and 4267 transitions. Second operand has 4 states, 4 states have (on average 36.25) 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-10-12 20:16:11,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:16:11,849 INFO L93 Difference]: Finished difference Result 7252 states and 10633 transitions. [2024-10-12 20:16:11,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:16:11,850 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.25) 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-10-12 20:16:11,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:16:11,862 INFO L225 Difference]: With dead ends: 7252 [2024-10-12 20:16:11,862 INFO L226 Difference]: Without dead ends: 4394 [2024-10-12 20:16:11,867 INFO L431 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-10-12 20:16:11,869 INFO L432 NwaCegarLoop]: 731 mSDtfsCounter, 769 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 769 SdHoareTripleChecker+Valid, 1119 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:16:11,869 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [769 Valid, 1119 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:16:11,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4394 states. [2024-10-12 20:16:11,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4394 to 4392. [2024-10-12 20:16:11,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4392 states, 4391 states have (on average 1.4495559098155317) internal successors, (6365), 4391 states have internal predecessors, (6365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:16:11,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4392 states to 4392 states and 6365 transitions. [2024-10-12 20:16:11,986 INFO L78 Accepts]: Start accepts. Automaton has 4392 states and 6365 transitions. Word has length 145 [2024-10-12 20:16:11,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:16:11,988 INFO L471 AbstractCegarLoop]: Abstraction has 4392 states and 6365 transitions. [2024-10-12 20:16:11,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.25) 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-10-12 20:16:11,988 INFO L276 IsEmpty]: Start isEmpty. Operand 4392 states and 6365 transitions. [2024-10-12 20:16:11,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-12 20:16:11,992 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:16:11,992 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:16:11,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 20:16:11,992 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:16:11,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:16:11,993 INFO L85 PathProgramCache]: Analyzing trace with hash 914381432, now seen corresponding path program 1 times [2024-10-12 20:16:11,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:16:11,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227897577] [2024-10-12 20:16:11,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:16:11,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:16:12,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:16:12,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:16:12,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:16:12,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227897577] [2024-10-12 20:16:12,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227897577] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:16:12,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:16:12,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:16:12,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301915085] [2024-10-12 20:16:12,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:16:12,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:16:12,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:16:12,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:16:12,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:16:12,076 INFO L87 Difference]: Start difference. First operand 4392 states and 6365 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:16:12,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:16:12,144 INFO L93 Difference]: Finished difference Result 10885 states and 15803 transitions. [2024-10-12 20:16:12,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:16:12,145 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 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 153 [2024-10-12 20:16:12,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:16:12,163 INFO L225 Difference]: With dead ends: 10885 [2024-10-12 20:16:12,163 INFO L226 Difference]: Without dead ends: 6970 [2024-10-12 20:16:12,168 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:16:12,170 INFO L432 NwaCegarLoop]: 810 mSDtfsCounter, 366 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 1205 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-10-12 20:16:12,170 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 1205 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:16:12,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6970 states. [2024-10-12 20:16:12,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6970 to 6968. [2024-10-12 20:16:12,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6968 states, 6967 states have (on average 1.428735467202526) internal successors, (9954), 6967 states have internal predecessors, (9954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:16:12,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6968 states to 6968 states and 9954 transitions. [2024-10-12 20:16:12,316 INFO L78 Accepts]: Start accepts. Automaton has 6968 states and 9954 transitions. Word has length 153 [2024-10-12 20:16:12,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:16:12,316 INFO L471 AbstractCegarLoop]: Abstraction has 6968 states and 9954 transitions. [2024-10-12 20:16:12,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:16:12,317 INFO L276 IsEmpty]: Start isEmpty. Operand 6968 states and 9954 transitions. [2024-10-12 20:16:12,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-12 20:16:12,324 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:16:12,325 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:16:12,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 20:16:12,325 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:16:12,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:16:12,325 INFO L85 PathProgramCache]: Analyzing trace with hash -89819030, now seen corresponding path program 1 times [2024-10-12 20:16:12,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:16:12,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213158858] [2024-10-12 20:16:12,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:16:12,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:16:12,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:16:12,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:16:12,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:16:12,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213158858] [2024-10-12 20:16:12,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213158858] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:16:12,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:16:12,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 20:16:12,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864434511] [2024-10-12 20:16:12,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:16:12,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 20:16:12,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:16:12,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 20:16:12,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-12 20:16:12,944 INFO L87 Difference]: Start difference. First operand 6968 states and 9954 transitions. Second operand has 9 states, 9 states have (on average 17.0) internal successors, (153), 9 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:16:13,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:16:13,219 INFO L93 Difference]: Finished difference Result 15876 states and 23340 transitions. [2024-10-12 20:16:13,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:16:13,220 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 17.0) internal successors, (153), 9 states have internal predecessors, (153), 0 states have call successors, (0), 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 153 [2024-10-12 20:16:13,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:16:13,254 INFO L225 Difference]: With dead ends: 15876 [2024-10-12 20:16:13,254 INFO L226 Difference]: Without dead ends: 12884 [2024-10-12 20:16:13,261 INFO L431 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-10-12 20:16:13,263 INFO L432 NwaCegarLoop]: 405 mSDtfsCounter, 2033 mSDsluCounter, 2022 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2033 SdHoareTripleChecker+Valid, 2427 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:16:13,264 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2033 Valid, 2427 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 20:16:13,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12884 states. [2024-10-12 20:16:13,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12884 to 12882. [2024-10-12 20:16:13,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12882 states, 12881 states have (on average 1.4328080118003261) internal successors, (18456), 12881 states have internal predecessors, (18456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:16:13,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12882 states to 12882 states and 18456 transitions. [2024-10-12 20:16:13,487 INFO L78 Accepts]: Start accepts. Automaton has 12882 states and 18456 transitions. Word has length 153 [2024-10-12 20:16:13,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:16:13,487 INFO L471 AbstractCegarLoop]: Abstraction has 12882 states and 18456 transitions. [2024-10-12 20:16:13,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.0) internal successors, (153), 9 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:16:13,487 INFO L276 IsEmpty]: Start isEmpty. Operand 12882 states and 18456 transitions. [2024-10-12 20:16:13,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-12 20:16:13,499 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:16:13,500 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:16:13,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 20:16:13,500 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:16:13,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:16:13,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1570632198, now seen corresponding path program 1 times [2024-10-12 20:16:13,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:16:13,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418661995] [2024-10-12 20:16:13,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:16:13,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:16:13,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:16:13,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:16:13,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:16:13,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418661995] [2024-10-12 20:16:13,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418661995] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:16:13,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:16:13,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:16:13,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820237304] [2024-10-12 20:16:13,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:16:13,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:16:13,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:16:13,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:16:13,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:16:13,915 INFO L87 Difference]: Start difference. First operand 12882 states and 18456 transitions. Second operand has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:16:13,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:16:13,985 INFO L93 Difference]: Finished difference Result 24114 states and 34570 transitions. [2024-10-12 20:16:13,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:16:13,985 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 0 states have call successors, (0), 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 153 [2024-10-12 20:16:13,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:16:14,001 INFO L225 Difference]: With dead ends: 24114 [2024-10-12 20:16:14,001 INFO L226 Difference]: Without dead ends: 11483 [2024-10-12 20:16:14,014 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:16:14,015 INFO L432 NwaCegarLoop]: 481 mSDtfsCounter, 23 mSDsluCounter, 913 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 1394 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:16:14,015 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 1394 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:16:14,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11483 states. [2024-10-12 20:16:14,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11483 to 11483. [2024-10-12 20:16:14,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11483 states, 11482 states have (on average 1.4315450269987806) internal successors, (16437), 11482 states have internal predecessors, (16437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:16:14,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11483 states to 11483 states and 16437 transitions. [2024-10-12 20:16:14,292 INFO L78 Accepts]: Start accepts. Automaton has 11483 states and 16437 transitions. Word has length 153 [2024-10-12 20:16:14,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:16:14,292 INFO L471 AbstractCegarLoop]: Abstraction has 11483 states and 16437 transitions. [2024-10-12 20:16:14,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:16:14,293 INFO L276 IsEmpty]: Start isEmpty. Operand 11483 states and 16437 transitions. [2024-10-12 20:16:14,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-10-12 20:16:14,300 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:16:14,301 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:16:14,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 20:16:14,301 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:16:14,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:16:14,302 INFO L85 PathProgramCache]: Analyzing trace with hash -791594437, now seen corresponding path program 1 times [2024-10-12 20:16:14,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:16:14,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944462843] [2024-10-12 20:16:14,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:16:14,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:16:14,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:16:14,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:16:14,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:16:14,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944462843] [2024-10-12 20:16:14,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944462843] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:16:14,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:16:14,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:16:14,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124918235] [2024-10-12 20:16:14,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:16:14,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:16:14,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:16:14,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:16:14,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:16:14,379 INFO L87 Difference]: Start difference. First operand 11483 states and 16437 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:16:14,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:16:14,654 INFO L93 Difference]: Finished difference Result 31353 states and 45379 transitions. [2024-10-12 20:16:14,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:16:14,654 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 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 159 [2024-10-12 20:16:14,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:16:14,685 INFO L225 Difference]: With dead ends: 31353 [2024-10-12 20:16:14,685 INFO L226 Difference]: Without dead ends: 21751 [2024-10-12 20:16:14,701 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:16:14,702 INFO L432 NwaCegarLoop]: 343 mSDtfsCounter, 295 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:16:14,702 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 667 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 20:16:14,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21751 states. [2024-10-12 20:16:14,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21751 to 21749. [2024-10-12 20:16:14,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21749 states, 21748 states have (on average 1.4306143093617805) internal successors, (31113), 21748 states have internal predecessors, (31113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:16:15,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21749 states to 21749 states and 31113 transitions. [2024-10-12 20:16:15,117 INFO L78 Accepts]: Start accepts. Automaton has 21749 states and 31113 transitions. Word has length 159 [2024-10-12 20:16:15,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:16:15,117 INFO L471 AbstractCegarLoop]: Abstraction has 21749 states and 31113 transitions. [2024-10-12 20:16:15,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:16:15,118 INFO L276 IsEmpty]: Start isEmpty. Operand 21749 states and 31113 transitions. [2024-10-12 20:16:15,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-10-12 20:16:15,132 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:16:15,132 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:16:15,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 20:16:15,133 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:16:15,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:16:15,133 INFO L85 PathProgramCache]: Analyzing trace with hash -770393130, now seen corresponding path program 1 times [2024-10-12 20:16:15,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:16:15,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532378137] [2024-10-12 20:16:15,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:16:15,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:16:15,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:16:15,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:16:15,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:16:15,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532378137] [2024-10-12 20:16:15,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532378137] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:16:15,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:16:15,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:16:15,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374800975] [2024-10-12 20:16:15,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:16:15,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:16:15,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:16:15,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:16:15,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:16:15,368 INFO L87 Difference]: Start difference. First operand 21749 states and 31113 transitions. Second operand has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:16:15,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:16:15,585 INFO L93 Difference]: Finished difference Result 34093 states and 50985 transitions. [2024-10-12 20:16:15,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:16:15,585 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 0 states have call successors, (0), 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 159 [2024-10-12 20:16:15,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:16:15,624 INFO L225 Difference]: With dead ends: 34093 [2024-10-12 20:16:15,625 INFO L226 Difference]: Without dead ends: 29595 [2024-10-12 20:16:15,638 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:16:15,638 INFO L432 NwaCegarLoop]: 786 mSDtfsCounter, 844 mSDsluCounter, 1209 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 844 SdHoareTripleChecker+Valid, 1995 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:16:15,638 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [844 Valid, 1995 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:16:15,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29595 states. [2024-10-12 20:16:16,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29595 to 25109. [2024-10-12 20:16:16,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25109 states, 25108 states have (on average 1.4531225107535446) internal successors, (36485), 25108 states have internal predecessors, (36485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:16:16,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25109 states to 25109 states and 36485 transitions. [2024-10-12 20:16:16,126 INFO L78 Accepts]: Start accepts. Automaton has 25109 states and 36485 transitions. Word has length 159 [2024-10-12 20:16:16,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:16:16,126 INFO L471 AbstractCegarLoop]: Abstraction has 25109 states and 36485 transitions. [2024-10-12 20:16:16,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:16:16,126 INFO L276 IsEmpty]: Start isEmpty. Operand 25109 states and 36485 transitions. [2024-10-12 20:16:16,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-10-12 20:16:16,146 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:16:16,146 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:16:16,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 20:16:16,146 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:16:16,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:16:16,147 INFO L85 PathProgramCache]: Analyzing trace with hash 2126511149, now seen corresponding path program 1 times [2024-10-12 20:16:16,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:16:16,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882118132] [2024-10-12 20:16:16,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:16:16,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:16:16,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:16:16,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:16:16,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:16:16,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882118132] [2024-10-12 20:16:16,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882118132] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:16:16,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:16:16,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:16:16,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505409862] [2024-10-12 20:16:16,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:16:16,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:16:16,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:16:16,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:16:16,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:16:16,587 INFO L87 Difference]: Start difference. First operand 25109 states and 36485 transitions. Second operand has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:16:16,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:16:16,719 INFO L93 Difference]: Finished difference Result 35377 states and 52767 transitions. [2024-10-12 20:16:16,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:16:16,720 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 0 states have call successors, (0), 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 159 [2024-10-12 20:16:16,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:16:16,879 INFO L225 Difference]: With dead ends: 35377 [2024-10-12 20:16:16,879 INFO L226 Difference]: Without dead ends: 25111 [2024-10-12 20:16:16,889 INFO L431 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-10-12 20:16:16,889 INFO L432 NwaCegarLoop]: 440 mSDtfsCounter, 539 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 539 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:16:16,890 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [539 Valid, 890 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:16:16,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25111 states. [2024-10-12 20:16:17,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25111 to 25109. [2024-10-12 20:16:17,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25109 states, 25108 states have (on average 1.4461127927353832) internal successors, (36309), 25108 states have internal predecessors, (36309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:16:17,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25109 states to 25109 states and 36309 transitions. [2024-10-12 20:16:17,300 INFO L78 Accepts]: Start accepts. Automaton has 25109 states and 36309 transitions. Word has length 159 [2024-10-12 20:16:17,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:16:17,300 INFO L471 AbstractCegarLoop]: Abstraction has 25109 states and 36309 transitions. [2024-10-12 20:16:17,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:16:17,301 INFO L276 IsEmpty]: Start isEmpty. Operand 25109 states and 36309 transitions. [2024-10-12 20:16:17,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-10-12 20:16:17,324 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:16:17,324 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:16:17,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 20:16:17,324 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:16:17,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:16:17,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1009384059, now seen corresponding path program 1 times [2024-10-12 20:16:17,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:16:17,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820813020] [2024-10-12 20:16:17,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:16:17,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:16:17,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:16:17,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:16:17,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:16:17,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820813020] [2024-10-12 20:16:17,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820813020] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:16:17,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:16:17,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:16:17,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292230213] [2024-10-12 20:16:17,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:16:17,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:16:17,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:16:17,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:16:17,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:16:17,810 INFO L87 Difference]: Start difference. First operand 25109 states and 36309 transitions. Second operand has 4 states, 4 states have (on average 39.75) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:16:18,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:16:18,361 INFO L93 Difference]: Finished difference Result 122030 states and 175982 transitions. [2024-10-12 20:16:18,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:16:18,366 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 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 159 [2024-10-12 20:16:18,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:16:18,483 INFO L225 Difference]: With dead ends: 122030 [2024-10-12 20:16:18,484 INFO L226 Difference]: Without dead ends: 96969 [2024-10-12 20:16:18,523 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-10-12 20:16:18,524 INFO L432 NwaCegarLoop]: 731 mSDtfsCounter, 1210 mSDsluCounter, 1170 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1210 SdHoareTripleChecker+Valid, 1901 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:16:18,524 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1210 Valid, 1901 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 20:16:18,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96969 states. [2024-10-12 20:16:19,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96969 to 48535. [2024-10-12 20:16:19,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48535 states, 48534 states have (on average 1.4278650018543702) internal successors, (69300), 48534 states have internal predecessors, (69300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:16:20,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48535 states to 48535 states and 69300 transitions. [2024-10-12 20:16:20,153 INFO L78 Accepts]: Start accepts. Automaton has 48535 states and 69300 transitions. Word has length 159 [2024-10-12 20:16:20,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:16:20,153 INFO L471 AbstractCegarLoop]: Abstraction has 48535 states and 69300 transitions. [2024-10-12 20:16:20,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:16:20,153 INFO L276 IsEmpty]: Start isEmpty. Operand 48535 states and 69300 transitions. [2024-10-12 20:16:20,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-12 20:16:20,173 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:16:20,173 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:16:20,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 20:16:20,173 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:16:20,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:16:20,173 INFO L85 PathProgramCache]: Analyzing trace with hash -2114801041, now seen corresponding path program 1 times [2024-10-12 20:16:20,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:16:20,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287633904] [2024-10-12 20:16:20,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:16:20,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:16:20,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:16:20,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:16:20,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:16:20,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287633904] [2024-10-12 20:16:20,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287633904] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:16:20,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:16:20,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:16:20,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924446870] [2024-10-12 20:16:20,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:16:20,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:16:20,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:16:20,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:16:20,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:16:20,234 INFO L87 Difference]: Start difference. First operand 48535 states and 69300 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 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-10-12 20:16:20,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:16:20,416 INFO L93 Difference]: Finished difference Result 96957 states and 138449 transitions. [2024-10-12 20:16:20,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:16:20,417 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 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-10-12 20:16:20,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:16:20,473 INFO L225 Difference]: With dead ends: 96957 [2024-10-12 20:16:20,474 INFO L226 Difference]: Without dead ends: 48543 [2024-10-12 20:16:20,514 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:16:20,515 INFO L432 NwaCegarLoop]: 438 mSDtfsCounter, 0 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 871 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:16:20,515 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 871 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:16:20,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48543 states. [2024-10-12 20:16:21,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48543 to 48543. [2024-10-12 20:16:21,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48543 states, 48542 states have (on average 1.4277944872481563) internal successors, (69308), 48542 states have internal predecessors, (69308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:16:21,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48543 states to 48543 states and 69308 transitions. [2024-10-12 20:16:21,812 INFO L78 Accepts]: Start accepts. Automaton has 48543 states and 69308 transitions. Word has length 160 [2024-10-12 20:16:21,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:16:21,812 INFO L471 AbstractCegarLoop]: Abstraction has 48543 states and 69308 transitions. [2024-10-12 20:16:21,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 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-10-12 20:16:21,813 INFO L276 IsEmpty]: Start isEmpty. Operand 48543 states and 69308 transitions. [2024-10-12 20:16:21,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-12 20:16:21,868 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:16:21,868 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:16:21,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 20:16:21,868 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:16:21,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:16:21,869 INFO L85 PathProgramCache]: Analyzing trace with hash -376055152, now seen corresponding path program 1 times [2024-10-12 20:16:21,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:16:21,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572510520] [2024-10-12 20:16:21,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:16:21,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:16:21,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:16:21,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:16:21,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:16:21,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572510520] [2024-10-12 20:16:21,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572510520] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:16:21,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:16:21,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:16:21,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807172484] [2024-10-12 20:16:21,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:16:21,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:16:21,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:16:21,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:16:21,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:16:21,966 INFO L87 Difference]: Start difference. First operand 48543 states and 69308 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-10-12 20:16:22,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:16:22,334 INFO L93 Difference]: Finished difference Result 130616 states and 185812 transitions. [2024-10-12 20:16:22,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:16:22,335 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-10-12 20:16:22,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:16:22,447 INFO L225 Difference]: With dead ends: 130616 [2024-10-12 20:16:22,448 INFO L226 Difference]: Without dead ends: 83170 [2024-10-12 20:16:22,509 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:16:22,510 INFO L432 NwaCegarLoop]: 807 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, 1206 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-10-12 20:16:22,511 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 1206 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:16:22,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83170 states. [2024-10-12 20:16:24,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83170 to 83168. [2024-10-12 20:16:24,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83168 states, 83167 states have (on average 1.40192624478459) internal successors, (116594), 83167 states have internal predecessors, (116594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:16:24,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83168 states to 83168 states and 116594 transitions. [2024-10-12 20:16:24,281 INFO L78 Accepts]: Start accepts. Automaton has 83168 states and 116594 transitions. Word has length 161 [2024-10-12 20:16:24,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:16:24,281 INFO L471 AbstractCegarLoop]: Abstraction has 83168 states and 116594 transitions. [2024-10-12 20:16:24,281 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-10-12 20:16:24,282 INFO L276 IsEmpty]: Start isEmpty. Operand 83168 states and 116594 transitions. [2024-10-12 20:16:24,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-12 20:16:24,315 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:16:24,315 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:16:24,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 20:16:24,315 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:16:24,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:16:24,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1292958739, now seen corresponding path program 1 times [2024-10-12 20:16:24,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:16:24,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541954956] [2024-10-12 20:16:24,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:16:24,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:16:24,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:16:24,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:16:24,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:16:24,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541954956] [2024-10-12 20:16:24,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541954956] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:16:24,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:16:24,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:16:24,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020852855] [2024-10-12 20:16:24,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:16:24,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:16:24,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:16:24,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:16:24,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:16:24,985 INFO L87 Difference]: Start difference. First operand 83168 states and 116594 transitions. Second operand has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 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-10-12 20:16:25,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:16:25,285 INFO L93 Difference]: Finished difference Result 154193 states and 216479 transitions. [2024-10-12 20:16:25,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:16:25,285 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 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-10-12 20:16:25,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:16:25,365 INFO L225 Difference]: With dead ends: 154193 [2024-10-12 20:16:25,366 INFO L226 Difference]: Without dead ends: 72002 [2024-10-12 20:16:25,425 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:16:25,427 INFO L432 NwaCegarLoop]: 468 mSDtfsCounter, 15 mSDsluCounter, 898 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 1366 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:16:25,427 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 1366 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:16:25,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72002 states. [2024-10-12 20:16:27,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72002 to 72002. [2024-10-12 20:16:27,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72002 states, 72001 states have (on average 1.4034249524312163) internal successors, (101048), 72001 states have internal predecessors, (101048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:16:27,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72002 states to 72002 states and 101048 transitions. [2024-10-12 20:16:27,134 INFO L78 Accepts]: Start accepts. Automaton has 72002 states and 101048 transitions. Word has length 161 [2024-10-12 20:16:27,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:16:27,135 INFO L471 AbstractCegarLoop]: Abstraction has 72002 states and 101048 transitions. [2024-10-12 20:16:27,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 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-10-12 20:16:27,135 INFO L276 IsEmpty]: Start isEmpty. Operand 72002 states and 101048 transitions. [2024-10-12 20:16:27,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-12 20:16:27,165 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:16:27,165 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:16:27,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 20:16:27,165 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:16:27,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:16:27,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1856556306, now seen corresponding path program 1 times [2024-10-12 20:16:27,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:16:27,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897857875] [2024-10-12 20:16:27,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:16:27,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:16:27,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:16:27,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:16:27,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:16:27,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897857875] [2024-10-12 20:16:27,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897857875] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:16:27,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:16:27,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:16:27,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093924968] [2024-10-12 20:16:27,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:16:27,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:16:27,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:16:27,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:16:27,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:16:27,284 INFO L87 Difference]: Start difference. First operand 72002 states and 101048 transitions. Second operand has 5 states, 5 states have (on average 33.4) internal successors, (167), 5 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:16:27,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:16:27,812 INFO L93 Difference]: Finished difference Result 177662 states and 266234 transitions. [2024-10-12 20:16:27,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 20:16:27,813 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.4) internal successors, (167), 5 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 167 [2024-10-12 20:16:27,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:16:28,005 INFO L225 Difference]: With dead ends: 177662 [2024-10-12 20:16:28,005 INFO L226 Difference]: Without dead ends: 142220 [2024-10-12 20:16:28,064 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:16:28,065 INFO L432 NwaCegarLoop]: 543 mSDtfsCounter, 1290 mSDsluCounter, 1158 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1290 SdHoareTripleChecker+Valid, 1701 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:16:28,065 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1290 Valid, 1701 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:16:28,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142220 states. [2024-10-12 20:16:29,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142220 to 100178. [2024-10-12 20:16:29,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100178 states, 100177 states have (on average 1.439092805733851) internal successors, (144164), 100177 states have internal predecessors, (144164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:16:30,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100178 states to 100178 states and 144164 transitions. [2024-10-12 20:16:30,048 INFO L78 Accepts]: Start accepts. Automaton has 100178 states and 144164 transitions. Word has length 167 [2024-10-12 20:16:30,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:16:30,048 INFO L471 AbstractCegarLoop]: Abstraction has 100178 states and 144164 transitions. [2024-10-12 20:16:30,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.4) internal successors, (167), 5 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:16:30,049 INFO L276 IsEmpty]: Start isEmpty. Operand 100178 states and 144164 transitions. [2024-10-12 20:16:30,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-12 20:16:30,075 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:16:30,075 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:16:30,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-12 20:16:30,075 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:16:30,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:16:30,076 INFO L85 PathProgramCache]: Analyzing trace with hash 22051905, now seen corresponding path program 1 times [2024-10-12 20:16:30,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:16:30,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395075626] [2024-10-12 20:16:30,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:16:30,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:16:30,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:16:30,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:16:30,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:16:30,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395075626] [2024-10-12 20:16:30,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395075626] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:16:30,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:16:30,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:16:30,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715540258] [2024-10-12 20:16:30,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:16:30,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:16:30,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:16:30,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:16:30,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:16:30,192 INFO L87 Difference]: Start difference. First operand 100178 states and 144164 transitions. Second operand has 5 states, 5 states have (on average 33.4) internal successors, (167), 5 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:16:31,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:16:31,148 INFO L93 Difference]: Finished difference Result 167242 states and 248340 transitions. [2024-10-12 20:16:31,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:16:31,149 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.4) internal successors, (167), 5 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 167 [2024-10-12 20:16:31,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:16:31,380 INFO L225 Difference]: With dead ends: 167242 [2024-10-12 20:16:31,380 INFO L226 Difference]: Without dead ends: 141688 [2024-10-12 20:16:31,442 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:16:31,442 INFO L432 NwaCegarLoop]: 789 mSDtfsCounter, 788 mSDsluCounter, 1198 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 788 SdHoareTripleChecker+Valid, 1987 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:16:31,442 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [788 Valid, 1987 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:16:31,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141688 states. [2024-10-12 20:16:33,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141688 to 109778. [2024-10-12 20:16:33,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109778 states, 109777 states have (on average 1.4486823287209525) internal successors, (159032), 109777 states have internal predecessors, (159032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:16:33,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109778 states to 109778 states and 159032 transitions. [2024-10-12 20:16:33,946 INFO L78 Accepts]: Start accepts. Automaton has 109778 states and 159032 transitions. Word has length 167 [2024-10-12 20:16:33,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:16:33,947 INFO L471 AbstractCegarLoop]: Abstraction has 109778 states and 159032 transitions. [2024-10-12 20:16:33,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.4) internal successors, (167), 5 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:16:33,947 INFO L276 IsEmpty]: Start isEmpty. Operand 109778 states and 159032 transitions. [2024-10-12 20:16:33,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-12 20:16:33,980 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:16:33,980 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:16:33,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-12 20:16:33,980 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:16:33,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:16:33,981 INFO L85 PathProgramCache]: Analyzing trace with hash 2075530595, now seen corresponding path program 1 times [2024-10-12 20:16:33,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:16:33,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002289764] [2024-10-12 20:16:33,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:16:33,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:16:34,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:16:34,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:16:34,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:16:34,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002289764] [2024-10-12 20:16:34,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002289764] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:16:34,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:16:34,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 20:16:34,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782151418] [2024-10-12 20:16:34,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:16:34,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:16:34,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:16:34,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:16:34,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:16:34,240 INFO L87 Difference]: Start difference. First operand 109778 states and 159032 transitions. Second operand has 8 states, 8 states have (on average 20.875) internal successors, (167), 8 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:16:34,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:16:34,706 INFO L93 Difference]: Finished difference Result 178678 states and 264826 transitions. [2024-10-12 20:16:34,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:16:34,707 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 20.875) internal successors, (167), 8 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 167 [2024-10-12 20:16:34,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:16:34,888 INFO L225 Difference]: With dead ends: 178678 [2024-10-12 20:16:34,888 INFO L226 Difference]: Without dead ends: 109780 [2024-10-12 20:16:34,955 INFO L431 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-10-12 20:16:34,956 INFO L432 NwaCegarLoop]: 594 mSDtfsCounter, 1013 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1013 SdHoareTripleChecker+Valid, 1183 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:16:34,956 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1013 Valid, 1183 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:16:35,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109780 states. [2024-10-12 20:16:36,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109780 to 103378. [2024-10-12 20:16:36,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103378 states, 103377 states have (on average 1.4359867281890555) internal successors, (148448), 103377 states have internal predecessors, (148448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:16:36,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103378 states to 103378 states and 148448 transitions. [2024-10-12 20:16:36,939 INFO L78 Accepts]: Start accepts. Automaton has 103378 states and 148448 transitions. Word has length 167 [2024-10-12 20:16:36,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:16:36,939 INFO L471 AbstractCegarLoop]: Abstraction has 103378 states and 148448 transitions. [2024-10-12 20:16:36,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.875) internal successors, (167), 8 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:16:36,939 INFO L276 IsEmpty]: Start isEmpty. Operand 103378 states and 148448 transitions. [2024-10-12 20:16:36,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-12 20:16:36,977 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:16:36,977 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:16:36,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-12 20:16:36,978 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:16:36,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:16:36,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1363074833, now seen corresponding path program 1 times [2024-10-12 20:16:36,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:16:36,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031875567] [2024-10-12 20:16:36,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:16:36,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:16:37,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:16:37,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:16:37,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:16:37,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031875567] [2024-10-12 20:16:37,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031875567] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:16:37,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:16:37,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 20:16:37,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631029893] [2024-10-12 20:16:37,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:16:37,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 20:16:37,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:16:37,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 20:16:37,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-10-12 20:16:37,420 INFO L87 Difference]: Start difference. First operand 103378 states and 148448 transitions. Second operand has 10 states, 10 states have (on average 16.7) internal successors, (167), 9 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:16:38,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:16:38,053 INFO L93 Difference]: Finished difference Result 193498 states and 277961 transitions. [2024-10-12 20:16:38,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:16:38,053 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 16.7) internal successors, (167), 9 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 167 [2024-10-12 20:16:38,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:16:38,195 INFO L225 Difference]: With dead ends: 193498 [2024-10-12 20:16:38,195 INFO L226 Difference]: Without dead ends: 103378 [2024-10-12 20:16:38,718 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2024-10-12 20:16:38,719 INFO L432 NwaCegarLoop]: 322 mSDtfsCounter, 2946 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2946 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:16:38,719 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2946 Valid, 516 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:16:38,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103378 states. [2024-10-12 20:16:39,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103378 to 103378. [2024-10-12 20:16:39,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103378 states, 103377 states have (on average 1.418129758069977) internal successors, (146602), 103377 states have internal predecessors, (146602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:16:40,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103378 states to 103378 states and 146602 transitions. [2024-10-12 20:16:40,132 INFO L78 Accepts]: Start accepts. Automaton has 103378 states and 146602 transitions. Word has length 167 [2024-10-12 20:16:40,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:16:40,132 INFO L471 AbstractCegarLoop]: Abstraction has 103378 states and 146602 transitions. [2024-10-12 20:16:40,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.7) internal successors, (167), 9 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:16:40,133 INFO L276 IsEmpty]: Start isEmpty. Operand 103378 states and 146602 transitions. [2024-10-12 20:16:40,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-12 20:16:40,161 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:16:40,161 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:16:40,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-12 20:16:40,161 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:16:40,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:16:40,162 INFO L85 PathProgramCache]: Analyzing trace with hash 715015700, now seen corresponding path program 1 times [2024-10-12 20:16:40,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:16:40,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177289237] [2024-10-12 20:16:40,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:16:40,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:16:40,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:16:40,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:16:40,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:16:40,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177289237] [2024-10-12 20:16:40,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177289237] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:16:40,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:16:40,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:16:40,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816766328] [2024-10-12 20:16:40,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:16:40,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:16:40,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:16:40,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:16:40,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:16:40,392 INFO L87 Difference]: Start difference. First operand 103378 states and 146602 transitions. Second operand has 4 states, 4 states have (on average 41.75) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:16:40,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:16:40,907 INFO L93 Difference]: Finished difference Result 194360 states and 275297 transitions. [2024-10-12 20:16:40,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:16:40,907 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 167 [2024-10-12 20:16:40,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:16:41,031 INFO L225 Difference]: With dead ends: 194360 [2024-10-12 20:16:41,032 INFO L226 Difference]: Without dead ends: 91348 [2024-10-12 20:16:41,107 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-10-12 20:16:41,108 INFO L432 NwaCegarLoop]: 685 mSDtfsCounter, 365 mSDsluCounter, 1038 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 1723 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:16:41,110 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 1723 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:16:41,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91348 states. [2024-10-12 20:16:42,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91348 to 91089. [2024-10-12 20:16:42,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91089 states, 91088 states have (on average 1.414247760407518) internal successors, (128821), 91088 states have internal predecessors, (128821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:16:42,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91089 states to 91089 states and 128821 transitions. [2024-10-12 20:16:42,916 INFO L78 Accepts]: Start accepts. Automaton has 91089 states and 128821 transitions. Word has length 167 [2024-10-12 20:16:42,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:16:42,916 INFO L471 AbstractCegarLoop]: Abstraction has 91089 states and 128821 transitions. [2024-10-12 20:16:42,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:16:42,916 INFO L276 IsEmpty]: Start isEmpty. Operand 91089 states and 128821 transitions. [2024-10-12 20:16:42,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-12 20:16:42,951 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:16:42,951 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:16:42,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-12 20:16:42,951 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:16:42,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:16:42,952 INFO L85 PathProgramCache]: Analyzing trace with hash -483940591, now seen corresponding path program 1 times [2024-10-12 20:16:42,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:16:42,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523446317] [2024-10-12 20:16:42,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:16:42,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:16:43,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:16:43,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:16:43,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:16:43,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523446317] [2024-10-12 20:16:43,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523446317] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:16:43,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:16:43,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:16:43,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767380238] [2024-10-12 20:16:43,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:16:43,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:16:43,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:16:43,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:16:43,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:16:43,238 INFO L87 Difference]: Start difference. First operand 91089 states and 128821 transitions. Second operand has 4 states, 4 states have (on average 42.25) 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-10-12 20:16:43,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:16:43,870 INFO L93 Difference]: Finished difference Result 273521 states and 386712 transitions. [2024-10-12 20:16:43,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:16:43,871 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.25) 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-10-12 20:16:43,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:16:44,595 INFO L225 Difference]: With dead ends: 273521 [2024-10-12 20:16:44,596 INFO L226 Difference]: Without dead ends: 182569 [2024-10-12 20:16:44,654 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-10-12 20:16:44,654 INFO L432 NwaCegarLoop]: 682 mSDtfsCounter, 1172 mSDsluCounter, 1089 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1172 SdHoareTripleChecker+Valid, 1771 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:16:44,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1172 Valid, 1771 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:16:44,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182569 states. [2024-10-12 20:16:46,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182569 to 91264. [2024-10-12 20:16:46,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91264 states, 91263 states have (on average 1.4134972551855627) internal successors, (129000), 91263 states have internal predecessors, (129000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:16:46,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91264 states to 91264 states and 129000 transitions. [2024-10-12 20:16:46,434 INFO L78 Accepts]: Start accepts. Automaton has 91264 states and 129000 transitions. Word has length 169 [2024-10-12 20:16:46,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:16:46,434 INFO L471 AbstractCegarLoop]: Abstraction has 91264 states and 129000 transitions. [2024-10-12 20:16:46,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.25) 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-10-12 20:16:46,434 INFO L276 IsEmpty]: Start isEmpty. Operand 91264 states and 129000 transitions. [2024-10-12 20:16:46,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-12 20:16:46,462 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:16:46,462 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:16:46,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-12 20:16:46,462 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:16:46,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:16:46,463 INFO L85 PathProgramCache]: Analyzing trace with hash 254092131, now seen corresponding path program 1 times [2024-10-12 20:16:46,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:16:46,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010203960] [2024-10-12 20:16:46,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:16:46,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:16:46,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:16:46,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:16:46,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:16:46,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010203960] [2024-10-12 20:16:46,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010203960] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:16:46,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:16:46,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:16:46,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58642997] [2024-10-12 20:16:46,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:16:46,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:16:46,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:16:46,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:16:46,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:16:46,517 INFO L87 Difference]: Start difference. First operand 91264 states and 129000 transitions. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 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-10-12 20:16:47,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:16:47,331 INFO L93 Difference]: Finished difference Result 160464 states and 226769 transitions. [2024-10-12 20:16:47,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:16:47,332 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 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-10-12 20:16:47,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:16:47,448 INFO L225 Difference]: With dead ends: 160464 [2024-10-12 20:16:47,448 INFO L226 Difference]: Without dead ends: 91276 [2024-10-12 20:16:47,496 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:16:47,497 INFO L432 NwaCegarLoop]: 427 mSDtfsCounter, 0 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 849 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:16:47,497 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 849 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:16:47,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91276 states. [2024-10-12 20:16:48,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91276 to 91276. [2024-10-12 20:16:48,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91276 states, 91275 states have (on average 1.413442892358258) internal successors, (129012), 91275 states have internal predecessors, (129012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:16:49,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91276 states to 91276 states and 129012 transitions. [2024-10-12 20:16:49,015 INFO L78 Accepts]: Start accepts. Automaton has 91276 states and 129012 transitions. Word has length 170 [2024-10-12 20:16:49,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:16:49,016 INFO L471 AbstractCegarLoop]: Abstraction has 91276 states and 129012 transitions. [2024-10-12 20:16:49,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 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-10-12 20:16:49,016 INFO L276 IsEmpty]: Start isEmpty. Operand 91276 states and 129012 transitions. [2024-10-12 20:16:49,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-12 20:16:49,041 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:16:49,042 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:16:49,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-12 20:16:49,042 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:16:49,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:16:49,042 INFO L85 PathProgramCache]: Analyzing trace with hash -2023485038, now seen corresponding path program 1 times [2024-10-12 20:16:49,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:16:49,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777630101] [2024-10-12 20:16:49,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:16:49,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:16:49,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:16:49,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:16:49,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:16:49,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777630101] [2024-10-12 20:16:49,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777630101] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:16:49,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:16:49,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:16:49,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263458734] [2024-10-12 20:16:49,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:16:49,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:16:49,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:16:49,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:16:49,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:16:49,299 INFO L87 Difference]: Start difference. First operand 91276 states and 129012 transitions. Second operand has 4 states, 4 states have (on average 42.75) internal successors, (171), 4 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-10-12 20:16:50,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:16:50,015 INFO L93 Difference]: Finished difference Result 161003 states and 227364 transitions. [2024-10-12 20:16:50,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:16:50,016 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.75) internal successors, (171), 4 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-10-12 20:16:50,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:16:50,131 INFO L225 Difference]: With dead ends: 161003 [2024-10-12 20:16:50,131 INFO L226 Difference]: Without dead ends: 91264 [2024-10-12 20:16:50,149 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:16:50,150 INFO L432 NwaCegarLoop]: 444 mSDtfsCounter, 3 mSDsluCounter, 864 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1308 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:16:50,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1308 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:16:50,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91264 states. [2024-10-12 20:16:51,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91264 to 91264. [2024-10-12 20:16:51,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91264 states, 91263 states have (on average 1.4134315111271818) internal successors, (128994), 91263 states have internal predecessors, (128994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:16:51,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91264 states to 91264 states and 128994 transitions. [2024-10-12 20:16:51,504 INFO L78 Accepts]: Start accepts. Automaton has 91264 states and 128994 transitions. Word has length 171 [2024-10-12 20:16:51,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:16:51,504 INFO L471 AbstractCegarLoop]: Abstraction has 91264 states and 128994 transitions. [2024-10-12 20:16:51,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.75) internal successors, (171), 4 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-10-12 20:16:51,504 INFO L276 IsEmpty]: Start isEmpty. Operand 91264 states and 128994 transitions. [2024-10-12 20:16:51,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-12 20:16:51,531 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:16:51,531 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:16:51,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-12 20:16:51,531 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:16:51,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:16:51,532 INFO L85 PathProgramCache]: Analyzing trace with hash 2118153408, now seen corresponding path program 1 times [2024-10-12 20:16:51,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:16:51,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173971728] [2024-10-12 20:16:51,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:16:51,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:16:51,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:16:51,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:16:51,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:16:51,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173971728] [2024-10-12 20:16:51,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173971728] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:16:51,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:16:51,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:16:51,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989515704] [2024-10-12 20:16:51,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:16:51,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:16:51,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:16:51,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:16:51,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:16:51,728 INFO L87 Difference]: Start difference. First operand 91264 states and 128994 transitions. Second operand has 4 states, 4 states have (on average 42.75) 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-10-12 20:16:52,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:16:52,080 INFO L93 Difference]: Finished difference Result 147722 states and 208750 transitions. [2024-10-12 20:16:52,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:16:52,081 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.75) 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-10-12 20:16:52,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:16:52,189 INFO L225 Difference]: With dead ends: 147722 [2024-10-12 20:16:52,190 INFO L226 Difference]: Without dead ends: 79663 [2024-10-12 20:16:52,251 INFO L431 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-10-12 20:16:52,252 INFO L432 NwaCegarLoop]: 692 mSDtfsCounter, 370 mSDsluCounter, 718 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 1410 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:16:52,252 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 1410 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:16:52,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79663 states. [2024-10-12 20:16:53,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79663 to 79268. [2024-10-12 20:16:53,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79268 states, 79267 states have (on average 1.4111547049844197) internal successors, (111858), 79267 states have internal predecessors, (111858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:16:53,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79268 states to 79268 states and 111858 transitions. [2024-10-12 20:16:53,547 INFO L78 Accepts]: Start accepts. Automaton has 79268 states and 111858 transitions. Word has length 171 [2024-10-12 20:16:53,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:16:53,548 INFO L471 AbstractCegarLoop]: Abstraction has 79268 states and 111858 transitions. [2024-10-12 20:16:53,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.75) 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-10-12 20:16:53,548 INFO L276 IsEmpty]: Start isEmpty. Operand 79268 states and 111858 transitions. [2024-10-12 20:16:53,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-10-12 20:16:53,572 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:16:53,572 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:16:53,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-12 20:16:53,572 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:16:53,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:16:53,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1795938641, now seen corresponding path program 1 times [2024-10-12 20:16:53,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:16:53,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318632866] [2024-10-12 20:16:53,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:16:53,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:16:53,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:16:53,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:16:53,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:16:53,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318632866] [2024-10-12 20:16:53,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318632866] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:16:53,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:16:53,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:16:53,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300753791] [2024-10-12 20:16:53,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:16:53,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:16:53,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:16:53,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:16:53,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:16:53,696 INFO L87 Difference]: Start difference. First operand 79268 states and 111858 transitions. Second operand has 5 states, 5 states have (on average 34.6) internal successors, (173), 5 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)