./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_overflow.ufo.UNBOUNDED.pals+Problem12_label02.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_overflow.ufo.UNBOUNDED.pals+Problem12_label02.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 5f3e3e9ccc5a5069122f9a5e86045d7e13172c8034d09d1e159c68b2e816764e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 04:43:21,469 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 04:43:21,560 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:21,567 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 04:43:21,569 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 04:43:21,603 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 04:43:21,605 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 04:43:21,605 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 04:43:21,606 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 04:43:21,606 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 04:43:21,606 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 04:43:21,607 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 04:43:21,607 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 04:43:21,608 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 04:43:21,609 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 04:43:21,611 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 04:43:21,611 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 04:43:21,611 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 04:43:21,612 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 04:43:21,612 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 04:43:21,612 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 04:43:21,613 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 04:43:21,616 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 04:43:21,616 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 04:43:21,616 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 04:43:21,617 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 04:43:21,617 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 04:43:21,617 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 04:43:21,617 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 04:43:21,617 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 04:43:21,618 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 04:43:21,618 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 04:43:21,618 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:43:21,618 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 04:43:21,619 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 04:43:21,619 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 04:43:21,619 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 04:43:21,621 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 04:43:21,621 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 04:43:21,621 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 04:43:21,622 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 04:43:21,623 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 04:43:21,623 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 -> 5f3e3e9ccc5a5069122f9a5e86045d7e13172c8034d09d1e159c68b2e816764e [2024-10-11 04:43:21,882 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 04:43:21,931 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 04:43:21,939 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 04:43:21,940 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 04:43:21,940 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 04:43:21,941 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3_overflow.ufo.UNBOUNDED.pals+Problem12_label02.c [2024-10-11 04:43:23,759 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 04:43:24,597 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 04:43:24,598 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3_overflow.ufo.UNBOUNDED.pals+Problem12_label02.c [2024-10-11 04:43:24,620 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b0c8bf7b7/83448cd2390c4ff7808d7b588535dbd2/FLAG9be417de7 [2024-10-11 04:43:24,859 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b0c8bf7b7/83448cd2390c4ff7808d7b588535dbd2 [2024-10-11 04:43:24,862 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 04:43:24,863 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 04:43:24,864 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 04:43:24,864 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 04:43:24,868 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 04:43:24,869 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:43:24" (1/1) ... [2024-10-11 04:43:24,871 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78b5ebab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:43:24, skipping insertion in model container [2024-10-11 04:43:24,871 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:43:24" (1/1) ... [2024-10-11 04:43:24,947 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 04:43:25,196 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_overflow.ufo.UNBOUNDED.pals+Problem12_label02.c[6524,6537] [2024-10-11 04:43:25,239 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_overflow.ufo.UNBOUNDED.pals+Problem12_label02.c[13814,13827] [2024-10-11 04:43:25,794 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:43:25,807 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 04:43:25,833 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_overflow.ufo.UNBOUNDED.pals+Problem12_label02.c[6524,6537] [2024-10-11 04:43:25,846 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_overflow.ufo.UNBOUNDED.pals+Problem12_label02.c[13814,13827] [2024-10-11 04:43:26,149 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:43:26,170 INFO L204 MainTranslator]: Completed translation [2024-10-11 04:43:26,171 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:43:26 WrapperNode [2024-10-11 04:43:26,171 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 04:43:26,172 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 04:43:26,172 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 04:43:26,172 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 04:43:26,177 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:26" (1/1) ... [2024-10-11 04:43:26,217 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:26" (1/1) ... [2024-10-11 04:43:26,510 INFO L138 Inliner]: procedures = 35, calls = 20, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 4981 [2024-10-11 04:43:26,511 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 04:43:26,513 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 04:43:26,513 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 04:43:26,513 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 04:43:26,524 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:26" (1/1) ... [2024-10-11 04:43:26,525 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:26" (1/1) ... [2024-10-11 04:43:26,577 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:26" (1/1) ... [2024-10-11 04:43:26,903 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:26,903 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:26" (1/1) ... [2024-10-11 04:43:26,904 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:26" (1/1) ... [2024-10-11 04:43:27,085 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:26" (1/1) ... [2024-10-11 04:43:27,127 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:26" (1/1) ... [2024-10-11 04:43:27,159 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:26" (1/1) ... [2024-10-11 04:43:27,188 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:26" (1/1) ... [2024-10-11 04:43:27,288 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 04:43:27,293 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 04:43:27,293 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 04:43:27,293 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 04:43:27,293 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:43:26" (1/1) ... [2024-10-11 04:43:27,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:43:27,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:43:27,332 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:27,341 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:27,387 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 04:43:27,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 04:43:27,388 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 04:43:27,388 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 04:43:27,485 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 04:43:27,487 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 04:43:31,388 INFO L? ?]: Removed 734 outVars from TransFormulas that were not future-live. [2024-10-11 04:43:31,389 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 04:43:31,463 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 04:43:31,464 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 04:43:31,464 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:43:31 BoogieIcfgContainer [2024-10-11 04:43:31,464 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 04:43:31,466 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 04:43:31,466 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 04:43:31,468 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 04:43:31,469 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 04:43:24" (1/3) ... [2024-10-11 04:43:31,469 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@489a493d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:43:31, skipping insertion in model container [2024-10-11 04:43:31,469 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:43:26" (2/3) ... [2024-10-11 04:43:31,469 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@489a493d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:43:31, skipping insertion in model container [2024-10-11 04:43:31,470 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:43:31" (3/3) ... [2024-10-11 04:43:31,470 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3_overflow.ufo.UNBOUNDED.pals+Problem12_label02.c [2024-10-11 04:43:31,482 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 04:43:31,482 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 04:43:31,574 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 04:43:31,591 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;@49222680, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 04:43:31,592 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 04:43:31,607 INFO L276 IsEmpty]: Start isEmpty. Operand has 807 states, 804 states have (on average 1.9800995024875623) internal successors, (1592), 806 states have internal predecessors, (1592), 0 states have call successors, (0), 0 states 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,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 04:43:31,626 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:43:31,627 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:31,627 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:43:31,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:43:31,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1100216757, now seen corresponding path program 1 times [2024-10-11 04:43:31,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:43:31,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885882049] [2024-10-11 04:43:31,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:43:31,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:43:31,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:43:32,067 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:32,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:43:32,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885882049] [2024-10-11 04:43:32,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885882049] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:43:32,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:43:32,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 04:43:32,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145664978] [2024-10-11 04:43:32,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:43:32,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 04:43:32,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:43:32,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 04:43:32,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 04:43:32,136 INFO L87 Difference]: Start difference. First operand has 807 states, 804 states have (on average 1.9800995024875623) internal successors, (1592), 806 states have internal predecessors, (1592), 0 states have call successors, (0), 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:32,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:43:32,324 INFO L93 Difference]: Finished difference Result 1593 states and 3145 transitions. [2024-10-11 04:43:32,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 04:43:32,326 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:32,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:43:32,365 INFO L225 Difference]: With dead ends: 1593 [2024-10-11 04:43:32,369 INFO L226 Difference]: Without dead ends: 803 [2024-10-11 04:43:32,381 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:32,390 INFO L432 NwaCegarLoop]: 1520 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, 1520 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:32,391 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1520 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:32,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2024-10-11 04:43:32,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 803. [2024-10-11 04:43:32,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 803 states, 801 states have (on average 1.898876404494382) internal successors, (1521), 802 states have internal predecessors, (1521), 0 states have call successors, (0), 0 states 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,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1521 transitions. [2024-10-11 04:43:32,533 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1521 transitions. Word has length 17 [2024-10-11 04:43:32,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:43:32,535 INFO L471 AbstractCegarLoop]: Abstraction has 803 states and 1521 transitions. [2024-10-11 04:43:32,536 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:32,536 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1521 transitions. [2024-10-11 04:43:32,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 04:43:32,537 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:43:32,537 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:32,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 04:43:32,542 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:43:32,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:43:32,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1687022771, now seen corresponding path program 1 times [2024-10-11 04:43:32,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:43:32,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158429081] [2024-10-11 04:43:32,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:43:32,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:43:32,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:43:32,842 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:32,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:43:32,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158429081] [2024-10-11 04:43:32,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158429081] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:43:32,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:43:32,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 04:43:32,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808617829] [2024-10-11 04:43:32,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:43:32,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 04:43:32,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:43:32,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 04:43:32,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 04:43:32,850 INFO L87 Difference]: Start difference. First operand 803 states and 1521 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:32,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:43:32,951 INFO L93 Difference]: Finished difference Result 835 states and 1570 transitions. [2024-10-11 04:43:32,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 04:43:32,952 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:32,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:43:32,956 INFO L225 Difference]: With dead ends: 835 [2024-10-11 04:43:32,956 INFO L226 Difference]: Without dead ends: 803 [2024-10-11 04:43:32,956 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:32,958 INFO L432 NwaCegarLoop]: 1518 mSDtfsCounter, 0 mSDsluCounter, 3016 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4534 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.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:43:32,958 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4534 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:43:32,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2024-10-11 04:43:32,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 803. [2024-10-11 04:43:32,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 803 states, 801 states have (on average 1.8789013732833957) internal successors, (1505), 802 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states 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,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1505 transitions. [2024-10-11 04:43:32,978 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1505 transitions. Word has length 17 [2024-10-11 04:43:32,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:43:32,978 INFO L471 AbstractCegarLoop]: Abstraction has 803 states and 1505 transitions. [2024-10-11 04:43:32,979 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:32,979 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1505 transitions. [2024-10-11 04:43:32,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-11 04:43:32,980 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:43:32,980 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:43:32,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 04:43:32,981 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:43:32,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:43:32,981 INFO L85 PathProgramCache]: Analyzing trace with hash 613121839, now seen corresponding path program 1 times [2024-10-11 04:43:32,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:43:32,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768989868] [2024-10-11 04:43:32,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:43:32,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:43:33,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:43:33,172 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:33,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:43:33,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768989868] [2024-10-11 04:43:33,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768989868] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:43:33,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:43:33,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 04:43:33,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432934808] [2024-10-11 04:43:33,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:43:33,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 04:43:33,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:43:33,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 04:43:33,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 04:43:33,179 INFO L87 Difference]: Start difference. First operand 803 states and 1505 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:33,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:43:33,346 INFO L93 Difference]: Finished difference Result 977 states and 1781 transitions. [2024-10-11 04:43:33,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:43:33,350 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:33,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:43:33,354 INFO L225 Difference]: With dead ends: 977 [2024-10-11 04:43:33,355 INFO L226 Difference]: Without dead ends: 948 [2024-10-11 04:43:33,357 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:33,358 INFO L432 NwaCegarLoop]: 1498 mSDtfsCounter, 4578 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4578 SdHoareTripleChecker+Valid, 1841 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:43:33,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4578 Valid, 1841 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:43:33,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 948 states. [2024-10-11 04:43:33,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 948 to 830. [2024-10-11 04:43:33,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 830 states, 828 states have (on average 1.8695652173913044) internal successors, (1548), 829 states have internal predecessors, (1548), 0 states have call successors, (0), 0 states 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:33,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1548 transitions. [2024-10-11 04:43:33,380 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1548 transitions. Word has length 32 [2024-10-11 04:43:33,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:43:33,383 INFO L471 AbstractCegarLoop]: Abstraction has 830 states and 1548 transitions. [2024-10-11 04:43:33,384 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:33,384 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1548 transitions. [2024-10-11 04:43:33,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-11 04:43:33,385 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:43:33,385 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:33,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 04:43:33,386 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:43:33,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:43:33,386 INFO L85 PathProgramCache]: Analyzing trace with hash 675954815, now seen corresponding path program 1 times [2024-10-11 04:43:33,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:43:33,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099547327] [2024-10-11 04:43:33,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:43:33,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:43:33,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:43:33,475 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:33,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:43:33,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099547327] [2024-10-11 04:43:33,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099547327] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:43:33,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:43:33,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:43:33,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829910021] [2024-10-11 04:43:33,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:43:33,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:43:33,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:43:33,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:43:33,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:43:33,478 INFO L87 Difference]: Start difference. First operand 830 states and 1548 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:33,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:43:33,519 INFO L93 Difference]: Finished difference Result 931 states and 1707 transitions. [2024-10-11 04:43:33,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:43:33,520 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:33,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:43:33,524 INFO L225 Difference]: With dead ends: 931 [2024-10-11 04:43:33,524 INFO L226 Difference]: Without dead ends: 875 [2024-10-11 04:43:33,525 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:33,526 INFO L432 NwaCegarLoop]: 1500 mSDtfsCounter, 1464 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1464 SdHoareTripleChecker+Valid, 1540 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:43:33,526 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1464 Valid, 1540 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:43:33,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2024-10-11 04:43:33,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 873. [2024-10-11 04:43:33,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 871 states have (on average 1.8530424799081515) internal successors, (1614), 872 states have internal predecessors, (1614), 0 states have call successors, (0), 0 states 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:33,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1614 transitions. [2024-10-11 04:43:33,551 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1614 transitions. Word has length 34 [2024-10-11 04:43:33,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:43:33,552 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1614 transitions. [2024-10-11 04:43:33,552 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:33,552 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1614 transitions. [2024-10-11 04:43:33,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-11 04:43:33,554 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:43:33,554 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:33,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 04:43:33,554 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:43:33,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:43:33,555 INFO L85 PathProgramCache]: Analyzing trace with hash 678099767, now seen corresponding path program 1 times [2024-10-11 04:43:33,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:43:33,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773479474] [2024-10-11 04:43:33,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:43:33,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:43:33,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:43:33,742 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:33,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:43:33,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773479474] [2024-10-11 04:43:33,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773479474] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:43:33,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:43:33,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 04:43:33,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24183138] [2024-10-11 04:43:33,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:43:33,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 04:43:33,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:43:33,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 04:43:33,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 04:43:33,745 INFO L87 Difference]: Start difference. First operand 873 states and 1614 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:33,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:43:33,882 INFO L93 Difference]: Finished difference Result 974 states and 1770 transitions. [2024-10-11 04:43:33,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 04:43:33,883 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:33,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:43:33,891 INFO L225 Difference]: With dead ends: 974 [2024-10-11 04:43:33,891 INFO L226 Difference]: Without dead ends: 875 [2024-10-11 04:43:33,892 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-11 04:43:33,896 INFO L432 NwaCegarLoop]: 1497 mSDtfsCounter, 4411 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4411 SdHoareTripleChecker+Valid, 1579 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:43:33,896 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4411 Valid, 1579 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:43:33,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2024-10-11 04:43:33,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 873. [2024-10-11 04:43:33,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 871 states have (on average 1.8507462686567164) internal successors, (1612), 872 states have internal predecessors, (1612), 0 states have call successors, (0), 0 states 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:33,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1612 transitions. [2024-10-11 04:43:33,940 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1612 transitions. Word has length 34 [2024-10-11 04:43:33,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:43:33,940 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1612 transitions. [2024-10-11 04:43:33,941 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:33,941 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1612 transitions. [2024-10-11 04:43:33,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-11 04:43:33,942 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:43:33,942 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:33,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 04:43:33,942 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:43:33,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:43:33,943 INFO L85 PathProgramCache]: Analyzing trace with hash -582127364, now seen corresponding path program 1 times [2024-10-11 04:43:33,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:43:33,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780843907] [2024-10-11 04:43:33,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:43:33,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:43:33,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:43:34,150 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:34,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:43:34,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780843907] [2024-10-11 04:43:34,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780843907] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:43:34,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:43:34,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 04:43:34,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845063472] [2024-10-11 04:43:34,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:43:34,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 04:43:34,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:43:34,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 04:43:34,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 04:43:34,152 INFO L87 Difference]: Start difference. First operand 873 states and 1612 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:34,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:43:34,192 INFO L93 Difference]: Finished difference Result 879 states and 1619 transitions. [2024-10-11 04:43:34,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 04:43:34,195 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:34,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:43:34,197 INFO L225 Difference]: With dead ends: 879 [2024-10-11 04:43:34,197 INFO L226 Difference]: Without dead ends: 877 [2024-10-11 04:43:34,198 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:34,198 INFO L432 NwaCegarLoop]: 1501 mSDtfsCounter, 0 mSDsluCounter, 2994 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4495 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:34,199 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4495 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:34,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2024-10-11 04:43:34,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 877. [2024-10-11 04:43:34,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 877 states, 875 states have (on average 1.8457142857142856) internal successors, (1615), 876 states have internal predecessors, (1615), 0 states have call successors, (0), 0 states 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:34,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 1615 transitions. [2024-10-11 04:43:34,211 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 1615 transitions. Word has length 35 [2024-10-11 04:43:34,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:43:34,211 INFO L471 AbstractCegarLoop]: Abstraction has 877 states and 1615 transitions. [2024-10-11 04:43:34,211 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:34,211 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1615 transitions. [2024-10-11 04:43:34,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-11 04:43:34,212 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:43:34,212 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:34,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 04:43:34,212 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:43:34,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:43:34,213 INFO L85 PathProgramCache]: Analyzing trace with hash 2127458807, now seen corresponding path program 1 times [2024-10-11 04:43:34,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:43:34,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740850894] [2024-10-11 04:43:34,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:43:34,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:43:34,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:43:34,248 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:34,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:43:34,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740850894] [2024-10-11 04:43:34,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740850894] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:43:34,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:43:34,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:43:34,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459757132] [2024-10-11 04:43:34,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:43:34,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:43:34,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:43:34,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:43:34,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:43:34,250 INFO L87 Difference]: Start difference. First operand 877 states and 1615 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:34,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:43:34,277 INFO L93 Difference]: Finished difference Result 991 states and 1788 transitions. [2024-10-11 04:43:34,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:43:34,277 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:34,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:43:34,280 INFO L225 Difference]: With dead ends: 991 [2024-10-11 04:43:34,280 INFO L226 Difference]: Without dead ends: 931 [2024-10-11 04:43:34,281 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:34,281 INFO L432 NwaCegarLoop]: 1532 mSDtfsCounter, 1474 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1474 SdHoareTripleChecker+Valid, 1578 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:34,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1474 Valid, 1578 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:34,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2024-10-11 04:43:34,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 929. [2024-10-11 04:43:34,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 929 states, 927 states have (on average 1.825242718446602) internal successors, (1692), 928 states have internal predecessors, (1692), 0 states have call successors, (0), 0 states 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:34,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1692 transitions. [2024-10-11 04:43:34,297 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1692 transitions. Word has length 36 [2024-10-11 04:43:34,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:43:34,297 INFO L471 AbstractCegarLoop]: Abstraction has 929 states and 1692 transitions. [2024-10-11 04:43:34,297 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:34,298 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1692 transitions. [2024-10-11 04:43:34,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-11 04:43:34,298 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:43:34,298 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:34,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 04:43:34,298 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:43:34,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:43:34,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1501802743, now seen corresponding path program 1 times [2024-10-11 04:43:34,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:43:34,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001575615] [2024-10-11 04:43:34,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:43:34,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:43:34,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:43:34,326 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:34,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:43:34,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001575615] [2024-10-11 04:43:34,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001575615] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:43:34,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:43:34,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:43:34,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565165856] [2024-10-11 04:43:34,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:43:34,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:43:34,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:43:34,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:43:34,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:43:34,328 INFO L87 Difference]: Start difference. First operand 929 states and 1692 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:34,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:43:34,353 INFO L93 Difference]: Finished difference Result 1211 states and 2112 transitions. [2024-10-11 04:43:34,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:43:34,354 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:34,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:43:34,357 INFO L225 Difference]: With dead ends: 1211 [2024-10-11 04:43:34,357 INFO L226 Difference]: Without dead ends: 1058 [2024-10-11 04:43:34,358 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:34,358 INFO L432 NwaCegarLoop]: 1534 mSDtfsCounter, 1472 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1472 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:34,358 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1472 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:34,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1058 states. [2024-10-11 04:43:34,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1058 to 1056. [2024-10-11 04:43:34,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1056 states, 1054 states have (on average 1.777988614800759) internal successors, (1874), 1055 states have internal predecessors, (1874), 0 states have call successors, (0), 0 states 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:34,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1056 states to 1056 states and 1874 transitions. [2024-10-11 04:43:34,454 INFO L78 Accepts]: Start accepts. Automaton has 1056 states and 1874 transitions. Word has length 36 [2024-10-11 04:43:34,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:43:34,454 INFO L471 AbstractCegarLoop]: Abstraction has 1056 states and 1874 transitions. [2024-10-11 04:43:34,455 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:34,455 INFO L276 IsEmpty]: Start isEmpty. Operand 1056 states and 1874 transitions. [2024-10-11 04:43:34,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-11 04:43:34,455 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:43:34,455 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:34,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 04:43:34,455 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:43:34,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:43:34,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1904431113, now seen corresponding path program 1 times [2024-10-11 04:43:34,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:43:34,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57032026] [2024-10-11 04:43:34,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:43:34,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:43:34,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:43:34,503 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:34,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:43:34,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57032026] [2024-10-11 04:43:34,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57032026] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:43:34,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:43:34,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:43:34,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469465405] [2024-10-11 04:43:34,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:43:34,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:43:34,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:43:34,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:43:34,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:43:34,505 INFO L87 Difference]: Start difference. First operand 1056 states and 1874 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:34,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:43:34,535 INFO L93 Difference]: Finished difference Result 1568 states and 2616 transitions. [2024-10-11 04:43:34,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:43:34,536 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:34,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:43:34,539 INFO L225 Difference]: With dead ends: 1568 [2024-10-11 04:43:34,540 INFO L226 Difference]: Without dead ends: 1288 [2024-10-11 04:43:34,540 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:34,541 INFO L432 NwaCegarLoop]: 1532 mSDtfsCounter, 1470 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1470 SdHoareTripleChecker+Valid, 1586 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:34,541 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1470 Valid, 1586 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:34,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1288 states. [2024-10-11 04:43:34,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1288 to 1286. [2024-10-11 04:43:34,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1286 states, 1284 states have (on average 1.705607476635514) internal successors, (2190), 1285 states have internal predecessors, (2190), 0 states have call successors, (0), 0 states 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:34,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1286 states to 1286 states and 2190 transitions. [2024-10-11 04:43:34,563 INFO L78 Accepts]: Start accepts. Automaton has 1286 states and 2190 transitions. Word has length 36 [2024-10-11 04:43:34,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:43:34,563 INFO L471 AbstractCegarLoop]: Abstraction has 1286 states and 2190 transitions. [2024-10-11 04:43:34,563 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:34,564 INFO L276 IsEmpty]: Start isEmpty. Operand 1286 states and 2190 transitions. [2024-10-11 04:43:34,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-11 04:43:34,564 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:43:34,564 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:34,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 04:43:34,565 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:43:34,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:43:34,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1853448570, now seen corresponding path program 1 times [2024-10-11 04:43:34,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:43:34,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675725213] [2024-10-11 04:43:34,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:43:34,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:43:34,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:43:34,641 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:34,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:43:34,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675725213] [2024-10-11 04:43:34,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675725213] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:43:34,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:43:34,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 04:43:34,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307035900] [2024-10-11 04:43:34,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:43:34,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 04:43:34,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:43:34,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 04:43:34,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 04:43:34,643 INFO L87 Difference]: Start difference. First operand 1286 states and 2190 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states 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:34,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:43:34,736 INFO L93 Difference]: Finished difference Result 2794 states and 4342 transitions. [2024-10-11 04:43:34,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 04:43:34,736 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 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:34,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:43:34,743 INFO L225 Difference]: With dead ends: 2794 [2024-10-11 04:43:34,743 INFO L226 Difference]: Without dead ends: 2424 [2024-10-11 04:43:34,744 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:34,745 INFO L432 NwaCegarLoop]: 1540 mSDtfsCounter, 3033 mSDsluCounter, 1601 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3033 SdHoareTripleChecker+Valid, 3141 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:43:34,745 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3033 Valid, 3141 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:43:34,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2424 states. [2024-10-11 04:43:34,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2424 to 1726. [2024-10-11 04:43:34,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1726 states, 1724 states have (on average 1.6299303944315546) internal successors, (2810), 1725 states have internal predecessors, (2810), 0 states have call successors, (0), 0 states 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:34,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1726 states and 2810 transitions. [2024-10-11 04:43:34,787 INFO L78 Accepts]: Start accepts. Automaton has 1726 states and 2810 transitions. Word has length 50 [2024-10-11 04:43:34,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:43:34,787 INFO L471 AbstractCegarLoop]: Abstraction has 1726 states and 2810 transitions. [2024-10-11 04:43:34,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states 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:34,787 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 2810 transitions. [2024-10-11 04:43:34,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-11 04:43:34,788 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:43:34,788 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:34,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 04:43:34,789 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:43:34,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:43:34,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1815862662, now seen corresponding path program 1 times [2024-10-11 04:43:34,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:43:34,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550291662] [2024-10-11 04:43:34,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:43:34,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:43:34,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:43:34,881 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:34,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:43:34,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550291662] [2024-10-11 04:43:34,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550291662] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:43:34,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:43:34,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 04:43:34,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500086050] [2024-10-11 04:43:34,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:43:34,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 04:43:34,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:43:34,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 04:43:34,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 04:43:34,883 INFO L87 Difference]: Start difference. First operand 1726 states and 2810 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:35,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:43:35,008 INFO L93 Difference]: Finished difference Result 3302 states and 5062 transitions. [2024-10-11 04:43:35,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 04:43:35,009 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:35,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:43:35,016 INFO L225 Difference]: With dead ends: 3302 [2024-10-11 04:43:35,016 INFO L226 Difference]: Without dead ends: 2792 [2024-10-11 04:43:35,017 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:35,018 INFO L432 NwaCegarLoop]: 1539 mSDtfsCounter, 3035 mSDsluCounter, 1591 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3035 SdHoareTripleChecker+Valid, 3130 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:35,018 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3035 Valid, 3130 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:35,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2792 states. [2024-10-11 04:43:35,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2792 to 2418. [2024-10-11 04:43:35,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2418 states, 2416 states have (on average 1.5653973509933774) internal successors, (3782), 2417 states have internal predecessors, (3782), 0 states have call successors, (0), 0 states 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:35,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2418 states to 2418 states and 3782 transitions. [2024-10-11 04:43:35,069 INFO L78 Accepts]: Start accepts. Automaton has 2418 states and 3782 transitions. Word has length 50 [2024-10-11 04:43:35,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:43:35,069 INFO L471 AbstractCegarLoop]: Abstraction has 2418 states and 3782 transitions. [2024-10-11 04:43:35,070 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:35,070 INFO L276 IsEmpty]: Start isEmpty. Operand 2418 states and 3782 transitions. [2024-10-11 04:43:35,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-11 04:43:35,070 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:43:35,070 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:35,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 04:43:35,071 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:43:35,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:43:35,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1590371194, now seen corresponding path program 1 times [2024-10-11 04:43:35,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:43:35,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353198088] [2024-10-11 04:43:35,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:43:35,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:43:35,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:43:35,137 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:35,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:43:35,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353198088] [2024-10-11 04:43:35,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353198088] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:43:35,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:43:35,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 04:43:35,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489781682] [2024-10-11 04:43:35,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:43:35,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 04:43:35,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:43:35,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 04:43:35,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 04:43:35,139 INFO L87 Difference]: Start difference. First operand 2418 states and 3782 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:35,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:43:35,247 INFO L93 Difference]: Finished difference Result 3810 states and 5778 transitions. [2024-10-11 04:43:35,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 04:43:35,248 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:35,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:43:35,257 INFO L225 Difference]: With dead ends: 3810 [2024-10-11 04:43:35,257 INFO L226 Difference]: Without dead ends: 3300 [2024-10-11 04:43:35,258 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:35,259 INFO L432 NwaCegarLoop]: 1538 mSDtfsCounter, 3041 mSDsluCounter, 1596 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3041 SdHoareTripleChecker+Valid, 3134 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:43:35,259 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3041 Valid, 3134 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:43:35,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3300 states. [2024-10-11 04:43:35,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3300 to 2926. [2024-10-11 04:43:35,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2926 states, 2924 states have (on average 1.5383036935704515) internal successors, (4498), 2925 states have internal predecessors, (4498), 0 states have call successors, (0), 0 states 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:35,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2926 states to 2926 states and 4498 transitions. [2024-10-11 04:43:35,319 INFO L78 Accepts]: Start accepts. Automaton has 2926 states and 4498 transitions. Word has length 50 [2024-10-11 04:43:35,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:43:35,320 INFO L471 AbstractCegarLoop]: Abstraction has 2926 states and 4498 transitions. [2024-10-11 04:43:35,320 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:35,320 INFO L276 IsEmpty]: Start isEmpty. Operand 2926 states and 4498 transitions. [2024-10-11 04:43:35,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-11 04:43:35,320 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:43:35,321 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] [2024-10-11 04:43:35,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 04:43:35,321 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:43:35,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:43:35,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1183432324, now seen corresponding path program 1 times [2024-10-11 04:43:35,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:43:35,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645275512] [2024-10-11 04:43:35,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:43:35,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:43:35,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:43:35,379 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:35,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:43:35,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645275512] [2024-10-11 04:43:35,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645275512] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:43:35,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:43:35,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:43:35,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445813383] [2024-10-11 04:43:35,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:43:35,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:43:35,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:43:35,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:43:35,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:43:35,381 INFO L87 Difference]: Start difference. First operand 2926 states and 4498 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 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:35,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:43:35,485 INFO L93 Difference]: Finished difference Result 5078 states and 7536 transitions. [2024-10-11 04:43:35,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:43:35,486 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 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 51 [2024-10-11 04:43:35,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:43:35,496 INFO L225 Difference]: With dead ends: 5078 [2024-10-11 04:43:35,497 INFO L226 Difference]: Without dead ends: 2928 [2024-10-11 04:43:35,500 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:35,502 INFO L432 NwaCegarLoop]: 1520 mSDtfsCounter, 29 mSDsluCounter, 1491 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 3011 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:35,502 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 3011 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:35,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2928 states. [2024-10-11 04:43:35,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2928 to 2926. [2024-10-11 04:43:35,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2926 states, 2924 states have (on average 1.5212038303693571) internal successors, (4448), 2925 states have internal predecessors, (4448), 0 states have call successors, (0), 0 states 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:35,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2926 states to 2926 states and 4448 transitions. [2024-10-11 04:43:35,575 INFO L78 Accepts]: Start accepts. Automaton has 2926 states and 4448 transitions. Word has length 51 [2024-10-11 04:43:35,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:43:35,575 INFO L471 AbstractCegarLoop]: Abstraction has 2926 states and 4448 transitions. [2024-10-11 04:43:35,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 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:35,575 INFO L276 IsEmpty]: Start isEmpty. Operand 2926 states and 4448 transitions. [2024-10-11 04:43:35,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-11 04:43:35,576 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:43:35,576 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:35,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 04:43:35,576 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:43:35,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:43:35,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1165828046, now seen corresponding path program 1 times [2024-10-11 04:43:35,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:43:35,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389031361] [2024-10-11 04:43:35,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:43:35,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:43:35,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:43:35,674 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:35,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:43:35,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389031361] [2024-10-11 04:43:35,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389031361] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:43:35,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:43:35,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:43:35,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868175711] [2024-10-11 04:43:35,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:43:35,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:43:35,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:43:35,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:43:35,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:43:35,676 INFO L87 Difference]: Start difference. First operand 2926 states and 4448 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:35,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:43:35,724 INFO L93 Difference]: Finished difference Result 3772 states and 5635 transitions. [2024-10-11 04:43:35,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:43:35,725 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:35,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:43:35,730 INFO L225 Difference]: With dead ends: 3772 [2024-10-11 04:43:35,730 INFO L226 Difference]: Without dead ends: 1622 [2024-10-11 04:43:35,733 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:35,733 INFO L432 NwaCegarLoop]: 1518 mSDtfsCounter, 23 mSDsluCounter, 1490 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 3008 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:35,734 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 3008 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:35,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1622 states. [2024-10-11 04:43:35,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1622 to 1615. [2024-10-11 04:43:35,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1615 states, 1613 states have (on average 1.6261624302541848) internal successors, (2623), 1614 states have internal predecessors, (2623), 0 states have call successors, (0), 0 states 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:35,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1615 states to 1615 states and 2623 transitions. [2024-10-11 04:43:35,767 INFO L78 Accepts]: Start accepts. Automaton has 1615 states and 2623 transitions. Word has length 52 [2024-10-11 04:43:35,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:43:35,768 INFO L471 AbstractCegarLoop]: Abstraction has 1615 states and 2623 transitions. [2024-10-11 04:43:35,768 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:35,768 INFO L276 IsEmpty]: Start isEmpty. Operand 1615 states and 2623 transitions. [2024-10-11 04:43:35,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-11 04:43:35,769 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:43:35,769 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] [2024-10-11 04:43:35,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 04:43:35,769 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:43:35,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:43:35,770 INFO L85 PathProgramCache]: Analyzing trace with hash 2138930058, now seen corresponding path program 1 times [2024-10-11 04:43:35,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:43:35,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683859647] [2024-10-11 04:43:35,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:43:35,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:43:35,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:43:35,863 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:35,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:43:35,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683859647] [2024-10-11 04:43:35,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683859647] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:43:35,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:43:35,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:43:35,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079267769] [2024-10-11 04:43:35,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:43:35,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:43:35,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:43:35,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:43:35,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:43:35,866 INFO L87 Difference]: Start difference. First operand 1615 states and 2623 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:35,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:43:35,901 INFO L93 Difference]: Finished difference Result 2033 states and 3201 transitions. [2024-10-11 04:43:35,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:43:35,901 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:35,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:43:35,906 INFO L225 Difference]: With dead ends: 2033 [2024-10-11 04:43:35,906 INFO L226 Difference]: Without dead ends: 1203 [2024-10-11 04:43:35,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:35,909 INFO L432 NwaCegarLoop]: 1512 mSDtfsCounter, 25 mSDsluCounter, 1475 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 2987 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:35,909 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 2987 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:35,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2024-10-11 04:43:35,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 1201. [2024-10-11 04:43:35,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1201 states, 1199 states have (on average 1.6997497914929107) internal successors, (2038), 1200 states have internal predecessors, (2038), 0 states have call successors, (0), 0 states 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:35,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1201 states to 1201 states and 2038 transitions. [2024-10-11 04:43:35,944 INFO L78 Accepts]: Start accepts. Automaton has 1201 states and 2038 transitions. Word has length 53 [2024-10-11 04:43:35,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:43:35,944 INFO L471 AbstractCegarLoop]: Abstraction has 1201 states and 2038 transitions. [2024-10-11 04:43:35,944 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:35,945 INFO L276 IsEmpty]: Start isEmpty. Operand 1201 states and 2038 transitions. [2024-10-11 04:43:35,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-11 04:43:35,945 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:43:35,946 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] [2024-10-11 04:43:35,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 04:43:35,947 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:43:35,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:43:35,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1489407768, now seen corresponding path program 1 times [2024-10-11 04:43:35,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:43:35,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900013321] [2024-10-11 04:43:35,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:43:35,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:43:35,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:43:38,443 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:38,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:43:38,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900013321] [2024-10-11 04:43:38,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900013321] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:43:38,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1996553419] [2024-10-11 04:43:38,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:43:38,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:43:38,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:43:38,448 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:38,450 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:38,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:43:38,555 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 04:43:38,560 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:43:38,755 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:38,755 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 04:43:38,902 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:38,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1996553419] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 04:43:38,903 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 04:43:38,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5, 4] total 18 [2024-10-11 04:43:38,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847983707] [2024-10-11 04:43:38,903 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 04:43:38,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-11 04:43:38,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:43:38,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-11 04:43:38,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2024-10-11 04:43:38,904 INFO L87 Difference]: Start difference. First operand 1201 states and 2038 transitions. Second operand has 18 states, 18 states have (on average 8.38888888888889) internal successors, (151), 18 states have internal predecessors, (151), 0 states have call successors, (0), 0 states 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:41,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:43:41,702 INFO L93 Difference]: Finished difference Result 3410 states and 4968 transitions. [2024-10-11 04:43:41,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-10-11 04:43:41,704 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 8.38888888888889) internal successors, (151), 18 states have internal predecessors, (151), 0 states have call successors, (0), 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:41,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:43:41,713 INFO L225 Difference]: With dead ends: 3410 [2024-10-11 04:43:41,713 INFO L226 Difference]: Without dead ends: 2994 [2024-10-11 04:43:41,716 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 105 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:41,717 INFO L432 NwaCegarLoop]: 1488 mSDtfsCounter, 12963 mSDsluCounter, 6144 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12963 SdHoareTripleChecker+Valid, 7632 SdHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 04:43:41,717 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12963 Valid, 7632 Invalid, 655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 04:43:41,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2994 states. [2024-10-11 04:43:41,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2994 to 2848. [2024-10-11 04:43:41,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2848 states, 2846 states have (on average 1.4462403373155306) internal successors, (4116), 2847 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states 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:41,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2848 states to 2848 states and 4116 transitions. [2024-10-11 04:43:41,795 INFO L78 Accepts]: Start accepts. Automaton has 2848 states and 4116 transitions. Word has length 55 [2024-10-11 04:43:41,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:43:41,796 INFO L471 AbstractCegarLoop]: Abstraction has 2848 states and 4116 transitions. [2024-10-11 04:43:41,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 8.38888888888889) internal successors, (151), 18 states have internal predecessors, (151), 0 states have call successors, (0), 0 states 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:41,796 INFO L276 IsEmpty]: Start isEmpty. Operand 2848 states and 4116 transitions. [2024-10-11 04:43:41,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-11 04:43:41,797 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:43:41,797 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] [2024-10-11 04:43:41,812 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 04:43:41,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-11 04:43:41,998 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:43:41,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:43:41,999 INFO L85 PathProgramCache]: Analyzing trace with hash 375754418, now seen corresponding path program 1 times [2024-10-11 04:43:41,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:43:41,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696468858] [2024-10-11 04:43:41,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:43:41,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:43:42,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:43:44,022 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:44,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:43:44,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696468858] [2024-10-11 04:43:44,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696468858] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:43:44,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1117749189] [2024-10-11 04:43:44,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:43:44,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:43:44,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:43:44,028 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:44,035 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:44,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:43:44,115 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-11 04:43:44,116 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:43:44,594 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:44,594 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 04:43:45,248 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:45,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1117749189] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 04:43:45,248 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 04:43:45,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 25 [2024-10-11 04:43:45,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491045498] [2024-10-11 04:43:45,249 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 04:43:45,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-11 04:43:45,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:43:45,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-11 04:43:45,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=549, Unknown=0, NotChecked=0, Total=650 [2024-10-11 04:43:45,251 INFO L87 Difference]: Start difference. First operand 2848 states and 4116 transitions. Second operand has 26 states, 26 states have (on average 5.1923076923076925) internal successors, (135), 25 states have internal predecessors, (135), 0 states have call successors, (0), 0 states 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:45,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:43:45,841 INFO L93 Difference]: Finished difference Result 6561 states and 8923 transitions. [2024-10-11 04:43:45,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:43:45,842 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.1923076923076925) internal successors, (135), 25 states have internal predecessors, (135), 0 states have call successors, (0), 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 56 [2024-10-11 04:43:45,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:43:45,851 INFO L225 Difference]: With dead ends: 6561 [2024-10-11 04:43:45,851 INFO L226 Difference]: Without dead ends: 4874 [2024-10-11 04:43:45,853 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=298, Invalid=1034, Unknown=0, NotChecked=0, Total=1332 [2024-10-11 04:43:45,854 INFO L432 NwaCegarLoop]: 1485 mSDtfsCounter, 14967 mSDsluCounter, 4680 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14967 SdHoareTripleChecker+Valid, 6165 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 04:43:45,854 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14967 Valid, 6165 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 04:43:45,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4874 states. [2024-10-11 04:43:45,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4874 to 4808. [2024-10-11 04:43:45,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4808 states, 4806 states have (on average 1.361839367457345) internal successors, (6545), 4807 states have internal predecessors, (6545), 0 states have call successors, (0), 0 states 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:45,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4808 states to 4808 states and 6545 transitions. [2024-10-11 04:43:45,949 INFO L78 Accepts]: Start accepts. Automaton has 4808 states and 6545 transitions. Word has length 56 [2024-10-11 04:43:45,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:43:45,949 INFO L471 AbstractCegarLoop]: Abstraction has 4808 states and 6545 transitions. [2024-10-11 04:43:45,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.1923076923076925) internal successors, (135), 25 states have internal predecessors, (135), 0 states have call successors, (0), 0 states 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:45,950 INFO L276 IsEmpty]: Start isEmpty. Operand 4808 states and 6545 transitions. [2024-10-11 04:43:45,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-11 04:43:45,950 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:43:45,950 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] [2024-10-11 04:43:45,964 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:46,154 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,SelfDestructingSolverStorable16 [2024-10-11 04:43:46,155 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:43:46,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:43:46,156 INFO L85 PathProgramCache]: Analyzing trace with hash -294784256, now seen corresponding path program 1 times [2024-10-11 04:43:46,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:43:46,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916963256] [2024-10-11 04:43:46,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:43:46,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:43:46,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:43:46,400 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:46,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:43:46,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916963256] [2024-10-11 04:43:46,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916963256] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:43:46,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [817024594] [2024-10-11 04:43:46,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:43:46,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:43:46,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:43:46,405 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:46,407 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:46,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:43:46,531 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-10-11 04:43:46,533 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:43:47,688 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:47,689 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 04:43:49,396 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:49,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [817024594] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 04:43:49,396 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 04:43:49,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15, 18] total 39 [2024-10-11 04:43:49,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976997543] [2024-10-11 04:43:49,396 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 04:43:49,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-10-11 04:43:49,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:43:49,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-10-11 04:43:49,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=1210, Unknown=0, NotChecked=0, Total=1482 [2024-10-11 04:43:49,397 INFO L87 Difference]: Start difference. First operand 4808 states and 6545 transitions. Second operand has 39 states, 39 states have (on average 3.6666666666666665) internal successors, (143), 39 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:43:52,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:43:52,955 INFO L93 Difference]: Finished difference Result 12321 states and 16155 transitions. [2024-10-11 04:43:52,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-10-11 04:43:52,956 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 3.6666666666666665) internal successors, (143), 39 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2024-10-11 04:43:52,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:43:52,968 INFO L225 Difference]: With dead ends: 12321 [2024-10-11 04:43:52,969 INFO L226 Difference]: Without dead ends: 8669 [2024-10-11 04:43:52,974 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1798 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1545, Invalid=5261, Unknown=0, NotChecked=0, Total=6806 [2024-10-11 04:43:52,974 INFO L432 NwaCegarLoop]: 1487 mSDtfsCounter, 14748 mSDsluCounter, 10803 mSDsCounter, 0 mSdLazyCounter, 919 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14748 SdHoareTripleChecker+Valid, 12290 SdHoareTripleChecker+Invalid, 965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 04:43:52,975 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14748 Valid, 12290 Invalid, 965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 919 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 04:43:52,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8669 states. [2024-10-11 04:43:53,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8669 to 8653. [2024-10-11 04:43:53,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8653 states, 8651 states have (on average 1.3141833314067737) internal successors, (11369), 8652 states have internal predecessors, (11369), 0 states have call successors, (0), 0 states 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:53,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8653 states to 8653 states and 11369 transitions. [2024-10-11 04:43:53,190 INFO L78 Accepts]: Start accepts. Automaton has 8653 states and 11369 transitions. Word has length 56 [2024-10-11 04:43:53,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:43:53,190 INFO L471 AbstractCegarLoop]: Abstraction has 8653 states and 11369 transitions. [2024-10-11 04:43:53,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 3.6666666666666665) internal successors, (143), 39 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:43:53,190 INFO L276 IsEmpty]: Start isEmpty. Operand 8653 states and 11369 transitions. [2024-10-11 04:43:53,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-11 04:43:53,191 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:43:53,191 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] [2024-10-11 04:43:53,204 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 04:43:53,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:43:53,395 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:43:53,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:43:53,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1035298560, now seen corresponding path program 1 times [2024-10-11 04:43:53,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:43:53,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001105055] [2024-10-11 04:43:53,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:43:53,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:43:53,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:43:53,631 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:53,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:43:53,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001105055] [2024-10-11 04:43:53,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001105055] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:43:53,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [369812015] [2024-10-11 04:43:53,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:43:53,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:43:53,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:43:53,635 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:53,636 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:53,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:43:53,724 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-11 04:43:53,725 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:43:54,269 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:54,270 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 04:43:54,905 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:54,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [369812015] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 04:43:54,906 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 04:43:54,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 13] total 32 [2024-10-11 04:43:54,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20470207] [2024-10-11 04:43:54,906 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 04:43:54,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-10-11 04:43:54,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:43:54,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-10-11 04:43:54,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=887, Unknown=0, NotChecked=0, Total=992 [2024-10-11 04:43:54,907 INFO L87 Difference]: Start difference. First operand 8653 states and 11369 transitions. Second operand has 32 states, 32 states have (on average 4.71875) internal successors, (151), 32 states have internal predecessors, (151), 0 states have call successors, (0), 0 states 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:57,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:43:57,264 INFO L93 Difference]: Finished difference Result 16693 states and 21624 transitions. [2024-10-11 04:43:57,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-10-11 04:43:57,265 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 4.71875) internal successors, (151), 32 states have internal predecessors, (151), 0 states have call successors, (0), 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 56 [2024-10-11 04:43:57,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:43:57,285 INFO L225 Difference]: With dead ends: 16693 [2024-10-11 04:43:57,285 INFO L226 Difference]: Without dead ends: 9369 [2024-10-11 04:43:57,297 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 791 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=786, Invalid=3246, Unknown=0, NotChecked=0, Total=4032 [2024-10-11 04:43:57,297 INFO L432 NwaCegarLoop]: 1477 mSDtfsCounter, 14577 mSDsluCounter, 16413 mSDsCounter, 0 mSdLazyCounter, 867 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14577 SdHoareTripleChecker+Valid, 17890 SdHoareTripleChecker+Invalid, 905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 867 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 04:43:57,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14577 Valid, 17890 Invalid, 905 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [38 Valid, 867 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 04:43:57,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9369 states. [2024-10-11 04:43:57,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9369 to 7055. [2024-10-11 04:43:57,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7055 states, 7053 states have (on average 1.309230114844747) internal successors, (9234), 7054 states have internal predecessors, (9234), 0 states have call successors, (0), 0 states 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:57,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7055 states to 7055 states and 9234 transitions. [2024-10-11 04:43:57,580 INFO L78 Accepts]: Start accepts. Automaton has 7055 states and 9234 transitions. Word has length 56 [2024-10-11 04:43:57,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:43:57,580 INFO L471 AbstractCegarLoop]: Abstraction has 7055 states and 9234 transitions. [2024-10-11 04:43:57,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 4.71875) internal successors, (151), 32 states have internal predecessors, (151), 0 states have call successors, (0), 0 states 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:57,581 INFO L276 IsEmpty]: Start isEmpty. Operand 7055 states and 9234 transitions. [2024-10-11 04:43:57,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 04:43:57,582 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:43:57,582 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:57,602 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-11 04:43:57,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:43:57,783 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:43:57,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:43:57,783 INFO L85 PathProgramCache]: Analyzing trace with hash 200986498, now seen corresponding path program 1 times [2024-10-11 04:43:57,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:43:57,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602469149] [2024-10-11 04:43:57,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:43:57,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:43:57,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:43:58,499 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:43:58,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:43:58,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602469149] [2024-10-11 04:43:58,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602469149] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:43:58,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1186070733] [2024-10-11 04:43:58,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:43:58,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:43:58,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:43:58,504 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:58,508 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:58,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:43:58,635 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-10-11 04:43:58,638 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:44:01,062 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:01,063 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 04:44:04,337 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:04,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1186070733] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 04:44:04,337 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 04:44:04,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 22, 17] total 47 [2024-10-11 04:44:04,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961876776] [2024-10-11 04:44:04,338 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 04:44:04,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-10-11 04:44:04,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:44:04,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-10-11 04:44:04,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=287, Invalid=1875, Unknown=0, NotChecked=0, Total=2162 [2024-10-11 04:44:04,340 INFO L87 Difference]: Start difference. First operand 7055 states and 9234 transitions. Second operand has 47 states, 47 states have (on average 3.3404255319148937) internal successors, (157), 47 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:44:16,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:44:16,928 INFO L93 Difference]: Finished difference Result 12159 states and 15668 transitions. [2024-10-11 04:44:16,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2024-10-11 04:44:16,929 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 3.3404255319148937) internal successors, (157), 47 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 58 [2024-10-11 04:44:16,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:44:16,944 INFO L225 Difference]: With dead ends: 12159 [2024-10-11 04:44:16,944 INFO L226 Difference]: Without dead ends: 8299 [2024-10-11 04:44:16,952 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4063 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=2878, Invalid=11884, Unknown=0, NotChecked=0, Total=14762 [2024-10-11 04:44:16,953 INFO L432 NwaCegarLoop]: 1517 mSDtfsCounter, 26584 mSDsluCounter, 21308 mSDsCounter, 0 mSdLazyCounter, 1596 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26584 SdHoareTripleChecker+Valid, 22825 SdHoareTripleChecker+Invalid, 1694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 1596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-11 04:44:16,953 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26584 Valid, 22825 Invalid, 1694 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [98 Valid, 1596 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-11 04:44:16,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8299 states. [2024-10-11 04:44:17,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8299 to 5549. [2024-10-11 04:44:17,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5549 states, 5547 states have (on average 1.3277447268793943) internal successors, (7365), 5548 states have internal predecessors, (7365), 0 states have call successors, (0), 0 states 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:17,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5549 states to 5549 states and 7365 transitions. [2024-10-11 04:44:17,226 INFO L78 Accepts]: Start accepts. Automaton has 5549 states and 7365 transitions. Word has length 58 [2024-10-11 04:44:17,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:44:17,227 INFO L471 AbstractCegarLoop]: Abstraction has 5549 states and 7365 transitions. [2024-10-11 04:44:17,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 3.3404255319148937) internal successors, (157), 47 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:44:17,227 INFO L276 IsEmpty]: Start isEmpty. Operand 5549 states and 7365 transitions. [2024-10-11 04:44:17,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-11 04:44:17,228 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:44:17,228 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:44:17,245 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:17,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:44:17,433 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:44:17,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:44:17,433 INFO L85 PathProgramCache]: Analyzing trace with hash -56380255, now seen corresponding path program 1 times [2024-10-11 04:44:17,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:44:17,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871427926] [2024-10-11 04:44:17,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:44:17,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:44:17,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:44:17,513 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:44:17,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:44:17,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871427926] [2024-10-11 04:44:17,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871427926] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:44:17,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:44:17,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 04:44:17,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679264158] [2024-10-11 04:44:17,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:44:17,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:44:17,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:44:17,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:44:17,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:44:17,517 INFO L87 Difference]: Start difference. First operand 5549 states and 7365 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 2 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:44:21,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:44:21,089 INFO L93 Difference]: Finished difference Result 7053 states and 10238 transitions. [2024-10-11 04:44:21,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:44:21,090 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 2 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-10-11 04:44:21,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:44:21,100 INFO L225 Difference]: With dead ends: 7053 [2024-10-11 04:44:21,100 INFO L226 Difference]: Without dead ends: 6300 [2024-10-11 04:44:21,103 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:44:21,103 INFO L432 NwaCegarLoop]: 531 mSDtfsCounter, 805 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2264 mSolverCounterSat, 652 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 805 SdHoareTripleChecker+Valid, 538 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.3s IncrementalHoareTripleChecker+Time [2024-10-11 04:44:21,104 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [805 Valid, 538 Invalid, 2916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [652 Valid, 2264 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-10-11 04:44:21,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6300 states. [2024-10-11 04:44:21,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6300 to 6300. [2024-10-11 04:44:21,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6300 states, 6298 states have (on average 1.32486503651953) internal successors, (8344), 6299 states have internal predecessors, (8344), 0 states have call successors, (0), 0 states 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:21,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6300 states to 6300 states and 8344 transitions. [2024-10-11 04:44:21,332 INFO L78 Accepts]: Start accepts. Automaton has 6300 states and 8344 transitions. Word has length 62 [2024-10-11 04:44:21,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:44:21,333 INFO L471 AbstractCegarLoop]: Abstraction has 6300 states and 8344 transitions. [2024-10-11 04:44:21,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 2 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:44:21,333 INFO L276 IsEmpty]: Start isEmpty. Operand 6300 states and 8344 transitions. [2024-10-11 04:44:21,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 04:44:21,335 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:44:21,335 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:44:21,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 04:44:21,336 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:44:21,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:44:21,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1489464124, now seen corresponding path program 1 times [2024-10-11 04:44:21,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:44:21,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987413811] [2024-10-11 04:44:21,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:44:21,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:44:21,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:44:22,394 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 22 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:44:22,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:44:22,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987413811] [2024-10-11 04:44:22,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987413811] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:44:22,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1392638263] [2024-10-11 04:44:22,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:44:22,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:44:22,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:44:22,396 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:22,397 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:22,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:44:22,487 INFO L255 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-11 04:44:22,489 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:44:23,152 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 17 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:44:23,152 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 04:44:24,266 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 14 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:44:24,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1392638263] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 04:44:24,266 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 04:44:24,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12, 12] total 38 [2024-10-11 04:44:24,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687178243] [2024-10-11 04:44:24,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 04:44:24,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-10-11 04:44:24,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:44:24,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-10-11 04:44:24,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1289, Unknown=0, NotChecked=0, Total=1406 [2024-10-11 04:44:24,268 INFO L87 Difference]: Start difference. First operand 6300 states and 8344 transitions. Second operand has 38 states, 38 states have (on average 6.7894736842105265) internal successors, (258), 38 states have internal predecessors, (258), 0 states have call successors, (0), 0 states 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:33,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:44:33,401 INFO L93 Difference]: Finished difference Result 15687 states and 19976 transitions. [2024-10-11 04:44:33,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2024-10-11 04:44:33,402 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 6.7894736842105265) internal successors, (258), 38 states have internal predecessors, (258), 0 states have call successors, (0), 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 94 [2024-10-11 04:44:33,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:44:33,420 INFO L225 Difference]: With dead ends: 15687 [2024-10-11 04:44:33,420 INFO L226 Difference]: Without dead ends: 12752 [2024-10-11 04:44:33,429 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3912 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=2200, Invalid=13052, Unknown=0, NotChecked=0, Total=15252 [2024-10-11 04:44:33,429 INFO L432 NwaCegarLoop]: 1520 mSDtfsCounter, 16735 mSDsluCounter, 27739 mSDsCounter, 0 mSdLazyCounter, 2296 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16735 SdHoareTripleChecker+Valid, 29259 SdHoareTripleChecker+Invalid, 2406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 2296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 04:44:33,430 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16735 Valid, 29259 Invalid, 2406 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [110 Valid, 2296 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 04:44:33,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12752 states. [2024-10-11 04:44:33,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12752 to 8408. [2024-10-11 04:44:33,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8408 states, 8406 states have (on average 1.298596240780395) internal successors, (10916), 8407 states have internal predecessors, (10916), 0 states have call successors, (0), 0 states 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:33,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8408 states to 8408 states and 10916 transitions. [2024-10-11 04:44:33,907 INFO L78 Accepts]: Start accepts. Automaton has 8408 states and 10916 transitions. Word has length 94 [2024-10-11 04:44:33,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:44:33,907 INFO L471 AbstractCegarLoop]: Abstraction has 8408 states and 10916 transitions. [2024-10-11 04:44:33,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 6.7894736842105265) internal successors, (258), 38 states have internal predecessors, (258), 0 states have call successors, (0), 0 states 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:33,907 INFO L276 IsEmpty]: Start isEmpty. Operand 8408 states and 10916 transitions. [2024-10-11 04:44:33,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-11 04:44:33,909 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:44:33,910 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-11 04:44:33,929 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 04:44:34,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-10-11 04:44:34,114 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:44:34,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:44:34,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1281352916, now seen corresponding path program 1 times [2024-10-11 04:44:34,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:44:34,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133930455] [2024-10-11 04:44:34,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:44:34,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:44:34,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:44:35,080 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 29 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:44:35,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:44:35,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133930455] [2024-10-11 04:44:35,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133930455] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:44:35,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003598109] [2024-10-11 04:44:35,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:44:35,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:44:35,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:44:35,082 INFO L229 MonitoredProcess]: Starting monitored process 8 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:35,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 04:44:35,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:44:35,202 INFO L255 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-10-11 04:44:35,205 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:44:37,583 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 19 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:44:37,584 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 04:44:41,431 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 19 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:44:41,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1003598109] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 04:44:41,431 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 04:44:41,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 22, 22] total 58 [2024-10-11 04:44:41,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630825734] [2024-10-11 04:44:41,432 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 04:44:41,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2024-10-11 04:44:41,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:44:41,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2024-10-11 04:44:41,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=3018, Unknown=0, NotChecked=0, Total=3306 [2024-10-11 04:44:41,434 INFO L87 Difference]: Start difference. First operand 8408 states and 10916 transitions. Second operand has 58 states, 58 states have (on average 4.637931034482759) internal successors, (269), 58 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)