./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label39.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label39.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 0d7a1ac2bddd27216563c8e31b878b94b733d43befd074e50a1bdc6b73a7213c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 23:47:49,355 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 23:47:49,449 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 23:47:49,453 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 23:47:49,453 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 23:47:49,472 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 23:47:49,473 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 23:47:49,473 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 23:47:49,474 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 23:47:49,474 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 23:47:49,475 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 23:47:49,475 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 23:47:49,476 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 23:47:49,476 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 23:47:49,476 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 23:47:49,477 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 23:47:49,477 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 23:47:49,478 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 23:47:49,478 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 23:47:49,478 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 23:47:49,479 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 23:47:49,482 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 23:47:49,483 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 23:47:49,483 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 23:47:49,483 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 23:47:49,483 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 23:47:49,484 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 23:47:49,484 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 23:47:49,484 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 23:47:49,484 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 23:47:49,485 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 23:47:49,485 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 23:47:49,485 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:47:49,485 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 23:47:49,486 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 23:47:49,486 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 23:47:49,487 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 23:47:49,487 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 23:47:49,488 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 23:47:49,488 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 23:47:49,488 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 23:47:49,489 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 23:47:49,489 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-clean/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-clean/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 -> 0d7a1ac2bddd27216563c8e31b878b94b733d43befd074e50a1bdc6b73a7213c [2024-10-10 23:47:49,753 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 23:47:49,775 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 23:47:49,780 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 23:47:49,783 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 23:47:49,783 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 23:47:49,784 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label39.c [2024-10-10 23:47:51,204 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 23:47:51,606 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 23:47:51,608 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label39.c [2024-10-10 23:47:51,635 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/be92aac6e/f665be930e804c81b7de32e137f72b7b/FLAGfb8534591 [2024-10-10 23:47:51,776 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/be92aac6e/f665be930e804c81b7de32e137f72b7b [2024-10-10 23:47:51,780 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 23:47:51,782 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 23:47:51,784 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 23:47:51,785 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 23:47:51,790 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 23:47:51,791 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:47:51" (1/1) ... [2024-10-10 23:47:51,792 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35e2f668 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:47:51, skipping insertion in model container [2024-10-10 23:47:51,792 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:47:51" (1/1) ... [2024-10-10 23:47:51,877 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 23:47:52,125 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/eca-rers2012/Problem17_label39.c[9366,9379] [2024-10-10 23:47:52,704 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:47:52,742 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 23:47:52,776 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/eca-rers2012/Problem17_label39.c[9366,9379] [2024-10-10 23:47:52,982 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:47:53,002 INFO L204 MainTranslator]: Completed translation [2024-10-10 23:47:53,002 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:47:53 WrapperNode [2024-10-10 23:47:53,003 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 23:47:53,004 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 23:47:53,004 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 23:47:53,004 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 23:47:53,011 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:47:53" (1/1) ... [2024-10-10 23:47:53,059 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:47:53" (1/1) ... [2024-10-10 23:47:53,323 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2613 [2024-10-10 23:47:53,323 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 23:47:53,324 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 23:47:53,324 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 23:47:53,324 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 23:47:53,335 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:47:53" (1/1) ... [2024-10-10 23:47:53,336 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:47:53" (1/1) ... [2024-10-10 23:47:53,447 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:47:53" (1/1) ... [2024-10-10 23:47:53,579 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-10 23:47:53,580 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:47:53" (1/1) ... [2024-10-10 23:47:53,580 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:47:53" (1/1) ... [2024-10-10 23:47:53,706 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:47:53" (1/1) ... [2024-10-10 23:47:53,721 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:47:53" (1/1) ... [2024-10-10 23:47:53,747 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:47:53" (1/1) ... [2024-10-10 23:47:53,765 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:47:53" (1/1) ... [2024-10-10 23:47:53,803 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 23:47:53,805 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 23:47:53,805 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 23:47:53,805 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 23:47:53,807 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:47:53" (1/1) ... [2024-10-10 23:47:53,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:47:53,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:47:53,845 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-10 23:47:53,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-10 23:47:53,899 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 23:47:53,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 23:47:53,900 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 23:47:53,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 23:47:53,975 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 23:47:53,978 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 23:47:57,343 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2024-10-10 23:47:57,343 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 23:47:57,418 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 23:47:57,421 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 23:47:57,421 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:47:57 BoogieIcfgContainer [2024-10-10 23:47:57,422 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 23:47:57,424 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 23:47:57,425 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 23:47:57,428 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 23:47:57,428 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 11:47:51" (1/3) ... [2024-10-10 23:47:57,429 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66011804 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:47:57, skipping insertion in model container [2024-10-10 23:47:57,429 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:47:53" (2/3) ... [2024-10-10 23:47:57,429 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66011804 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:47:57, skipping insertion in model container [2024-10-10 23:47:57,429 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:47:57" (3/3) ... [2024-10-10 23:47:57,431 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem17_label39.c [2024-10-10 23:47:57,448 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 23:47:57,449 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 23:47:57,532 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 23:47:57,540 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;@6466af97, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 23:47:57,540 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 23:47:57,547 INFO L276 IsEmpty]: Start isEmpty. Operand has 528 states, 526 states have (on average 1.9011406844106464) internal successors, (1000), 527 states have internal predecessors, (1000), 0 states have call successors, (0), 0 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-10 23:47:57,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-10 23:47:57,557 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:47:57,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] [2024-10-10 23:47:57,558 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:47:57,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:47:57,564 INFO L85 PathProgramCache]: Analyzing trace with hash -193928819, now seen corresponding path program 1 times [2024-10-10 23:47:57,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:47:57,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489420432] [2024-10-10 23:47:57,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:47:57,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:47:57,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:47:57,814 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-10 23:47:57,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:47:57,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489420432] [2024-10-10 23:47:57,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489420432] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:47:57,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:47:57,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:47:57,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895278311] [2024-10-10 23:47:57,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:47:57,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 23:47:57,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:47:57,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 23:47:57,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:47:57,854 INFO L87 Difference]: Start difference. First operand has 528 states, 526 states have (on average 1.9011406844106464) internal successors, (1000), 527 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 0 states have call successors, (0), 0 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-10 23:47:57,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:47:57,935 INFO L93 Difference]: Finished difference Result 1055 states and 1999 transitions. [2024-10-10 23:47:57,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 23:47:57,938 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2024-10-10 23:47:57,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:47:57,954 INFO L225 Difference]: With dead ends: 1055 [2024-10-10 23:47:57,954 INFO L226 Difference]: Without dead ends: 526 [2024-10-10 23:47:57,960 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:47:57,965 INFO L432 NwaCegarLoop]: 935 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:47:57,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 935 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 23:47:57,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2024-10-10 23:47:58,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 526. [2024-10-10 23:47:58,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 525 states have (on average 1.7809523809523808) internal successors, (935), 525 states have internal predecessors, (935), 0 states have call successors, (0), 0 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-10 23:47:58,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 935 transitions. [2024-10-10 23:47:58,037 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 935 transitions. Word has length 62 [2024-10-10 23:47:58,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:47:58,037 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 935 transitions. [2024-10-10 23:47:58,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 0 states have call successors, (0), 0 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-10 23:47:58,038 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 935 transitions. [2024-10-10 23:47:58,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-10 23:47:58,039 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:47:58,039 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] [2024-10-10 23:47:58,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 23:47:58,040 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:47:58,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:47:58,041 INFO L85 PathProgramCache]: Analyzing trace with hash 501592809, now seen corresponding path program 1 times [2024-10-10 23:47:58,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:47:58,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375539876] [2024-10-10 23:47:58,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:47:58,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:47:58,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:47:58,274 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-10 23:47:58,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:47:58,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375539876] [2024-10-10 23:47:58,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375539876] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:47:58,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:47:58,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:47:58,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185813705] [2024-10-10 23:47:58,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:47:58,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:47:58,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:47:58,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:47:58,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:47:58,279 INFO L87 Difference]: Start difference. First operand 526 states and 935 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 2 states have internal predecessors, (62), 0 states have call successors, (0), 0 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-10 23:48:00,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:48:00,455 INFO L93 Difference]: Finished difference Result 1499 states and 2693 transitions. [2024-10-10 23:48:00,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:48:00,456 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 2 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2024-10-10 23:48:00,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:48:00,461 INFO L225 Difference]: With dead ends: 1499 [2024-10-10 23:48:00,461 INFO L226 Difference]: Without dead ends: 974 [2024-10-10 23:48:00,463 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10 23:48:00,464 INFO L432 NwaCegarLoop]: 422 mSDtfsCounter, 411 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1341 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 1666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 1341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:48:00,465 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [411 Valid, 495 Invalid, 1666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 1341 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-10 23:48:00,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2024-10-10 23:48:00,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 971. [2024-10-10 23:48:00,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 971 states, 970 states have (on average 1.5082474226804123) internal successors, (1463), 970 states have internal predecessors, (1463), 0 states have call successors, (0), 0 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-10 23:48:00,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1463 transitions. [2024-10-10 23:48:00,508 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1463 transitions. Word has length 62 [2024-10-10 23:48:00,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:48:00,509 INFO L471 AbstractCegarLoop]: Abstraction has 971 states and 1463 transitions. [2024-10-10 23:48:00,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 2 states have internal predecessors, (62), 0 states have call successors, (0), 0 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-10 23:48:00,509 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1463 transitions. [2024-10-10 23:48:00,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-10 23:48:00,513 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:48:00,513 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:48:00,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 23:48:00,514 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:48:00,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:48:00,514 INFO L85 PathProgramCache]: Analyzing trace with hash -170379876, now seen corresponding path program 1 times [2024-10-10 23:48:00,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:48:00,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369754162] [2024-10-10 23:48:00,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:48:00,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:48:00,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:48:00,840 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:48:00,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:48:00,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369754162] [2024-10-10 23:48:00,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369754162] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:48:00,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:48:00,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:48:00,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674479919] [2024-10-10 23:48:00,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:48:00,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:48:00,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:48:00,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:48:00,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:48:00,842 INFO L87 Difference]: Start difference. First operand 971 states and 1463 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 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-10 23:48:03,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:48:03,163 INFO L93 Difference]: Finished difference Result 2813 states and 4241 transitions. [2024-10-10 23:48:03,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:48:03,164 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 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 132 [2024-10-10 23:48:03,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:48:03,172 INFO L225 Difference]: With dead ends: 2813 [2024-10-10 23:48:03,172 INFO L226 Difference]: Without dead ends: 1843 [2024-10-10 23:48:03,175 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-10 23:48:03,177 INFO L432 NwaCegarLoop]: 851 mSDtfsCounter, 428 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1284 mSolverCounterSat, 414 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 918 SdHoareTripleChecker+Invalid, 1698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 414 IncrementalHoareTripleChecker+Valid, 1284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:48:03,180 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 918 Invalid, 1698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [414 Valid, 1284 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-10 23:48:03,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1843 states. [2024-10-10 23:48:03,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1843 to 1841. [2024-10-10 23:48:03,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1841 states, 1840 states have (on average 1.3603260869565217) internal successors, (2503), 1840 states have internal predecessors, (2503), 0 states have call successors, (0), 0 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-10 23:48:03,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1841 states to 1841 states and 2503 transitions. [2024-10-10 23:48:03,221 INFO L78 Accepts]: Start accepts. Automaton has 1841 states and 2503 transitions. Word has length 132 [2024-10-10 23:48:03,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:48:03,223 INFO L471 AbstractCegarLoop]: Abstraction has 1841 states and 2503 transitions. [2024-10-10 23:48:03,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 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-10 23:48:03,223 INFO L276 IsEmpty]: Start isEmpty. Operand 1841 states and 2503 transitions. [2024-10-10 23:48:03,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-10 23:48:03,232 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:48:03,232 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:48:03,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 23:48:03,233 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:48:03,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:48:03,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1591153639, now seen corresponding path program 1 times [2024-10-10 23:48:03,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:48:03,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50785646] [2024-10-10 23:48:03,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:48:03,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:48:03,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:48:03,425 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:48:03,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:48:03,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50785646] [2024-10-10 23:48:03,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50785646] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:48:03,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:48:03,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:48:03,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987010602] [2024-10-10 23:48:03,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:48:03,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:48:03,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:48:03,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:48:03,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:48:03,430 INFO L87 Difference]: Start difference. First operand 1841 states and 2503 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:48:05,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:48:05,348 INFO L93 Difference]: Finished difference Result 5394 states and 7325 transitions. [2024-10-10 23:48:05,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:48:05,349 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 154 [2024-10-10 23:48:05,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:48:05,359 INFO L225 Difference]: With dead ends: 5394 [2024-10-10 23:48:05,359 INFO L226 Difference]: Without dead ends: 2700 [2024-10-10 23:48:05,364 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10 23:48:05,366 INFO L432 NwaCegarLoop]: 514 mSDtfsCounter, 368 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 1630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-10 23:48:05,366 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 589 Invalid, 1630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1082 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-10 23:48:05,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2700 states. [2024-10-10 23:48:05,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2700 to 2700. [2024-10-10 23:48:05,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2700 states, 2699 states have (on average 1.1919229344201556) internal successors, (3217), 2699 states have internal predecessors, (3217), 0 states have call successors, (0), 0 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-10 23:48:05,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2700 states to 2700 states and 3217 transitions. [2024-10-10 23:48:05,415 INFO L78 Accepts]: Start accepts. Automaton has 2700 states and 3217 transitions. Word has length 154 [2024-10-10 23:48:05,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:48:05,417 INFO L471 AbstractCegarLoop]: Abstraction has 2700 states and 3217 transitions. [2024-10-10 23:48:05,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:48:05,417 INFO L276 IsEmpty]: Start isEmpty. Operand 2700 states and 3217 transitions. [2024-10-10 23:48:05,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-10-10 23:48:05,420 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:48:05,420 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:48:05,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 23:48:05,421 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:48:05,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:48:05,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1816151866, now seen corresponding path program 1 times [2024-10-10 23:48:05,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:48:05,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527936832] [2024-10-10 23:48:05,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:48:05,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:48:05,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:48:05,691 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:48:05,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:48:05,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527936832] [2024-10-10 23:48:05,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527936832] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:48:05,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:48:05,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:48:05,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999834122] [2024-10-10 23:48:05,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:48:05,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:48:05,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:48:05,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:48:05,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:48:05,695 INFO L87 Difference]: Start difference. First operand 2700 states and 3217 transitions. Second operand has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 0 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-10 23:48:07,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:48:07,169 INFO L93 Difference]: Finished difference Result 7107 states and 8597 transitions. [2024-10-10 23:48:07,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:48:07,170 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 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 214 [2024-10-10 23:48:07,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:48:07,183 INFO L225 Difference]: With dead ends: 7107 [2024-10-10 23:48:07,184 INFO L226 Difference]: Without dead ends: 4408 [2024-10-10 23:48:07,188 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-10 23:48:07,189 INFO L432 NwaCegarLoop]: 724 mSDtfsCounter, 496 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1137 mSolverCounterSat, 306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 781 SdHoareTripleChecker+Invalid, 1443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 306 IncrementalHoareTripleChecker+Valid, 1137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:48:07,190 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 781 Invalid, 1443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [306 Valid, 1137 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-10 23:48:07,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4408 states. [2024-10-10 23:48:07,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4408 to 4408. [2024-10-10 23:48:07,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4408 states, 4407 states have (on average 1.1706376219650556) internal successors, (5159), 4407 states have internal predecessors, (5159), 0 states have call successors, (0), 0 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-10 23:48:07,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4408 states to 4408 states and 5159 transitions. [2024-10-10 23:48:07,260 INFO L78 Accepts]: Start accepts. Automaton has 4408 states and 5159 transitions. Word has length 214 [2024-10-10 23:48:07,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:48:07,261 INFO L471 AbstractCegarLoop]: Abstraction has 4408 states and 5159 transitions. [2024-10-10 23:48:07,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 0 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-10 23:48:07,261 INFO L276 IsEmpty]: Start isEmpty. Operand 4408 states and 5159 transitions. [2024-10-10 23:48:07,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-10-10 23:48:07,264 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:48:07,264 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:48:07,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 23:48:07,265 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:48:07,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:48:07,265 INFO L85 PathProgramCache]: Analyzing trace with hash 361293035, now seen corresponding path program 1 times [2024-10-10 23:48:07,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:48:07,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681383292] [2024-10-10 23:48:07,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:48:07,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:48:07,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:48:07,477 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-10-10 23:48:07,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:48:07,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681383292] [2024-10-10 23:48:07,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681383292] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:48:07,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:48:07,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:48:07,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262772665] [2024-10-10 23:48:07,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:48:07,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:48:07,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:48:07,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:48:07,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:48:07,481 INFO L87 Difference]: Start difference. First operand 4408 states and 5159 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 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-10 23:48:09,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:48:09,064 INFO L93 Difference]: Finished difference Result 10935 states and 12969 transitions. [2024-10-10 23:48:09,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:48:09,065 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 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 216 [2024-10-10 23:48:09,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:48:09,086 INFO L225 Difference]: With dead ends: 10935 [2024-10-10 23:48:09,086 INFO L226 Difference]: Without dead ends: 6527 [2024-10-10 23:48:09,094 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-10 23:48:09,095 INFO L432 NwaCegarLoop]: 380 mSDtfsCounter, 387 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1216 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 1490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 1216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:48:09,095 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 442 Invalid, 1490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 1216 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-10 23:48:09,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6527 states. [2024-10-10 23:48:09,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6527 to 4381. [2024-10-10 23:48:09,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4381 states, 4380 states have (on average 1.1684931506849314) internal successors, (5118), 4380 states have internal predecessors, (5118), 0 states have call successors, (0), 0 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-10 23:48:09,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4381 states to 4381 states and 5118 transitions. [2024-10-10 23:48:09,181 INFO L78 Accepts]: Start accepts. Automaton has 4381 states and 5118 transitions. Word has length 216 [2024-10-10 23:48:09,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:48:09,182 INFO L471 AbstractCegarLoop]: Abstraction has 4381 states and 5118 transitions. [2024-10-10 23:48:09,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 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-10 23:48:09,183 INFO L276 IsEmpty]: Start isEmpty. Operand 4381 states and 5118 transitions. [2024-10-10 23:48:09,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2024-10-10 23:48:09,186 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:48:09,186 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:48:09,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 23:48:09,187 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:48:09,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:48:09,187 INFO L85 PathProgramCache]: Analyzing trace with hash 973168997, now seen corresponding path program 1 times [2024-10-10 23:48:09,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:48:09,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813850751] [2024-10-10 23:48:09,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:48:09,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:48:09,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:48:09,472 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-10-10 23:48:09,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:48:09,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813850751] [2024-10-10 23:48:09,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813850751] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:48:09,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:48:09,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:48:09,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005259165] [2024-10-10 23:48:09,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:48:09,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:48:09,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:48:09,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:48:09,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:48:09,475 INFO L87 Difference]: Start difference. First operand 4381 states and 5118 transitions. Second operand has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 0 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-10 23:48:10,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:48:10,952 INFO L93 Difference]: Finished difference Result 10044 states and 11705 transitions. [2024-10-10 23:48:10,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:48:10,952 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 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 282 [2024-10-10 23:48:10,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:48:10,965 INFO L225 Difference]: With dead ends: 10044 [2024-10-10 23:48:10,965 INFO L226 Difference]: Without dead ends: 5664 [2024-10-10 23:48:10,971 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-10 23:48:10,972 INFO L432 NwaCegarLoop]: 831 mSDtfsCounter, 373 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 1343 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 891 SdHoareTripleChecker+Invalid, 1410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:48:10,972 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 891 Invalid, 1410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1343 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-10 23:48:10,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5664 states. [2024-10-10 23:48:11,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5664 to 5233. [2024-10-10 23:48:11,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5233 states, 5232 states have (on average 1.1588302752293578) internal successors, (6063), 5232 states have internal predecessors, (6063), 0 states have call successors, (0), 0 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-10 23:48:11,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5233 states to 5233 states and 6063 transitions. [2024-10-10 23:48:11,050 INFO L78 Accepts]: Start accepts. Automaton has 5233 states and 6063 transitions. Word has length 282 [2024-10-10 23:48:11,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:48:11,051 INFO L471 AbstractCegarLoop]: Abstraction has 5233 states and 6063 transitions. [2024-10-10 23:48:11,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 0 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-10 23:48:11,051 INFO L276 IsEmpty]: Start isEmpty. Operand 5233 states and 6063 transitions. [2024-10-10 23:48:11,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2024-10-10 23:48:11,055 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:48:11,055 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:48:11,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 23:48:11,056 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:48:11,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:48:11,056 INFO L85 PathProgramCache]: Analyzing trace with hash 262398569, now seen corresponding path program 1 times [2024-10-10 23:48:11,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:48:11,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888179724] [2024-10-10 23:48:11,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:48:11,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:48:11,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:48:11,325 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 254 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2024-10-10 23:48:11,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:48:11,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888179724] [2024-10-10 23:48:11,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888179724] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:48:11,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:48:11,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:48:11,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944788672] [2024-10-10 23:48:11,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:48:11,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:48:11,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:48:11,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:48:11,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:48:11,328 INFO L87 Difference]: Start difference. First operand 5233 states and 6063 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:48:12,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:48:12,908 INFO L93 Difference]: Finished difference Result 12592 states and 14782 transitions. [2024-10-10 23:48:12,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:48:12,908 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 294 [2024-10-10 23:48:12,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:48:12,925 INFO L225 Difference]: With dead ends: 12592 [2024-10-10 23:48:12,925 INFO L226 Difference]: Without dead ends: 6935 [2024-10-10 23:48:12,930 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-10 23:48:12,931 INFO L432 NwaCegarLoop]: 776 mSDtfsCounter, 383 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 1200 mSolverCounterSat, 258 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 844 SdHoareTripleChecker+Invalid, 1458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 258 IncrementalHoareTripleChecker+Valid, 1200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:48:12,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 844 Invalid, 1458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [258 Valid, 1200 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-10 23:48:12,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6935 states. [2024-10-10 23:48:13,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6935 to 6935. [2024-10-10 23:48:13,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6935 states, 6934 states have (on average 1.1322468993366022) internal successors, (7851), 6934 states have internal predecessors, (7851), 0 states have call successors, (0), 0 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-10 23:48:13,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6935 states to 6935 states and 7851 transitions. [2024-10-10 23:48:13,045 INFO L78 Accepts]: Start accepts. Automaton has 6935 states and 7851 transitions. Word has length 294 [2024-10-10 23:48:13,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:48:13,045 INFO L471 AbstractCegarLoop]: Abstraction has 6935 states and 7851 transitions. [2024-10-10 23:48:13,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:48:13,046 INFO L276 IsEmpty]: Start isEmpty. Operand 6935 states and 7851 transitions. [2024-10-10 23:48:13,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2024-10-10 23:48:13,051 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:48:13,051 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:48:13,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-10 23:48:13,052 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:48:13,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:48:13,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1489443268, now seen corresponding path program 1 times [2024-10-10 23:48:13,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:48:13,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368792564] [2024-10-10 23:48:13,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:48:13,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:48:13,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:48:13,611 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 430 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:48:13,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:48:13,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368792564] [2024-10-10 23:48:13,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368792564] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:48:13,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:48:13,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 23:48:13,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706004627] [2024-10-10 23:48:13,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:48:13,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:48:13,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:48:13,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:48:13,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:48:13,613 INFO L87 Difference]: Start difference. First operand 6935 states and 7851 transitions. Second operand has 4 states, 4 states have (on average 83.5) internal successors, (334), 4 states have internal predecessors, (334), 0 states have call successors, (0), 0 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-10 23:48:16,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:48:16,193 INFO L93 Difference]: Finished difference Result 21979 states and 24836 transitions. [2024-10-10 23:48:16,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:48:16,197 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 83.5) internal successors, (334), 4 states have internal predecessors, (334), 0 states have call successors, (0), 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 334 [2024-10-10 23:48:16,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:48:16,225 INFO L225 Difference]: With dead ends: 21979 [2024-10-10 23:48:16,225 INFO L226 Difference]: Without dead ends: 15045 [2024-10-10 23:48:16,235 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-10 23:48:16,236 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 821 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 2437 mSolverCounterSat, 490 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 821 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 2927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 490 IncrementalHoareTripleChecker+Valid, 2437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:48:16,236 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [821 Valid, 221 Invalid, 2927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [490 Valid, 2437 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-10 23:48:16,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15045 states. [2024-10-10 23:48:16,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15045 to 13336. [2024-10-10 23:48:16,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13336 states, 13335 states have (on average 1.133933258342707) internal successors, (15121), 13335 states have internal predecessors, (15121), 0 states have call successors, (0), 0 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-10 23:48:16,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13336 states to 13336 states and 15121 transitions. [2024-10-10 23:48:16,443 INFO L78 Accepts]: Start accepts. Automaton has 13336 states and 15121 transitions. Word has length 334 [2024-10-10 23:48:16,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:48:16,444 INFO L471 AbstractCegarLoop]: Abstraction has 13336 states and 15121 transitions. [2024-10-10 23:48:16,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.5) internal successors, (334), 4 states have internal predecessors, (334), 0 states have call successors, (0), 0 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-10 23:48:16,445 INFO L276 IsEmpty]: Start isEmpty. Operand 13336 states and 15121 transitions. [2024-10-10 23:48:16,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2024-10-10 23:48:16,451 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:48:16,451 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 23:48:16,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-10 23:48:16,452 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:48:16,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:48:16,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1394061168, now seen corresponding path program 1 times [2024-10-10 23:48:16,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:48:16,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771163358] [2024-10-10 23:48:16,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:48:16,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:48:16,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:48:16,851 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-10-10 23:48:16,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:48:16,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771163358] [2024-10-10 23:48:16,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771163358] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:48:16,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:48:16,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:48:16,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011337384] [2024-10-10 23:48:16,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:48:16,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:48:16,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:48:16,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:48:16,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:48:16,856 INFO L87 Difference]: Start difference. First operand 13336 states and 15121 transitions. Second operand has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 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-10 23:48:18,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:48:18,585 INFO L93 Difference]: Finished difference Result 35222 states and 39900 transitions. [2024-10-10 23:48:18,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:48:18,586 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 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 351 [2024-10-10 23:48:18,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:48:18,628 INFO L225 Difference]: With dead ends: 35222 [2024-10-10 23:48:18,628 INFO L226 Difference]: Without dead ends: 21887 [2024-10-10 23:48:18,647 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-10 23:48:18,648 INFO L432 NwaCegarLoop]: 766 mSDtfsCounter, 438 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 1364 mSolverCounterSat, 216 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 1580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 216 IncrementalHoareTripleChecker+Valid, 1364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:48:18,648 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 817 Invalid, 1580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [216 Valid, 1364 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-10 23:48:18,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21887 states. [2024-10-10 23:48:18,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21887 to 21014. [2024-10-10 23:48:18,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21014 states, 21013 states have (on average 1.1174986912863465) internal successors, (23482), 21013 states have internal predecessors, (23482), 0 states have call successors, (0), 0 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-10 23:48:18,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21014 states to 21014 states and 23482 transitions. [2024-10-10 23:48:18,936 INFO L78 Accepts]: Start accepts. Automaton has 21014 states and 23482 transitions. Word has length 351 [2024-10-10 23:48:18,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:48:18,937 INFO L471 AbstractCegarLoop]: Abstraction has 21014 states and 23482 transitions. [2024-10-10 23:48:18,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 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-10 23:48:18,938 INFO L276 IsEmpty]: Start isEmpty. Operand 21014 states and 23482 transitions. [2024-10-10 23:48:18,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2024-10-10 23:48:18,946 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:48:18,947 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:48:18,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-10 23:48:18,947 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:48:18,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:48:18,948 INFO L85 PathProgramCache]: Analyzing trace with hash -544006677, now seen corresponding path program 1 times [2024-10-10 23:48:18,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:48:18,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22316310] [2024-10-10 23:48:18,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:48:18,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:48:18,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:48:19,228 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 287 proven. 0 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2024-10-10 23:48:19,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:48:19,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22316310] [2024-10-10 23:48:19,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22316310] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:48:19,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:48:19,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:48:19,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278494504] [2024-10-10 23:48:19,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:48:19,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:48:19,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:48:19,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:48:19,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:48:19,231 INFO L87 Difference]: Start difference. First operand 21014 states and 23482 transitions. Second operand has 3 states, 3 states have (on average 73.0) internal successors, (219), 2 states have internal predecessors, (219), 0 states have call successors, (0), 0 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-10 23:48:20,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:48:20,028 INFO L93 Difference]: Finished difference Result 42012 states and 46948 transitions. [2024-10-10 23:48:20,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:48:20,028 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 2 states have internal predecessors, (219), 0 states have call successors, (0), 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 360 [2024-10-10 23:48:20,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:48:20,060 INFO L225 Difference]: With dead ends: 42012 [2024-10-10 23:48:20,060 INFO L226 Difference]: Without dead ends: 20999 [2024-10-10 23:48:20,084 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10 23:48:20,084 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 669 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 680 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:48:20,086 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [669 Valid, 120 Invalid, 689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 680 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:48:20,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20999 states. [2024-10-10 23:48:20,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20999 to 20994. [2024-10-10 23:48:20,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20994 states, 20993 states have (on average 1.1166579335969133) internal successors, (23442), 20993 states have internal predecessors, (23442), 0 states have call successors, (0), 0 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-10 23:48:20,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20994 states to 20994 states and 23442 transitions. [2024-10-10 23:48:20,335 INFO L78 Accepts]: Start accepts. Automaton has 20994 states and 23442 transitions. Word has length 360 [2024-10-10 23:48:20,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:48:20,336 INFO L471 AbstractCegarLoop]: Abstraction has 20994 states and 23442 transitions. [2024-10-10 23:48:20,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 2 states have internal predecessors, (219), 0 states have call successors, (0), 0 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-10 23:48:20,336 INFO L276 IsEmpty]: Start isEmpty. Operand 20994 states and 23442 transitions. [2024-10-10 23:48:20,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2024-10-10 23:48:20,342 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:48:20,343 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:48:20,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-10 23:48:20,343 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:48:20,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:48:20,344 INFO L85 PathProgramCache]: Analyzing trace with hash 966223054, now seen corresponding path program 1 times [2024-10-10 23:48:20,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:48:20,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147103230] [2024-10-10 23:48:20,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:48:20,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:48:20,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:48:20,733 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2024-10-10 23:48:20,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:48:20,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147103230] [2024-10-10 23:48:20,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147103230] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:48:20,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:48:20,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:48:20,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335925135] [2024-10-10 23:48:20,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:48:20,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:48:20,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:48:20,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:48:20,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:48:20,736 INFO L87 Difference]: Start difference. First operand 20994 states and 23442 transitions. Second operand has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 0 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-10 23:48:22,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:48:22,243 INFO L93 Difference]: Finished difference Result 48383 states and 54182 transitions. [2024-10-10 23:48:22,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:48:22,244 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 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 377 [2024-10-10 23:48:22,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:48:22,286 INFO L225 Difference]: With dead ends: 48383 [2024-10-10 23:48:22,287 INFO L226 Difference]: Without dead ends: 27390 [2024-10-10 23:48:22,306 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-10 23:48:22,308 INFO L432 NwaCegarLoop]: 232 mSDtfsCounter, 443 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 1243 mSolverCounterSat, 319 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 1562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 319 IncrementalHoareTripleChecker+Valid, 1243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:48:22,308 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 253 Invalid, 1562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [319 Valid, 1243 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-10 23:48:22,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27390 states. [2024-10-10 23:48:22,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27390 to 25234. [2024-10-10 23:48:22,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25234 states, 25233 states have (on average 1.1257876590179527) internal successors, (28407), 25233 states have internal predecessors, (28407), 0 states have call successors, (0), 0 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-10 23:48:22,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25234 states to 25234 states and 28407 transitions. [2024-10-10 23:48:22,605 INFO L78 Accepts]: Start accepts. Automaton has 25234 states and 28407 transitions. Word has length 377 [2024-10-10 23:48:22,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:48:22,606 INFO L471 AbstractCegarLoop]: Abstraction has 25234 states and 28407 transitions. [2024-10-10 23:48:22,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 0 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-10 23:48:22,607 INFO L276 IsEmpty]: Start isEmpty. Operand 25234 states and 28407 transitions. [2024-10-10 23:48:22,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2024-10-10 23:48:22,615 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:48:22,615 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 23:48:22,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-10 23:48:22,616 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:48:22,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:48:22,616 INFO L85 PathProgramCache]: Analyzing trace with hash -67541884, now seen corresponding path program 1 times [2024-10-10 23:48:22,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:48:22,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474061778] [2024-10-10 23:48:22,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:48:22,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:48:22,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:48:23,027 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:48:23,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:48:23,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474061778] [2024-10-10 23:48:23,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474061778] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:48:23,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:48:23,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:48:23,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970790861] [2024-10-10 23:48:23,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:48:23,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:48:23,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:48:23,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:48:23,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:48:23,031 INFO L87 Difference]: Start difference. First operand 25234 states and 28407 transitions. Second operand has 4 states, 4 states have (on average 100.25) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 0 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-10 23:48:25,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:48:25,070 INFO L93 Difference]: Finished difference Result 61554 states and 69145 transitions. [2024-10-10 23:48:25,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:48:25,071 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 100.25) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 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 401 [2024-10-10 23:48:25,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:48:25,112 INFO L225 Difference]: With dead ends: 61554 [2024-10-10 23:48:25,112 INFO L226 Difference]: Without dead ends: 35896 [2024-10-10 23:48:25,136 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-10 23:48:25,137 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 610 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 2340 mSolverCounterSat, 310 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 610 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 2650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 310 IncrementalHoareTripleChecker+Valid, 2340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-10 23:48:25,137 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [610 Valid, 184 Invalid, 2650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [310 Valid, 2340 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-10 23:48:25,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35896 states. [2024-10-10 23:48:25,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35896 to 35895. [2024-10-10 23:48:25,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35895 states, 35894 states have (on average 1.1228060400066864) internal successors, (40302), 35894 states have internal predecessors, (40302), 0 states have call successors, (0), 0 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-10 23:48:25,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35895 states to 35895 states and 40302 transitions. [2024-10-10 23:48:25,663 INFO L78 Accepts]: Start accepts. Automaton has 35895 states and 40302 transitions. Word has length 401 [2024-10-10 23:48:25,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:48:25,664 INFO L471 AbstractCegarLoop]: Abstraction has 35895 states and 40302 transitions. [2024-10-10 23:48:25,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.25) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 0 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-10 23:48:25,664 INFO L276 IsEmpty]: Start isEmpty. Operand 35895 states and 40302 transitions. [2024-10-10 23:48:25,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2024-10-10 23:48:25,673 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:48:25,674 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:48:25,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-10 23:48:25,674 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:48:25,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:48:25,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1061119686, now seen corresponding path program 1 times [2024-10-10 23:48:25,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:48:25,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680428280] [2024-10-10 23:48:25,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:48:25,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:48:25,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:48:25,912 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 320 proven. 0 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2024-10-10 23:48:25,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:48:25,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680428280] [2024-10-10 23:48:25,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680428280] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:48:25,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:48:25,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:48:25,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54321066] [2024-10-10 23:48:25,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:48:25,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:48:25,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:48:25,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:48:25,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:48:25,915 INFO L87 Difference]: Start difference. First operand 35895 states and 40302 transitions. Second operand has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 0 states have call successors, (0), 0 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-10 23:48:27,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:48:27,680 INFO L93 Difference]: Finished difference Result 81167 states and 91135 transitions. [2024-10-10 23:48:27,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:48:27,681 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 0 states have call successors, (0), 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 423 [2024-10-10 23:48:27,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:48:27,742 INFO L225 Difference]: With dead ends: 81167 [2024-10-10 23:48:27,743 INFO L226 Difference]: Without dead ends: 45273 [2024-10-10 23:48:27,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-10 23:48:27,764 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 502 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 1290 mSolverCounterSat, 254 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 502 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 1544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 254 IncrementalHoareTripleChecker+Valid, 1290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:48:27,764 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [502 Valid, 222 Invalid, 1544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [254 Valid, 1290 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-10 23:48:27,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45273 states. [2024-10-10 23:48:28,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45273 to 45257. [2024-10-10 23:48:28,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45257 states, 45256 states have (on average 1.1104604914265512) internal successors, (50255), 45256 states have internal predecessors, (50255), 0 states have call successors, (0), 0 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-10 23:48:28,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45257 states to 45257 states and 50255 transitions. [2024-10-10 23:48:28,316 INFO L78 Accepts]: Start accepts. Automaton has 45257 states and 50255 transitions. Word has length 423 [2024-10-10 23:48:28,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:48:28,316 INFO L471 AbstractCegarLoop]: Abstraction has 45257 states and 50255 transitions. [2024-10-10 23:48:28,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 0 states have call successors, (0), 0 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-10 23:48:28,316 INFO L276 IsEmpty]: Start isEmpty. Operand 45257 states and 50255 transitions. [2024-10-10 23:48:28,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 525 [2024-10-10 23:48:28,333 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:48:28,333 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:48:28,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-10 23:48:28,333 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:48:28,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:48:28,334 INFO L85 PathProgramCache]: Analyzing trace with hash -128129830, now seen corresponding path program 1 times [2024-10-10 23:48:28,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:48:28,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266501732] [2024-10-10 23:48:28,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:48:28,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:48:28,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:48:28,738 INFO L134 CoverageAnalysis]: Checked inductivity of 494 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-10 23:48:28,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:48:28,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266501732] [2024-10-10 23:48:28,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266501732] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:48:28,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:48:28,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:48:28,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421956725] [2024-10-10 23:48:28,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:48:28,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:48:28,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:48:28,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:48:28,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:48:28,741 INFO L87 Difference]: Start difference. First operand 45257 states and 50255 transitions. Second operand has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 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-10 23:48:30,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:48:30,487 INFO L93 Difference]: Finished difference Result 99443 states and 111248 transitions. [2024-10-10 23:48:30,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:48:30,487 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 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 524 [2024-10-10 23:48:30,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:48:30,552 INFO L225 Difference]: With dead ends: 99443 [2024-10-10 23:48:30,552 INFO L226 Difference]: Without dead ends: 52480 [2024-10-10 23:48:30,589 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-10 23:48:30,590 INFO L432 NwaCegarLoop]: 705 mSDtfsCounter, 411 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 1219 mSolverCounterSat, 229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 1448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 229 IncrementalHoareTripleChecker+Valid, 1219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:48:30,591 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [411 Valid, 760 Invalid, 1448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [229 Valid, 1219 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-10 23:48:30,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52480 states. [2024-10-10 23:48:31,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52480 to 52053. [2024-10-10 23:48:31,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52053 states, 52052 states have (on average 1.104337969722585) internal successors, (57483), 52052 states have internal predecessors, (57483), 0 states have call successors, (0), 0 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-10 23:48:31,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52053 states to 52053 states and 57483 transitions. [2024-10-10 23:48:31,386 INFO L78 Accepts]: Start accepts. Automaton has 52053 states and 57483 transitions. Word has length 524 [2024-10-10 23:48:31,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:48:31,387 INFO L471 AbstractCegarLoop]: Abstraction has 52053 states and 57483 transitions. [2024-10-10 23:48:31,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 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-10 23:48:31,387 INFO L276 IsEmpty]: Start isEmpty. Operand 52053 states and 57483 transitions. [2024-10-10 23:48:31,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 548 [2024-10-10 23:48:31,405 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:48:31,405 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 23:48:31,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-10 23:48:31,405 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:48:31,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:48:31,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1714721869, now seen corresponding path program 1 times [2024-10-10 23:48:31,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:48:31,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492082113] [2024-10-10 23:48:31,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:48:31,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:48:31,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:48:32,505 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 61 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:48:32,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:48:32,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492082113] [2024-10-10 23:48:32,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492082113] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:48:32,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [739494179] [2024-10-10 23:48:32,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:48:32,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:48:32,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:48:32,509 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:48:32,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-10 23:48:32,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:48:32,688 INFO L255 TraceCheckSpWp]: Trace formula consists of 656 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-10 23:48:32,704 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:48:33,374 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 61 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:48:33,374 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 23:48:34,048 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 203 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:48:34,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [739494179] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-10 23:48:34,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-10 23:48:34,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 7 [2024-10-10 23:48:34,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127220640] [2024-10-10 23:48:34,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:48:34,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-10 23:48:34,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:48:34,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-10 23:48:34,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2024-10-10 23:48:34,053 INFO L87 Difference]: Start difference. First operand 52053 states and 57483 transitions. Second operand has 5 states, 5 states have (on average 109.4) internal successors, (547), 4 states have internal predecessors, (547), 0 states have call successors, (0), 0 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-10 23:48:37,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:48:37,467 INFO L93 Difference]: Finished difference Result 146296 states and 161538 transitions. [2024-10-10 23:48:37,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-10 23:48:37,468 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 109.4) internal successors, (547), 4 states have internal predecessors, (547), 0 states have call successors, (0), 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 547 [2024-10-10 23:48:37,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:48:37,563 INFO L225 Difference]: With dead ends: 146296 [2024-10-10 23:48:37,563 INFO L226 Difference]: Without dead ends: 91266 [2024-10-10 23:48:37,589 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1096 GetRequests, 1090 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2024-10-10 23:48:37,590 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 1196 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 2683 mSolverCounterSat, 1198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1196 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 3881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1198 IncrementalHoareTripleChecker+Valid, 2683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:48:37,590 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1196 Valid, 170 Invalid, 3881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1198 Valid, 2683 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-10 23:48:37,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91266 states. [2024-10-10 23:48:38,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91266 to 75075. [2024-10-10 23:48:38,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75075 states, 75074 states have (on average 1.1009803660388418) internal successors, (82655), 75074 states have internal predecessors, (82655), 0 states have call successors, (0), 0 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-10 23:48:38,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75075 states to 75075 states and 82655 transitions. [2024-10-10 23:48:38,624 INFO L78 Accepts]: Start accepts. Automaton has 75075 states and 82655 transitions. Word has length 547 [2024-10-10 23:48:38,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:48:38,625 INFO L471 AbstractCegarLoop]: Abstraction has 75075 states and 82655 transitions. [2024-10-10 23:48:38,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.4) internal successors, (547), 4 states have internal predecessors, (547), 0 states have call successors, (0), 0 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-10 23:48:38,625 INFO L276 IsEmpty]: Start isEmpty. Operand 75075 states and 82655 transitions. [2024-10-10 23:48:38,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 577 [2024-10-10 23:48:38,639 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:48:38,639 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:48:38,652 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-10 23:48:38,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-10 23:48:38,840 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:48:38,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:48:38,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1013662199, now seen corresponding path program 1 times [2024-10-10 23:48:38,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:48:38,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344043348] [2024-10-10 23:48:38,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:48:38,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:48:38,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:48:39,434 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2024-10-10 23:48:39,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:48:39,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344043348] [2024-10-10 23:48:39,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344043348] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:48:39,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:48:39,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:48:39,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193365833] [2024-10-10 23:48:39,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:48:39,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:48:39,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:48:39,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:48:39,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:48:39,440 INFO L87 Difference]: Start difference. First operand 75075 states and 82655 transitions. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 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-10 23:48:41,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:48:41,175 INFO L93 Difference]: Finished difference Result 144121 states and 158276 transitions. [2024-10-10 23:48:41,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:48:41,176 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 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 576 [2024-10-10 23:48:41,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:48:41,256 INFO L225 Difference]: With dead ends: 144121 [2024-10-10 23:48:41,256 INFO L226 Difference]: Without dead ends: 64366 [2024-10-10 23:48:41,295 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-10 23:48:41,296 INFO L432 NwaCegarLoop]: 600 mSDtfsCounter, 421 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 1137 mSolverCounterSat, 218 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 1355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 218 IncrementalHoareTripleChecker+Valid, 1137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:48:41,296 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 630 Invalid, 1355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [218 Valid, 1137 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-10 23:48:41,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64366 states. [2024-10-10 23:48:42,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64366 to 64362. [2024-10-10 23:48:42,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64362 states, 64361 states have (on average 1.0824101552182221) internal successors, (69665), 64361 states have internal predecessors, (69665), 0 states have call successors, (0), 0 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-10 23:48:42,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64362 states to 64362 states and 69665 transitions. [2024-10-10 23:48:42,217 INFO L78 Accepts]: Start accepts. Automaton has 64362 states and 69665 transitions. Word has length 576 [2024-10-10 23:48:42,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:48:42,218 INFO L471 AbstractCegarLoop]: Abstraction has 64362 states and 69665 transitions. [2024-10-10 23:48:42,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 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-10 23:48:42,218 INFO L276 IsEmpty]: Start isEmpty. Operand 64362 states and 69665 transitions. [2024-10-10 23:48:42,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 797 [2024-10-10 23:48:42,248 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:48:42,248 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 23:48:42,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-10 23:48:42,249 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:48:42,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:48:42,249 INFO L85 PathProgramCache]: Analyzing trace with hash 73774505, now seen corresponding path program 1 times [2024-10-10 23:48:42,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:48:42,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100760821] [2024-10-10 23:48:42,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:48:42,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:48:42,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:48:42,907 INFO L134 CoverageAnalysis]: Checked inductivity of 1216 backedges. 304 proven. 0 refuted. 0 times theorem prover too weak. 912 trivial. 0 not checked. [2024-10-10 23:48:42,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:48:42,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100760821] [2024-10-10 23:48:42,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100760821] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:48:42,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:48:42,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:48:42,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158235846] [2024-10-10 23:48:42,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:48:42,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:48:42,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:48:42,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:48:42,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:48:42,911 INFO L87 Difference]: Start difference. First operand 64362 states and 69665 transitions. Second operand has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 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-10 23:48:44,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:48:44,517 INFO L93 Difference]: Finished difference Result 134667 states and 145793 transitions. [2024-10-10 23:48:44,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:48:44,518 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 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 796 [2024-10-10 23:48:44,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:48:44,590 INFO L225 Difference]: With dead ends: 134667 [2024-10-10 23:48:44,590 INFO L226 Difference]: Without dead ends: 67755 [2024-10-10 23:48:44,628 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-10 23:48:44,629 INFO L432 NwaCegarLoop]: 675 mSDtfsCounter, 443 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 1076 mSolverCounterSat, 185 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 1261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 1076 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:48:44,629 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 714 Invalid, 1261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [185 Valid, 1076 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-10 23:48:44,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67755 states. [2024-10-10 23:48:45,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67755 to 63927. [2024-10-10 23:48:45,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63927 states, 63926 states have (on average 1.0723336357663549) internal successors, (68550), 63926 states have internal predecessors, (68550), 0 states have call successors, (0), 0 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-10 23:48:45,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63927 states to 63927 states and 68550 transitions. [2024-10-10 23:48:45,350 INFO L78 Accepts]: Start accepts. Automaton has 63927 states and 68550 transitions. Word has length 796 [2024-10-10 23:48:45,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:48:45,350 INFO L471 AbstractCegarLoop]: Abstraction has 63927 states and 68550 transitions. [2024-10-10 23:48:45,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 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-10 23:48:45,351 INFO L276 IsEmpty]: Start isEmpty. Operand 63927 states and 68550 transitions. [2024-10-10 23:48:45,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 939 [2024-10-10 23:48:45,393 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:48:45,393 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 23:48:45,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-10 23:48:45,394 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:48:45,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:48:45,395 INFO L85 PathProgramCache]: Analyzing trace with hash -418891996, now seen corresponding path program 1 times [2024-10-10 23:48:45,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:48:45,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019402303] [2024-10-10 23:48:45,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:48:45,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:48:45,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:48:47,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1289 backedges. 1154 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2024-10-10 23:48:47,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:48:47,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019402303] [2024-10-10 23:48:47,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019402303] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:48:47,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:48:47,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 23:48:47,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291377409] [2024-10-10 23:48:47,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:48:47,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:48:47,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:48:47,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:48:47,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:48:47,104 INFO L87 Difference]: Start difference. First operand 63927 states and 68550 transitions. Second operand has 4 states, 4 states have (on average 201.25) internal successors, (805), 4 states have internal predecessors, (805), 0 states have call successors, (0), 0 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-10 23:48:49,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:48:49,296 INFO L93 Difference]: Finished difference Result 131260 states and 140855 transitions. [2024-10-10 23:48:49,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:48:49,297 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 201.25) internal successors, (805), 4 states have internal predecessors, (805), 0 states have call successors, (0), 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 938 [2024-10-10 23:48:49,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:48:49,390 INFO L225 Difference]: With dead ends: 131260 [2024-10-10 23:48:49,391 INFO L226 Difference]: Without dead ends: 67334 [2024-10-10 23:48:49,436 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-10 23:48:49,436 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 652 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 2185 mSolverCounterSat, 338 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 652 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 2523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 338 IncrementalHoareTripleChecker+Valid, 2185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-10 23:48:49,437 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [652 Valid, 127 Invalid, 2523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [338 Valid, 2185 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-10 23:48:49,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67334 states. [2024-10-10 23:48:50,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67334 to 63077. [2024-10-10 23:48:50,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63077 states, 63076 states have (on average 1.070898598516076) internal successors, (67548), 63076 states have internal predecessors, (67548), 0 states have call successors, (0), 0 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-10 23:48:50,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63077 states to 63077 states and 67548 transitions. [2024-10-10 23:48:50,420 INFO L78 Accepts]: Start accepts. Automaton has 63077 states and 67548 transitions. Word has length 938 [2024-10-10 23:48:50,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:48:50,420 INFO L471 AbstractCegarLoop]: Abstraction has 63077 states and 67548 transitions. [2024-10-10 23:48:50,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 201.25) internal successors, (805), 4 states have internal predecessors, (805), 0 states have call successors, (0), 0 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-10 23:48:50,421 INFO L276 IsEmpty]: Start isEmpty. Operand 63077 states and 67548 transitions. [2024-10-10 23:48:50,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 955 [2024-10-10 23:48:50,464 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:48:50,465 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 23:48:50,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-10 23:48:50,465 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:48:50,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:48:50,466 INFO L85 PathProgramCache]: Analyzing trace with hash -2010060766, now seen corresponding path program 1 times [2024-10-10 23:48:50,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:48:50,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246774651] [2024-10-10 23:48:50,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:48:50,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:48:50,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:48:51,415 INFO L134 CoverageAnalysis]: Checked inductivity of 1377 backedges. 1034 proven. 0 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2024-10-10 23:48:51,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:48:51,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246774651] [2024-10-10 23:48:51,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246774651] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:48:51,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:48:51,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 23:48:51,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235568522] [2024-10-10 23:48:51,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:48:51,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:48:51,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:48:51,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:48:51,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:48:51,419 INFO L87 Difference]: Start difference. First operand 63077 states and 67548 transitions. Second operand has 4 states, 4 states have (on average 174.0) internal successors, (696), 4 states have internal predecessors, (696), 0 states have call successors, (0), 0 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-10 23:48:53,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:48:53,839 INFO L93 Difference]: Finished difference Result 129537 states and 138707 transitions. [2024-10-10 23:48:53,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:48:53,840 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 174.0) internal successors, (696), 4 states have internal predecessors, (696), 0 states have call successors, (0), 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 954 [2024-10-10 23:48:53,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:48:53,928 INFO L225 Difference]: With dead ends: 129537 [2024-10-10 23:48:53,928 INFO L226 Difference]: Without dead ends: 66461 [2024-10-10 23:48:53,974 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-10 23:48:53,975 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 814 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 2669 mSolverCounterSat, 265 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 814 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 2934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 265 IncrementalHoareTripleChecker+Valid, 2669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:48:53,975 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [814 Valid, 277 Invalid, 2934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [265 Valid, 2669 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-10 23:48:54,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66461 states. [2024-10-10 23:48:54,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66461 to 63904. [2024-10-10 23:48:54,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63904 states, 63903 states have (on average 1.0638311190397947) internal successors, (67982), 63903 states have internal predecessors, (67982), 0 states have call successors, (0), 0 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-10 23:48:54,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63904 states to 63904 states and 67982 transitions. [2024-10-10 23:48:54,824 INFO L78 Accepts]: Start accepts. Automaton has 63904 states and 67982 transitions. Word has length 954 [2024-10-10 23:48:54,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:48:54,824 INFO L471 AbstractCegarLoop]: Abstraction has 63904 states and 67982 transitions. [2024-10-10 23:48:54,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 174.0) internal successors, (696), 4 states have internal predecessors, (696), 0 states have call successors, (0), 0 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-10 23:48:54,825 INFO L276 IsEmpty]: Start isEmpty. Operand 63904 states and 67982 transitions. [2024-10-10 23:48:54,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 980 [2024-10-10 23:48:54,854 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:48:54,854 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:48:54,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-10 23:48:54,855 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:48:54,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:48:54,855 INFO L85 PathProgramCache]: Analyzing trace with hash 779529413, now seen corresponding path program 1 times [2024-10-10 23:48:54,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:48:54,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557182122] [2024-10-10 23:48:54,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:48:54,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:48:54,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:48:56,141 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 755 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2024-10-10 23:48:56,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:48:56,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557182122] [2024-10-10 23:48:56,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557182122] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:48:56,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:48:56,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 23:48:56,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010975327] [2024-10-10 23:48:56,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:48:56,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:48:56,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:48:56,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:48:56,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:48:56,144 INFO L87 Difference]: Start difference. First operand 63904 states and 67982 transitions. Second operand has 4 states, 4 states have (on average 198.5) internal successors, (794), 4 states have internal predecessors, (794), 0 states have call successors, (0), 0 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-10 23:48:58,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:48:58,105 INFO L93 Difference]: Finished difference Result 121400 states and 129097 transitions. [2024-10-10 23:48:58,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:48:58,106 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 198.5) internal successors, (794), 4 states have internal predecessors, (794), 0 states have call successors, (0), 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 979 [2024-10-10 23:48:58,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:48:58,108 INFO L225 Difference]: With dead ends: 121400 [2024-10-10 23:48:58,108 INFO L226 Difference]: Without dead ends: 0 [2024-10-10 23:48:58,148 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-10 23:48:58,149 INFO L432 NwaCegarLoop]: 669 mSDtfsCounter, 461 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 2017 mSolverCounterSat, 194 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 461 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 2211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 2017 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:48:58,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [461 Valid, 707 Invalid, 2211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 2017 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-10 23:48:58,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-10 23:48:58,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-10 23:48:58,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 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-10 23:48:58,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-10 23:48:58,151 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 979 [2024-10-10 23:48:58,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:48:58,151 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-10 23:48:58,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 198.5) internal successors, (794), 4 states have internal predecessors, (794), 0 states have call successors, (0), 0 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-10 23:48:58,152 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-10 23:48:58,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-10 23:48:58,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-10 23:48:58,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-10 23:48:58,160 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:48:58,161 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-10 23:49:04,480 WARN L286 SmtUtils]: Spent 6.31s on a formula simplification. DAG size of input: 403 DAG size of output: 486 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or)