./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label07.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label07.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3c4a130150e3546b51c6f5052a66be25e85ab754f6eb3524346398a032a444aa --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 02:42:15,370 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 02:42:15,452 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 02:42:15,458 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 02:42:15,458 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 02:42:15,481 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 02:42:15,482 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 02:42:15,482 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 02:42:15,484 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 02:42:15,484 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 02:42:15,484 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 02:42:15,485 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 02:42:15,485 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 02:42:15,485 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 02:42:15,486 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 02:42:15,486 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 02:42:15,486 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 02:42:15,487 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 02:42:15,487 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 02:42:15,489 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 02:42:15,490 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 02:42:15,493 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 02:42:15,493 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 02:42:15,493 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 02:42:15,493 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 02:42:15,494 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 02:42:15,494 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 02:42:15,494 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 02:42:15,494 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 02:42:15,495 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 02:42:15,495 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 02:42:15,495 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 02:42:15,495 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 02:42:15,496 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 02:42:15,496 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 02:42:15,496 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 02:42:15,496 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 02:42:15,497 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 02:42:15,497 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 02:42:15,497 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 02:42:15,497 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 02:42:15,498 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 02:42:15,498 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3c4a130150e3546b51c6f5052a66be25e85ab754f6eb3524346398a032a444aa [2024-10-24 02:42:15,721 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 02:42:15,744 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 02:42:15,749 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 02:42:15,750 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 02:42:15,751 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 02:42:15,752 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label07.c [2024-10-24 02:42:17,195 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 02:42:17,605 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 02:42:17,607 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label07.c [2024-10-24 02:42:17,640 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80b3526c7/d663beb5990b45558df6fd6ca1cdf0a1/FLAGc2b9e8614 [2024-10-24 02:42:17,759 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80b3526c7/d663beb5990b45558df6fd6ca1cdf0a1 [2024-10-24 02:42:17,761 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 02:42:17,763 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 02:42:17,765 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 02:42:17,765 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 02:42:17,798 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 02:42:17,799 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:42:17" (1/1) ... [2024-10-24 02:42:17,802 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57dddfd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:42:17, skipping insertion in model container [2024-10-24 02:42:17,803 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:42:17" (1/1) ... [2024-10-24 02:42:17,918 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 02:42:18,210 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/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label07.c[6450,6463] [2024-10-24 02:42:18,230 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/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label07.c[7292,7305] [2024-10-24 02:42:18,996 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 02:42:19,008 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 02:42:19,035 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/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label07.c[6450,6463] [2024-10-24 02:42:19,038 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/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label07.c[7292,7305] [2024-10-24 02:42:19,419 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 02:42:19,450 INFO L204 MainTranslator]: Completed translation [2024-10-24 02:42:19,450 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:42:19 WrapperNode [2024-10-24 02:42:19,451 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 02:42:19,452 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 02:42:19,452 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 02:42:19,452 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 02:42:19,459 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:42:19" (1/1) ... [2024-10-24 02:42:19,556 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:42:19" (1/1) ... [2024-10-24 02:42:19,866 INFO L138 Inliner]: procedures = 35, calls = 20, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 4983 [2024-10-24 02:42:19,866 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 02:42:19,867 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 02:42:19,867 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 02:42:19,867 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 02:42:19,888 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:42:19" (1/1) ... [2024-10-24 02:42:19,889 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:42:19" (1/1) ... [2024-10-24 02:42:19,933 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:42:19" (1/1) ... [2024-10-24 02:42:20,099 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-24 02:42:20,099 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:42:19" (1/1) ... [2024-10-24 02:42:20,099 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:42:19" (1/1) ... [2024-10-24 02:42:20,252 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:42:19" (1/1) ... [2024-10-24 02:42:20,280 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:42:19" (1/1) ... [2024-10-24 02:42:20,309 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:42:19" (1/1) ... [2024-10-24 02:42:20,326 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:42:19" (1/1) ... [2024-10-24 02:42:20,375 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 02:42:20,376 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 02:42:20,377 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 02:42:20,377 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 02:42:20,378 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:42:19" (1/1) ... [2024-10-24 02:42:20,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 02:42:20,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 02:42:20,409 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 02:42:20,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 02:42:20,455 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 02:42:20,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 02:42:20,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 02:42:20,455 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 02:42:20,569 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 02:42:20,571 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 02:42:24,785 INFO L? ?]: Removed 734 outVars from TransFormulas that were not future-live. [2024-10-24 02:42:24,785 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 02:42:24,859 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 02:42:24,859 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-24 02:42:24,860 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:42:24 BoogieIcfgContainer [2024-10-24 02:42:24,860 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 02:42:24,862 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 02:42:24,863 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 02:42:24,866 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 02:42:24,866 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 02:42:17" (1/3) ... [2024-10-24 02:42:24,867 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b4cbc9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:42:24, skipping insertion in model container [2024-10-24 02:42:24,867 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:42:19" (2/3) ... [2024-10-24 02:42:24,867 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b4cbc9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:42:24, skipping insertion in model container [2024-10-24 02:42:24,867 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:42:24" (3/3) ... [2024-10-24 02:42:24,870 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label07.c [2024-10-24 02:42:24,887 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 02:42:24,887 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-24 02:42:24,984 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 02:42:24,991 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;@617eccea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 02:42:24,992 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-24 02:42:25,000 INFO L276 IsEmpty]: Start isEmpty. Operand has 809 states, 806 states have (on average 1.978908188585608) internal successors, (1595), 808 states have internal predecessors, (1595), 0 states have call successors, (0), 0 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-24 02:42:25,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-24 02:42:25,007 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:42:25,008 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-24 02:42:25,008 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:42:25,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:42:25,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1085854336, now seen corresponding path program 1 times [2024-10-24 02:42:25,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:42:25,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680043887] [2024-10-24 02:42:25,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:42:25,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:42:25,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:42:25,247 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-24 02:42:25,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:42:25,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680043887] [2024-10-24 02:42:25,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680043887] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:42:25,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:42:25,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 02:42:25,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953083553] [2024-10-24 02:42:25,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:42:25,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 02:42:25,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:42:25,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 02:42:25,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 02:42:25,285 INFO L87 Difference]: Start difference. First operand has 809 states, 806 states have (on average 1.978908188585608) internal successors, (1595), 808 states have internal predecessors, (1595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 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-24 02:42:28,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:42:28,785 INFO L93 Difference]: Finished difference Result 2351 states and 4652 transitions. [2024-10-24 02:42:28,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 02:42:28,787 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2024-10-24 02:42:28,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:42:28,809 INFO L225 Difference]: With dead ends: 2351 [2024-10-24 02:42:28,809 INFO L226 Difference]: Without dead ends: 1556 [2024-10-24 02:42:28,814 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-24 02:42:28,817 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 897 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 2282 mSolverCounterSat, 998 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 897 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 3280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 998 IncrementalHoareTripleChecker+Valid, 2282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-10-24 02:42:28,818 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [897 Valid, 163 Invalid, 3280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [998 Valid, 2282 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-10-24 02:42:28,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1556 states. [2024-10-24 02:42:28,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1556 to 1556. [2024-10-24 02:42:28,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1556 states, 1554 states have (on average 1.8655083655083655) internal successors, (2899), 1555 states have internal predecessors, (2899), 0 states have call successors, (0), 0 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-24 02:42:28,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 2899 transitions. [2024-10-24 02:42:28,952 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 2899 transitions. Word has length 6 [2024-10-24 02:42:28,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:42:28,952 INFO L471 AbstractCegarLoop]: Abstraction has 1556 states and 2899 transitions. [2024-10-24 02:42:28,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 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-24 02:42:28,953 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 2899 transitions. [2024-10-24 02:42:28,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-24 02:42:28,954 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:42:28,954 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 02:42:28,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 02:42:28,955 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:42:28,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:42:28,956 INFO L85 PathProgramCache]: Analyzing trace with hash 2107674030, now seen corresponding path program 1 times [2024-10-24 02:42:28,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:42:28,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203991106] [2024-10-24 02:42:28,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:42:28,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:42:28,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:42:29,123 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-24 02:42:29,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:42:29,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203991106] [2024-10-24 02:42:29,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203991106] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:42:29,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:42:29,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 02:42:29,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005810938] [2024-10-24 02:42:29,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:42:29,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 02:42:29,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:42:29,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 02:42:29,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 02:42:29,129 INFO L87 Difference]: Start difference. First operand 1556 states and 2899 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 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-24 02:42:29,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:42:29,197 INFO L93 Difference]: Finished difference Result 1590 states and 2951 transitions. [2024-10-24 02:42:29,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 02:42:29,198 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2024-10-24 02:42:29,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:42:29,205 INFO L225 Difference]: With dead ends: 1590 [2024-10-24 02:42:29,206 INFO L226 Difference]: Without dead ends: 1556 [2024-10-24 02:42:29,207 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-24 02:42:29,208 INFO L432 NwaCegarLoop]: 1521 mSDtfsCounter, 0 mSDsluCounter, 3022 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4543 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 02:42:29,208 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4543 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 02:42:29,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1556 states. [2024-10-24 02:42:29,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1556 to 1556. [2024-10-24 02:42:29,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1556 states, 1554 states have (on average 1.8552123552123552) internal successors, (2883), 1555 states have internal predecessors, (2883), 0 states have call successors, (0), 0 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-24 02:42:29,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 2883 transitions. [2024-10-24 02:42:29,246 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 2883 transitions. Word has length 17 [2024-10-24 02:42:29,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:42:29,247 INFO L471 AbstractCegarLoop]: Abstraction has 1556 states and 2883 transitions. [2024-10-24 02:42:29,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 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-24 02:42:29,248 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 2883 transitions. [2024-10-24 02:42:29,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-24 02:42:29,249 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:42:29,250 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] [2024-10-24 02:42:29,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 02:42:29,250 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:42:29,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:42:29,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1024653184, now seen corresponding path program 1 times [2024-10-24 02:42:29,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:42:29,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061937398] [2024-10-24 02:42:29,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:42:29,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:42:29,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:42:29,403 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-24 02:42:29,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:42:29,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061937398] [2024-10-24 02:42:29,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061937398] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:42:29,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:42:29,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 02:42:29,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41628412] [2024-10-24 02:42:29,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:42:29,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 02:42:29,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:42:29,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 02:42:29,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 02:42:29,407 INFO L87 Difference]: Start difference. First operand 1556 states and 2883 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 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-24 02:42:29,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:42:29,536 INFO L93 Difference]: Finished difference Result 1742 states and 3177 transitions. [2024-10-24 02:42:29,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 02:42:29,537 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2024-10-24 02:42:29,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:42:29,545 INFO L225 Difference]: With dead ends: 1742 [2024-10-24 02:42:29,545 INFO L226 Difference]: Without dead ends: 1711 [2024-10-24 02:42:29,547 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-24 02:42:29,549 INFO L432 NwaCegarLoop]: 1499 mSDtfsCounter, 4669 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4669 SdHoareTripleChecker+Valid, 1742 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 02:42:29,552 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4669 Valid, 1742 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 02:42:29,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1711 states. [2024-10-24 02:42:29,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1711 to 1585. [2024-10-24 02:42:29,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1585 states, 1583 states have (on average 1.85028427037271) internal successors, (2929), 1584 states have internal predecessors, (2929), 0 states have call successors, (0), 0 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-24 02:42:29,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 2929 transitions. [2024-10-24 02:42:29,592 INFO L78 Accepts]: Start accepts. Automaton has 1585 states and 2929 transitions. Word has length 32 [2024-10-24 02:42:29,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:42:29,592 INFO L471 AbstractCegarLoop]: Abstraction has 1585 states and 2929 transitions. [2024-10-24 02:42:29,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 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-24 02:42:29,593 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 2929 transitions. [2024-10-24 02:42:29,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-24 02:42:29,594 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:42:29,594 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] [2024-10-24 02:42:29,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 02:42:29,594 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:42:29,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:42:29,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1266889168, now seen corresponding path program 1 times [2024-10-24 02:42:29,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:42:29,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410028557] [2024-10-24 02:42:29,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:42:29,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:42:29,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:42:29,682 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-24 02:42:29,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:42:29,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410028557] [2024-10-24 02:42:29,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410028557] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:42:29,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:42:29,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 02:42:29,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503376063] [2024-10-24 02:42:29,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:42:29,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 02:42:29,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:42:29,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 02:42:29,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 02:42:29,685 INFO L87 Difference]: Start difference. First operand 1585 states and 2929 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 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-24 02:42:29,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:42:29,725 INFO L93 Difference]: Finished difference Result 1694 states and 3100 transitions. [2024-10-24 02:42:29,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 02:42:29,726 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2024-10-24 02:42:29,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:42:29,732 INFO L225 Difference]: With dead ends: 1694 [2024-10-24 02:42:29,732 INFO L226 Difference]: Without dead ends: 1634 [2024-10-24 02:42:29,734 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-24 02:42:29,738 INFO L432 NwaCegarLoop]: 1501 mSDtfsCounter, 1466 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1466 SdHoareTripleChecker+Valid, 1542 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 02:42:29,738 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1466 Valid, 1542 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 02:42:29,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1634 states. [2024-10-24 02:42:29,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1634 to 1630. [2024-10-24 02:42:29,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1630 states, 1628 states have (on average 1.8409090909090908) internal successors, (2997), 1629 states have internal predecessors, (2997), 0 states have call successors, (0), 0 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-24 02:42:29,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1630 states to 1630 states and 2997 transitions. [2024-10-24 02:42:29,779 INFO L78 Accepts]: Start accepts. Automaton has 1630 states and 2997 transitions. Word has length 34 [2024-10-24 02:42:29,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:42:29,779 INFO L471 AbstractCegarLoop]: Abstraction has 1630 states and 2997 transitions. [2024-10-24 02:42:29,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 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-24 02:42:29,779 INFO L276 IsEmpty]: Start isEmpty. Operand 1630 states and 2997 transitions. [2024-10-24 02:42:29,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-24 02:42:29,780 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:42:29,780 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] [2024-10-24 02:42:29,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 02:42:29,781 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:42:29,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:42:29,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1264744216, now seen corresponding path program 1 times [2024-10-24 02:42:29,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:42:29,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837378445] [2024-10-24 02:42:29,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:42:29,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:42:29,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:42:29,919 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-24 02:42:29,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:42:29,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837378445] [2024-10-24 02:42:29,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837378445] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:42:29,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:42:29,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 02:42:29,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055055333] [2024-10-24 02:42:29,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:42:29,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 02:42:29,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:42:29,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 02:42:29,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 02:42:29,921 INFO L87 Difference]: Start difference. First operand 1630 states and 2997 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 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-24 02:42:30,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:42:30,005 INFO L93 Difference]: Finished difference Result 1737 states and 3161 transitions. [2024-10-24 02:42:30,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 02:42:30,006 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2024-10-24 02:42:30,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:42:30,012 INFO L225 Difference]: With dead ends: 1737 [2024-10-24 02:42:30,012 INFO L226 Difference]: Without dead ends: 1632 [2024-10-24 02:42:30,014 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-24 02:42:30,015 INFO L432 NwaCegarLoop]: 1500 mSDtfsCounter, 1476 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1476 SdHoareTripleChecker+Valid, 1632 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 02:42:30,015 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1476 Valid, 1632 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 02:42:30,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1632 states. [2024-10-24 02:42:30,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1632 to 1630. [2024-10-24 02:42:30,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1630 states, 1628 states have (on average 1.8396805896805897) internal successors, (2995), 1629 states have internal predecessors, (2995), 0 states have call successors, (0), 0 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-24 02:42:30,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1630 states to 1630 states and 2995 transitions. [2024-10-24 02:42:30,053 INFO L78 Accepts]: Start accepts. Automaton has 1630 states and 2995 transitions. Word has length 34 [2024-10-24 02:42:30,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:42:30,053 INFO L471 AbstractCegarLoop]: Abstraction has 1630 states and 2995 transitions. [2024-10-24 02:42:30,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 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-24 02:42:30,054 INFO L276 IsEmpty]: Start isEmpty. Operand 1630 states and 2995 transitions. [2024-10-24 02:42:30,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-24 02:42:30,054 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:42:30,055 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] [2024-10-24 02:42:30,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 02:42:30,055 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:42:30,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:42:30,055 INFO L85 PathProgramCache]: Analyzing trace with hash -680719856, now seen corresponding path program 1 times [2024-10-24 02:42:30,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:42:30,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695087017] [2024-10-24 02:42:30,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:42:30,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:42:30,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:42:30,201 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-24 02:42:30,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:42:30,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695087017] [2024-10-24 02:42:30,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695087017] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:42:30,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:42:30,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 02:42:30,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124339575] [2024-10-24 02:42:30,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:42:30,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 02:42:30,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:42:30,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 02:42:30,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 02:42:30,206 INFO L87 Difference]: Start difference. First operand 1630 states and 2995 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 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-24 02:42:30,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:42:30,247 INFO L93 Difference]: Finished difference Result 1636 states and 3002 transitions. [2024-10-24 02:42:30,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 02:42:30,251 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2024-10-24 02:42:30,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:42:30,258 INFO L225 Difference]: With dead ends: 1636 [2024-10-24 02:42:30,259 INFO L226 Difference]: Without dead ends: 1634 [2024-10-24 02:42:30,260 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-24 02:42:30,261 INFO L432 NwaCegarLoop]: 1504 mSDtfsCounter, 0 mSDsluCounter, 3000 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4504 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 02:42:30,261 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4504 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 02:42:30,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1634 states. [2024-10-24 02:42:30,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1634 to 1634. [2024-10-24 02:42:30,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1634 states, 1632 states have (on average 1.8370098039215685) internal successors, (2998), 1633 states have internal predecessors, (2998), 0 states have call successors, (0), 0 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-24 02:42:30,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1634 states to 1634 states and 2998 transitions. [2024-10-24 02:42:30,331 INFO L78 Accepts]: Start accepts. Automaton has 1634 states and 2998 transitions. Word has length 35 [2024-10-24 02:42:30,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:42:30,331 INFO L471 AbstractCegarLoop]: Abstraction has 1634 states and 2998 transitions. [2024-10-24 02:42:30,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 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-24 02:42:30,332 INFO L276 IsEmpty]: Start isEmpty. Operand 1634 states and 2998 transitions. [2024-10-24 02:42:30,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-24 02:42:30,334 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:42:30,335 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] [2024-10-24 02:42:30,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 02:42:30,335 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:42:30,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:42:30,336 INFO L85 PathProgramCache]: Analyzing trace with hash -665802232, now seen corresponding path program 1 times [2024-10-24 02:42:30,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:42:30,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900104425] [2024-10-24 02:42:30,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:42:30,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:42:30,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:42:30,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 02:42:30,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:42:30,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900104425] [2024-10-24 02:42:30,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900104425] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:42:30,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:42:30,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 02:42:30,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013761726] [2024-10-24 02:42:30,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:42:30,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 02:42:30,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:42:30,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 02:42:30,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 02:42:30,380 INFO L87 Difference]: Start difference. First operand 1634 states and 2998 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 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-24 02:42:30,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:42:30,418 INFO L93 Difference]: Finished difference Result 1836 states and 3298 transitions. [2024-10-24 02:42:30,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 02:42:30,419 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2024-10-24 02:42:30,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:42:30,426 INFO L225 Difference]: With dead ends: 1836 [2024-10-24 02:42:30,426 INFO L226 Difference]: Without dead ends: 1727 [2024-10-24 02:42:30,427 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-24 02:42:30,428 INFO L432 NwaCegarLoop]: 1520 mSDtfsCounter, 1473 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1473 SdHoareTripleChecker+Valid, 1577 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 02:42:30,428 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1473 Valid, 1577 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 02:42:30,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1727 states. [2024-10-24 02:42:30,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1727 to 1725. [2024-10-24 02:42:30,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1725 states, 1723 states have (on average 1.81601857225769) internal successors, (3129), 1724 states have internal predecessors, (3129), 0 states have call successors, (0), 0 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-24 02:42:30,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1725 states to 1725 states and 3129 transitions. [2024-10-24 02:42:30,468 INFO L78 Accepts]: Start accepts. Automaton has 1725 states and 3129 transitions. Word has length 36 [2024-10-24 02:42:30,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:42:30,469 INFO L471 AbstractCegarLoop]: Abstraction has 1725 states and 3129 transitions. [2024-10-24 02:42:30,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 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-24 02:42:30,469 INFO L276 IsEmpty]: Start isEmpty. Operand 1725 states and 3129 transitions. [2024-10-24 02:42:30,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-24 02:42:30,470 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:42:30,470 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] [2024-10-24 02:42:30,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 02:42:30,471 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:42:30,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:42:30,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1554535672, now seen corresponding path program 1 times [2024-10-24 02:42:30,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:42:30,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474907215] [2024-10-24 02:42:30,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:42:30,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:42:30,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:42:30,509 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-24 02:42:30,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:42:30,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474907215] [2024-10-24 02:42:30,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474907215] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:42:30,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:42:30,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 02:42:30,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919348322] [2024-10-24 02:42:30,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:42:30,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 02:42:30,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:42:30,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 02:42:30,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 02:42:30,512 INFO L87 Difference]: Start difference. First operand 1725 states and 3129 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 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-24 02:42:30,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:42:30,549 INFO L93 Difference]: Finished difference Result 2093 states and 3663 transitions. [2024-10-24 02:42:30,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 02:42:30,550 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2024-10-24 02:42:30,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:42:30,557 INFO L225 Difference]: With dead ends: 2093 [2024-10-24 02:42:30,557 INFO L226 Difference]: Without dead ends: 1893 [2024-10-24 02:42:30,558 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-24 02:42:30,559 INFO L432 NwaCegarLoop]: 1530 mSDtfsCounter, 1475 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1475 SdHoareTripleChecker+Valid, 1583 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 02:42:30,560 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1475 Valid, 1583 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 02:42:30,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1893 states. [2024-10-24 02:42:30,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1893 to 1891. [2024-10-24 02:42:30,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1891 states, 1889 states have (on average 1.7781895182636316) internal successors, (3359), 1890 states have internal predecessors, (3359), 0 states have call successors, (0), 0 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-24 02:42:30,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1891 states to 1891 states and 3359 transitions. [2024-10-24 02:42:30,608 INFO L78 Accepts]: Start accepts. Automaton has 1891 states and 3359 transitions. Word has length 36 [2024-10-24 02:42:30,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:42:30,610 INFO L471 AbstractCegarLoop]: Abstraction has 1891 states and 3359 transitions. [2024-10-24 02:42:30,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 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-24 02:42:30,611 INFO L276 IsEmpty]: Start isEmpty. Operand 1891 states and 3359 transitions. [2024-10-24 02:42:30,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-24 02:42:30,611 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:42:30,611 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] [2024-10-24 02:42:30,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 02:42:30,611 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:42:30,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:42:30,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1381367059, now seen corresponding path program 1 times [2024-10-24 02:42:30,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:42:30,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699532384] [2024-10-24 02:42:30,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:42:30,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:42:30,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:42:30,656 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-24 02:42:30,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:42:30,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699532384] [2024-10-24 02:42:30,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699532384] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:42:30,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:42:30,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 02:42:30,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285636701] [2024-10-24 02:42:30,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:42:30,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 02:42:30,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:42:30,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 02:42:30,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 02:42:30,659 INFO L87 Difference]: Start difference. First operand 1891 states and 3359 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 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-24 02:42:30,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:42:30,697 INFO L93 Difference]: Finished difference Result 2282 states and 3933 transitions. [2024-10-24 02:42:30,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 02:42:30,698 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2024-10-24 02:42:30,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:42:30,706 INFO L225 Difference]: With dead ends: 2282 [2024-10-24 02:42:30,706 INFO L226 Difference]: Without dead ends: 2063 [2024-10-24 02:42:30,707 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-24 02:42:30,708 INFO L432 NwaCegarLoop]: 1535 mSDtfsCounter, 1474 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1474 SdHoareTripleChecker+Valid, 1584 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 02:42:30,708 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1474 Valid, 1584 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 02:42:30,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2063 states. [2024-10-24 02:42:30,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2063 to 2061. [2024-10-24 02:42:30,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2061 states, 2059 states have (on average 1.746964545896066) internal successors, (3597), 2060 states have internal predecessors, (3597), 0 states have call successors, (0), 0 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-24 02:42:30,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2061 states to 2061 states and 3597 transitions. [2024-10-24 02:42:30,753 INFO L78 Accepts]: Start accepts. Automaton has 2061 states and 3597 transitions. Word has length 38 [2024-10-24 02:42:30,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:42:30,754 INFO L471 AbstractCegarLoop]: Abstraction has 2061 states and 3597 transitions. [2024-10-24 02:42:30,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 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-24 02:42:30,754 INFO L276 IsEmpty]: Start isEmpty. Operand 2061 states and 3597 transitions. [2024-10-24 02:42:30,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-24 02:42:30,755 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:42:30,755 INFO L215 NwaCegarLoop]: trace histogram [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-24 02:42:30,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 02:42:30,755 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:42:30,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:42:30,756 INFO L85 PathProgramCache]: Analyzing trace with hash 514089809, now seen corresponding path program 1 times [2024-10-24 02:42:30,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:42:30,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069443192] [2024-10-24 02:42:30,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:42:30,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:42:30,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:42:30,876 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-24 02:42:30,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:42:30,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069443192] [2024-10-24 02:42:30,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069443192] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:42:30,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:42:30,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 02:42:30,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750572309] [2024-10-24 02:42:30,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:42:30,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 02:42:30,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:42:30,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 02:42:30,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 02:42:30,880 INFO L87 Difference]: Start difference. First operand 2061 states and 3597 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 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-24 02:42:31,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:42:31,003 INFO L93 Difference]: Finished difference Result 3785 states and 6045 transitions. [2024-10-24 02:42:31,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 02:42:31,004 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 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 50 [2024-10-24 02:42:31,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:42:31,016 INFO L225 Difference]: With dead ends: 3785 [2024-10-24 02:42:31,016 INFO L226 Difference]: Without dead ends: 3251 [2024-10-24 02:42:31,018 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-24 02:42:31,019 INFO L432 NwaCegarLoop]: 1543 mSDtfsCounter, 3051 mSDsluCounter, 1595 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3051 SdHoareTripleChecker+Valid, 3138 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 02:42:31,019 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3051 Valid, 3138 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 02:42:31,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3251 states. [2024-10-24 02:42:31,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3251 to 2593. [2024-10-24 02:42:31,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2593 states, 2591 states have (on average 1.6769587032033964) internal successors, (4345), 2592 states have internal predecessors, (4345), 0 states have call successors, (0), 0 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-24 02:42:31,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2593 states to 2593 states and 4345 transitions. [2024-10-24 02:42:31,086 INFO L78 Accepts]: Start accepts. Automaton has 2593 states and 4345 transitions. Word has length 50 [2024-10-24 02:42:31,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:42:31,087 INFO L471 AbstractCegarLoop]: Abstraction has 2593 states and 4345 transitions. [2024-10-24 02:42:31,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 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-24 02:42:31,087 INFO L276 IsEmpty]: Start isEmpty. Operand 2593 states and 4345 transitions. [2024-10-24 02:42:31,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-24 02:42:31,087 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:42:31,088 INFO L215 NwaCegarLoop]: trace histogram [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-24 02:42:31,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 02:42:31,088 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:42:31,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:42:31,088 INFO L85 PathProgramCache]: Analyzing trace with hash -374643631, now seen corresponding path program 1 times [2024-10-24 02:42:31,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:42:31,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216153888] [2024-10-24 02:42:31,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:42:31,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:42:31,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:42:31,185 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 02:42:31,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:42:31,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216153888] [2024-10-24 02:42:31,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216153888] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:42:31,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:42:31,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 02:42:31,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159956079] [2024-10-24 02:42:31,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:42:31,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 02:42:31,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:42:31,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 02:42:31,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 02:42:31,188 INFO L87 Difference]: Start difference. First operand 2593 states and 4345 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 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-24 02:42:31,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:42:31,331 INFO L93 Difference]: Finished difference Result 4317 states and 6793 transitions. [2024-10-24 02:42:31,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 02:42:31,331 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 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 50 [2024-10-24 02:42:31,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:42:31,345 INFO L225 Difference]: With dead ends: 4317 [2024-10-24 02:42:31,345 INFO L226 Difference]: Without dead ends: 3783 [2024-10-24 02:42:31,347 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-24 02:42:31,348 INFO L432 NwaCegarLoop]: 1544 mSDtfsCounter, 3043 mSDsluCounter, 1609 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3043 SdHoareTripleChecker+Valid, 3153 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 02:42:31,348 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3043 Valid, 3153 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 02:42:31,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3783 states. [2024-10-24 02:42:31,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3783 to 3393. [2024-10-24 02:42:31,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3393 states, 3391 states have (on average 1.6092598053671483) internal successors, (5457), 3392 states have internal predecessors, (5457), 0 states have call successors, (0), 0 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-24 02:42:31,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3393 states to 3393 states and 5457 transitions. [2024-10-24 02:42:31,440 INFO L78 Accepts]: Start accepts. Automaton has 3393 states and 5457 transitions. Word has length 50 [2024-10-24 02:42:31,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:42:31,440 INFO L471 AbstractCegarLoop]: Abstraction has 3393 states and 5457 transitions. [2024-10-24 02:42:31,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 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-24 02:42:31,440 INFO L276 IsEmpty]: Start isEmpty. Operand 3393 states and 5457 transitions. [2024-10-24 02:42:31,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-24 02:42:31,441 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:42:31,441 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-24 02:42:31,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 02:42:31,441 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:42:31,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:42:31,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1477767, now seen corresponding path program 1 times [2024-10-24 02:42:31,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:42:31,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565416482] [2024-10-24 02:42:31,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:42:31,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:42:31,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:42:31,531 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 02:42:31,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:42:31,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565416482] [2024-10-24 02:42:31,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565416482] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:42:31,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:42:31,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 02:42:31,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915869478] [2024-10-24 02:42:31,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:42:31,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 02:42:31,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:42:31,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 02:42:31,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 02:42:31,532 INFO L87 Difference]: Start difference. First operand 3393 states and 5457 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 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-24 02:42:31,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:42:31,646 INFO L93 Difference]: Finished difference Result 4756 states and 7407 transitions. [2024-10-24 02:42:31,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 02:42:31,646 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2024-10-24 02:42:31,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:42:31,654 INFO L225 Difference]: With dead ends: 4756 [2024-10-24 02:42:31,654 INFO L226 Difference]: Without dead ends: 2890 [2024-10-24 02:42:31,656 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-24 02:42:31,657 INFO L432 NwaCegarLoop]: 1529 mSDtfsCounter, 34 mSDsluCounter, 1491 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 3020 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 02:42:31,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 3020 Invalid, 10 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 02:42:31,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2890 states. [2024-10-24 02:42:31,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2890 to 2888. [2024-10-24 02:42:31,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2888 states, 2886 states have (on average 1.6479556479556479) internal successors, (4756), 2887 states have internal predecessors, (4756), 0 states have call successors, (0), 0 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-24 02:42:31,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2888 states to 2888 states and 4756 transitions. [2024-10-24 02:42:31,728 INFO L78 Accepts]: Start accepts. Automaton has 2888 states and 4756 transitions. Word has length 52 [2024-10-24 02:42:31,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:42:31,728 INFO L471 AbstractCegarLoop]: Abstraction has 2888 states and 4756 transitions. [2024-10-24 02:42:31,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 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-24 02:42:31,728 INFO L276 IsEmpty]: Start isEmpty. Operand 2888 states and 4756 transitions. [2024-10-24 02:42:31,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-24 02:42:31,729 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:42:31,729 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-24 02:42:31,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 02:42:31,730 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:42:31,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:42:31,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1376481802, now seen corresponding path program 1 times [2024-10-24 02:42:31,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:42:31,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261305636] [2024-10-24 02:42:31,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:42:31,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:42:31,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:42:31,815 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-24 02:42:31,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:42:31,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261305636] [2024-10-24 02:42:31,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261305636] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:42:31,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:42:31,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 02:42:31,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662501667] [2024-10-24 02:42:31,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:42:31,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 02:42:31,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:42:31,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 02:42:31,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 02:42:31,817 INFO L87 Difference]: Start difference. First operand 2888 states and 4756 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 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-24 02:42:31,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:42:31,930 INFO L93 Difference]: Finished difference Result 4048 states and 6416 transitions. [2024-10-24 02:42:31,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 02:42:31,931 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 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 52 [2024-10-24 02:42:31,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:42:31,938 INFO L225 Difference]: With dead ends: 4048 [2024-10-24 02:42:31,938 INFO L226 Difference]: Without dead ends: 3662 [2024-10-24 02:42:31,940 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-24 02:42:31,941 INFO L432 NwaCegarLoop]: 1541 mSDtfsCounter, 3043 mSDsluCounter, 1597 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3043 SdHoareTripleChecker+Valid, 3138 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 02:42:31,941 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3043 Valid, 3138 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 02:42:31,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3662 states. [2024-10-24 02:42:32,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3662 to 3272. [2024-10-24 02:42:32,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3272 states, 3270 states have (on average 1.620795107033639) internal successors, (5300), 3271 states have internal predecessors, (5300), 0 states have call successors, (0), 0 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-24 02:42:32,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3272 states to 3272 states and 5300 transitions. [2024-10-24 02:42:32,021 INFO L78 Accepts]: Start accepts. Automaton has 3272 states and 5300 transitions. Word has length 52 [2024-10-24 02:42:32,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:42:32,021 INFO L471 AbstractCegarLoop]: Abstraction has 3272 states and 5300 transitions. [2024-10-24 02:42:32,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 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-24 02:42:32,022 INFO L276 IsEmpty]: Start isEmpty. Operand 3272 states and 5300 transitions. [2024-10-24 02:42:32,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-24 02:42:32,022 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:42:32,023 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-24 02:42:32,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 02:42:32,023 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:42:32,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:42:32,023 INFO L85 PathProgramCache]: Analyzing trace with hash 717664433, now seen corresponding path program 1 times [2024-10-24 02:42:32,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:42:32,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452672332] [2024-10-24 02:42:32,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:42:32,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:42:32,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:42:32,115 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 02:42:32,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:42:32,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452672332] [2024-10-24 02:42:32,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452672332] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:42:32,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:42:32,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 02:42:32,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674719920] [2024-10-24 02:42:32,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:42:32,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 02:42:32,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:42:32,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 02:42:32,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 02:42:32,116 INFO L87 Difference]: Start difference. First operand 3272 states and 5300 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 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-24 02:42:32,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:42:32,163 INFO L93 Difference]: Finished difference Result 4140 states and 6526 transitions. [2024-10-24 02:42:32,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 02:42:32,164 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2024-10-24 02:42:32,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:42:32,172 INFO L225 Difference]: With dead ends: 4140 [2024-10-24 02:42:32,174 INFO L226 Difference]: Without dead ends: 2410 [2024-10-24 02:42:32,177 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-24 02:42:32,177 INFO L432 NwaCegarLoop]: 1522 mSDtfsCounter, 29 mSDsluCounter, 1483 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 3005 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 02:42:32,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 3005 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 02:42:32,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2410 states. [2024-10-24 02:42:32,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2410 to 2408. [2024-10-24 02:42:32,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2408 states, 2406 states have (on average 1.686616791354946) internal successors, (4058), 2407 states have internal predecessors, (4058), 0 states have call successors, (0), 0 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-24 02:42:32,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2408 states to 2408 states and 4058 transitions. [2024-10-24 02:42:32,227 INFO L78 Accepts]: Start accepts. Automaton has 2408 states and 4058 transitions. Word has length 53 [2024-10-24 02:42:32,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:42:32,227 INFO L471 AbstractCegarLoop]: Abstraction has 2408 states and 4058 transitions. [2024-10-24 02:42:32,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 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-24 02:42:32,228 INFO L276 IsEmpty]: Start isEmpty. Operand 2408 states and 4058 transitions. [2024-10-24 02:42:32,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-24 02:42:32,229 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:42:32,229 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-24 02:42:32,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 02:42:32,229 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:42:32,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:42:32,230 INFO L85 PathProgramCache]: Analyzing trace with hash -562231777, now seen corresponding path program 1 times [2024-10-24 02:42:32,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:42:32,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825678458] [2024-10-24 02:42:32,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:42:32,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:42:32,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:42:32,307 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 02:42:32,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:42:32,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825678458] [2024-10-24 02:42:32,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825678458] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:42:32,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:42:32,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 02:42:32,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51348738] [2024-10-24 02:42:32,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:42:32,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 02:42:32,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:42:32,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 02:42:32,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 02:42:32,309 INFO L87 Difference]: Start difference. First operand 2408 states and 4058 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 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-24 02:42:32,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:42:32,344 INFO L93 Difference]: Finished difference Result 2844 states and 4663 transitions. [2024-10-24 02:42:32,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 02:42:32,345 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2024-10-24 02:42:32,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:42:32,349 INFO L225 Difference]: With dead ends: 2844 [2024-10-24 02:42:32,349 INFO L226 Difference]: Without dead ends: 1978 [2024-10-24 02:42:32,352 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-24 02:42:32,352 INFO L432 NwaCegarLoop]: 1515 mSDtfsCounter, 26 mSDsluCounter, 1475 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 2990 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 02:42:32,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 2990 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 02:42:32,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1978 states. [2024-10-24 02:42:32,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1978 to 1976. [2024-10-24 02:42:32,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1976 states, 1974 states have (on average 1.745694022289767) internal successors, (3446), 1975 states have internal predecessors, (3446), 0 states have call successors, (0), 0 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-24 02:42:32,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1976 states to 1976 states and 3446 transitions. [2024-10-24 02:42:32,388 INFO L78 Accepts]: Start accepts. Automaton has 1976 states and 3446 transitions. Word has length 55 [2024-10-24 02:42:32,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:42:32,389 INFO L471 AbstractCegarLoop]: Abstraction has 1976 states and 3446 transitions. [2024-10-24 02:42:32,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 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-24 02:42:32,389 INFO L276 IsEmpty]: Start isEmpty. Operand 1976 states and 3446 transitions. [2024-10-24 02:42:32,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-24 02:42:32,390 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:42:32,390 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-24 02:42:32,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 02:42:32,390 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:42:32,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:42:32,391 INFO L85 PathProgramCache]: Analyzing trace with hash -165946099, now seen corresponding path program 1 times [2024-10-24 02:42:32,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:42:32,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028549023] [2024-10-24 02:42:32,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:42:32,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:42:32,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:42:34,576 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 02:42:34,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:42:34,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028549023] [2024-10-24 02:42:34,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028549023] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 02:42:34,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [795732068] [2024-10-24 02:42:34,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:42:34,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 02:42:34,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 02:42:34,583 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 02:42:34,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 02:42:34,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:42:34,694 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-24 02:42:34,699 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 02:42:35,140 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 02:42:35,140 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 02:42:35,821 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 02:42:35,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [795732068] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 02:42:35,822 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 02:42:35,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 25 [2024-10-24 02:42:35,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014938270] [2024-10-24 02:42:35,822 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 02:42:35,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-24 02:42:35,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:42:35,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-24 02:42:35,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=549, Unknown=0, NotChecked=0, Total=650 [2024-10-24 02:42:35,824 INFO L87 Difference]: Start difference. First operand 1976 states and 3446 transitions. Second operand has 26 states, 26 states have (on average 5.384615384615385) internal successors, (140), 25 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 02:42:36,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:42:36,431 INFO L93 Difference]: Finished difference Result 2900 states and 4718 transitions. [2024-10-24 02:42:36,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 02:42:36,432 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.384615384615385) internal successors, (140), 25 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2024-10-24 02:42:36,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:42:36,436 INFO L225 Difference]: With dead ends: 2900 [2024-10-24 02:42:36,436 INFO L226 Difference]: Without dead ends: 2466 [2024-10-24 02:42:36,438 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=298, Invalid=1034, Unknown=0, NotChecked=0, Total=1332 [2024-10-24 02:42:36,438 INFO L432 NwaCegarLoop]: 1484 mSDtfsCounter, 10594 mSDsluCounter, 3244 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10594 SdHoareTripleChecker+Valid, 4728 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 02:42:36,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10594 Valid, 4728 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 02:42:36,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2466 states. [2024-10-24 02:42:36,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2466 to 2444. [2024-10-24 02:42:36,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2444 states, 2442 states have (on average 1.6654381654381654) internal successors, (4067), 2443 states have internal predecessors, (4067), 0 states have call successors, (0), 0 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-24 02:42:36,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2444 states to 2444 states and 4067 transitions. [2024-10-24 02:42:36,489 INFO L78 Accepts]: Start accepts. Automaton has 2444 states and 4067 transitions. Word has length 57 [2024-10-24 02:42:36,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:42:36,490 INFO L471 AbstractCegarLoop]: Abstraction has 2444 states and 4067 transitions. [2024-10-24 02:42:36,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.384615384615385) internal successors, (140), 25 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 02:42:36,490 INFO L276 IsEmpty]: Start isEmpty. Operand 2444 states and 4067 transitions. [2024-10-24 02:42:36,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-24 02:42:36,491 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:42:36,491 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-24 02:42:36,510 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 02:42:36,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-24 02:42:36,693 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:42:36,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:42:36,693 INFO L85 PathProgramCache]: Analyzing trace with hash -625110334, now seen corresponding path program 1 times [2024-10-24 02:42:36,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:42:36,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558834296] [2024-10-24 02:42:36,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:42:36,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:42:36,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:42:37,996 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 02:42:37,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:42:37,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558834296] [2024-10-24 02:42:37,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558834296] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 02:42:37,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [593589845] [2024-10-24 02:42:37,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:42:37,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 02:42:37,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 02:42:38,000 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 02:42:38,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 02:42:38,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:42:38,094 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 02:42:38,095 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 02:42:38,241 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-24 02:42:38,241 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 02:42:38,380 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-24 02:42:38,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [593589845] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 02:42:38,381 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 02:42:38,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5, 4] total 18 [2024-10-24 02:42:38,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424442680] [2024-10-24 02:42:38,381 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 02:42:38,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-24 02:42:38,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:42:38,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-24 02:42:38,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2024-10-24 02:42:38,382 INFO L87 Difference]: Start difference. First operand 2444 states and 4067 transitions. Second operand has 18 states, 18 states have (on average 8.88888888888889) internal successors, (160), 18 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 02:42:40,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:42:40,759 INFO L93 Difference]: Finished difference Result 6931 states and 9966 transitions. [2024-10-24 02:42:40,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-10-24 02:42:40,760 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 8.88888888888889) internal successors, (160), 18 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2024-10-24 02:42:40,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:42:40,769 INFO L225 Difference]: With dead ends: 6931 [2024-10-24 02:42:40,772 INFO L226 Difference]: Without dead ends: 6029 [2024-10-24 02:42:40,775 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1122 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=723, Invalid=3059, Unknown=0, NotChecked=0, Total=3782 [2024-10-24 02:42:40,775 INFO L432 NwaCegarLoop]: 1498 mSDtfsCounter, 15350 mSDsluCounter, 4819 mSDsCounter, 0 mSdLazyCounter, 774 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15350 SdHoareTripleChecker+Valid, 6317 SdHoareTripleChecker+Invalid, 813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 02:42:40,775 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15350 Valid, 6317 Invalid, 813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 774 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 02:42:40,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6029 states. [2024-10-24 02:42:40,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6029 to 5893. [2024-10-24 02:42:40,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5893 states, 5891 states have (on average 1.4099473773552877) internal successors, (8306), 5892 states have internal predecessors, (8306), 0 states have call successors, (0), 0 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-24 02:42:40,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5893 states to 5893 states and 8306 transitions. [2024-10-24 02:42:40,924 INFO L78 Accepts]: Start accepts. Automaton has 5893 states and 8306 transitions. Word has length 58 [2024-10-24 02:42:40,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:42:40,924 INFO L471 AbstractCegarLoop]: Abstraction has 5893 states and 8306 transitions. [2024-10-24 02:42:40,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 8.88888888888889) internal successors, (160), 18 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 02:42:40,925 INFO L276 IsEmpty]: Start isEmpty. Operand 5893 states and 8306 transitions. [2024-10-24 02:42:40,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-24 02:42:40,925 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:42:40,926 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-24 02:42:40,945 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 02:42:41,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-24 02:42:41,127 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:42:41,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:42:41,127 INFO L85 PathProgramCache]: Analyzing trace with hash -71117744, now seen corresponding path program 1 times [2024-10-24 02:42:41,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:42:41,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640448380] [2024-10-24 02:42:41,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:42:41,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:42:41,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:42:41,448 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 02:42:41,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:42:41,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640448380] [2024-10-24 02:42:41,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640448380] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 02:42:41,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1614269924] [2024-10-24 02:42:41,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:42:41,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 02:42:41,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 02:42:41,451 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 02:42:41,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-24 02:42:41,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:42:41,569 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-24 02:42:41,571 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 02:42:44,542 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 02:42:44,542 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 02:42:46,170 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 02:42:46,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1614269924] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 02:42:46,170 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 02:42:46,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 17, 17] total 40 [2024-10-24 02:42:46,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538654705] [2024-10-24 02:42:46,171 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 02:42:46,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-10-24 02:42:46,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:42:46,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-10-24 02:42:46,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1378, Unknown=0, NotChecked=0, Total=1560 [2024-10-24 02:42:46,172 INFO L87 Difference]: Start difference. First operand 5893 states and 8306 transitions. Second operand has 40 states, 40 states have (on average 3.875) internal successors, (155), 40 states have internal predecessors, (155), 0 states have call successors, (0), 0 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-24 02:43:05,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:43:05,041 INFO L93 Difference]: Finished difference Result 18507 states and 24483 transitions. [2024-10-24 02:43:05,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2024-10-24 02:43:05,042 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 3.875) internal successors, (155), 40 states have internal predecessors, (155), 0 states have call successors, (0), 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 58 [2024-10-24 02:43:05,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:43:05,071 INFO L225 Difference]: With dead ends: 18507 [2024-10-24 02:43:05,072 INFO L226 Difference]: Without dead ends: 14462 [2024-10-24 02:43:05,088 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11085 ImplicationChecksByTransitivity, 18.2s TimeCoverageRelationStatistics Valid=5515, Invalid=23897, Unknown=0, NotChecked=0, Total=29412 [2024-10-24 02:43:05,088 INFO L432 NwaCegarLoop]: 1536 mSDtfsCounter, 17691 mSDsluCounter, 20408 mSDsCounter, 0 mSdLazyCounter, 1730 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17691 SdHoareTripleChecker+Valid, 21944 SdHoareTripleChecker+Invalid, 1871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 1730 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-24 02:43:05,089 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17691 Valid, 21944 Invalid, 1871 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [141 Valid, 1730 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-24 02:43:05,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14462 states. [2024-10-24 02:43:05,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14462 to 11512. [2024-10-24 02:43:05,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11512 states, 11510 states have (on average 1.3415291051259775) internal successors, (15441), 11511 states have internal predecessors, (15441), 0 states have call successors, (0), 0 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-24 02:43:05,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11512 states to 11512 states and 15441 transitions. [2024-10-24 02:43:05,716 INFO L78 Accepts]: Start accepts. Automaton has 11512 states and 15441 transitions. Word has length 58 [2024-10-24 02:43:05,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:43:05,716 INFO L471 AbstractCegarLoop]: Abstraction has 11512 states and 15441 transitions. [2024-10-24 02:43:05,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 3.875) internal successors, (155), 40 states have internal predecessors, (155), 0 states have call successors, (0), 0 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-24 02:43:05,717 INFO L276 IsEmpty]: Start isEmpty. Operand 11512 states and 15441 transitions. [2024-10-24 02:43:05,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-24 02:43:05,717 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:43:05,717 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-24 02:43:05,735 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-24 02:43:05,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-24 02:43:05,922 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:43:05,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:43:05,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1546226177, now seen corresponding path program 1 times [2024-10-24 02:43:05,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:43:05,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691428798] [2024-10-24 02:43:05,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:43:05,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:43:05,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:43:06,253 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 02:43:06,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:43:06,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691428798] [2024-10-24 02:43:06,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691428798] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 02:43:06,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [136182540] [2024-10-24 02:43:06,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:43:06,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 02:43:06,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 02:43:06,257 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 02:43:06,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-24 02:43:06,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:43:06,396 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-10-24 02:43:06,399 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 02:43:08,760 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 02:43:08,760 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 02:43:11,594 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 02:43:11,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [136182540] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 02:43:11,595 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 02:43:11,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 19, 22] total 45 [2024-10-24 02:43:11,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565135487] [2024-10-24 02:43:11,596 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 02:43:11,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-10-24 02:43:11,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:43:11,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-10-24 02:43:11,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=316, Invalid=1664, Unknown=0, NotChecked=0, Total=1980 [2024-10-24 02:43:11,598 INFO L87 Difference]: Start difference. First operand 11512 states and 15441 transitions. Second operand has 45 states, 45 states have (on average 3.466666666666667) internal successors, (156), 45 states have internal predecessors, (156), 0 states have call successors, (0), 0 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-24 02:43:21,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:43:21,945 INFO L93 Difference]: Finished difference Result 20678 states and 26989 transitions. [2024-10-24 02:43:21,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-10-24 02:43:21,946 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 3.466666666666667) internal successors, (156), 45 states have internal predecessors, (156), 0 states have call successors, (0), 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 59 [2024-10-24 02:43:21,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:43:21,968 INFO L225 Difference]: With dead ends: 20678 [2024-10-24 02:43:21,968 INFO L226 Difference]: Without dead ends: 11096 [2024-10-24 02:43:21,985 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3560 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=3133, Invalid=9749, Unknown=0, NotChecked=0, Total=12882 [2024-10-24 02:43:21,986 INFO L432 NwaCegarLoop]: 1544 mSDtfsCounter, 24824 mSDsluCounter, 15990 mSDsCounter, 0 mSdLazyCounter, 1810 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24824 SdHoareTripleChecker+Valid, 17534 SdHoareTripleChecker+Invalid, 1882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-24 02:43:21,986 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24824 Valid, 17534 Invalid, 1882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1810 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-24 02:43:21,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11096 states. [2024-10-24 02:43:22,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11096 to 10618. [2024-10-24 02:43:22,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10618 states, 10616 states have (on average 1.3415599095704598) internal successors, (14242), 10617 states have internal predecessors, (14242), 0 states have call successors, (0), 0 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-24 02:43:22,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10618 states to 10618 states and 14242 transitions. [2024-10-24 02:43:22,483 INFO L78 Accepts]: Start accepts. Automaton has 10618 states and 14242 transitions. Word has length 59 [2024-10-24 02:43:22,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:43:22,484 INFO L471 AbstractCegarLoop]: Abstraction has 10618 states and 14242 transitions. [2024-10-24 02:43:22,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 3.466666666666667) internal successors, (156), 45 states have internal predecessors, (156), 0 states have call successors, (0), 0 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-24 02:43:22,484 INFO L276 IsEmpty]: Start isEmpty. Operand 10618 states and 14242 transitions. [2024-10-24 02:43:22,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-24 02:43:22,485 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:43:22,485 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-24 02:43:22,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-24 02:43:22,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 02:43:22,687 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:43:22,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:43:22,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1391138053, now seen corresponding path program 1 times [2024-10-24 02:43:22,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:43:22,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799258868] [2024-10-24 02:43:22,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:43:22,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:43:22,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:43:22,780 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 02:43:22,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:43:22,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799258868] [2024-10-24 02:43:22,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799258868] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:43:22,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:43:22,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 02:43:22,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850518413] [2024-10-24 02:43:22,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:43:22,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 02:43:22,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:43:22,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 02:43:22,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 02:43:22,783 INFO L87 Difference]: Start difference. First operand 10618 states and 14242 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 2 states have internal predecessors, (79), 0 states have call successors, (0), 0 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-24 02:43:25,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:43:25,916 INFO L93 Difference]: Finished difference Result 13624 states and 19865 transitions. [2024-10-24 02:43:25,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 02:43:25,916 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 2 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2024-10-24 02:43:25,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:43:25,931 INFO L225 Difference]: With dead ends: 13624 [2024-10-24 02:43:25,931 INFO L226 Difference]: Without dead ends: 12120 [2024-10-24 02:43:25,935 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-24 02:43:25,935 INFO L432 NwaCegarLoop]: 553 mSDtfsCounter, 795 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2272 mSolverCounterSat, 652 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 795 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 2924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 652 IncrementalHoareTripleChecker+Valid, 2272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-24 02:43:25,936 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [795 Valid, 560 Invalid, 2924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [652 Valid, 2272 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-24 02:43:25,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12120 states. [2024-10-24 02:43:26,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12120 to 12120. [2024-10-24 02:43:26,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12120 states, 12118 states have (on average 1.3353688727512791) internal successors, (16182), 12119 states have internal predecessors, (16182), 0 states have call successors, (0), 0 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-24 02:43:26,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12120 states to 12120 states and 16182 transitions. [2024-10-24 02:43:26,369 INFO L78 Accepts]: Start accepts. Automaton has 12120 states and 16182 transitions. Word has length 79 [2024-10-24 02:43:26,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:43:26,369 INFO L471 AbstractCegarLoop]: Abstraction has 12120 states and 16182 transitions. [2024-10-24 02:43:26,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 2 states have internal predecessors, (79), 0 states have call successors, (0), 0 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-24 02:43:26,370 INFO L276 IsEmpty]: Start isEmpty. Operand 12120 states and 16182 transitions. [2024-10-24 02:43:26,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-24 02:43:26,371 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:43:26,371 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-24 02:43:26,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-24 02:43:26,371 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:43:26,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:43:26,372 INFO L85 PathProgramCache]: Analyzing trace with hash 39025430, now seen corresponding path program 1 times [2024-10-24 02:43:26,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:43:26,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029378992] [2024-10-24 02:43:26,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:43:26,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:43:26,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:43:26,433 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 02:43:26,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:43:26,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029378992] [2024-10-24 02:43:26,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029378992] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:43:26,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:43:26,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 02:43:26,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760868395] [2024-10-24 02:43:26,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:43:26,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 02:43:26,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:43:26,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 02:43:26,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 02:43:26,435 INFO L87 Difference]: Start difference. First operand 12120 states and 16182 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 states have internal predecessors, (81), 0 states have call successors, (0), 0 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-24 02:43:29,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:43:29,432 INFO L93 Difference]: Finished difference Result 18132 states and 25686 transitions. [2024-10-24 02:43:29,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 02:43:29,433 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2024-10-24 02:43:29,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:43:29,447 INFO L225 Difference]: With dead ends: 18132 [2024-10-24 02:43:29,447 INFO L226 Difference]: Without dead ends: 15126 [2024-10-24 02:43:29,452 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-24 02:43:29,453 INFO L432 NwaCegarLoop]: 611 mSDtfsCounter, 985 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2370 mSolverCounterSat, 550 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 985 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 2920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 550 IncrementalHoareTripleChecker+Valid, 2370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-24 02:43:29,453 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [985 Valid, 618 Invalid, 2920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [550 Valid, 2370 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-24 02:43:29,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15126 states. [2024-10-24 02:43:29,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15126 to 15124. [2024-10-24 02:43:29,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15124 states, 15122 states have (on average 1.327139267292686) internal successors, (20069), 15123 states have internal predecessors, (20069), 0 states have call successors, (0), 0 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-24 02:43:29,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15124 states to 15124 states and 20069 transitions. [2024-10-24 02:43:29,975 INFO L78 Accepts]: Start accepts. Automaton has 15124 states and 20069 transitions. Word has length 81 [2024-10-24 02:43:29,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:43:29,975 INFO L471 AbstractCegarLoop]: Abstraction has 15124 states and 20069 transitions. [2024-10-24 02:43:29,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 states have internal predecessors, (81), 0 states have call successors, (0), 0 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-24 02:43:29,976 INFO L276 IsEmpty]: Start isEmpty. Operand 15124 states and 20069 transitions. [2024-10-24 02:43:29,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-24 02:43:29,978 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:43:29,978 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2024-10-24 02:43:29,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-24 02:43:29,979 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:43:29,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:43:29,979 INFO L85 PathProgramCache]: Analyzing trace with hash -572483718, now seen corresponding path program 1 times [2024-10-24 02:43:29,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:43:29,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249720599] [2024-10-24 02:43:29,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:43:29,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:43:30,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:43:31,028 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 36 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 02:43:31,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:43:31,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249720599] [2024-10-24 02:43:31,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249720599] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 02:43:31,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496315441] [2024-10-24 02:43:31,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:43:31,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 02:43:31,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 02:43:31,033 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 02:43:31,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-24 02:43:31,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:43:31,154 INFO L255 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-24 02:43:31,156 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 02:43:31,817 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 30 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 02:43:31,817 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 02:43:33,561 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 28 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 02:43:33,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1496315441] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 02:43:33,562 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 02:43:33,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 34 [2024-10-24 02:43:33,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510928939] [2024-10-24 02:43:33,562 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 02:43:33,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-10-24 02:43:33,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:43:33,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-10-24 02:43:33,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1075, Unknown=0, NotChecked=0, Total=1190 [2024-10-24 02:43:33,564 INFO L87 Difference]: Start difference. First operand 15124 states and 20069 transitions. Second operand has 35 states, 35 states have (on average 7.485714285714286) internal successors, (262), 34 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)