./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.1.ufo.BOUNDED-6.pals+Problem12_label01.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.1.ufo.BOUNDED-6.pals+Problem12_label01.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 3736cf4cbe4516cdffd2221499177e4bcfb3173bf4b9cf02e11d88f6dadf2f34 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 04:40:13,598 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 04:40:13,646 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:40:13,649 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 04:40:13,649 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 04:40:13,665 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 04:40:13,666 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 04:40:13,666 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 04:40:13,667 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 04:40:13,667 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 04:40:13,667 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 04:40:13,668 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 04:40:13,668 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 04:40:13,669 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 04:40:13,669 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 04:40:13,669 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 04:40:13,670 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 04:40:13,670 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 04:40:13,670 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 04:40:13,670 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 04:40:13,671 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 04:40:13,671 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 04:40:13,672 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 04:40:13,672 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 04:40:13,672 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 04:40:13,672 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 04:40:13,673 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 04:40:13,673 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 04:40:13,673 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 04:40:13,674 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 04:40:13,674 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 04:40:13,674 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 04:40:13,674 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:40:13,675 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 04:40:13,675 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 04:40:13,675 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 04:40:13,676 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 04:40:13,676 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 04:40:13,676 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 04:40:13,676 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 04:40:13,677 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 04:40:13,677 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 04:40:13,677 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 -> 3736cf4cbe4516cdffd2221499177e4bcfb3173bf4b9cf02e11d88f6dadf2f34 [2024-10-11 04:40:13,923 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 04:40:13,954 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 04:40:13,958 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 04:40:13,959 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 04:40:13,961 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 04:40:13,962 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.1.ufo.BOUNDED-6.pals+Problem12_label01.c [2024-10-11 04:40:15,569 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 04:40:16,004 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 04:40:16,006 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.1.ufo.BOUNDED-6.pals+Problem12_label01.c [2024-10-11 04:40:16,045 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/96431a9d2/b7fd2f3a8bc54b2099b78de1b952f792/FLAG610613e5b [2024-10-11 04:40:16,062 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/96431a9d2/b7fd2f3a8bc54b2099b78de1b952f792 [2024-10-11 04:40:16,064 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 04:40:16,068 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 04:40:16,070 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 04:40:16,071 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 04:40:16,077 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 04:40:16,078 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:40:16" (1/1) ... [2024-10-11 04:40:16,079 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c4a6f16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:40:16, skipping insertion in model container [2024-10-11 04:40:16,081 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:40:16" (1/1) ... [2024-10-11 04:40:16,199 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 04:40:16,717 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.1.ufo.BOUNDED-6.pals+Problem12_label01.c[6391,6404] [2024-10-11 04:40:16,756 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.1.ufo.BOUNDED-6.pals+Problem12_label01.c[11946,11959] [2024-10-11 04:40:17,309 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:40:17,320 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 04:40:17,348 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.1.ufo.BOUNDED-6.pals+Problem12_label01.c[6391,6404] [2024-10-11 04:40:17,355 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.1.ufo.BOUNDED-6.pals+Problem12_label01.c[11946,11959] [2024-10-11 04:40:17,682 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:40:17,706 INFO L204 MainTranslator]: Completed translation [2024-10-11 04:40:17,707 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:40:17 WrapperNode [2024-10-11 04:40:17,707 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 04:40:17,708 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 04:40:17,708 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 04:40:17,708 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 04:40:17,713 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:40:17" (1/1) ... [2024-10-11 04:40:17,758 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:40:17" (1/1) ... [2024-10-11 04:40:18,016 INFO L138 Inliner]: procedures = 33, calls = 19, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 4984 [2024-10-11 04:40:18,017 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 04:40:18,018 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 04:40:18,018 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 04:40:18,018 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 04:40:18,027 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:40:17" (1/1) ... [2024-10-11 04:40:18,027 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:40:17" (1/1) ... [2024-10-11 04:40:18,061 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:40:17" (1/1) ... [2024-10-11 04:40:18,393 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:40:18,396 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:40:17" (1/1) ... [2024-10-11 04:40:18,396 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:40:17" (1/1) ... [2024-10-11 04:40:18,566 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:40:17" (1/1) ... [2024-10-11 04:40:18,597 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:40:17" (1/1) ... [2024-10-11 04:40:18,628 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:40:17" (1/1) ... [2024-10-11 04:40:18,661 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:40:17" (1/1) ... [2024-10-11 04:40:18,807 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 04:40:18,807 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 04:40:18,807 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 04:40:18,807 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 04:40:18,808 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:40:17" (1/1) ... [2024-10-11 04:40:18,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:40:18,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:40:18,837 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:40:18,840 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:40:18,899 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 04:40:18,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 04:40:18,900 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 04:40:18,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 04:40:18,979 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 04:40:18,981 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 04:40:22,520 INFO L? ?]: Removed 732 outVars from TransFormulas that were not future-live. [2024-10-11 04:40:22,521 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 04:40:22,586 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 04:40:22,586 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 04:40:22,586 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:40:22 BoogieIcfgContainer [2024-10-11 04:40:22,587 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 04:40:22,589 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 04:40:22,589 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 04:40:22,593 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 04:40:22,593 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 04:40:16" (1/3) ... [2024-10-11 04:40:22,594 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71ec9e40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:40:22, skipping insertion in model container [2024-10-11 04:40:22,594 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:40:17" (2/3) ... [2024-10-11 04:40:22,594 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71ec9e40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:40:22, skipping insertion in model container [2024-10-11 04:40:22,594 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:40:22" (3/3) ... [2024-10-11 04:40:22,596 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.1.ufo.BOUNDED-6.pals+Problem12_label01.c [2024-10-11 04:40:22,612 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 04:40:22,612 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 04:40:22,699 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 04:40:22,707 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;@55cb7cdd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 04:40:22,707 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 04:40:22,717 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:40:22,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 04:40:22,724 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:40:22,724 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:40:22,725 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:40:22,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:40:22,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1100216757, now seen corresponding path program 1 times [2024-10-11 04:40:22,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:40:22,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382712956] [2024-10-11 04:40:22,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:40:22,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:40:22,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:40:22,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:40:22,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:40:22,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382712956] [2024-10-11 04:40:22,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382712956] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:40:22,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:40:22,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 04:40:22,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641907525] [2024-10-11 04:40:22,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:40:22,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 04:40:22,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:40:23,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 04:40:23,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 04:40:23,018 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:40:23,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:40:23,112 INFO L93 Difference]: Finished difference Result 1594 states and 3146 transitions. [2024-10-11 04:40:23,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 04:40:23,115 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:40:23,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:40:23,128 INFO L225 Difference]: With dead ends: 1594 [2024-10-11 04:40:23,129 INFO L226 Difference]: Without dead ends: 803 [2024-10-11 04:40:23,133 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:40:23,135 INFO L432 NwaCegarLoop]: 1521 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1521 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:40:23,136 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1521 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:40:23,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2024-10-11 04:40:23,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 803. [2024-10-11 04:40:23,193 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:40:23,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1521 transitions. [2024-10-11 04:40:23,196 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1521 transitions. Word has length 17 [2024-10-11 04:40:23,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:40:23,197 INFO L471 AbstractCegarLoop]: Abstraction has 803 states and 1521 transitions. [2024-10-11 04:40:23,197 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:40:23,197 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1521 transitions. [2024-10-11 04:40:23,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 04:40:23,198 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:40:23,198 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:40:23,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 04:40:23,199 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:40:23,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:40:23,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1687022771, now seen corresponding path program 1 times [2024-10-11 04:40:23,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:40:23,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268225322] [2024-10-11 04:40:23,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:40:23,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:40:23,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:40:23,334 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:40:23,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:40:23,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268225322] [2024-10-11 04:40:23,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268225322] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:40:23,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:40:23,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 04:40:23,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151144646] [2024-10-11 04:40:23,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:40:23,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 04:40:23,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:40:23,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 04:40:23,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 04:40:23,341 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:40:23,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:40:23,439 INFO L93 Difference]: Finished difference Result 864 states and 1616 transitions. [2024-10-11 04:40:23,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 04:40:23,440 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:40:23,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:40:23,445 INFO L225 Difference]: With dead ends: 864 [2024-10-11 04:40:23,445 INFO L226 Difference]: Without dead ends: 832 [2024-10-11 04:40:23,446 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:40:23,447 INFO L432 NwaCegarLoop]: 1516 mSDtfsCounter, 45 mSDsluCounter, 3011 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 4527 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:40:23,447 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 4527 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:40:23,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2024-10-11 04:40:23,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 803. [2024-10-11 04:40:23,482 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:40:23,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1505 transitions. [2024-10-11 04:40:23,485 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1505 transitions. Word has length 17 [2024-10-11 04:40:23,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:40:23,486 INFO L471 AbstractCegarLoop]: Abstraction has 803 states and 1505 transitions. [2024-10-11 04:40:23,486 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:40:23,486 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1505 transitions. [2024-10-11 04:40:23,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-11 04:40:23,487 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:40:23,487 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:40:23,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 04:40:23,488 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:40:23,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:40:23,488 INFO L85 PathProgramCache]: Analyzing trace with hash 613121839, now seen corresponding path program 1 times [2024-10-11 04:40:23,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:40:23,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445440885] [2024-10-11 04:40:23,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:40:23,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:40:23,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:40:23,649 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:40:23,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:40:23,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445440885] [2024-10-11 04:40:23,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445440885] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:40:23,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:40:23,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 04:40:23,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296295704] [2024-10-11 04:40:23,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:40:23,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 04:40:23,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:40:23,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 04:40:23,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 04:40:23,652 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:40:23,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:40:23,799 INFO L93 Difference]: Finished difference Result 977 states and 1781 transitions. [2024-10-11 04:40:23,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:40:23,799 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:40:23,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:40:23,804 INFO L225 Difference]: With dead ends: 977 [2024-10-11 04:40:23,805 INFO L226 Difference]: Without dead ends: 948 [2024-10-11 04:40:23,807 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:40:23,809 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:40:23,810 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:40:23,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 948 states. [2024-10-11 04:40:23,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 948 to 830. [2024-10-11 04:40:23,830 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:40:23,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1548 transitions. [2024-10-11 04:40:23,834 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1548 transitions. Word has length 32 [2024-10-11 04:40:23,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:40:23,835 INFO L471 AbstractCegarLoop]: Abstraction has 830 states and 1548 transitions. [2024-10-11 04:40:23,838 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:40:23,838 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1548 transitions. [2024-10-11 04:40:23,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-11 04:40:23,839 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:40:23,840 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:40:23,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 04:40:23,840 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:40:23,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:40:23,841 INFO L85 PathProgramCache]: Analyzing trace with hash 675954815, now seen corresponding path program 1 times [2024-10-11 04:40:23,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:40:23,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552534197] [2024-10-11 04:40:23,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:40:23,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:40:23,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:40:23,923 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:40:23,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:40:23,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552534197] [2024-10-11 04:40:23,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552534197] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:40:23,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:40:23,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:40:23,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546622080] [2024-10-11 04:40:23,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:40:23,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:40:23,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:40:23,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:40:23,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:40:23,926 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:40:23,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:40:23,955 INFO L93 Difference]: Finished difference Result 931 states and 1707 transitions. [2024-10-11 04:40:23,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:40:23,956 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:40:23,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:40:23,959 INFO L225 Difference]: With dead ends: 931 [2024-10-11 04:40:23,960 INFO L226 Difference]: Without dead ends: 875 [2024-10-11 04:40:23,960 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:40:23,961 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:40:23,962 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:40:23,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2024-10-11 04:40:23,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 873. [2024-10-11 04:40:23,980 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:40:23,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1614 transitions. [2024-10-11 04:40:23,985 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1614 transitions. Word has length 34 [2024-10-11 04:40:23,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:40:23,985 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1614 transitions. [2024-10-11 04:40:23,985 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:40:23,986 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1614 transitions. [2024-10-11 04:40:23,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-11 04:40:23,987 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:40:23,987 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:40:23,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 04:40:23,987 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:40:23,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:40:23,988 INFO L85 PathProgramCache]: Analyzing trace with hash 678099767, now seen corresponding path program 1 times [2024-10-11 04:40:23,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:40:23,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108878221] [2024-10-11 04:40:23,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:40:23,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:40:24,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:40:24,142 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:40:24,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:40:24,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108878221] [2024-10-11 04:40:24,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108878221] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:40:24,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:40:24,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 04:40:24,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458986645] [2024-10-11 04:40:24,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:40:24,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 04:40:24,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:40:24,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 04:40:24,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 04:40:24,147 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:40:24,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:40:24,226 INFO L93 Difference]: Finished difference Result 974 states and 1770 transitions. [2024-10-11 04:40:24,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 04:40:24,226 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:40:24,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:40:24,230 INFO L225 Difference]: With dead ends: 974 [2024-10-11 04:40:24,230 INFO L226 Difference]: Without dead ends: 875 [2024-10-11 04:40:24,232 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-11 04:40:24,232 INFO L432 NwaCegarLoop]: 1497 mSDtfsCounter, 1473 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1473 SdHoareTripleChecker+Valid, 1620 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:40:24,233 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1473 Valid, 1620 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:40:24,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2024-10-11 04:40:24,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 873. [2024-10-11 04:40:24,310 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:40:24,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1612 transitions. [2024-10-11 04:40:24,313 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1612 transitions. Word has length 34 [2024-10-11 04:40:24,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:40:24,314 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1612 transitions. [2024-10-11 04:40:24,315 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:40:24,315 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1612 transitions. [2024-10-11 04:40:24,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-11 04:40:24,316 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:40:24,316 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:40:24,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 04:40:24,318 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:40:24,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:40:24,318 INFO L85 PathProgramCache]: Analyzing trace with hash -582127364, now seen corresponding path program 1 times [2024-10-11 04:40:24,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:40:24,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544401298] [2024-10-11 04:40:24,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:40:24,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:40:24,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:40:24,453 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:40:24,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:40:24,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544401298] [2024-10-11 04:40:24,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544401298] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:40:24,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:40:24,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 04:40:24,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093695099] [2024-10-11 04:40:24,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:40:24,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 04:40:24,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:40:24,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 04:40:24,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 04:40:24,455 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:40:24,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:40:24,498 INFO L93 Difference]: Finished difference Result 879 states and 1619 transitions. [2024-10-11 04:40:24,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 04:40:24,501 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:40:24,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:40:24,505 INFO L225 Difference]: With dead ends: 879 [2024-10-11 04:40:24,506 INFO L226 Difference]: Without dead ends: 877 [2024-10-11 04:40:24,506 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:40:24,507 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:40:24,508 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:40:24,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2024-10-11 04:40:24,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 877. [2024-10-11 04:40:24,525 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:40:24,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 1615 transitions. [2024-10-11 04:40:24,527 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 1615 transitions. Word has length 35 [2024-10-11 04:40:24,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:40:24,528 INFO L471 AbstractCegarLoop]: Abstraction has 877 states and 1615 transitions. [2024-10-11 04:40:24,528 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:40:24,528 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1615 transitions. [2024-10-11 04:40:24,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-11 04:40:24,529 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:40:24,529 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:40:24,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 04:40:24,529 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:40:24,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:40:24,530 INFO L85 PathProgramCache]: Analyzing trace with hash 2127458807, now seen corresponding path program 1 times [2024-10-11 04:40:24,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:40:24,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249857604] [2024-10-11 04:40:24,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:40:24,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:40:24,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:40:24,573 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:40:24,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:40:24,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249857604] [2024-10-11 04:40:24,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249857604] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:40:24,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:40:24,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:40:24,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965402712] [2024-10-11 04:40:24,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:40:24,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:40:24,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:40:24,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:40:24,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:40:24,575 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:40:24,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:40:24,606 INFO L93 Difference]: Finished difference Result 991 states and 1788 transitions. [2024-10-11 04:40:24,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:40:24,606 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:40:24,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:40:24,610 INFO L225 Difference]: With dead ends: 991 [2024-10-11 04:40:24,610 INFO L226 Difference]: Without dead ends: 931 [2024-10-11 04:40:24,611 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:40:24,613 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:40:24,614 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:40:24,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2024-10-11 04:40:24,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 929. [2024-10-11 04:40:24,633 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:40:24,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1692 transitions. [2024-10-11 04:40:24,636 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1692 transitions. Word has length 36 [2024-10-11 04:40:24,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:40:24,636 INFO L471 AbstractCegarLoop]: Abstraction has 929 states and 1692 transitions. [2024-10-11 04:40:24,636 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:40:24,636 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1692 transitions. [2024-10-11 04:40:24,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-11 04:40:24,637 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:40:24,637 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:40:24,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 04:40:24,637 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:40:24,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:40:24,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1501802743, now seen corresponding path program 1 times [2024-10-11 04:40:24,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:40:24,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864760516] [2024-10-11 04:40:24,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:40:24,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:40:24,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:40:24,692 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:40:24,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:40:24,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864760516] [2024-10-11 04:40:24,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864760516] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:40:24,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:40:24,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:40:24,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168592993] [2024-10-11 04:40:24,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:40:24,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:40:24,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:40:24,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:40:24,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:40:24,694 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:40:24,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:40:24,716 INFO L93 Difference]: Finished difference Result 1211 states and 2112 transitions. [2024-10-11 04:40:24,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:40:24,716 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:40:24,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:40:24,721 INFO L225 Difference]: With dead ends: 1211 [2024-10-11 04:40:24,722 INFO L226 Difference]: Without dead ends: 1058 [2024-10-11 04:40:24,722 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:40:24,723 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:40:24,723 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:40:24,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1058 states. [2024-10-11 04:40:24,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1058 to 1056. [2024-10-11 04:40:24,739 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:40:24,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1056 states to 1056 states and 1874 transitions. [2024-10-11 04:40:24,742 INFO L78 Accepts]: Start accepts. Automaton has 1056 states and 1874 transitions. Word has length 36 [2024-10-11 04:40:24,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:40:24,742 INFO L471 AbstractCegarLoop]: Abstraction has 1056 states and 1874 transitions. [2024-10-11 04:40:24,742 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:40:24,743 INFO L276 IsEmpty]: Start isEmpty. Operand 1056 states and 1874 transitions. [2024-10-11 04:40:24,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-11 04:40:24,744 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:40:24,744 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:40:24,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 04:40:24,744 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:40:24,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:40:24,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1904431113, now seen corresponding path program 1 times [2024-10-11 04:40:24,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:40:24,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500568060] [2024-10-11 04:40:24,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:40:24,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:40:24,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:40:24,789 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:40:24,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:40:24,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500568060] [2024-10-11 04:40:24,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500568060] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:40:24,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:40:24,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:40:24,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168507959] [2024-10-11 04:40:24,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:40:24,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:40:24,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:40:24,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:40:24,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:40:24,791 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:40:24,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:40:24,832 INFO L93 Difference]: Finished difference Result 1568 states and 2616 transitions. [2024-10-11 04:40:24,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:40:24,833 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:40:24,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:40:24,838 INFO L225 Difference]: With dead ends: 1568 [2024-10-11 04:40:24,838 INFO L226 Difference]: Without dead ends: 1288 [2024-10-11 04:40:24,839 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:40:24,842 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:40:24,842 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:40:24,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1288 states. [2024-10-11 04:40:24,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1288 to 1286. [2024-10-11 04:40:24,869 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:40:24,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1286 states to 1286 states and 2190 transitions. [2024-10-11 04:40:24,874 INFO L78 Accepts]: Start accepts. Automaton has 1286 states and 2190 transitions. Word has length 36 [2024-10-11 04:40:24,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:40:24,875 INFO L471 AbstractCegarLoop]: Abstraction has 1286 states and 2190 transitions. [2024-10-11 04:40:24,875 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:40:24,875 INFO L276 IsEmpty]: Start isEmpty. Operand 1286 states and 2190 transitions. [2024-10-11 04:40:24,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-11 04:40:24,876 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:40:24,876 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] [2024-10-11 04:40:24,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 04:40:24,876 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:40:24,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:40:24,877 INFO L85 PathProgramCache]: Analyzing trace with hash -458172208, now seen corresponding path program 1 times [2024-10-11 04:40:24,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:40:24,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599353035] [2024-10-11 04:40:24,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:40:24,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:40:24,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:40:24,944 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:40:24,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:40:24,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599353035] [2024-10-11 04:40:24,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599353035] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:40:24,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:40:24,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 04:40:24,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452706165] [2024-10-11 04:40:24,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:40:24,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:40:24,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:40:24,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:40:24,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:40:24,947 INFO L87 Difference]: Start difference. First operand 1286 states and 2190 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 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:40:28,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:40:28,176 INFO L93 Difference]: Finished difference Result 2790 states and 5063 transitions. [2024-10-11 04:40:28,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:40:28,176 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 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 47 [2024-10-11 04:40:28,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:40:28,184 INFO L225 Difference]: With dead ends: 2790 [2024-10-11 04:40:28,185 INFO L226 Difference]: Without dead ends: 2037 [2024-10-11 04:40:28,186 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:40:28,186 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 834 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2280 mSolverCounterSat, 998 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 834 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 3278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 998 IncrementalHoareTripleChecker+Valid, 2280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-11 04:40:28,187 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [834 Valid, 140 Invalid, 3278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [998 Valid, 2280 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-11 04:40:28,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2037 states. [2024-10-11 04:40:28,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2037 to 2037. [2024-10-11 04:40:28,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2037 states, 2035 states have (on average 1.7518427518427517) internal successors, (3565), 2036 states have internal predecessors, (3565), 0 states have call successors, (0), 0 states 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:40:28,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2037 states to 2037 states and 3565 transitions. [2024-10-11 04:40:28,228 INFO L78 Accepts]: Start accepts. Automaton has 2037 states and 3565 transitions. Word has length 47 [2024-10-11 04:40:28,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:40:28,229 INFO L471 AbstractCegarLoop]: Abstraction has 2037 states and 3565 transitions. [2024-10-11 04:40:28,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 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:40:28,229 INFO L276 IsEmpty]: Start isEmpty. Operand 2037 states and 3565 transitions. [2024-10-11 04:40:28,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-11 04:40:28,230 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:40:28,230 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:40:28,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 04:40:28,231 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:40:28,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:40:28,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1853448570, now seen corresponding path program 1 times [2024-10-11 04:40:28,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:40:28,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703872579] [2024-10-11 04:40:28,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:40:28,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:40:28,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:40:28,342 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:40:28,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:40:28,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703872579] [2024-10-11 04:40:28,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703872579] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:40:28,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:40:28,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 04:40:28,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187490906] [2024-10-11 04:40:28,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:40:28,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 04:40:28,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:40:28,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 04:40:28,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 04:40:28,344 INFO L87 Difference]: Start difference. First operand 2037 states and 3565 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:40:28,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:40:28,428 INFO L93 Difference]: Finished difference Result 3545 states and 5717 transitions. [2024-10-11 04:40:28,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 04:40:28,429 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:40:28,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:40:28,436 INFO L225 Difference]: With dead ends: 3545 [2024-10-11 04:40:28,436 INFO L226 Difference]: Without dead ends: 3175 [2024-10-11 04:40:28,437 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:40:28,437 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:40:28,437 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:40:28,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3175 states. [2024-10-11 04:40:28,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3175 to 2477. [2024-10-11 04:40:28,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2477 states, 2475 states have (on average 1.690909090909091) internal successors, (4185), 2476 states have internal predecessors, (4185), 0 states have call successors, (0), 0 states 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:40:28,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2477 states to 2477 states and 4185 transitions. [2024-10-11 04:40:28,485 INFO L78 Accepts]: Start accepts. Automaton has 2477 states and 4185 transitions. Word has length 50 [2024-10-11 04:40:28,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:40:28,486 INFO L471 AbstractCegarLoop]: Abstraction has 2477 states and 4185 transitions. [2024-10-11 04:40:28,486 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:40:28,486 INFO L276 IsEmpty]: Start isEmpty. Operand 2477 states and 4185 transitions. [2024-10-11 04:40:28,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-11 04:40:28,487 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:40:28,487 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:40:28,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 04:40:28,487 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:40:28,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:40:28,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1815862662, now seen corresponding path program 1 times [2024-10-11 04:40:28,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:40:28,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86329474] [2024-10-11 04:40:28,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:40:28,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:40:28,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:40:28,616 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:40:28,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:40:28,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86329474] [2024-10-11 04:40:28,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86329474] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:40:28,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:40:28,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 04:40:28,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580355240] [2024-10-11 04:40:28,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:40:28,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 04:40:28,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:40:28,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 04:40:28,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 04:40:28,620 INFO L87 Difference]: Start difference. First operand 2477 states and 4185 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:40:28,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:40:28,745 INFO L93 Difference]: Finished difference Result 4053 states and 6437 transitions. [2024-10-11 04:40:28,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 04:40:28,745 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:40:28,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:40:28,758 INFO L225 Difference]: With dead ends: 4053 [2024-10-11 04:40:28,758 INFO L226 Difference]: Without dead ends: 3543 [2024-10-11 04:40:28,760 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:40:28,761 INFO L432 NwaCegarLoop]: 1539 mSDtfsCounter, 3033 mSDsluCounter, 1601 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3033 SdHoareTripleChecker+Valid, 3140 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:40:28,761 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3033 Valid, 3140 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:40:28,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3543 states. [2024-10-11 04:40:28,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3543 to 3169. [2024-10-11 04:40:28,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3169 states, 3167 states have (on average 1.6283549100094727) internal successors, (5157), 3168 states have internal predecessors, (5157), 0 states have call successors, (0), 0 states 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:40:28,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3169 states to 3169 states and 5157 transitions. [2024-10-11 04:40:28,841 INFO L78 Accepts]: Start accepts. Automaton has 3169 states and 5157 transitions. Word has length 50 [2024-10-11 04:40:28,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:40:28,841 INFO L471 AbstractCegarLoop]: Abstraction has 3169 states and 5157 transitions. [2024-10-11 04:40:28,842 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:40:28,842 INFO L276 IsEmpty]: Start isEmpty. Operand 3169 states and 5157 transitions. [2024-10-11 04:40:28,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-11 04:40:28,842 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:40:28,843 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:40:28,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 04:40:28,843 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:40:28,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:40:28,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1590371194, now seen corresponding path program 1 times [2024-10-11 04:40:28,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:40:28,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789182936] [2024-10-11 04:40:28,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:40:28,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:40:28,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:40:28,951 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:40:28,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:40:28,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789182936] [2024-10-11 04:40:28,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789182936] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:40:28,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:40:28,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 04:40:28,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833776043] [2024-10-11 04:40:28,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:40:28,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 04:40:28,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:40:28,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 04:40:28,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 04:40:28,953 INFO L87 Difference]: Start difference. First operand 3169 states and 5157 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:40:29,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:40:29,096 INFO L93 Difference]: Finished difference Result 4561 states and 7153 transitions. [2024-10-11 04:40:29,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 04:40:29,096 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:40:29,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:40:29,110 INFO L225 Difference]: With dead ends: 4561 [2024-10-11 04:40:29,110 INFO L226 Difference]: Without dead ends: 4051 [2024-10-11 04:40:29,112 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:40:29,113 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:40:29,113 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:40:29,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4051 states. [2024-10-11 04:40:29,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4051 to 3677. [2024-10-11 04:40:29,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3677 states, 3675 states have (on average 1.598095238095238) internal successors, (5873), 3676 states have internal predecessors, (5873), 0 states have call successors, (0), 0 states 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:40:29,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3677 states to 3677 states and 5873 transitions. [2024-10-11 04:40:29,238 INFO L78 Accepts]: Start accepts. Automaton has 3677 states and 5873 transitions. Word has length 50 [2024-10-11 04:40:29,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:40:29,239 INFO L471 AbstractCegarLoop]: Abstraction has 3677 states and 5873 transitions. [2024-10-11 04:40:29,239 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:40:29,239 INFO L276 IsEmpty]: Start isEmpty. Operand 3677 states and 5873 transitions. [2024-10-11 04:40:29,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-11 04:40:29,240 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:40:29,241 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:40:29,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 04:40:29,242 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:40:29,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:40:29,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1183432324, now seen corresponding path program 1 times [2024-10-11 04:40:29,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:40:29,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196362411] [2024-10-11 04:40:29,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:40:29,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:40:29,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:40:29,351 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:40:29,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:40:29,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196362411] [2024-10-11 04:40:29,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196362411] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:40:29,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:40:29,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:40:29,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126307287] [2024-10-11 04:40:29,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:40:29,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:40:29,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:40:29,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:40:29,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:40:29,354 INFO L87 Difference]: Start difference. First operand 3677 states and 5873 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:40:29,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:40:29,466 INFO L93 Difference]: Finished difference Result 5829 states and 8911 transitions. [2024-10-11 04:40:29,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:40:29,467 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:40:29,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:40:29,480 INFO L225 Difference]: With dead ends: 5829 [2024-10-11 04:40:29,483 INFO L226 Difference]: Without dead ends: 3679 [2024-10-11 04:40:29,486 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:40:29,487 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:40:29,487 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:40:29,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3679 states. [2024-10-11 04:40:29,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3679 to 3677. [2024-10-11 04:40:29,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3677 states, 3675 states have (on average 1.5844897959183672) internal successors, (5823), 3676 states have internal predecessors, (5823), 0 states have call successors, (0), 0 states 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:40:29,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3677 states to 3677 states and 5823 transitions. [2024-10-11 04:40:29,576 INFO L78 Accepts]: Start accepts. Automaton has 3677 states and 5823 transitions. Word has length 51 [2024-10-11 04:40:29,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:40:29,577 INFO L471 AbstractCegarLoop]: Abstraction has 3677 states and 5823 transitions. [2024-10-11 04:40:29,577 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:40:29,577 INFO L276 IsEmpty]: Start isEmpty. Operand 3677 states and 5823 transitions. [2024-10-11 04:40:29,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-11 04:40:29,578 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:40:29,578 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:40:29,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 04:40:29,579 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:40:29,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:40:29,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1165828046, now seen corresponding path program 1 times [2024-10-11 04:40:29,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:40:29,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566514895] [2024-10-11 04:40:29,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:40:29,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:40:29,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:40:29,661 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:40:29,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:40:29,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566514895] [2024-10-11 04:40:29,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566514895] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:40:29,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:40:29,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:40:29,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910794764] [2024-10-11 04:40:29,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:40:29,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:40:29,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:40:29,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:40:29,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:40:29,664 INFO L87 Difference]: Start difference. First operand 3677 states and 5823 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:40:29,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:40:29,710 INFO L93 Difference]: Finished difference Result 4523 states and 7010 transitions. [2024-10-11 04:40:29,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:40:29,711 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:40:29,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:40:29,720 INFO L225 Difference]: With dead ends: 4523 [2024-10-11 04:40:29,721 INFO L226 Difference]: Without dead ends: 2373 [2024-10-11 04:40:29,724 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:40:29,725 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:40:29,726 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:40:29,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2373 states. [2024-10-11 04:40:29,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2373 to 2366. [2024-10-11 04:40:29,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2366 states, 2364 states have (on average 1.6912013536379018) internal successors, (3998), 2365 states have internal predecessors, (3998), 0 states have call successors, (0), 0 states 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:40:29,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2366 states to 2366 states and 3998 transitions. [2024-10-11 04:40:29,774 INFO L78 Accepts]: Start accepts. Automaton has 2366 states and 3998 transitions. Word has length 52 [2024-10-11 04:40:29,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:40:29,774 INFO L471 AbstractCegarLoop]: Abstraction has 2366 states and 3998 transitions. [2024-10-11 04:40:29,774 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:40:29,774 INFO L276 IsEmpty]: Start isEmpty. Operand 2366 states and 3998 transitions. [2024-10-11 04:40:29,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-11 04:40:29,775 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:40:29,775 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:40:29,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 04:40:29,779 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:40:29,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:40:29,780 INFO L85 PathProgramCache]: Analyzing trace with hash 2138930058, now seen corresponding path program 1 times [2024-10-11 04:40:29,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:40:29,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708889433] [2024-10-11 04:40:29,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:40:29,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:40:29,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:40:29,916 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:40:29,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:40:29,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708889433] [2024-10-11 04:40:29,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708889433] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:40:29,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:40:29,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:40:29,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540231638] [2024-10-11 04:40:29,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:40:29,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:40:29,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:40:29,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:40:29,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:40:29,923 INFO L87 Difference]: Start difference. First operand 2366 states and 3998 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:40:29,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:40:29,986 INFO L93 Difference]: Finished difference Result 2784 states and 4576 transitions. [2024-10-11 04:40:29,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:40:29,986 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:40:29,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:40:29,994 INFO L225 Difference]: With dead ends: 2784 [2024-10-11 04:40:29,994 INFO L226 Difference]: Without dead ends: 1954 [2024-10-11 04:40:29,996 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:40:29,996 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:40:30,000 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:40:30,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1954 states. [2024-10-11 04:40:30,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1954 to 1952. [2024-10-11 04:40:30,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1952 states, 1950 states have (on average 1.7502564102564102) internal successors, (3413), 1951 states have internal predecessors, (3413), 0 states have call successors, (0), 0 states 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:40:30,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1952 states to 1952 states and 3413 transitions. [2024-10-11 04:40:30,077 INFO L78 Accepts]: Start accepts. Automaton has 1952 states and 3413 transitions. Word has length 53 [2024-10-11 04:40:30,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:40:30,078 INFO L471 AbstractCegarLoop]: Abstraction has 1952 states and 3413 transitions. [2024-10-11 04:40:30,078 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:40:30,078 INFO L276 IsEmpty]: Start isEmpty. Operand 1952 states and 3413 transitions. [2024-10-11 04:40:30,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-11 04:40:30,083 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:40:30,083 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:40:30,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 04:40:30,084 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:40:30,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:40:30,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1489407768, now seen corresponding path program 1 times [2024-10-11 04:40:30,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:40:30,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485462619] [2024-10-11 04:40:30,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:40:30,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:40:30,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:40:32,223 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:40:32,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:40:32,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485462619] [2024-10-11 04:40:32,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485462619] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:40:32,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1642774956] [2024-10-11 04:40:32,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:40:32,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:40:32,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:40:32,227 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:40:32,227 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:40:32,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:40:32,327 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-11 04:40:32,333 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:40:32,792 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:40:32,793 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 04:40:33,491 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:40:33,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1642774956] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 04:40:33,492 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 04:40:33,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 27 [2024-10-11 04:40:33,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005842005] [2024-10-11 04:40:33,492 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 04:40:33,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-11 04:40:33,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:40:33,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-11 04:40:33,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=668, Unknown=0, NotChecked=0, Total=756 [2024-10-11 04:40:33,494 INFO L87 Difference]: Start difference. First operand 1952 states and 3413 transitions. Second operand has 28 states, 28 states have (on average 5.071428571428571) internal successors, (142), 27 states have internal predecessors, (142), 0 states have call successors, (0), 0 states 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:40:36,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:40:36,410 INFO L93 Difference]: Finished difference Result 3440 states and 5435 transitions. [2024-10-11 04:40:36,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-10-11 04:40:36,411 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 5.071428571428571) internal successors, (142), 27 states have internal predecessors, (142), 0 states have call successors, (0), 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:40:36,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:40:36,416 INFO L225 Difference]: With dead ends: 3440 [2024-10-11 04:40:36,416 INFO L226 Difference]: Without dead ends: 3024 [2024-10-11 04:40:36,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 805 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=813, Invalid=3093, Unknown=0, NotChecked=0, Total=3906 [2024-10-11 04:40:36,419 INFO L432 NwaCegarLoop]: 1477 mSDtfsCounter, 24311 mSDsluCounter, 6227 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24311 SdHoareTripleChecker+Valid, 7704 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 04:40:36,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24311 Valid, 7704 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 676 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 04:40:36,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3024 states. [2024-10-11 04:40:36,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3024 to 2971. [2024-10-11 04:40:36,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2971 states, 2969 states have (on average 1.603907039407208) internal successors, (4762), 2970 states have internal predecessors, (4762), 0 states have call successors, (0), 0 states 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:40:36,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2971 states to 2971 states and 4762 transitions. [2024-10-11 04:40:36,481 INFO L78 Accepts]: Start accepts. Automaton has 2971 states and 4762 transitions. Word has length 55 [2024-10-11 04:40:36,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:40:36,482 INFO L471 AbstractCegarLoop]: Abstraction has 2971 states and 4762 transitions. [2024-10-11 04:40:36,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 5.071428571428571) internal successors, (142), 27 states have internal predecessors, (142), 0 states have call successors, (0), 0 states 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:40:36,482 INFO L276 IsEmpty]: Start isEmpty. Operand 2971 states and 4762 transitions. [2024-10-11 04:40:36,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-11 04:40:36,483 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:40:36,483 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:40:36,501 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 04:40:36,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-11 04:40:36,688 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:40:36,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:40:36,688 INFO L85 PathProgramCache]: Analyzing trace with hash -294784256, now seen corresponding path program 1 times [2024-10-11 04:40:36,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:40:36,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177118797] [2024-10-11 04:40:36,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:40:36,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:40:36,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:40:37,081 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:40:37,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:40:37,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177118797] [2024-10-11 04:40:37,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177118797] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:40:37,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [865909330] [2024-10-11 04:40:37,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:40:37,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:40:37,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:40:37,085 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:40:37,091 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:40:37,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:40:37,176 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-11 04:40:37,178 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:40:37,433 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:40:37,434 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 04:40:38,043 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:40:38,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [865909330] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 04:40:38,044 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 04:40:38,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2024-10-11 04:40:38,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485230190] [2024-10-11 04:40:38,044 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 04:40:38,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-11 04:40:38,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:40:38,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-11 04:40:38,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2024-10-11 04:40:38,046 INFO L87 Difference]: Start difference. First operand 2971 states and 4762 transitions. Second operand has 23 states, 23 states have (on average 5.260869565217392) internal successors, (121), 22 states have internal predecessors, (121), 0 states have call successors, (0), 0 states 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:40:38,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:40:38,450 INFO L93 Difference]: Finished difference Result 5166 states and 7727 transitions. [2024-10-11 04:40:38,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 04:40:38,451 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 5.260869565217392) internal successors, (121), 22 states have internal predecessors, (121), 0 states have call successors, (0), 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:40:38,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:40:38,459 INFO L225 Difference]: With dead ends: 5166 [2024-10-11 04:40:38,459 INFO L226 Difference]: Without dead ends: 3731 [2024-10-11 04:40:38,462 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=238, Invalid=692, Unknown=0, NotChecked=0, Total=930 [2024-10-11 04:40:38,463 INFO L432 NwaCegarLoop]: 1481 mSDtfsCounter, 12124 mSDsluCounter, 4535 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12124 SdHoareTripleChecker+Valid, 6016 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 04:40:38,463 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12124 Valid, 6016 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 04:40:38,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3731 states. [2024-10-11 04:40:38,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3731 to 3727. [2024-10-11 04:40:38,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3727 states, 3725 states have (on average 1.553020134228188) internal successors, (5785), 3726 states have internal predecessors, (5785), 0 states have call successors, (0), 0 states 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:40:38,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3727 states to 3727 states and 5785 transitions. [2024-10-11 04:40:38,554 INFO L78 Accepts]: Start accepts. Automaton has 3727 states and 5785 transitions. Word has length 56 [2024-10-11 04:40:38,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:40:38,554 INFO L471 AbstractCegarLoop]: Abstraction has 3727 states and 5785 transitions. [2024-10-11 04:40:38,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.260869565217392) internal successors, (121), 22 states have internal predecessors, (121), 0 states have call successors, (0), 0 states 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:40:38,554 INFO L276 IsEmpty]: Start isEmpty. Operand 3727 states and 5785 transitions. [2024-10-11 04:40:38,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-11 04:40:38,557 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:40:38,557 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:40:38,578 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 04:40:38,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-11 04:40:38,758 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:40:38,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:40:38,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1035298560, now seen corresponding path program 1 times [2024-10-11 04:40:38,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:40:38,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800007946] [2024-10-11 04:40:38,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:40:38,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:40:38,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:40:39,081 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:40:39,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:40:39,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800007946] [2024-10-11 04:40:39,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800007946] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:40:39,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1846625358] [2024-10-11 04:40:39,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:40:39,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:40:39,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:40:39,085 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:40:39,086 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:40:39,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:40:39,174 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-11 04:40:39,176 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:40:39,518 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:40:39,518 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 04:40:40,045 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:40:40,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1846625358] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 04:40:40,046 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 04:40:40,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2024-10-11 04:40:40,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588078725] [2024-10-11 04:40:40,046 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 04:40:40,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-11 04:40:40,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:40:40,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-11 04:40:40,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2024-10-11 04:40:40,048 INFO L87 Difference]: Start difference. First operand 3727 states and 5785 transitions. Second operand has 22 states, 22 states have (on average 5.7727272727272725) internal successors, (127), 21 states have internal predecessors, (127), 0 states have call successors, (0), 0 states 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:40:40,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:40:40,642 INFO L93 Difference]: Finished difference Result 7463 states and 10812 transitions. [2024-10-11 04:40:40,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 04:40:40,643 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 5.7727272727272725) internal successors, (127), 21 states have internal predecessors, (127), 0 states have call successors, (0), 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:40:40,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:40:40,649 INFO L225 Difference]: With dead ends: 7463 [2024-10-11 04:40:40,649 INFO L226 Difference]: Without dead ends: 5285 [2024-10-11 04:40:40,652 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=268, Invalid=788, Unknown=0, NotChecked=0, Total=1056 [2024-10-11 04:40:40,652 INFO L432 NwaCegarLoop]: 1488 mSDtfsCounter, 10598 mSDsluCounter, 4675 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10598 SdHoareTripleChecker+Valid, 6163 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 04:40:40,652 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10598 Valid, 6163 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 04:40:40,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5285 states. [2024-10-11 04:40:40,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5285 to 4993. [2024-10-11 04:40:40,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4993 states, 4991 states have (on average 1.4922861150070126) internal successors, (7448), 4992 states have internal predecessors, (7448), 0 states have call successors, (0), 0 states 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:40:40,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4993 states to 4993 states and 7448 transitions. [2024-10-11 04:40:40,749 INFO L78 Accepts]: Start accepts. Automaton has 4993 states and 7448 transitions. Word has length 56 [2024-10-11 04:40:40,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:40:40,750 INFO L471 AbstractCegarLoop]: Abstraction has 4993 states and 7448 transitions. [2024-10-11 04:40:40,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.7727272727272725) internal successors, (127), 21 states have internal predecessors, (127), 0 states have call successors, (0), 0 states 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:40:40,750 INFO L276 IsEmpty]: Start isEmpty. Operand 4993 states and 7448 transitions. [2024-10-11 04:40:40,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-11 04:40:40,751 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:40:40,751 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:40:40,770 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:40:40,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:40:40,953 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:40:40,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:40:40,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1142870954, now seen corresponding path program 1 times [2024-10-11 04:40:40,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:40:40,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826271848] [2024-10-11 04:40:40,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:40:40,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:40:41,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:40:41,688 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:40:41,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:40:41,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826271848] [2024-10-11 04:40:41,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826271848] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:40:41,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151223665] [2024-10-11 04:40:41,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:40:41,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:40:41,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:40:41,690 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:40:41,691 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:40:41,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:40:41,760 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-11 04:40:41,761 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:40:42,389 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:40:42,389 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 04:40:43,110 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:40:43,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1151223665] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 04:40:43,110 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 04:40:43,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 13] total 30 [2024-10-11 04:40:43,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76578902] [2024-10-11 04:40:43,111 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 04:40:43,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-10-11 04:40:43,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:40:43,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-10-11 04:40:43,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=756, Unknown=0, NotChecked=0, Total=870 [2024-10-11 04:40:43,113 INFO L87 Difference]: Start difference. First operand 4993 states and 7448 transitions. Second operand has 30 states, 30 states have (on average 4.133333333333334) internal successors, (124), 30 states have internal predecessors, (124), 0 states have call successors, (0), 0 states 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:40:44,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:40:44,318 INFO L93 Difference]: Finished difference Result 7784 states and 11151 transitions. [2024-10-11 04:40:44,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-11 04:40:44,319 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 4.133333333333334) internal successors, (124), 30 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2024-10-11 04:40:44,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:40:44,329 INFO L225 Difference]: With dead ends: 7784 [2024-10-11 04:40:44,329 INFO L226 Difference]: Without dead ends: 6414 [2024-10-11 04:40:44,333 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=457, Invalid=1705, Unknown=0, NotChecked=0, Total=2162 [2024-10-11 04:40:44,334 INFO L432 NwaCegarLoop]: 1491 mSDtfsCounter, 9619 mSDsluCounter, 13526 mSDsCounter, 0 mSdLazyCounter, 671 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9619 SdHoareTripleChecker+Valid, 15017 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 04:40:44,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9619 Valid, 15017 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 671 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 04:40:44,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6414 states. [2024-10-11 04:40:44,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6414 to 5010. [2024-10-11 04:40:44,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5010 states, 5008 states have (on average 1.4878194888178913) internal successors, (7451), 5009 states have internal predecessors, (7451), 0 states have call successors, (0), 0 states 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:40:44,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5010 states to 5010 states and 7451 transitions. [2024-10-11 04:40:44,505 INFO L78 Accepts]: Start accepts. Automaton has 5010 states and 7451 transitions. Word has length 57 [2024-10-11 04:40:44,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:40:44,506 INFO L471 AbstractCegarLoop]: Abstraction has 5010 states and 7451 transitions. [2024-10-11 04:40:44,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 4.133333333333334) internal successors, (124), 30 states have internal predecessors, (124), 0 states have call successors, (0), 0 states 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:40:44,506 INFO L276 IsEmpty]: Start isEmpty. Operand 5010 states and 7451 transitions. [2024-10-11 04:40:44,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-11 04:40:44,507 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:40:44,507 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:40:44,527 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 04:40:44,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:40:44,712 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:40:44,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:40:44,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1615101446, now seen corresponding path program 1 times [2024-10-11 04:40:44,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:40:44,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843592751] [2024-10-11 04:40:44,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:40:44,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:40:44,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:40:45,659 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:40:45,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:40:45,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843592751] [2024-10-11 04:40:45,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843592751] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:40:45,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [332043351] [2024-10-11 04:40:45,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:40:45,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:40:45,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:40:45,662 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:40:45,663 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:40:45,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:40:45,751 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-10-11 04:40:45,753 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:40:47,032 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:40:47,032 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 04:40:49,137 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:40:49,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [332043351] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 04:40:49,138 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 04:40:49,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 17, 16] total 38 [2024-10-11 04:40:49,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517990610] [2024-10-11 04:40:49,138 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 04:40:49,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-10-11 04:40:49,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:40:49,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-10-11 04:40:49,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1236, Unknown=0, NotChecked=0, Total=1406 [2024-10-11 04:40:49,140 INFO L87 Difference]: Start difference. First operand 5010 states and 7451 transitions. Second operand has 38 states, 38 states have (on average 4.0) internal successors, (152), 38 states have internal predecessors, (152), 0 states have call successors, (0), 0 states 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:40:51,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:40:51,672 INFO L93 Difference]: Finished difference Result 6952 states and 10031 transitions. [2024-10-11 04:40:51,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-10-11 04:40:51,673 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 4.0) internal successors, (152), 38 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2024-10-11 04:40:51,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:40:51,681 INFO L225 Difference]: With dead ends: 6952 [2024-10-11 04:40:51,681 INFO L226 Difference]: Without dead ends: 4378 [2024-10-11 04:40:51,685 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1017 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=985, Invalid=3845, Unknown=0, NotChecked=0, Total=4830 [2024-10-11 04:40:51,688 INFO L432 NwaCegarLoop]: 1475 mSDtfsCounter, 16669 mSDsluCounter, 16423 mSDsCounter, 0 mSdLazyCounter, 931 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16669 SdHoareTripleChecker+Valid, 17898 SdHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 04:40:51,688 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16669 Valid, 17898 Invalid, 980 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [49 Valid, 931 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 04:40:51,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4378 states. [2024-10-11 04:40:51,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4378 to 4068. [2024-10-11 04:40:51,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4068 states, 4066 states have (on average 1.529021151008362) internal successors, (6217), 4067 states have internal predecessors, (6217), 0 states have call successors, (0), 0 states 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:40:51,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4068 states to 4068 states and 6217 transitions. [2024-10-11 04:40:51,805 INFO L78 Accepts]: Start accepts. Automaton has 4068 states and 6217 transitions. Word has length 57 [2024-10-11 04:40:51,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:40:51,805 INFO L471 AbstractCegarLoop]: Abstraction has 4068 states and 6217 transitions. [2024-10-11 04:40:51,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 4.0) internal successors, (152), 38 states have internal predecessors, (152), 0 states have call successors, (0), 0 states 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:40:51,806 INFO L276 IsEmpty]: Start isEmpty. Operand 4068 states and 6217 transitions. [2024-10-11 04:40:51,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 04:40:51,809 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:40:51,809 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:40:51,823 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:40:52,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:40:52,010 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:40:52,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:40:52,010 INFO L85 PathProgramCache]: Analyzing trace with hash -402890190, now seen corresponding path program 1 times [2024-10-11 04:40:52,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:40:52,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029474733] [2024-10-11 04:40:52,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:40:52,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:40:52,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:40:52,180 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:40:52,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:40:52,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029474733] [2024-10-11 04:40:52,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029474733] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:40:52,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1306928558] [2024-10-11 04:40:52,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:40:52,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:40:52,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:40:52,183 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:40:52,187 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:40:52,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:40:52,266 INFO L255 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 04:40:52,268 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:40:52,327 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:40:52,327 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 04:40:52,470 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:40:52,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1306928558] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 04:40:52,470 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 04:40:52,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 4] total 9 [2024-10-11 04:40:52,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695414916] [2024-10-11 04:40:52,471 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 04:40:52,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 04:40:52,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:40:52,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 04:40:52,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-10-11 04:40:52,472 INFO L87 Difference]: Start difference. First operand 4068 states and 6217 transitions. Second operand has 9 states, 9 states have (on average 17.444444444444443) internal successors, (157), 9 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:40:52,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:40:52,632 INFO L93 Difference]: Finished difference Result 7896 states and 11171 transitions. [2024-10-11 04:40:52,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 04:40:52,633 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 17.444444444444443) internal successors, (157), 9 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:40:52,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:40:52,641 INFO L225 Difference]: With dead ends: 7896 [2024-10-11 04:40:52,641 INFO L226 Difference]: Without dead ends: 5384 [2024-10-11 04:40:52,643 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-10-11 04:40:52,645 INFO L432 NwaCegarLoop]: 1510 mSDtfsCounter, 4356 mSDsluCounter, 3149 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4356 SdHoareTripleChecker+Valid, 4659 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:40:52,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4356 Valid, 4659 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:40:52,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5384 states. [2024-10-11 04:40:52,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5384 to 5144. [2024-10-11 04:40:52,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5144 states, 5142 states have (on average 1.441656942823804) internal successors, (7413), 5143 states have internal predecessors, (7413), 0 states have call successors, (0), 0 states 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:40:52,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5144 states to 5144 states and 7413 transitions. [2024-10-11 04:40:52,759 INFO L78 Accepts]: Start accepts. Automaton has 5144 states and 7413 transitions. Word has length 58 [2024-10-11 04:40:52,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:40:52,760 INFO L471 AbstractCegarLoop]: Abstraction has 5144 states and 7413 transitions. [2024-10-11 04:40:52,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.444444444444443) internal successors, (157), 9 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:40:52,760 INFO L276 IsEmpty]: Start isEmpty. Operand 5144 states and 7413 transitions. [2024-10-11 04:40:52,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-11 04:40:52,761 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:40:52,761 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:52,774 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:40:52,962 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:40:52,963 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:40:52,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:40:52,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1874846004, now seen corresponding path program 1 times [2024-10-11 04:40:52,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:40:52,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933359063] [2024-10-11 04:40:52,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:40:52,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:40:53,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:40:53,628 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 36 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:40:53,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:40:53,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933359063] [2024-10-11 04:40:53,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933359063] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:40:53,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726291699] [2024-10-11 04:40:53,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:40:53,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:40:53,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:40:53,630 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:40:53,631 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:40:53,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:40:53,746 INFO L255 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-10-11 04:40:53,749 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:40:56,249 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 52 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-10-11 04:40:56,249 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 04:41:00,106 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 19 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:41:00,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [726291699] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 04:41:00,107 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 04:41:00,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 22, 24] total 57 [2024-10-11 04:41:00,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638468766] [2024-10-11 04:41:00,107 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 04:41:00,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2024-10-11 04:41:00,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:41:00,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2024-10-11 04:41:00,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=400, Invalid=2792, Unknown=0, NotChecked=0, Total=3192 [2024-10-11 04:41:00,110 INFO L87 Difference]: Start difference. First operand 5144 states and 7413 transitions. Second operand has 57 states, 57 states have (on average 4.157894736842105) internal successors, (237), 57 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)