./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_label08.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label08.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5a9891cd4c5f04616b7fa480ff51a2b34c717470141ef1b888630cca6069f53e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 04:43:15,405 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 04:43:15,490 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 04:43:15,496 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 04:43:15,499 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 04:43:15,535 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 04:43:15,537 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 04:43:15,538 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 04:43:15,539 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 04:43:15,541 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 04:43:15,541 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 04:43:15,541 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 04:43:15,542 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 04:43:15,544 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 04:43:15,545 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 04:43:15,545 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 04:43:15,545 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 04:43:15,546 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 04:43:15,546 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 04:43:15,546 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 04:43:15,546 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 04:43:15,550 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 04:43:15,551 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 04:43:15,551 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 04:43:15,551 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 04:43:15,552 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 04:43:15,552 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 04:43:15,552 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 04:43:15,552 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 04:43:15,553 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 04:43:15,553 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 04:43:15,553 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 04:43:15,553 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:43:15,554 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 04:43:15,554 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 04:43:15,554 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 04:43:15,554 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 04:43:15,555 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 04:43:15,555 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 04:43:15,555 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 04:43:15,555 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 04:43:15,557 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 04:43:15,557 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5a9891cd4c5f04616b7fa480ff51a2b34c717470141ef1b888630cca6069f53e [2024-10-11 04:43:15,817 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 04:43:15,844 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 04:43:15,847 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 04:43:15,848 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 04:43:15,848 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 04:43:15,850 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_label08.c [2024-10-11 04:43:17,366 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 04:43:17,806 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 04:43:17,807 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label08.c [2024-10-11 04:43:17,843 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/440d4ba7e/9feae9fe29574c8d8394d6480f503f8e/FLAGaf16683dd [2024-10-11 04:43:17,862 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/440d4ba7e/9feae9fe29574c8d8394d6480f503f8e [2024-10-11 04:43:17,865 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 04:43:17,867 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 04:43:17,869 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 04:43:17,869 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 04:43:17,874 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 04:43:17,875 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:43:17" (1/1) ... [2024-10-11 04:43:17,877 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@543810de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:43:17, skipping insertion in model container [2024-10-11 04:43:17,878 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:43:17" (1/1) ... [2024-10-11 04:43:18,002 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 04:43:18,359 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_label08.c[6450,6463] [2024-10-11 04:43:18,406 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_label08.c[9957,9970] [2024-10-11 04:43:19,083 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:43:19,096 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 04:43:19,125 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label08.c[6450,6463] [2024-10-11 04:43:19,138 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_label08.c[9957,9970] [2024-10-11 04:43:19,577 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:43:19,608 INFO L204 MainTranslator]: Completed translation [2024-10-11 04:43:19,608 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:43:19 WrapperNode [2024-10-11 04:43:19,609 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 04:43:19,610 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 04:43:19,610 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 04:43:19,610 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 04:43:19,617 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:43:19" (1/1) ... [2024-10-11 04:43:19,678 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:43:19" (1/1) ... [2024-10-11 04:43:19,954 INFO L138 Inliner]: procedures = 35, calls = 20, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 4983 [2024-10-11 04:43:19,955 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 04:43:19,956 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 04:43:19,956 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 04:43:19,956 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 04:43:19,966 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:43:19" (1/1) ... [2024-10-11 04:43:19,967 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:43:19" (1/1) ... [2024-10-11 04:43:20,105 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:43:19" (1/1) ... [2024-10-11 04:43:20,281 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-11 04:43:20,282 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:43:19" (1/1) ... [2024-10-11 04:43:20,282 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:43:19" (1/1) ... [2024-10-11 04:43:20,388 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:43:19" (1/1) ... [2024-10-11 04:43:20,418 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:43:19" (1/1) ... [2024-10-11 04:43:20,439 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:43:19" (1/1) ... [2024-10-11 04:43:20,454 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:43:19" (1/1) ... [2024-10-11 04:43:20,504 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 04:43:20,505 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 04:43:20,505 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 04:43:20,505 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 04:43:20,506 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:43:19" (1/1) ... [2024-10-11 04:43:20,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:43:20,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:43:20,539 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 04:43:20,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 04:43:20,594 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 04:43:20,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 04:43:20,594 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 04:43:20,595 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 04:43:20,715 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 04:43:20,718 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 04:43:25,088 INFO L? ?]: Removed 734 outVars from TransFormulas that were not future-live. [2024-10-11 04:43:25,089 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 04:43:25,154 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 04:43:25,154 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 04:43:25,155 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:43:25 BoogieIcfgContainer [2024-10-11 04:43:25,155 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 04:43:25,157 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 04:43:25,157 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 04:43:25,162 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 04:43:25,163 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 04:43:17" (1/3) ... [2024-10-11 04:43:25,164 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ddde02a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:43:25, skipping insertion in model container [2024-10-11 04:43:25,164 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:43:19" (2/3) ... [2024-10-11 04:43:25,164 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ddde02a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:43:25, skipping insertion in model container [2024-10-11 04:43:25,164 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:43:25" (3/3) ... [2024-10-11 04:43:25,166 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label08.c [2024-10-11 04:43:25,181 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 04:43:25,182 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 04:43:25,277 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 04:43:25,285 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;@b788, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 04:43:25,286 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 04:43:25,296 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-11 04:43:25,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 04:43:25,304 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:43:25,304 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:43:25,305 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:43:25,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:43:25,311 INFO L85 PathProgramCache]: Analyzing trace with hash -2106044916, now seen corresponding path program 1 times [2024-10-11 04:43:25,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:43:25,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802578215] [2024-10-11 04:43:25,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:43:25,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:43:25,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:43:25,545 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-11 04:43:25,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:43:25,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802578215] [2024-10-11 04:43:25,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802578215] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:43:25,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:43:25,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 04:43:25,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056315614] [2024-10-11 04:43:25,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:43:25,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 04:43:25,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:43:25,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 04:43:25,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 04:43:25,589 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 2 states, 2 states have (on average 8.5) internal successors, (17), 2 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-11 04:43:25,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:43:25,691 INFO L93 Difference]: Finished difference Result 1597 states and 3151 transitions. [2024-10-11 04:43:25,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 04:43:25,698 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 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-11 04:43:25,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:43:25,727 INFO L225 Difference]: With dead ends: 1597 [2024-10-11 04:43:25,727 INFO L226 Difference]: Without dead ends: 805 [2024-10-11 04:43:25,734 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 04:43:25,737 INFO L432 NwaCegarLoop]: 1523 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1523 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:43:25,738 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1523 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:43:25,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2024-10-11 04:43:25,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 805. [2024-10-11 04:43:25,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 805 states, 803 states have (on average 1.8978829389788294) internal successors, (1524), 804 states have internal predecessors, (1524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:43:25,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1524 transitions. [2024-10-11 04:43:25,827 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1524 transitions. Word has length 17 [2024-10-11 04:43:25,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:43:25,828 INFO L471 AbstractCegarLoop]: Abstraction has 805 states and 1524 transitions. [2024-10-11 04:43:25,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 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-11 04:43:25,829 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1524 transitions. [2024-10-11 04:43:25,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 04:43:25,831 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:43:25,831 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:43:25,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 04:43:25,832 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:43:25,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:43:25,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1602116366, now seen corresponding path program 1 times [2024-10-11 04:43:25,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:43:25,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316251442] [2024-10-11 04:43:25,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:43:25,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:43:25,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:43:26,019 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-11 04:43:26,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:43:26,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316251442] [2024-10-11 04:43:26,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316251442] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:43:26,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:43:26,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 04:43:26,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114585419] [2024-10-11 04:43:26,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:43:26,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 04:43:26,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:43:26,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 04:43:26,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 04:43:26,023 INFO L87 Difference]: Start difference. First operand 805 states and 1524 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-11 04:43:26,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:43:26,102 INFO L93 Difference]: Finished difference Result 839 states and 1576 transitions. [2024-10-11 04:43:26,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 04:43:26,103 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-11 04:43:26,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:43:26,106 INFO L225 Difference]: With dead ends: 839 [2024-10-11 04:43:26,107 INFO L226 Difference]: Without dead ends: 805 [2024-10-11 04:43:26,107 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-11 04:43:26,108 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-11 04:43:26,109 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-11 04:43:26,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2024-10-11 04:43:26,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 805. [2024-10-11 04:43:26,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 805 states, 803 states have (on average 1.8779576587795765) internal successors, (1508), 804 states have internal predecessors, (1508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:43:26,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1508 transitions. [2024-10-11 04:43:26,132 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1508 transitions. Word has length 17 [2024-10-11 04:43:26,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:43:26,132 INFO L471 AbstractCegarLoop]: Abstraction has 805 states and 1508 transitions. [2024-10-11 04:43:26,132 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-11 04:43:26,133 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1508 transitions. [2024-10-11 04:43:26,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-11 04:43:26,134 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:43:26,134 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] [2024-10-11 04:43:26,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 04:43:26,134 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:43:26,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:43:26,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1997221712, now seen corresponding path program 1 times [2024-10-11 04:43:26,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:43:26,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721895694] [2024-10-11 04:43:26,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:43:26,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:43:26,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:43:26,228 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-11 04:43:26,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:43:26,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721895694] [2024-10-11 04:43:26,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721895694] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:43:26,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:43:26,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 04:43:26,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012614737] [2024-10-11 04:43:26,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:43:26,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:43:26,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:43:26,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:43:26,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:43:26,232 INFO L87 Difference]: Start difference. First operand 805 states and 1508 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:43:29,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:43:29,550 INFO L93 Difference]: Finished difference Result 2309 states and 4381 transitions. [2024-10-11 04:43:29,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:43:29,551 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2024-10-11 04:43:29,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:43:29,558 INFO L225 Difference]: With dead ends: 2309 [2024-10-11 04:43:29,561 INFO L226 Difference]: Without dead ends: 1556 [2024-10-11 04:43:29,564 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-11 04:43:29,566 INFO L432 NwaCegarLoop]: 534 mSDtfsCounter, 841 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2264 mSolverCounterSat, 652 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 841 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 2916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 652 IncrementalHoareTripleChecker+Valid, 2264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-11 04:43:29,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [841 Valid, 541 Invalid, 2916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [652 Valid, 2264 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-11 04:43:29,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1556 states. [2024-10-11 04:43:29,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1556 to 1556. [2024-10-11 04:43:29,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1556 states, 1554 states have (on average 1.6003861003861004) internal successors, (2487), 1555 states have internal predecessors, (2487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:43:29,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 2487 transitions. [2024-10-11 04:43:29,601 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 2487 transitions. Word has length 29 [2024-10-11 04:43:29,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:43:29,604 INFO L471 AbstractCegarLoop]: Abstraction has 1556 states and 2487 transitions. [2024-10-11 04:43:29,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:43:29,605 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 2487 transitions. [2024-10-11 04:43:29,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-11 04:43:29,606 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:43:29,607 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-11 04:43:29,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 04:43:29,607 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:43:29,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:43:29,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1530210848, now seen corresponding path program 1 times [2024-10-11 04:43:29,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:43:29,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861523598] [2024-10-11 04:43:29,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:43:29,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:43:29,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:43:29,734 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-11 04:43:29,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:43:29,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861523598] [2024-10-11 04:43:29,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861523598] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:43:29,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:43:29,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 04:43:29,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486109515] [2024-10-11 04:43:29,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:43:29,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 04:43:29,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:43:29,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 04:43:29,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 04:43:29,737 INFO L87 Difference]: Start difference. First operand 1556 states and 2487 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-11 04:43:29,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:43:29,851 INFO L93 Difference]: Finished difference Result 1742 states and 2781 transitions. [2024-10-11 04:43:29,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:43:29,852 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-11 04:43:29,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:43:29,858 INFO L225 Difference]: With dead ends: 1742 [2024-10-11 04:43:29,858 INFO L226 Difference]: Without dead ends: 1711 [2024-10-11 04:43:29,859 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-11 04:43:29,860 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-11 04:43:29,860 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-11 04:43:29,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1711 states. [2024-10-11 04:43:29,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1711 to 1585. [2024-10-11 04:43:29,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1585 states, 1583 states have (on average 1.600126342387871) internal successors, (2533), 1584 states have internal predecessors, (2533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:43:29,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 2533 transitions. [2024-10-11 04:43:29,892 INFO L78 Accepts]: Start accepts. Automaton has 1585 states and 2533 transitions. Word has length 32 [2024-10-11 04:43:29,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:43:29,893 INFO L471 AbstractCegarLoop]: Abstraction has 1585 states and 2533 transitions. [2024-10-11 04:43:29,893 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-11 04:43:29,893 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 2533 transitions. [2024-10-11 04:43:29,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-11 04:43:29,894 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:43:29,894 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-11 04:43:29,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 04:43:29,895 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:43:29,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:43:29,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1777422384, now seen corresponding path program 1 times [2024-10-11 04:43:29,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:43:29,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814826225] [2024-10-11 04:43:29,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:43:29,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:43:29,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:43:29,958 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-11 04:43:29,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:43:29,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814826225] [2024-10-11 04:43:29,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814826225] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:43:29,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:43:29,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:43:29,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125221239] [2024-10-11 04:43:29,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:43:29,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:43:29,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:43:29,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:43:29,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:43:29,960 INFO L87 Difference]: Start difference. First operand 1585 states and 2533 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-11 04:43:29,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:43:30,000 INFO L93 Difference]: Finished difference Result 1694 states and 2704 transitions. [2024-10-11 04:43:30,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:43:30,001 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-11 04:43:30,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:43:30,006 INFO L225 Difference]: With dead ends: 1694 [2024-10-11 04:43:30,006 INFO L226 Difference]: Without dead ends: 1634 [2024-10-11 04:43:30,007 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-11 04:43:30,008 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-11 04:43:30,008 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-11 04:43:30,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1634 states. [2024-10-11 04:43:30,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1634 to 1630. [2024-10-11 04:43:30,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1630 states, 1628 states have (on average 1.5976658476658476) internal successors, (2601), 1629 states have internal predecessors, (2601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:43:30,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1630 states to 1630 states and 2601 transitions. [2024-10-11 04:43:30,040 INFO L78 Accepts]: Start accepts. Automaton has 1630 states and 2601 transitions. Word has length 34 [2024-10-11 04:43:30,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:43:30,040 INFO L471 AbstractCegarLoop]: Abstraction has 1630 states and 2601 transitions. [2024-10-11 04:43:30,040 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-11 04:43:30,040 INFO L276 IsEmpty]: Start isEmpty. Operand 1630 states and 2601 transitions. [2024-10-11 04:43:30,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-11 04:43:30,041 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:43:30,042 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:43:30,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 04:43:30,042 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:43:30,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:43:30,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1775277432, now seen corresponding path program 1 times [2024-10-11 04:43:30,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:43:30,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524109533] [2024-10-11 04:43:30,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:43:30,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:43:30,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:43:30,232 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-11 04:43:30,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:43:30,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524109533] [2024-10-11 04:43:30,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524109533] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:43:30,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:43:30,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 04:43:30,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506300736] [2024-10-11 04:43:30,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:43:30,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 04:43:30,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:43:30,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 04:43:30,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 04:43:30,235 INFO L87 Difference]: Start difference. First operand 1630 states and 2601 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-11 04:43:30,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:43:30,320 INFO L93 Difference]: Finished difference Result 1737 states and 2765 transitions. [2024-10-11 04:43:30,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 04:43:30,321 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-11 04:43:30,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:43:30,327 INFO L225 Difference]: With dead ends: 1737 [2024-10-11 04:43:30,328 INFO L226 Difference]: Without dead ends: 1632 [2024-10-11 04:43:30,329 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-11 04:43:30,331 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-11 04:43:30,333 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-11 04:43:30,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1632 states. [2024-10-11 04:43:30,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1632 to 1630. [2024-10-11 04:43:30,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1630 states, 1628 states have (on average 1.5964373464373465) internal successors, (2599), 1629 states have internal predecessors, (2599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:43:30,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1630 states to 1630 states and 2599 transitions. [2024-10-11 04:43:30,374 INFO L78 Accepts]: Start accepts. Automaton has 1630 states and 2599 transitions. Word has length 34 [2024-10-11 04:43:30,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:43:30,375 INFO L471 AbstractCegarLoop]: Abstraction has 1630 states and 2599 transitions. [2024-10-11 04:43:30,376 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-11 04:43:30,376 INFO L276 IsEmpty]: Start isEmpty. Operand 1630 states and 2599 transitions. [2024-10-11 04:43:30,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-11 04:43:30,378 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:43:30,378 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-11 04:43:30,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 04:43:30,379 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:43:30,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:43:30,380 INFO L85 PathProgramCache]: Analyzing trace with hash 672590802, now seen corresponding path program 1 times [2024-10-11 04:43:30,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:43:30,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56470619] [2024-10-11 04:43:30,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:43:30,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:43:30,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:43:30,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:43:30,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:43:30,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56470619] [2024-10-11 04:43:30,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56470619] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:43:30,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:43:30,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 04:43:30,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711932684] [2024-10-11 04:43:30,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:43:30,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 04:43:30,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:43:30,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 04:43:30,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 04:43:30,546 INFO L87 Difference]: Start difference. First operand 1630 states and 2599 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-11 04:43:30,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:43:30,593 INFO L93 Difference]: Finished difference Result 1636 states and 2606 transitions. [2024-10-11 04:43:30,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 04:43:30,593 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-11 04:43:30,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:43:30,601 INFO L225 Difference]: With dead ends: 1636 [2024-10-11 04:43:30,601 INFO L226 Difference]: Without dead ends: 1634 [2024-10-11 04:43:30,602 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-11 04:43:30,604 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-11 04:43:30,605 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-11 04:43:30,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1634 states. [2024-10-11 04:43:30,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1634 to 1634. [2024-10-11 04:43:30,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1634 states, 1632 states have (on average 1.5943627450980393) internal successors, (2602), 1633 states have internal predecessors, (2602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:43:30,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1634 states to 1634 states and 2602 transitions. [2024-10-11 04:43:30,643 INFO L78 Accepts]: Start accepts. Automaton has 1634 states and 2602 transitions. Word has length 35 [2024-10-11 04:43:30,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:43:30,645 INFO L471 AbstractCegarLoop]: Abstraction has 1634 states and 2602 transitions. [2024-10-11 04:43:30,645 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-11 04:43:30,645 INFO L276 IsEmpty]: Start isEmpty. Operand 1634 states and 2602 transitions. [2024-10-11 04:43:30,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-11 04:43:30,647 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:43:30,647 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-11 04:43:30,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 04:43:30,648 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:43:30,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:43:30,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1662873624, now seen corresponding path program 1 times [2024-10-11 04:43:30,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:43:30,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94119689] [2024-10-11 04:43:30,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:43:30,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:43:30,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:43:30,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:43:30,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:43:30,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94119689] [2024-10-11 04:43:30,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94119689] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:43:30,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:43:30,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:43:30,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401643019] [2024-10-11 04:43:30,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:43:30,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:43:30,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:43:30,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:43:30,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:43:30,696 INFO L87 Difference]: Start difference. First operand 1634 states and 2602 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-11 04:43:30,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:43:30,740 INFO L93 Difference]: Finished difference Result 1836 states and 2902 transitions. [2024-10-11 04:43:30,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:43:30,741 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-11 04:43:30,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:43:30,747 INFO L225 Difference]: With dead ends: 1836 [2024-10-11 04:43:30,748 INFO L226 Difference]: Without dead ends: 1727 [2024-10-11 04:43:30,749 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-11 04:43:30,749 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-11 04:43:30,750 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-11 04:43:30,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1727 states. [2024-10-11 04:43:30,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1727 to 1725. [2024-10-11 04:43:30,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1725 states, 1723 states have (on average 1.5861868833430064) internal successors, (2733), 1724 states have internal predecessors, (2733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:43:30,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1725 states to 1725 states and 2733 transitions. [2024-10-11 04:43:30,791 INFO L78 Accepts]: Start accepts. Automaton has 1725 states and 2733 transitions. Word has length 36 [2024-10-11 04:43:30,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:43:30,791 INFO L471 AbstractCegarLoop]: Abstraction has 1725 states and 2733 transitions. [2024-10-11 04:43:30,792 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-11 04:43:30,792 INFO L276 IsEmpty]: Start isEmpty. Operand 1725 states and 2733 transitions. [2024-10-11 04:43:30,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-11 04:43:30,792 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:43:30,793 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-11 04:43:30,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 04:43:30,793 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:43:30,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:43:30,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1743360232, now seen corresponding path program 1 times [2024-10-11 04:43:30,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:43:30,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91228307] [2024-10-11 04:43:30,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:43:30,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:43:30,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:43:30,848 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-11 04:43:30,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:43:30,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91228307] [2024-10-11 04:43:30,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91228307] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:43:30,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:43:30,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:43:30,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500500384] [2024-10-11 04:43:30,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:43:30,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:43:30,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:43:30,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:43:30,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:43:30,853 INFO L87 Difference]: Start difference. First operand 1725 states and 2733 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-11 04:43:30,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:43:30,898 INFO L93 Difference]: Finished difference Result 2093 states and 3267 transitions. [2024-10-11 04:43:30,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:43:30,899 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-11 04:43:30,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:43:30,906 INFO L225 Difference]: With dead ends: 2093 [2024-10-11 04:43:30,906 INFO L226 Difference]: Without dead ends: 1893 [2024-10-11 04:43:30,908 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-11 04:43:30,908 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-11 04:43:30,909 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-11 04:43:30,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1893 states. [2024-10-11 04:43:30,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1893 to 1891. [2024-10-11 04:43:30,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1891 states, 1889 states have (on average 1.5685547908946533) internal successors, (2963), 1890 states have internal predecessors, (2963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:43:30,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1891 states to 1891 states and 2963 transitions. [2024-10-11 04:43:30,957 INFO L78 Accepts]: Start accepts. Automaton has 1891 states and 2963 transitions. Word has length 36 [2024-10-11 04:43:30,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:43:30,958 INFO L471 AbstractCegarLoop]: Abstraction has 1891 states and 2963 transitions. [2024-10-11 04:43:30,958 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-11 04:43:30,958 INFO L276 IsEmpty]: Start isEmpty. Operand 1891 states and 2963 transitions. [2024-10-11 04:43:30,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-11 04:43:30,959 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:43:30,959 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-11 04:43:30,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 04:43:30,959 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:43:30,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:43:30,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1790190323, now seen corresponding path program 1 times [2024-10-11 04:43:30,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:43:30,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250135244] [2024-10-11 04:43:30,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:43:30,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:43:30,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:43:31,006 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-11 04:43:31,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:43:31,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250135244] [2024-10-11 04:43:31,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250135244] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:43:31,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:43:31,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:43:31,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542998325] [2024-10-11 04:43:31,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:43:31,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:43:31,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:43:31,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:43:31,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:43:31,013 INFO L87 Difference]: Start difference. First operand 1891 states and 2963 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-11 04:43:31,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:43:31,058 INFO L93 Difference]: Finished difference Result 2282 states and 3537 transitions. [2024-10-11 04:43:31,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:43:31,059 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-11 04:43:31,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:43:31,065 INFO L225 Difference]: With dead ends: 2282 [2024-10-11 04:43:31,066 INFO L226 Difference]: Without dead ends: 2063 [2024-10-11 04:43:31,067 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-11 04:43:31,067 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-11 04:43:31,068 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-11 04:43:31,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2063 states. [2024-10-11 04:43:31,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2063 to 2061. [2024-10-11 04:43:31,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2061 states, 2059 states have (on average 1.554638173870811) internal successors, (3201), 2060 states have internal predecessors, (3201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:43:31,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2061 states to 2061 states and 3201 transitions. [2024-10-11 04:43:31,119 INFO L78 Accepts]: Start accepts. Automaton has 2061 states and 3201 transitions. Word has length 38 [2024-10-11 04:43:31,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:43:31,119 INFO L471 AbstractCegarLoop]: Abstraction has 2061 states and 3201 transitions. [2024-10-11 04:43:31,120 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-11 04:43:31,120 INFO L276 IsEmpty]: Start isEmpty. Operand 2061 states and 3201 transitions. [2024-10-11 04:43:31,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-11 04:43:31,121 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:43:31,121 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-11 04:43:31,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 04:43:31,121 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:43:31,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:43:31,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1801881872, now seen corresponding path program 1 times [2024-10-11 04:43:31,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:43:31,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753352833] [2024-10-11 04:43:31,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:43:31,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:43:31,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:43:31,268 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-11 04:43:31,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:43:31,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753352833] [2024-10-11 04:43:31,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753352833] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:43:31,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:43:31,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 04:43:31,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200666907] [2024-10-11 04:43:31,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:43:31,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 04:43:31,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:43:31,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 04:43:31,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 04:43:31,272 INFO L87 Difference]: Start difference. First operand 2061 states and 3201 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-11 04:43:31,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:43:31,407 INFO L93 Difference]: Finished difference Result 3785 states and 5649 transitions. [2024-10-11 04:43:31,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 04:43:31,408 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-11 04:43:31,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:43:31,421 INFO L225 Difference]: With dead ends: 3785 [2024-10-11 04:43:31,421 INFO L226 Difference]: Without dead ends: 3251 [2024-10-11 04:43:31,423 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-11 04:43:31,424 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-11 04:43:31,424 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-11 04:43:31,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3251 states. [2024-10-11 04:43:31,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3251 to 2593. [2024-10-11 04:43:31,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2593 states, 2591 states have (on average 1.5241219606329603) internal successors, (3949), 2592 states have internal predecessors, (3949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:43:31,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2593 states to 2593 states and 3949 transitions. [2024-10-11 04:43:31,495 INFO L78 Accepts]: Start accepts. Automaton has 2593 states and 3949 transitions. Word has length 50 [2024-10-11 04:43:31,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:43:31,496 INFO L471 AbstractCegarLoop]: Abstraction has 2593 states and 3949 transitions. [2024-10-11 04:43:31,496 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-11 04:43:31,497 INFO L276 IsEmpty]: Start isEmpty. Operand 2593 states and 3949 transitions. [2024-10-11 04:43:31,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-11 04:43:31,497 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:43:31,498 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-11 04:43:31,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 04:43:31,498 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:43:31,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:43:31,498 INFO L85 PathProgramCache]: Analyzing trace with hash 913148432, now seen corresponding path program 1 times [2024-10-11 04:43:31,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:43:31,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341622864] [2024-10-11 04:43:31,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:43:31,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:43:31,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:43:31,631 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-11 04:43:31,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:43:31,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341622864] [2024-10-11 04:43:31,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341622864] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:43:31,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:43:31,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 04:43:31,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440492124] [2024-10-11 04:43:31,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:43:31,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 04:43:31,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:43:31,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 04:43:31,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 04:43:31,634 INFO L87 Difference]: Start difference. First operand 2593 states and 3949 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-11 04:43:31,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:43:31,746 INFO L93 Difference]: Finished difference Result 4317 states and 6397 transitions. [2024-10-11 04:43:31,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 04:43:31,746 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-11 04:43:31,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:43:31,760 INFO L225 Difference]: With dead ends: 4317 [2024-10-11 04:43:31,760 INFO L226 Difference]: Without dead ends: 3783 [2024-10-11 04:43:31,763 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-11 04:43:31,763 INFO L432 NwaCegarLoop]: 1544 mSDtfsCounter, 3047 mSDsluCounter, 1598 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3047 SdHoareTripleChecker+Valid, 3142 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:43:31,764 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3047 Valid, 3142 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:43:31,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3783 states. [2024-10-11 04:43:31,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3783 to 3393. [2024-10-11 04:43:31,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3393 states, 3391 states have (on average 1.4924800943674432) internal successors, (5061), 3392 states have internal predecessors, (5061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:43:31,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3393 states to 3393 states and 5061 transitions. [2024-10-11 04:43:31,848 INFO L78 Accepts]: Start accepts. Automaton has 3393 states and 5061 transitions. Word has length 50 [2024-10-11 04:43:31,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:43:31,848 INFO L471 AbstractCegarLoop]: Abstraction has 3393 states and 5061 transitions. [2024-10-11 04:43:31,849 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-11 04:43:31,849 INFO L276 IsEmpty]: Start isEmpty. Operand 3393 states and 5061 transitions. [2024-10-11 04:43:31,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-11 04:43:31,850 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:43:31,850 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-11 04:43:31,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 04:43:31,850 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:43:31,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:43:31,851 INFO L85 PathProgramCache]: Analyzing trace with hash 615190968, now seen corresponding path program 1 times [2024-10-11 04:43:31,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:43:31,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008149357] [2024-10-11 04:43:31,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:43:31,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:43:31,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:43:31,931 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-11 04:43:31,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:43:31,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008149357] [2024-10-11 04:43:31,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008149357] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:43:31,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:43:31,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:43:31,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377704209] [2024-10-11 04:43:31,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:43:31,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:43:31,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:43:31,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:43:31,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:43:31,934 INFO L87 Difference]: Start difference. First operand 3393 states and 5061 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-11 04:43:31,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:43:31,990 INFO L93 Difference]: Finished difference Result 4756 states and 7011 transitions. [2024-10-11 04:43:31,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:43:31,991 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-11 04:43:31,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:43:32,002 INFO L225 Difference]: With dead ends: 4756 [2024-10-11 04:43:32,002 INFO L226 Difference]: Without dead ends: 2890 [2024-10-11 04:43:32,005 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-11 04:43:32,006 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.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:43:32,006 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 3020 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:43:32,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2890 states. [2024-10-11 04:43:32,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2890 to 2888. [2024-10-11 04:43:32,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2888 states, 2886 states have (on average 1.5107415107415108) internal successors, (4360), 2887 states have internal predecessors, (4360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:43:32,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2888 states to 2888 states and 4360 transitions. [2024-10-11 04:43:32,124 INFO L78 Accepts]: Start accepts. Automaton has 2888 states and 4360 transitions. Word has length 52 [2024-10-11 04:43:32,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:43:32,124 INFO L471 AbstractCegarLoop]: Abstraction has 2888 states and 4360 transitions. [2024-10-11 04:43:32,125 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-11 04:43:32,125 INFO L276 IsEmpty]: Start isEmpty. Operand 2888 states and 4360 transitions. [2024-10-11 04:43:32,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-11 04:43:32,126 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:43:32,126 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-11 04:43:32,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 04:43:32,126 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:43:32,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:43:32,127 INFO L85 PathProgramCache]: Analyzing trace with hash -759813067, now seen corresponding path program 1 times [2024-10-11 04:43:32,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:43:32,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515112317] [2024-10-11 04:43:32,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:43:32,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:43:32,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:43:32,220 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-11 04:43:32,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:43:32,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515112317] [2024-10-11 04:43:32,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515112317] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:43:32,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:43:32,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 04:43:32,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386622318] [2024-10-11 04:43:32,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:43:32,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 04:43:32,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:43:32,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 04:43:32,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 04:43:32,222 INFO L87 Difference]: Start difference. First operand 2888 states and 4360 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-11 04:43:32,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:43:32,334 INFO L93 Difference]: Finished difference Result 4048 states and 6020 transitions. [2024-10-11 04:43:32,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 04:43:32,335 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-11 04:43:32,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:43:32,344 INFO L225 Difference]: With dead ends: 4048 [2024-10-11 04:43:32,344 INFO L226 Difference]: Without dead ends: 3662 [2024-10-11 04:43:32,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-11 04:43:32,347 INFO L432 NwaCegarLoop]: 1541 mSDtfsCounter, 3045 mSDsluCounter, 1589 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3045 SdHoareTripleChecker+Valid, 3130 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:43:32,348 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3045 Valid, 3130 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:43:32,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3662 states. [2024-10-11 04:43:32,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3662 to 3272. [2024-10-11 04:43:32,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3272 states, 3270 states have (on average 1.4996941896024465) internal successors, (4904), 3271 states have internal predecessors, (4904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:43:32,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3272 states to 3272 states and 4904 transitions. [2024-10-11 04:43:32,427 INFO L78 Accepts]: Start accepts. Automaton has 3272 states and 4904 transitions. Word has length 52 [2024-10-11 04:43:32,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:43:32,427 INFO L471 AbstractCegarLoop]: Abstraction has 3272 states and 4904 transitions. [2024-10-11 04:43:32,428 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-11 04:43:32,428 INFO L276 IsEmpty]: Start isEmpty. Operand 3272 states and 4904 transitions. [2024-10-11 04:43:32,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-11 04:43:32,429 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:43:32,429 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-11 04:43:32,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 04:43:32,429 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:43:32,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:43:32,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1640470092, now seen corresponding path program 1 times [2024-10-11 04:43:32,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:43:32,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077093207] [2024-10-11 04:43:32,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:43:32,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:43:32,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:43:32,507 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-11 04:43:32,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:43:32,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077093207] [2024-10-11 04:43:32,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077093207] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:43:32,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:43:32,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:43:32,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111408838] [2024-10-11 04:43:32,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:43:32,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:43:32,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:43:32,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:43:32,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:43:32,509 INFO L87 Difference]: Start difference. First operand 3272 states and 4904 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-11 04:43:32,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:43:32,553 INFO L93 Difference]: Finished difference Result 4140 states and 6130 transitions. [2024-10-11 04:43:32,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:43:32,553 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-11 04:43:32,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:43:32,558 INFO L225 Difference]: With dead ends: 4140 [2024-10-11 04:43:32,558 INFO L226 Difference]: Without dead ends: 2410 [2024-10-11 04:43:32,564 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-11 04:43:32,565 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-11 04:43:32,565 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-11 04:43:32,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2410 states. [2024-10-11 04:43:32,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2410 to 2408. [2024-10-11 04:43:32,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2408 states, 2406 states have (on average 1.5220282626766417) internal successors, (3662), 2407 states have internal predecessors, (3662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:43:32,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2408 states to 2408 states and 3662 transitions. [2024-10-11 04:43:32,627 INFO L78 Accepts]: Start accepts. Automaton has 2408 states and 3662 transitions. Word has length 53 [2024-10-11 04:43:32,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:43:32,627 INFO L471 AbstractCegarLoop]: Abstraction has 2408 states and 3662 transitions. [2024-10-11 04:43:32,628 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-11 04:43:32,628 INFO L276 IsEmpty]: Start isEmpty. Operand 2408 states and 3662 transitions. [2024-10-11 04:43:32,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-11 04:43:32,629 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:43:32,629 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-11 04:43:32,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 04:43:32,629 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:43:32,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:43:32,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1012299426, now seen corresponding path program 1 times [2024-10-11 04:43:32,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:43:32,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251256599] [2024-10-11 04:43:32,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:43:32,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:43:32,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:43:32,714 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-11 04:43:32,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:43:32,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251256599] [2024-10-11 04:43:32,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251256599] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:43:32,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:43:32,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:43:32,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824862323] [2024-10-11 04:43:32,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:43:32,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:43:32,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:43:32,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:43:32,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:43:32,718 INFO L87 Difference]: Start difference. First operand 2408 states and 3662 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-11 04:43:32,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:43:32,749 INFO L93 Difference]: Finished difference Result 2844 states and 4267 transitions. [2024-10-11 04:43:32,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:43:32,750 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-11 04:43:32,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:43:32,754 INFO L225 Difference]: With dead ends: 2844 [2024-10-11 04:43:32,754 INFO L226 Difference]: Without dead ends: 1978 [2024-10-11 04:43:32,756 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-11 04:43:32,756 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-11 04:43:32,756 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-11 04:43:32,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1978 states. [2024-10-11 04:43:32,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1978 to 1976. [2024-10-11 04:43:32,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1976 states, 1974 states have (on average 1.5450861195542047) internal successors, (3050), 1975 states have internal predecessors, (3050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:43:32,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1976 states to 1976 states and 3050 transitions. [2024-10-11 04:43:32,791 INFO L78 Accepts]: Start accepts. Automaton has 1976 states and 3050 transitions. Word has length 55 [2024-10-11 04:43:32,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:43:32,791 INFO L471 AbstractCegarLoop]: Abstraction has 1976 states and 3050 transitions. [2024-10-11 04:43:32,791 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-11 04:43:32,792 INFO L276 IsEmpty]: Start isEmpty. Operand 1976 states and 3050 transitions. [2024-10-11 04:43:32,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-11 04:43:32,792 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:43:32,792 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-11 04:43:32,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 04:43:32,793 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:43:32,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:43:32,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1129129232, now seen corresponding path program 1 times [2024-10-11 04:43:32,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:43:32,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714049504] [2024-10-11 04:43:32,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:43:32,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:43:32,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:43:34,780 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-11 04:43:34,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:43:34,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714049504] [2024-10-11 04:43:34,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714049504] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:43:34,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2043314559] [2024-10-11 04:43:34,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:43:34,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:43:34,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:43:34,784 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 04:43:34,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 04:43:34,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:43:34,897 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 04:43:34,902 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:43:35,105 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-11 04:43:35,106 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 04:43:35,278 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-11 04:43:35,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2043314559] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 04:43:35,278 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 04:43:35,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5, 4] total 18 [2024-10-11 04:43:35,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840456326] [2024-10-11 04:43:35,279 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 04:43:35,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-11 04:43:35,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:43:35,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-11 04:43:35,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2024-10-11 04:43:35,281 INFO L87 Difference]: Start difference. First operand 1976 states and 3050 transitions. Second operand has 18 states, 18 states have (on average 8.722222222222221) internal successors, (157), 18 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:43:38,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:43:38,161 INFO L93 Difference]: Finished difference Result 4285 states and 6132 transitions. [2024-10-11 04:43:38,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-10-11 04:43:38,162 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 8.722222222222221) internal successors, (157), 18 states have internal predecessors, (157), 0 states have call successors, (0), 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-11 04:43:38,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:43:38,170 INFO L225 Difference]: With dead ends: 4285 [2024-10-11 04:43:38,170 INFO L226 Difference]: Without dead ends: 3851 [2024-10-11 04:43:38,173 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1082 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=719, Invalid=3063, Unknown=0, NotChecked=0, Total=3782 [2024-10-11 04:43:38,173 INFO L432 NwaCegarLoop]: 1492 mSDtfsCounter, 17155 mSDsluCounter, 6118 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17155 SdHoareTripleChecker+Valid, 7610 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 04:43:38,174 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17155 Valid, 7610 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 04:43:38,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3851 states. [2024-10-11 04:43:38,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3851 to 3773. [2024-10-11 04:43:38,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3773 states, 3771 states have (on average 1.4041368337311058) internal successors, (5295), 3772 states have internal predecessors, (5295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:43:38,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3773 states to 3773 states and 5295 transitions. [2024-10-11 04:43:38,316 INFO L78 Accepts]: Start accepts. Automaton has 3773 states and 5295 transitions. Word has length 57 [2024-10-11 04:43:38,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:43:38,316 INFO L471 AbstractCegarLoop]: Abstraction has 3773 states and 5295 transitions. [2024-10-11 04:43:38,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 8.722222222222221) internal successors, (157), 18 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:43:38,317 INFO L276 IsEmpty]: Start isEmpty. Operand 3773 states and 5295 transitions. [2024-10-11 04:43:38,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 04:43:38,317 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:43:38,318 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] [2024-10-11 04:43:38,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 04:43:38,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-11 04:43:38,519 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:43:38,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:43:38,520 INFO L85 PathProgramCache]: Analyzing trace with hash 2092021697, now seen corresponding path program 1 times [2024-10-11 04:43:38,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:43:38,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812059495] [2024-10-11 04:43:38,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:43:38,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:43:38,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:43:40,720 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-11 04:43:40,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:43:40,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812059495] [2024-10-11 04:43:40,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812059495] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:43:40,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [897533210] [2024-10-11 04:43:40,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:43:40,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:43:40,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:43:40,722 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 04:43:40,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 04:43:40,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:43:40,814 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-11 04:43:40,816 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:43:41,206 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-11 04:43:41,207 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 04:43:41,779 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-11 04:43:41,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [897533210] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 04:43:41,779 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 04:43:41,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 25 [2024-10-11 04:43:41,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577611569] [2024-10-11 04:43:41,780 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 04:43:41,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-11 04:43:41,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:43:41,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-11 04:43:41,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=549, Unknown=0, NotChecked=0, Total=650 [2024-10-11 04:43:41,781 INFO L87 Difference]: Start difference. First operand 3773 states and 5295 transitions. Second operand has 26 states, 26 states have (on average 5.423076923076923) internal successors, (141), 25 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:43:42,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:43:42,331 INFO L93 Difference]: Finished difference Result 7800 states and 10468 transitions. [2024-10-11 04:43:42,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:43:42,331 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.423076923076923) internal successors, (141), 25 states have internal predecessors, (141), 0 states have call successors, (0), 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-11 04:43:42,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:43:42,340 INFO L225 Difference]: With dead ends: 7800 [2024-10-11 04:43:42,340 INFO L226 Difference]: Without dead ends: 5959 [2024-10-11 04:43:42,342 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=298, Invalid=1034, Unknown=0, NotChecked=0, Total=1332 [2024-10-11 04:43:42,344 INFO L432 NwaCegarLoop]: 1489 mSDtfsCounter, 16628 mSDsluCounter, 3193 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16628 SdHoareTripleChecker+Valid, 4682 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 04:43:42,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16628 Valid, 4682 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 04:43:42,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5959 states. [2024-10-11 04:43:42,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5959 to 5893. [2024-10-11 04:43:42,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5893 states, 5891 states have (on average 1.3427261924970293) internal successors, (7910), 5892 states have internal predecessors, (7910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:43:42,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5893 states to 5893 states and 7910 transitions. [2024-10-11 04:43:42,507 INFO L78 Accepts]: Start accepts. Automaton has 5893 states and 7910 transitions. Word has length 58 [2024-10-11 04:43:42,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:43:42,507 INFO L471 AbstractCegarLoop]: Abstraction has 5893 states and 7910 transitions. [2024-10-11 04:43:42,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.423076923076923) internal successors, (141), 25 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:43:42,507 INFO L276 IsEmpty]: Start isEmpty. Operand 5893 states and 7910 transitions. [2024-10-11 04:43:42,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 04:43:42,510 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:43:42,510 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-11 04:43:42,527 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 04:43:42,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-11 04:43:42,715 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:43:42,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:43:42,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1421483023, now seen corresponding path program 1 times [2024-10-11 04:43:42,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:43:42,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898828547] [2024-10-11 04:43:42,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:43:42,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:43:42,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:43:43,044 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-11 04:43:43,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:43:43,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898828547] [2024-10-11 04:43:43,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898828547] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:43:43,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [501455668] [2024-10-11 04:43:43,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:43:43,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:43:43,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:43:43,047 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 04:43:43,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 04:43:43,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:43:43,215 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-11 04:43:43,217 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:43:43,682 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-11 04:43:43,682 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 04:43:44,368 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-11 04:43:44,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [501455668] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 04:43:44,369 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 04:43:44,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 13] total 32 [2024-10-11 04:43:44,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466547706] [2024-10-11 04:43:44,369 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 04:43:44,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-10-11 04:43:44,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:43:44,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-10-11 04:43:44,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=887, Unknown=0, NotChecked=0, Total=992 [2024-10-11 04:43:44,371 INFO L87 Difference]: Start difference. First operand 5893 states and 7910 transitions. Second operand has 32 states, 32 states have (on average 4.65625) internal successors, (149), 32 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:43:47,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:43:47,319 INFO L93 Difference]: Finished difference Result 15452 states and 20018 transitions. [2024-10-11 04:43:47,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2024-10-11 04:43:47,319 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 4.65625) internal successors, (149), 32 states have internal predecessors, (149), 0 states have call successors, (0), 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-11 04:43:47,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:43:47,340 INFO L225 Difference]: With dead ends: 15452 [2024-10-11 04:43:47,340 INFO L226 Difference]: Without dead ends: 11590 [2024-10-11 04:43:47,350 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1630 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1214, Invalid=5592, Unknown=0, NotChecked=0, Total=6806 [2024-10-11 04:43:47,350 INFO L432 NwaCegarLoop]: 1502 mSDtfsCounter, 15605 mSDsluCounter, 13951 mSDsCounter, 0 mSdLazyCounter, 980 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15605 SdHoareTripleChecker+Valid, 15453 SdHoareTripleChecker+Invalid, 1028 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 980 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 04:43:47,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15605 Valid, 15453 Invalid, 1028 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 980 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 04:43:47,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11590 states. [2024-10-11 04:43:47,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11590 to 7928. [2024-10-11 04:43:47,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7928 states, 7926 states have (on average 1.3115064345193035) internal successors, (10395), 7927 states have internal predecessors, (10395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:43:47,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7928 states to 7928 states and 10395 transitions. [2024-10-11 04:43:47,711 INFO L78 Accepts]: Start accepts. Automaton has 7928 states and 10395 transitions. Word has length 58 [2024-10-11 04:43:47,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:43:47,711 INFO L471 AbstractCegarLoop]: Abstraction has 7928 states and 10395 transitions. [2024-10-11 04:43:47,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 4.65625) internal successors, (149), 32 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:43:47,712 INFO L276 IsEmpty]: Start isEmpty. Operand 7928 states and 10395 transitions. [2024-10-11 04:43:47,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-11 04:43:47,712 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:43:47,713 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-11 04:43:47,730 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-11 04:43:47,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:43:47,914 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:43:47,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:43:47,914 INFO L85 PathProgramCache]: Analyzing trace with hash 572180868, now seen corresponding path program 1 times [2024-10-11 04:43:47,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:43:47,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058712697] [2024-10-11 04:43:47,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:43:47,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:43:47,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:43:48,260 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-11 04:43:48,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:43:48,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058712697] [2024-10-11 04:43:48,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058712697] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:43:48,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [259055385] [2024-10-11 04:43:48,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:43:48,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:43:48,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:43:48,263 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 04:43:48,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 04:43:48,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:43:48,359 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-11 04:43:48,361 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:43:48,681 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-11 04:43:48,681 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 04:43:49,136 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-11 04:43:49,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [259055385] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 04:43:49,137 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 04:43:49,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2024-10-11 04:43:49,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453813724] [2024-10-11 04:43:49,138 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 04:43:49,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-11 04:43:49,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:43:49,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-11 04:43:49,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2024-10-11 04:43:49,139 INFO L87 Difference]: Start difference. First operand 7928 states and 10395 transitions. Second operand has 21 states, 21 states have (on average 6.190476190476191) internal successors, (130), 20 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:43:49,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:43:49,669 INFO L93 Difference]: Finished difference Result 13504 states and 17416 transitions. [2024-10-11 04:43:49,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 04:43:49,670 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 6.190476190476191) internal successors, (130), 20 states have internal predecessors, (130), 0 states have call successors, (0), 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-11 04:43:49,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:43:49,684 INFO L225 Difference]: With dead ends: 13504 [2024-10-11 04:43:49,684 INFO L226 Difference]: Without dead ends: 8244 [2024-10-11 04:43:49,693 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=243, Invalid=749, Unknown=0, NotChecked=0, Total=992 [2024-10-11 04:43:49,694 INFO L432 NwaCegarLoop]: 1495 mSDtfsCounter, 10579 mSDsluCounter, 3188 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10579 SdHoareTripleChecker+Valid, 4683 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 04:43:49,694 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10579 Valid, 4683 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 04:43:49,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8244 states. [2024-10-11 04:43:49,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8244 to 7852. [2024-10-11 04:43:49,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7852 states, 7850 states have (on average 1.301656050955414) internal successors, (10218), 7851 states have internal predecessors, (10218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:43:50,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7852 states to 7852 states and 10218 transitions. [2024-10-11 04:43:50,012 INFO L78 Accepts]: Start accepts. Automaton has 7852 states and 10218 transitions. Word has length 59 [2024-10-11 04:43:50,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:43:50,012 INFO L471 AbstractCegarLoop]: Abstraction has 7852 states and 10218 transitions. [2024-10-11 04:43:50,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 6.190476190476191) internal successors, (130), 20 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:43:50,013 INFO L276 IsEmpty]: Start isEmpty. Operand 7852 states and 10218 transitions. [2024-10-11 04:43:50,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-11 04:43:50,014 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:43:50,014 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, 1] [2024-10-11 04:43:50,034 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 04:43:50,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:43:50,215 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:43:50,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:43:50,215 INFO L85 PathProgramCache]: Analyzing trace with hash 49576658, now seen corresponding path program 1 times [2024-10-11 04:43:50,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:43:50,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533301272] [2024-10-11 04:43:50,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:43:50,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:43:50,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:43:50,914 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-11 04:43:50,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:43:50,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533301272] [2024-10-11 04:43:50,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533301272] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:43:50,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1848767929] [2024-10-11 04:43:50,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:43:50,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:43:50,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:43:50,917 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 04:43:50,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 04:43:51,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:43:51,063 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-10-11 04:43:51,065 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:43:52,600 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-11 04:43:52,601 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 04:43:55,034 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-11 04:43:55,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1848767929] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 04:43:55,035 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 04:43:55,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 18, 17] total 43 [2024-10-11 04:43:55,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322598102] [2024-10-11 04:43:55,035 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 04:43:55,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-10-11 04:43:55,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:43:55,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-10-11 04:43:55,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=1585, Unknown=0, NotChecked=0, Total=1806 [2024-10-11 04:43:55,039 INFO L87 Difference]: Start difference. First operand 7852 states and 10218 transitions. Second operand has 43 states, 43 states have (on average 3.558139534883721) internal successors, (153), 43 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:44:01,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:44:01,830 INFO L93 Difference]: Finished difference Result 10066 states and 13001 transitions. [2024-10-11 04:44:01,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2024-10-11 04:44:01,830 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 3.558139534883721) internal successors, (153), 43 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2024-10-11 04:44:01,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:44:01,842 INFO L225 Difference]: With dead ends: 10066 [2024-10-11 04:44:01,842 INFO L226 Difference]: Without dead ends: 6575 [2024-10-11 04:44:01,850 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2596 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=2067, Invalid=8033, Unknown=0, NotChecked=0, Total=10100 [2024-10-11 04:44:01,851 INFO L432 NwaCegarLoop]: 1523 mSDtfsCounter, 14514 mSDsluCounter, 21637 mSDsCounter, 0 mSdLazyCounter, 1734 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14514 SdHoareTripleChecker+Valid, 23160 SdHoareTripleChecker+Invalid, 1791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 04:44:01,852 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14514 Valid, 23160 Invalid, 1791 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [57 Valid, 1734 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 04:44:01,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6575 states. [2024-10-11 04:44:02,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6575 to 6213. [2024-10-11 04:44:02,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6213 states, 6211 states have (on average 1.3179842215424247) internal successors, (8186), 6212 states have internal predecessors, (8186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:44:02,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6213 states to 6213 states and 8186 transitions. [2024-10-11 04:44:02,140 INFO L78 Accepts]: Start accepts. Automaton has 6213 states and 8186 transitions. Word has length 59 [2024-10-11 04:44:02,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:44:02,141 INFO L471 AbstractCegarLoop]: Abstraction has 6213 states and 8186 transitions. [2024-10-11 04:44:02,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 3.558139534883721) internal successors, (153), 43 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:44:02,141 INFO L276 IsEmpty]: Start isEmpty. Operand 6213 states and 8186 transitions. [2024-10-11 04:44:02,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-11 04:44:02,142 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:44:02,142 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, 1, 1] [2024-10-11 04:44:02,160 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 04:44:02,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:44:02,344 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:44:02,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:44:02,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1839133400, now seen corresponding path program 1 times [2024-10-11 04:44:02,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:44:02,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666673918] [2024-10-11 04:44:02,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:44:02,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:44:02,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:44:03,940 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-11 04:44:03,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:44:03,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666673918] [2024-10-11 04:44:03,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666673918] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:44:03,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2091590116] [2024-10-11 04:44:03,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:44:03,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:44:03,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:44:03,942 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 04:44:03,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 04:44:04,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:44:04,050 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-11 04:44:04,051 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:44:07,143 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-11 04:44:07,143 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 04:44:10,208 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-11 04:44:10,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2091590116] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 04:44:10,208 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 04:44:10,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20, 20] total 57 [2024-10-11 04:44:10,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641323971] [2024-10-11 04:44:10,209 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 04:44:10,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2024-10-11 04:44:10,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:44:10,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2024-10-11 04:44:10,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=2885, Unknown=0, NotChecked=0, Total=3192 [2024-10-11 04:44:10,211 INFO L87 Difference]: Start difference. First operand 6213 states and 8186 transitions. Second operand has 57 states, 57 states have (on average 2.824561403508772) internal successors, (161), 57 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)