./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label00.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label00.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6d20f8abdac11d3a14265079d0abbd72a3c88bf6607f5bf46f98ccd96bfda721 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 22:34:33,805 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 22:34:33,867 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 22:34:33,872 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 22:34:33,874 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 22:34:33,897 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 22:34:33,899 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 22:34:33,899 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 22:34:33,900 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 22:34:33,900 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 22:34:33,901 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 22:34:33,902 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 22:34:33,902 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 22:34:33,902 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 22:34:33,902 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 22:34:33,905 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 22:34:33,905 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 22:34:33,905 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 22:34:33,905 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 22:34:33,906 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 22:34:33,906 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 22:34:33,906 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 22:34:33,906 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 22:34:33,907 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 22:34:33,907 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 22:34:33,907 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 22:34:33,908 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 22:34:33,908 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 22:34:33,909 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 22:34:33,909 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 22:34:33,909 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 22:34:33,909 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 22:34:33,909 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 22:34:33,910 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 22:34:33,910 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 22:34:33,910 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 22:34:33,911 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 22:34:33,911 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 22:34:33,911 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 22:34:33,911 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 22:34:33,911 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 22:34:33,912 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 22:34:33,912 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6d20f8abdac11d3a14265079d0abbd72a3c88bf6607f5bf46f98ccd96bfda721 [2024-11-11 22:34:34,112 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 22:34:34,138 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 22:34:34,140 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 22:34:34,141 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 22:34:34,142 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 22:34:34,143 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label00.c [2024-11-11 22:34:35,447 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 22:34:35,893 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 22:34:35,894 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label00.c [2024-11-11 22:34:35,931 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22c45a75a/3a3559bc61e34cb1855ffa040c0e0a97/FLAG80830ae38 [2024-11-11 22:34:35,946 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22c45a75a/3a3559bc61e34cb1855ffa040c0e0a97 [2024-11-11 22:34:35,948 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 22:34:35,950 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 22:34:35,953 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 22:34:35,953 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 22:34:35,958 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 22:34:35,958 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 10:34:35" (1/1) ... [2024-11-11 22:34:35,959 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e48cbe8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:34:35, skipping insertion in model container [2024-11-11 22:34:35,959 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 10:34:35" (1/1) ... [2024-11-11 22:34:36,100 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 22:34:36,346 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label00.c[6354,6367] [2024-11-11 22:34:36,386 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label00.c[8229,8242] [2024-11-11 22:34:36,974 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 22:34:36,984 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 22:34:37,006 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label00.c[6354,6367] [2024-11-11 22:34:37,009 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label00.c[8229,8242] [2024-11-11 22:34:37,367 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 22:34:37,390 INFO L204 MainTranslator]: Completed translation [2024-11-11 22:34:37,390 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:34:37 WrapperNode [2024-11-11 22:34:37,391 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 22:34:37,392 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 22:34:37,392 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 22:34:37,392 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 22:34:37,397 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:34:37" (1/1) ... [2024-11-11 22:34:37,440 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:34:37" (1/1) ... [2024-11-11 22:34:37,684 INFO L138 Inliner]: procedures = 33, calls = 19, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 4983 [2024-11-11 22:34:37,684 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 22:34:37,685 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 22:34:37,685 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 22:34:37,685 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 22:34:37,693 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:34:37" (1/1) ... [2024-11-11 22:34:37,694 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:34:37" (1/1) ... [2024-11-11 22:34:37,730 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:34:37" (1/1) ... [2024-11-11 22:34:37,858 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-11-11 22:34:37,858 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:34:37" (1/1) ... [2024-11-11 22:34:37,858 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:34:37" (1/1) ... [2024-11-11 22:34:37,991 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:34:37" (1/1) ... [2024-11-11 22:34:38,017 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:34:37" (1/1) ... [2024-11-11 22:34:38,041 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:34:37" (1/1) ... [2024-11-11 22:34:38,055 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:34:37" (1/1) ... [2024-11-11 22:34:38,088 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 22:34:38,090 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 22:34:38,091 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 22:34:38,091 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 22:34:38,091 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:34:37" (1/1) ... [2024-11-11 22:34:38,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 22:34:38,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:34:38,116 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 22:34:38,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 22:34:38,151 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 22:34:38,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 22:34:38,152 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 22:34:38,152 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 22:34:38,240 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 22:34:38,242 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 22:34:41,643 INFO L? ?]: Removed 732 outVars from TransFormulas that were not future-live. [2024-11-11 22:34:41,643 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 22:34:41,673 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 22:34:41,676 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-11 22:34:41,676 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 10:34:41 BoogieIcfgContainer [2024-11-11 22:34:41,676 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 22:34:41,678 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 22:34:41,678 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 22:34:41,680 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 22:34:41,680 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 10:34:35" (1/3) ... [2024-11-11 22:34:41,681 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c4893cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 10:34:41, skipping insertion in model container [2024-11-11 22:34:41,681 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:34:37" (2/3) ... [2024-11-11 22:34:41,682 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c4893cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 10:34:41, skipping insertion in model container [2024-11-11 22:34:41,682 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 10:34:41" (3/3) ... [2024-11-11 22:34:41,683 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label00.c [2024-11-11 22:34:41,696 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 22:34:41,697 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-11 22:34:41,782 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 22:34:41,787 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;@157b4d0f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 22:34:41,788 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-11 22:34:41,795 INFO L276 IsEmpty]: Start isEmpty. Operand has 872 states, 869 states have (on average 1.906789413118527) internal successors, (1657), 871 states have internal predecessors, (1657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:41,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-11 22:34:41,802 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:34:41,802 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:34:41,803 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:34:41,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:34:41,809 INFO L85 PathProgramCache]: Analyzing trace with hash 894237909, now seen corresponding path program 1 times [2024-11-11 22:34:41,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:34:41,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156547008] [2024-11-11 22:34:41,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:34:41,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:34:41,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:34:42,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:34:42,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:34:42,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156547008] [2024-11-11 22:34:42,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156547008] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:34:42,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:34:42,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 22:34:42,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118955581] [2024-11-11 22:34:42,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:34:42,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:34:42,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:34:42,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:34:42,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:34:42,126 INFO L87 Difference]: Start difference. First operand has 872 states, 869 states have (on average 1.906789413118527) internal successors, (1657), 871 states have internal predecessors, (1657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:45,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:34:45,247 INFO L93 Difference]: Finished difference Result 2477 states and 4776 transitions. [2024-11-11 22:34:45,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:34:45,249 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2024-11-11 22:34:45,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:34:45,265 INFO L225 Difference]: With dead ends: 2477 [2024-11-11 22:34:45,266 INFO L226 Difference]: Without dead ends: 1557 [2024-11-11 22:34:45,270 INFO L434 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-11-11 22:34:45,273 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 970 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2437 mSolverCounterSat, 771 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 970 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 3208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 771 IncrementalHoareTripleChecker+Valid, 2437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:34:45,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [970 Valid, 246 Invalid, 3208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [771 Valid, 2437 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-11 22:34:45,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1557 states. [2024-11-11 22:34:45,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1557 to 1557. [2024-11-11 22:34:45,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1557 states, 1555 states have (on average 1.8411575562700964) internal successors, (2863), 1556 states have internal predecessors, (2863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:45,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1557 states to 1557 states and 2863 transitions. [2024-11-11 22:34:45,346 INFO L78 Accepts]: Start accepts. Automaton has 1557 states and 2863 transitions. Word has length 16 [2024-11-11 22:34:45,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:34:45,346 INFO L471 AbstractCegarLoop]: Abstraction has 1557 states and 2863 transitions. [2024-11-11 22:34:45,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:45,346 INFO L276 IsEmpty]: Start isEmpty. Operand 1557 states and 2863 transitions. [2024-11-11 22:34:45,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-11 22:34:45,347 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:34:45,347 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:34:45,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 22:34:45,348 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:34:45,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:34:45,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1746662891, now seen corresponding path program 1 times [2024-11-11 22:34:45,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:34:45,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335889375] [2024-11-11 22:34:45,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:34:45,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:34:45,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:34:45,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:34:45,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:34:45,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335889375] [2024-11-11 22:34:45,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335889375] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:34:45,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:34:45,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 22:34:45,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120512502] [2024-11-11 22:34:45,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:34:45,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 22:34:45,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:34:45,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 22:34:45,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 22:34:45,452 INFO L87 Difference]: Start difference. First operand 1557 states and 2863 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:45,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:34:45,521 INFO L93 Difference]: Finished difference Result 1621 states and 2961 transitions. [2024-11-11 22:34:45,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 22:34:45,526 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2024-11-11 22:34:45,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:34:45,531 INFO L225 Difference]: With dead ends: 1621 [2024-11-11 22:34:45,531 INFO L226 Difference]: Without dead ends: 1587 [2024-11-11 22:34:45,531 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 22:34:45,532 INFO L435 NwaCegarLoop]: 1520 mSDtfsCounter, 46 mSDsluCounter, 4538 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 6058 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:34:45,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 6058 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:34:45,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1587 states. [2024-11-11 22:34:45,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1587 to 1557. [2024-11-11 22:34:45,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1557 states, 1555 states have (on average 1.8308681672025724) internal successors, (2847), 1556 states have internal predecessors, (2847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:45,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1557 states to 1557 states and 2847 transitions. [2024-11-11 22:34:45,552 INFO L78 Accepts]: Start accepts. Automaton has 1557 states and 2847 transitions. Word has length 20 [2024-11-11 22:34:45,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:34:45,553 INFO L471 AbstractCegarLoop]: Abstraction has 1557 states and 2847 transitions. [2024-11-11 22:34:45,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:45,553 INFO L276 IsEmpty]: Start isEmpty. Operand 1557 states and 2847 transitions. [2024-11-11 22:34:45,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-11 22:34:45,554 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:34:45,554 INFO L218 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-11-11 22:34:45,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 22:34:45,554 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:34:45,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:34:45,555 INFO L85 PathProgramCache]: Analyzing trace with hash 623816355, now seen corresponding path program 1 times [2024-11-11 22:34:45,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:34:45,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568158650] [2024-11-11 22:34:45,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:34:45,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:34:45,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:34:45,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:34:45,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:34:45,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568158650] [2024-11-11 22:34:45,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568158650] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:34:45,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:34:45,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 22:34:45,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640082008] [2024-11-11 22:34:45,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:34:45,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 22:34:45,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:34:45,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 22:34:45,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 22:34:45,688 INFO L87 Difference]: Start difference. First operand 1557 states and 2847 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 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-11-11 22:34:45,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:34:45,819 INFO L93 Difference]: Finished difference Result 1737 states and 3129 transitions. [2024-11-11 22:34:45,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 22:34:45,820 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 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-11-11 22:34:45,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:34:45,825 INFO L225 Difference]: With dead ends: 1737 [2024-11-11 22:34:45,825 INFO L226 Difference]: Without dead ends: 1707 [2024-11-11 22:34:45,827 INFO L434 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-11-11 22:34:45,829 INFO L435 NwaCegarLoop]: 1504 mSDtfsCounter, 4589 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4589 SdHoareTripleChecker+Valid, 1865 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 22:34:45,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4589 Valid, 1865 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 22:34:45,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2024-11-11 22:34:45,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1585. [2024-11-11 22:34:45,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1585 states, 1583 states have (on average 1.8262792166771953) internal successors, (2891), 1584 states have internal predecessors, (2891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:45,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 2891 transitions. [2024-11-11 22:34:45,852 INFO L78 Accepts]: Start accepts. Automaton has 1585 states and 2891 transitions. Word has length 35 [2024-11-11 22:34:45,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:34:45,853 INFO L471 AbstractCegarLoop]: Abstraction has 1585 states and 2891 transitions. [2024-11-11 22:34:45,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 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-11-11 22:34:45,855 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 2891 transitions. [2024-11-11 22:34:45,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-11 22:34:45,855 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:34:45,855 INFO L218 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] [2024-11-11 22:34:45,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 22:34:45,856 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:34:45,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:34:45,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1071361683, now seen corresponding path program 1 times [2024-11-11 22:34:45,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:34:45,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822273336] [2024-11-11 22:34:45,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:34:45,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:34:45,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:34:45,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:34:45,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:34:45,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822273336] [2024-11-11 22:34:45,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822273336] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:34:45,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:34:45,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 22:34:45,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317598523] [2024-11-11 22:34:45,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:34:45,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:34:45,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:34:45,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:34:45,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:34:45,909 INFO L87 Difference]: Start difference. First operand 1585 states and 2891 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:45,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:34:45,938 INFO L93 Difference]: Finished difference Result 1690 states and 3054 transitions. [2024-11-11 22:34:45,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:34:45,938 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2024-11-11 22:34:45,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:34:45,943 INFO L225 Difference]: With dead ends: 1690 [2024-11-11 22:34:45,943 INFO L226 Difference]: Without dead ends: 1632 [2024-11-11 22:34:45,943 INFO L434 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-11-11 22:34:45,944 INFO L435 NwaCegarLoop]: 1506 mSDtfsCounter, 1466 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1466 SdHoareTripleChecker+Valid, 1548 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-11-11 22:34:45,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1466 Valid, 1548 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:34:45,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1632 states. [2024-11-11 22:34:45,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1632 to 1630. [2024-11-11 22:34:45,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1630 states, 1628 states have (on average 1.8175675675675675) internal successors, (2959), 1629 states have internal predecessors, (2959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:45,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1630 states to 1630 states and 2959 transitions. [2024-11-11 22:34:45,966 INFO L78 Accepts]: Start accepts. Automaton has 1630 states and 2959 transitions. Word has length 37 [2024-11-11 22:34:45,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:34:45,966 INFO L471 AbstractCegarLoop]: Abstraction has 1630 states and 2959 transitions. [2024-11-11 22:34:45,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:45,967 INFO L276 IsEmpty]: Start isEmpty. Operand 1630 states and 2959 transitions. [2024-11-11 22:34:45,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-11 22:34:45,968 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:34:45,968 INFO L218 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] [2024-11-11 22:34:45,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 22:34:45,968 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:34:45,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:34:45,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1137855195, now seen corresponding path program 1 times [2024-11-11 22:34:45,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:34:45,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497004426] [2024-11-11 22:34:45,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:34:45,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:34:45,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:34:46,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:34:46,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:34:46,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497004426] [2024-11-11 22:34:46,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497004426] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:34:46,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:34:46,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 22:34:46,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936156113] [2024-11-11 22:34:46,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:34:46,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 22:34:46,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:34:46,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 22:34:46,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 22:34:46,105 INFO L87 Difference]: Start difference. First operand 1630 states and 2959 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:46,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:34:46,186 INFO L93 Difference]: Finished difference Result 1735 states and 3119 transitions. [2024-11-11 22:34:46,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 22:34:46,187 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2024-11-11 22:34:46,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:34:46,192 INFO L225 Difference]: With dead ends: 1735 [2024-11-11 22:34:46,192 INFO L226 Difference]: Without dead ends: 1632 [2024-11-11 22:34:46,193 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-11 22:34:46,193 INFO L435 NwaCegarLoop]: 1503 mSDtfsCounter, 1475 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1475 SdHoareTripleChecker+Valid, 1632 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:34:46,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1475 Valid, 1632 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:34:46,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1632 states. [2024-11-11 22:34:46,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1632 to 1630. [2024-11-11 22:34:46,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1630 states, 1628 states have (on average 1.8163390663390664) internal successors, (2957), 1629 states have internal predecessors, (2957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:46,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1630 states to 1630 states and 2957 transitions. [2024-11-11 22:34:46,217 INFO L78 Accepts]: Start accepts. Automaton has 1630 states and 2957 transitions. Word has length 37 [2024-11-11 22:34:46,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:34:46,218 INFO L471 AbstractCegarLoop]: Abstraction has 1630 states and 2957 transitions. [2024-11-11 22:34:46,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:46,219 INFO L276 IsEmpty]: Start isEmpty. Operand 1630 states and 2957 transitions. [2024-11-11 22:34:46,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-11 22:34:46,221 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:34:46,221 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:34:46,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 22:34:46,221 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:34:46,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:34:46,222 INFO L85 PathProgramCache]: Analyzing trace with hash 499049456, now seen corresponding path program 1 times [2024-11-11 22:34:46,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:34:46,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813482097] [2024-11-11 22:34:46,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:34:46,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:34:46,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:34:46,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:34:46,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:34:46,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813482097] [2024-11-11 22:34:46,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813482097] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:34:46,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:34:46,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 22:34:46,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148359998] [2024-11-11 22:34:46,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:34:46,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 22:34:46,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:34:46,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 22:34:46,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 22:34:46,357 INFO L87 Difference]: Start difference. First operand 1630 states and 2957 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:46,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:34:46,394 INFO L93 Difference]: Finished difference Result 1638 states and 2966 transitions. [2024-11-11 22:34:46,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 22:34:46,394 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-11-11 22:34:46,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:34:46,399 INFO L225 Difference]: With dead ends: 1638 [2024-11-11 22:34:46,399 INFO L226 Difference]: Without dead ends: 1636 [2024-11-11 22:34:46,400 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 22:34:46,400 INFO L435 NwaCegarLoop]: 1505 mSDtfsCounter, 0 mSDsluCounter, 4506 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6011 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:34:46,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6011 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:34:46,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1636 states. [2024-11-11 22:34:46,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1636 to 1636. [2024-11-11 22:34:46,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1636 states, 1634 states have (on average 1.8127294981640147) internal successors, (2962), 1635 states have internal predecessors, (2962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:46,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1636 states to 1636 states and 2962 transitions. [2024-11-11 22:34:46,423 INFO L78 Accepts]: Start accepts. Automaton has 1636 states and 2962 transitions. Word has length 38 [2024-11-11 22:34:46,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:34:46,423 INFO L471 AbstractCegarLoop]: Abstraction has 1636 states and 2962 transitions. [2024-11-11 22:34:46,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:46,423 INFO L276 IsEmpty]: Start isEmpty. Operand 1636 states and 2962 transitions. [2024-11-11 22:34:46,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-11 22:34:46,424 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:34:46,424 INFO L218 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] [2024-11-11 22:34:46,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 22:34:46,424 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:34:46,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:34:46,425 INFO L85 PathProgramCache]: Analyzing trace with hash 166228827, now seen corresponding path program 1 times [2024-11-11 22:34:46,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:34:46,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087409576] [2024-11-11 22:34:46,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:34:46,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:34:46,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:34:46,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:34:46,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:34:46,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087409576] [2024-11-11 22:34:46,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087409576] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:34:46,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:34:46,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 22:34:46,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485644114] [2024-11-11 22:34:46,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:34:46,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:34:46,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:34:46,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:34:46,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:34:46,459 INFO L87 Difference]: Start difference. First operand 1636 states and 2962 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:46,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:34:46,539 INFO L93 Difference]: Finished difference Result 1758 states and 3143 transitions. [2024-11-11 22:34:46,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:34:46,540 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2024-11-11 22:34:46,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:34:46,544 INFO L225 Difference]: With dead ends: 1758 [2024-11-11 22:34:46,545 INFO L226 Difference]: Without dead ends: 1694 [2024-11-11 22:34:46,545 INFO L434 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-11-11 22:34:46,546 INFO L435 NwaCegarLoop]: 1540 mSDtfsCounter, 1476 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1476 SdHoareTripleChecker+Valid, 1588 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:34:46,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1476 Valid, 1588 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:34:46,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1694 states. [2024-11-11 22:34:46,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1694 to 1692. [2024-11-11 22:34:46,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1692 states, 1690 states have (on average 1.8005917159763314) internal successors, (3043), 1691 states have internal predecessors, (3043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:46,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1692 states to 1692 states and 3043 transitions. [2024-11-11 22:34:46,572 INFO L78 Accepts]: Start accepts. Automaton has 1692 states and 3043 transitions. Word has length 39 [2024-11-11 22:34:46,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:34:46,572 INFO L471 AbstractCegarLoop]: Abstraction has 1692 states and 3043 transitions. [2024-11-11 22:34:46,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:46,573 INFO L276 IsEmpty]: Start isEmpty. Operand 1692 states and 3043 transitions. [2024-11-11 22:34:46,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-11 22:34:46,574 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:34:46,574 INFO L218 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] [2024-11-11 22:34:46,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 22:34:46,574 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:34:46,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:34:46,575 INFO L85 PathProgramCache]: Analyzing trace with hash -2049239973, now seen corresponding path program 1 times [2024-11-11 22:34:46,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:34:46,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833741754] [2024-11-11 22:34:46,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:34:46,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:34:46,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:34:46,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:34:46,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:34:46,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833741754] [2024-11-11 22:34:46,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833741754] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:34:46,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:34:46,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 22:34:46,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24172382] [2024-11-11 22:34:46,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:34:46,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:34:46,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:34:46,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:34:46,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:34:46,613 INFO L87 Difference]: Start difference. First operand 1692 states and 3043 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:46,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:34:46,636 INFO L93 Difference]: Finished difference Result 1994 states and 3483 transitions. [2024-11-11 22:34:46,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:34:46,637 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2024-11-11 22:34:46,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:34:46,642 INFO L225 Difference]: With dead ends: 1994 [2024-11-11 22:34:46,642 INFO L226 Difference]: Without dead ends: 1831 [2024-11-11 22:34:46,643 INFO L434 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-11-11 22:34:46,644 INFO L435 NwaCegarLoop]: 1542 mSDtfsCounter, 1474 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1474 SdHoareTripleChecker+Valid, 1594 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:34:46,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1474 Valid, 1594 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:34:46,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1831 states. [2024-11-11 22:34:46,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1831 to 1829. [2024-11-11 22:34:46,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1829 states, 1827 states have (on average 1.7706622879036673) internal successors, (3235), 1828 states have internal predecessors, (3235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:46,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1829 states to 1829 states and 3235 transitions. [2024-11-11 22:34:46,675 INFO L78 Accepts]: Start accepts. Automaton has 1829 states and 3235 transitions. Word has length 39 [2024-11-11 22:34:46,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:34:46,675 INFO L471 AbstractCegarLoop]: Abstraction has 1829 states and 3235 transitions. [2024-11-11 22:34:46,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:46,675 INFO L276 IsEmpty]: Start isEmpty. Operand 1829 states and 3235 transitions. [2024-11-11 22:34:46,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-11 22:34:46,676 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:34:46,676 INFO L218 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] [2024-11-11 22:34:46,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 22:34:46,677 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:34:46,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:34:46,677 INFO L85 PathProgramCache]: Analyzing trace with hash -268307109, now seen corresponding path program 1 times [2024-11-11 22:34:46,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:34:46,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233358614] [2024-11-11 22:34:46,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:34:46,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:34:46,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:34:46,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:34:46,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:34:46,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233358614] [2024-11-11 22:34:46,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233358614] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:34:46,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:34:46,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 22:34:46,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45931] [2024-11-11 22:34:46,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:34:46,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:34:46,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:34:46,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:34:46,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:34:46,728 INFO L87 Difference]: Start difference. First operand 1829 states and 3235 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:46,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:34:46,758 INFO L93 Difference]: Finished difference Result 2381 states and 4017 transitions. [2024-11-11 22:34:46,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:34:46,758 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2024-11-11 22:34:46,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:34:46,764 INFO L225 Difference]: With dead ends: 2381 [2024-11-11 22:34:46,764 INFO L226 Difference]: Without dead ends: 2081 [2024-11-11 22:34:46,765 INFO L434 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-11-11 22:34:46,766 INFO L435 NwaCegarLoop]: 1540 mSDtfsCounter, 1472 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1472 SdHoareTripleChecker+Valid, 1596 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:34:46,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1472 Valid, 1596 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:34:46,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2081 states. [2024-11-11 22:34:46,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2081 to 2079. [2024-11-11 22:34:46,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2079 states, 2077 states have (on average 1.719306692344728) internal successors, (3571), 2078 states have internal predecessors, (3571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:46,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2079 states to 2079 states and 3571 transitions. [2024-11-11 22:34:46,798 INFO L78 Accepts]: Start accepts. Automaton has 2079 states and 3571 transitions. Word has length 39 [2024-11-11 22:34:46,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:34:46,798 INFO L471 AbstractCegarLoop]: Abstraction has 2079 states and 3571 transitions. [2024-11-11 22:34:46,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:46,799 INFO L276 IsEmpty]: Start isEmpty. Operand 2079 states and 3571 transitions. [2024-11-11 22:34:46,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-11 22:34:46,800 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:34:46,800 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:34:46,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 22:34:46,800 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:34:46,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:34:46,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1567417933, now seen corresponding path program 1 times [2024-11-11 22:34:46,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:34:46,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543121230] [2024-11-11 22:34:46,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:34:46,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:34:46,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:34:46,921 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-11 22:34:46,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:34:46,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543121230] [2024-11-11 22:34:46,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543121230] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:34:46,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:34:46,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 22:34:46,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402932118] [2024-11-11 22:34:46,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:34:46,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 22:34:46,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:34:46,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 22:34:46,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 22:34:46,924 INFO L87 Difference]: Start difference. First operand 2079 states and 3571 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 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-11-11 22:34:46,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:34:46,998 INFO L93 Difference]: Finished difference Result 3711 states and 5847 transitions. [2024-11-11 22:34:46,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 22:34:46,998 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 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 54 [2024-11-11 22:34:46,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:34:47,007 INFO L225 Difference]: With dead ends: 3711 [2024-11-11 22:34:47,007 INFO L226 Difference]: Without dead ends: 3309 [2024-11-11 22:34:47,009 INFO L434 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-11-11 22:34:47,009 INFO L435 NwaCegarLoop]: 1548 mSDtfsCounter, 3039 mSDsluCounter, 1612 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3039 SdHoareTripleChecker+Valid, 3160 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-11-11 22:34:47,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3039 Valid, 3160 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:34:47,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3309 states. [2024-11-11 22:34:47,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3309 to 2555. [2024-11-11 22:34:47,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2555 states, 2553 states have (on average 1.6556991774383079) internal successors, (4227), 2554 states have internal predecessors, (4227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:47,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2555 states to 2555 states and 4227 transitions. [2024-11-11 22:34:47,058 INFO L78 Accepts]: Start accepts. Automaton has 2555 states and 4227 transitions. Word has length 54 [2024-11-11 22:34:47,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:34:47,059 INFO L471 AbstractCegarLoop]: Abstraction has 2555 states and 4227 transitions. [2024-11-11 22:34:47,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 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-11-11 22:34:47,059 INFO L276 IsEmpty]: Start isEmpty. Operand 2555 states and 4227 transitions. [2024-11-11 22:34:47,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-11 22:34:47,060 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:34:47,060 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:34:47,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 22:34:47,060 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:34:47,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:34:47,060 INFO L85 PathProgramCache]: Analyzing trace with hash -648050867, now seen corresponding path program 1 times [2024-11-11 22:34:47,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:34:47,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567453405] [2024-11-11 22:34:47,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:34:47,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:34:47,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:34:47,170 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-11 22:34:47,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:34:47,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567453405] [2024-11-11 22:34:47,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567453405] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:34:47,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:34:47,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 22:34:47,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711478382] [2024-11-11 22:34:47,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:34:47,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 22:34:47,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:34:47,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 22:34:47,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 22:34:47,172 INFO L87 Difference]: Start difference. First operand 2555 states and 4227 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:47,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:34:47,258 INFO L93 Difference]: Finished difference Result 4259 states and 6607 transitions. [2024-11-11 22:34:47,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 22:34:47,259 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-11-11 22:34:47,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:34:47,276 INFO L225 Difference]: With dead ends: 4259 [2024-11-11 22:34:47,276 INFO L226 Difference]: Without dead ends: 3709 [2024-11-11 22:34:47,278 INFO L434 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-11-11 22:34:47,279 INFO L435 NwaCegarLoop]: 1547 mSDtfsCounter, 3041 mSDsluCounter, 1600 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3041 SdHoareTripleChecker+Valid, 3147 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:34:47,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3041 Valid, 3147 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:34:47,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3709 states. [2024-11-11 22:34:47,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3709 to 3303. [2024-11-11 22:34:47,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3303 states, 3301 states have (on average 1.5919418358073312) internal successors, (5255), 3302 states have internal predecessors, (5255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:47,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3303 states to 3303 states and 5255 transitions. [2024-11-11 22:34:47,346 INFO L78 Accepts]: Start accepts. Automaton has 3303 states and 5255 transitions. Word has length 54 [2024-11-11 22:34:47,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:34:47,346 INFO L471 AbstractCegarLoop]: Abstraction has 3303 states and 5255 transitions. [2024-11-11 22:34:47,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:47,347 INFO L276 IsEmpty]: Start isEmpty. Operand 3303 states and 5255 transitions. [2024-11-11 22:34:47,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-11 22:34:47,347 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:34:47,348 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:34:47,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 22:34:47,348 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:34:47,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:34:47,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1132881997, now seen corresponding path program 1 times [2024-11-11 22:34:47,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:34:47,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458127793] [2024-11-11 22:34:47,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:34:47,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:34:47,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:34:47,432 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-11 22:34:47,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:34:47,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458127793] [2024-11-11 22:34:47,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458127793] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:34:47,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:34:47,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 22:34:47,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000832368] [2024-11-11 22:34:47,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:34:47,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 22:34:47,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:34:47,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 22:34:47,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 22:34:47,434 INFO L87 Difference]: Start difference. First operand 3303 states and 5255 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-11-11 22:34:47,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:34:47,525 INFO L93 Difference]: Finished difference Result 4807 states and 7363 transitions. [2024-11-11 22:34:47,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 22:34:47,525 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 54 [2024-11-11 22:34:47,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:34:47,532 INFO L225 Difference]: With dead ends: 4807 [2024-11-11 22:34:47,533 INFO L226 Difference]: Without dead ends: 4257 [2024-11-11 22:34:47,534 INFO L434 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-11-11 22:34:47,538 INFO L435 NwaCegarLoop]: 1546 mSDtfsCounter, 3047 mSDsluCounter, 1607 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3047 SdHoareTripleChecker+Valid, 3153 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:34:47,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3047 Valid, 3153 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:34:47,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4257 states. [2024-11-11 22:34:47,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4257 to 3851. [2024-11-11 22:34:47,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3851 states, 3849 states have (on average 1.561704338789296) internal successors, (6011), 3850 states have internal predecessors, (6011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:47,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3851 states to 3851 states and 6011 transitions. [2024-11-11 22:34:47,679 INFO L78 Accepts]: Start accepts. Automaton has 3851 states and 6011 transitions. Word has length 54 [2024-11-11 22:34:47,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:34:47,679 INFO L471 AbstractCegarLoop]: Abstraction has 3851 states and 6011 transitions. [2024-11-11 22:34:47,680 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-11-11 22:34:47,680 INFO L276 IsEmpty]: Start isEmpty. Operand 3851 states and 6011 transitions. [2024-11-11 22:34:47,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-11 22:34:47,681 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:34:47,681 INFO L218 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, 1, 1, 1] [2024-11-11 22:34:47,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 22:34:47,681 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:34:47,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:34:47,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1336470191, now seen corresponding path program 1 times [2024-11-11 22:34:47,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:34:47,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835155574] [2024-11-11 22:34:47,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:34:47,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:34:47,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:34:47,749 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:34:47,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:34:47,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835155574] [2024-11-11 22:34:47,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835155574] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:34:47,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:34:47,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 22:34:47,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158470780] [2024-11-11 22:34:47,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:34:47,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:34:47,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:34:47,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:34:47,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:34:47,751 INFO L87 Difference]: Start difference. First operand 3851 states and 6011 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:47,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:34:47,816 INFO L93 Difference]: Finished difference Result 6175 states and 9221 transitions. [2024-11-11 22:34:47,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:34:47,817 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-11-11 22:34:47,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:34:47,823 INFO L225 Difference]: With dead ends: 6175 [2024-11-11 22:34:47,823 INFO L226 Difference]: Without dead ends: 3853 [2024-11-11 22:34:47,826 INFO L434 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-11-11 22:34:47,827 INFO L435 NwaCegarLoop]: 1526 mSDtfsCounter, 29 mSDsluCounter, 1496 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 3022 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-11-11 22:34:47,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 3022 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:34:47,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3853 states. [2024-11-11 22:34:47,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3853 to 3851. [2024-11-11 22:34:47,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3851 states, 3849 states have (on average 1.54871395167576) internal successors, (5961), 3850 states have internal predecessors, (5961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:47,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3851 states to 3851 states and 5961 transitions. [2024-11-11 22:34:47,931 INFO L78 Accepts]: Start accepts. Automaton has 3851 states and 5961 transitions. Word has length 55 [2024-11-11 22:34:47,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:34:47,931 INFO L471 AbstractCegarLoop]: Abstraction has 3851 states and 5961 transitions. [2024-11-11 22:34:47,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:47,932 INFO L276 IsEmpty]: Start isEmpty. Operand 3851 states and 5961 transitions. [2024-11-11 22:34:47,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-11 22:34:47,932 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:34:47,932 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:34:47,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-11 22:34:47,933 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:34:47,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:34:47,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1355833083, now seen corresponding path program 1 times [2024-11-11 22:34:47,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:34:47,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308881353] [2024-11-11 22:34:47,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:34:47,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:34:47,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:34:48,030 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:34:48,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:34:48,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308881353] [2024-11-11 22:34:48,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308881353] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:34:48,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:34:48,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 22:34:48,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864131495] [2024-11-11 22:34:48,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:34:48,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:34:48,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:34:48,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:34:48,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:34:48,033 INFO L87 Difference]: Start difference. First operand 3851 states and 5961 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:48,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:34:48,076 INFO L93 Difference]: Finished difference Result 4770 states and 7221 transitions. [2024-11-11 22:34:48,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:34:48,077 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 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-11-11 22:34:48,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:34:48,082 INFO L225 Difference]: With dead ends: 4770 [2024-11-11 22:34:48,082 INFO L226 Difference]: Without dead ends: 2448 [2024-11-11 22:34:48,084 INFO L434 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-11-11 22:34:48,085 INFO L435 NwaCegarLoop]: 1524 mSDtfsCounter, 23 mSDsluCounter, 1495 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 3019 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-11-11 22:34:48,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 3019 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:34:48,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2448 states. [2024-11-11 22:34:48,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2448 to 2440. [2024-11-11 22:34:48,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2440 states, 2438 states have (on average 1.6554552912223133) internal successors, (4036), 2439 states have internal predecessors, (4036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:48,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2440 states to 2440 states and 4036 transitions. [2024-11-11 22:34:48,138 INFO L78 Accepts]: Start accepts. Automaton has 2440 states and 4036 transitions. Word has length 56 [2024-11-11 22:34:48,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:34:48,138 INFO L471 AbstractCegarLoop]: Abstraction has 2440 states and 4036 transitions. [2024-11-11 22:34:48,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:48,139 INFO L276 IsEmpty]: Start isEmpty. Operand 2440 states and 4036 transitions. [2024-11-11 22:34:48,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-11 22:34:48,139 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:34:48,139 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:34:48,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 22:34:48,140 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:34:48,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:34:48,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1597882527, now seen corresponding path program 1 times [2024-11-11 22:34:48,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:34:48,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946770569] [2024-11-11 22:34:48,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:34:48,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:34:48,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:34:48,231 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:34:48,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:34:48,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946770569] [2024-11-11 22:34:48,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946770569] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:34:48,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:34:48,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 22:34:48,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655443471] [2024-11-11 22:34:48,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:34:48,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:34:48,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:34:48,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:34:48,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:34:48,234 INFO L87 Difference]: Start difference. First operand 2440 states and 4036 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:48,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:34:48,265 INFO L93 Difference]: Finished difference Result 2894 states and 4650 transitions. [2024-11-11 22:34:48,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:34:48,266 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 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-11-11 22:34:48,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:34:48,269 INFO L225 Difference]: With dead ends: 2894 [2024-11-11 22:34:48,269 INFO L226 Difference]: Without dead ends: 1992 [2024-11-11 22:34:48,272 INFO L434 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-11-11 22:34:48,272 INFO L435 NwaCegarLoop]: 1518 mSDtfsCounter, 25 mSDsluCounter, 1480 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 2998 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-11-11 22:34:48,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 2998 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:34:48,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1992 states. [2024-11-11 22:34:48,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1992 to 1990. [2024-11-11 22:34:48,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1990 states, 1988 states have (on average 1.7178068410462777) internal successors, (3415), 1989 states have internal predecessors, (3415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:48,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1990 states to 1990 states and 3415 transitions. [2024-11-11 22:34:48,307 INFO L78 Accepts]: Start accepts. Automaton has 1990 states and 3415 transitions. Word has length 57 [2024-11-11 22:34:48,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:34:48,308 INFO L471 AbstractCegarLoop]: Abstraction has 1990 states and 3415 transitions. [2024-11-11 22:34:48,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:48,308 INFO L276 IsEmpty]: Start isEmpty. Operand 1990 states and 3415 transitions. [2024-11-11 22:34:48,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-11 22:34:48,309 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:34:48,309 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:34:48,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-11 22:34:48,309 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:34:48,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:34:48,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1649038701, now seen corresponding path program 1 times [2024-11-11 22:34:48,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:34:48,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323483220] [2024-11-11 22:34:48,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:34:48,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:34:48,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:34:48,429 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-11 22:34:48,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:34:48,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323483220] [2024-11-11 22:34:48,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323483220] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 22:34:48,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1358359558] [2024-11-11 22:34:48,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:34:48,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:34:48,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:34:48,432 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 22:34:48,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-11 22:34:48,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:34:48,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-11 22:34:48,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 22:34:48,674 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-11 22:34:48,674 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 22:34:49,021 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-11 22:34:49,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1358359558] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 22:34:49,021 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 22:34:49,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 4] total 10 [2024-11-11 22:34:49,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848465670] [2024-11-11 22:34:49,022 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 22:34:49,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-11 22:34:49,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:34:49,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-11 22:34:49,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-11 22:34:49,023 INFO L87 Difference]: Start difference. First operand 1990 states and 3415 transitions. Second operand has 10 states, 10 states have (on average 15.6) internal successors, (156), 10 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:49,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:34:49,103 INFO L93 Difference]: Finished difference Result 3052 states and 4809 transitions. [2024-11-11 22:34:49,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 22:34:49,103 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 15.6) internal successors, (156), 10 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2024-11-11 22:34:49,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:34:49,111 INFO L225 Difference]: With dead ends: 3052 [2024-11-11 22:34:49,112 INFO L226 Difference]: Without dead ends: 2600 [2024-11-11 22:34:49,113 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-11 22:34:49,113 INFO L435 NwaCegarLoop]: 1516 mSDtfsCounter, 2938 mSDsluCounter, 4598 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2938 SdHoareTripleChecker+Valid, 6114 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:34:49,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2938 Valid, 6114 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:34:49,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2600 states. [2024-11-11 22:34:49,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2600 to 2545. [2024-11-11 22:34:49,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2545 states, 2543 states have (on average 1.610696028313016) internal successors, (4096), 2544 states have internal predecessors, (4096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:49,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2545 states to 2545 states and 4096 transitions. [2024-11-11 22:34:49,164 INFO L78 Accepts]: Start accepts. Automaton has 2545 states and 4096 transitions. Word has length 59 [2024-11-11 22:34:49,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:34:49,164 INFO L471 AbstractCegarLoop]: Abstraction has 2545 states and 4096 transitions. [2024-11-11 22:34:49,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.6) internal successors, (156), 10 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:49,164 INFO L276 IsEmpty]: Start isEmpty. Operand 2545 states and 4096 transitions. [2024-11-11 22:34:49,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-11 22:34:49,165 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:34:49,165 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:34:49,182 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-11 22:34:49,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-11 22:34:49,366 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:34:49,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:34:49,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1651307681, now seen corresponding path program 1 times [2024-11-11 22:34:49,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:34:49,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328983993] [2024-11-11 22:34:49,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:34:49,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:34:49,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:34:49,924 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:34:49,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:34:49,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328983993] [2024-11-11 22:34:49,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328983993] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 22:34:49,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880998777] [2024-11-11 22:34:49,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:34:49,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:34:49,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:34:49,926 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 22:34:49,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-11 22:34:50,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:34:50,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-11 22:34:50,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 22:34:50,388 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:34:50,388 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 22:34:50,961 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:34:50,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880998777] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 22:34:50,961 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 22:34:50,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2024-11-11 22:34:50,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583255735] [2024-11-11 22:34:50,962 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 22:34:50,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-11 22:34:50,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:34:50,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-11 22:34:50,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=524, Unknown=0, NotChecked=0, Total=600 [2024-11-11 22:34:50,963 INFO L87 Difference]: Start difference. First operand 2545 states and 4096 transitions. Second operand has 25 states, 25 states have (on average 5.92) internal successors, (148), 24 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:52,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:34:52,767 INFO L93 Difference]: Finished difference Result 7578 states and 10534 transitions. [2024-11-11 22:34:52,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-11-11 22:34:52,767 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 5.92) internal successors, (148), 24 states have internal predecessors, (148), 0 states have call successors, (0), 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 60 [2024-11-11 22:34:52,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:34:52,777 INFO L225 Difference]: With dead ends: 7578 [2024-11-11 22:34:52,777 INFO L226 Difference]: Without dead ends: 6592 [2024-11-11 22:34:52,780 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 817 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=791, Invalid=3115, Unknown=0, NotChecked=0, Total=3906 [2024-11-11 22:34:52,781 INFO L435 NwaCegarLoop]: 1504 mSDtfsCounter, 21684 mSDsluCounter, 6490 mSDsCounter, 0 mSdLazyCounter, 659 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21684 SdHoareTripleChecker+Valid, 7994 SdHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 22:34:52,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21684 Valid, 7994 Invalid, 700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 659 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 22:34:52,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6592 states. [2024-11-11 22:34:52,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6592 to 5254. [2024-11-11 22:34:52,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5254 states, 5252 states have (on average 1.416031987814166) internal successors, (7437), 5253 states have internal predecessors, (7437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:52,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5254 states to 5254 states and 7437 transitions. [2024-11-11 22:34:52,885 INFO L78 Accepts]: Start accepts. Automaton has 5254 states and 7437 transitions. Word has length 60 [2024-11-11 22:34:52,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:34:52,886 INFO L471 AbstractCegarLoop]: Abstraction has 5254 states and 7437 transitions. [2024-11-11 22:34:52,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 5.92) internal successors, (148), 24 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:52,886 INFO L276 IsEmpty]: Start isEmpty. Operand 5254 states and 7437 transitions. [2024-11-11 22:34:52,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-11 22:34:52,887 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:34:52,887 INFO L218 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, 1, 1] [2024-11-11 22:34:52,904 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-11 22:34:53,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-11 22:34:53,091 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:34:53,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:34:53,091 INFO L85 PathProgramCache]: Analyzing trace with hash 858338323, now seen corresponding path program 1 times [2024-11-11 22:34:53,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:34:53,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319537547] [2024-11-11 22:34:53,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:34:53,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:34:53,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:34:53,353 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:34:53,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:34:53,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319537547] [2024-11-11 22:34:53,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319537547] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 22:34:53,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [133229488] [2024-11-11 22:34:53,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:34:53,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:34:53,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:34:53,356 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 22:34:53,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-11 22:34:53,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:34:53,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-11 22:34:53,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 22:34:54,038 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:34:54,039 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 22:34:54,989 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:34:54,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [133229488] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 22:34:54,990 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 22:34:54,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 13] total 32 [2024-11-11 22:34:54,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412740327] [2024-11-11 22:34:54,990 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 22:34:54,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-11 22:34:54,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:34:54,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-11 22:34:54,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=886, Unknown=0, NotChecked=0, Total=992 [2024-11-11 22:34:54,991 INFO L87 Difference]: Start difference. First operand 5254 states and 7437 transitions. Second operand has 32 states, 32 states have (on average 5.0) internal successors, (160), 32 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:57,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:34:57,440 INFO L93 Difference]: Finished difference Result 14647 states and 19251 transitions. [2024-11-11 22:34:57,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-11-11 22:34:57,440 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 5.0) internal successors, (160), 32 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-11-11 22:34:57,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:34:57,456 INFO L225 Difference]: With dead ends: 14647 [2024-11-11 22:34:57,456 INFO L226 Difference]: Without dead ends: 11347 [2024-11-11 22:34:57,461 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1169 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=939, Invalid=4173, Unknown=0, NotChecked=0, Total=5112 [2024-11-11 22:34:57,461 INFO L435 NwaCegarLoop]: 1493 mSDtfsCounter, 19639 mSDsluCounter, 13679 mSDsCounter, 0 mSdLazyCounter, 852 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19639 SdHoareTripleChecker+Valid, 15172 SdHoareTripleChecker+Invalid, 909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 22:34:57,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19639 Valid, 15172 Invalid, 909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 852 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 22:34:57,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11347 states. [2024-11-11 22:34:57,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11347 to 5816. [2024-11-11 22:34:57,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5816 states, 5814 states have (on average 1.387512899896801) internal successors, (8067), 5815 states have internal predecessors, (8067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:57,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5816 states to 5816 states and 8067 transitions. [2024-11-11 22:34:57,720 INFO L78 Accepts]: Start accepts. Automaton has 5816 states and 8067 transitions. Word has length 60 [2024-11-11 22:34:57,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:34:57,720 INFO L471 AbstractCegarLoop]: Abstraction has 5816 states and 8067 transitions. [2024-11-11 22:34:57,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 5.0) internal successors, (160), 32 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:57,721 INFO L276 IsEmpty]: Start isEmpty. Operand 5816 states and 8067 transitions. [2024-11-11 22:34:57,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-11 22:34:57,722 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:34:57,722 INFO L218 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, 1, 1, 1] [2024-11-11 22:34:57,742 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-11 22:34:57,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-11 22:34:57,926 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:34:57,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:34:57,927 INFO L85 PathProgramCache]: Analyzing trace with hash 69853425, now seen corresponding path program 1 times [2024-11-11 22:34:57,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:34:57,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508295860] [2024-11-11 22:34:57,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:34:57,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:34:57,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:34:59,070 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:34:59,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:34:59,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508295860] [2024-11-11 22:34:59,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508295860] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 22:34:59,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2098069755] [2024-11-11 22:34:59,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:34:59,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:34:59,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:34:59,072 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 22:34:59,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-11 22:34:59,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:34:59,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-11 22:34:59,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 22:35:01,151 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:35:01,151 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 22:35:03,530 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:35:03,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2098069755] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 22:35:03,530 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 22:35:03,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19, 18] total 54 [2024-11-11 22:35:03,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188615957] [2024-11-11 22:35:03,531 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 22:35:03,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2024-11-11 22:35:03,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:35:03,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2024-11-11 22:35:03,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=2561, Unknown=0, NotChecked=0, Total=2862 [2024-11-11 22:35:03,532 INFO L87 Difference]: Start difference. First operand 5816 states and 8067 transitions. Second operand has 54 states, 54 states have (on average 3.074074074074074) internal successors, (166), 54 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:35:26,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:35:26,592 INFO L93 Difference]: Finished difference Result 14846 states and 19216 transitions. [2024-11-11 22:35:26,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2024-11-11 22:35:26,593 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 3.074074074074074) internal successors, (166), 54 states have internal predecessors, (166), 0 states have call successors, (0), 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 61 [2024-11-11 22:35:26,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:35:26,606 INFO L225 Difference]: With dead ends: 14846 [2024-11-11 22:35:26,606 INFO L226 Difference]: Without dead ends: 11795 [2024-11-11 22:35:26,612 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7266 ImplicationChecksByTransitivity, 22.3s TimeCoverageRelationStatistics Valid=4484, Invalid=20638, Unknown=0, NotChecked=0, Total=25122 [2024-11-11 22:35:26,613 INFO L435 NwaCegarLoop]: 1523 mSDtfsCounter, 28859 mSDsluCounter, 20692 mSDsCounter, 0 mSdLazyCounter, 2700 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28859 SdHoareTripleChecker+Valid, 22215 SdHoareTripleChecker+Invalid, 2797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 2700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-11 22:35:26,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28859 Valid, 22215 Invalid, 2797 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [97 Valid, 2700 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-11 22:35:26,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11795 states. [2024-11-11 22:35:26,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11795 to 7619. [2024-11-11 22:35:26,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7619 states, 7617 states have (on average 1.3471182880399106) internal successors, (10261), 7618 states have internal predecessors, (10261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:35:26,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7619 states to 7619 states and 10261 transitions. [2024-11-11 22:35:26,869 INFO L78 Accepts]: Start accepts. Automaton has 7619 states and 10261 transitions. Word has length 61 [2024-11-11 22:35:26,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:35:26,870 INFO L471 AbstractCegarLoop]: Abstraction has 7619 states and 10261 transitions. [2024-11-11 22:35:26,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 3.074074074074074) internal successors, (166), 54 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:35:26,870 INFO L276 IsEmpty]: Start isEmpty. Operand 7619 states and 10261 transitions. [2024-11-11 22:35:26,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-11 22:35:26,871 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:35:26,871 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:35:26,884 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-11 22:35:27,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:35:27,076 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:35:27,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:35:27,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1759918709, now seen corresponding path program 1 times [2024-11-11 22:35:27,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:35:27,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899334844] [2024-11-11 22:35:27,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:35:27,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:35:27,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:35:28,202 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:35:28,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:35:28,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899334844] [2024-11-11 22:35:28,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899334844] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 22:35:28,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [933237453] [2024-11-11 22:35:28,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:35:28,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:35:28,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:35:28,204 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 22:35:28,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-11 22:35:28,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:35:28,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-11 22:35:28,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 22:35:30,825 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:35:30,826 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 22:35:32,872 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:35:32,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [933237453] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 22:35:32,872 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 22:35:32,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22, 21] total 59 [2024-11-11 22:35:32,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183435913] [2024-11-11 22:35:32,873 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 22:35:32,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2024-11-11 22:35:32,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:35:32,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2024-11-11 22:35:32,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=388, Invalid=3034, Unknown=0, NotChecked=0, Total=3422 [2024-11-11 22:35:32,875 INFO L87 Difference]: Start difference. First operand 7619 states and 10261 transitions. Second operand has 59 states, 59 states have (on average 2.7966101694915255) internal successors, (165), 59 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:35:42,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:35:42,393 INFO L93 Difference]: Finished difference Result 12646 states and 16544 transitions. [2024-11-11 22:35:42,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2024-11-11 22:35:42,394 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 2.7966101694915255) internal successors, (165), 59 states have internal predecessors, (165), 0 states have call successors, (0), 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 63 [2024-11-11 22:35:42,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:35:42,407 INFO L225 Difference]: With dead ends: 12646 [2024-11-11 22:35:42,407 INFO L226 Difference]: Without dead ends: 9717 [2024-11-11 22:35:42,414 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 87 SyntacticMatches, 2 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5231 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=3432, Invalid=14658, Unknown=0, NotChecked=0, Total=18090 [2024-11-11 22:35:42,415 INFO L435 NwaCegarLoop]: 1507 mSDtfsCounter, 25110 mSDsluCounter, 24584 mSDsCounter, 0 mSdLazyCounter, 2184 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25110 SdHoareTripleChecker+Valid, 26091 SdHoareTripleChecker+Invalid, 2255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 2184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-11 22:35:42,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25110 Valid, 26091 Invalid, 2255 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [71 Valid, 2184 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-11 22:35:42,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9717 states. [2024-11-11 22:35:42,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9717 to 8219. [2024-11-11 22:35:42,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8219 states, 8217 states have (on average 1.343312644517464) internal successors, (11038), 8218 states have internal predecessors, (11038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:35:42,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8219 states to 8219 states and 11038 transitions. [2024-11-11 22:35:42,723 INFO L78 Accepts]: Start accepts. Automaton has 8219 states and 11038 transitions. Word has length 63 [2024-11-11 22:35:42,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:35:42,723 INFO L471 AbstractCegarLoop]: Abstraction has 8219 states and 11038 transitions. [2024-11-11 22:35:42,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 2.7966101694915255) internal successors, (165), 59 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:35:42,723 INFO L276 IsEmpty]: Start isEmpty. Operand 8219 states and 11038 transitions. [2024-11-11 22:35:42,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-11 22:35:42,728 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:35:42,728 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:35:42,745 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-11 22:35:42,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:35:42,932 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:35:42,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:35:42,933 INFO L85 PathProgramCache]: Analyzing trace with hash -459582480, now seen corresponding path program 1 times [2024-11-11 22:35:42,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:35:42,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961538788] [2024-11-11 22:35:42,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:35:42,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:35:42,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:35:43,061 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:35:43,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:35:43,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961538788] [2024-11-11 22:35:43,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961538788] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:35:43,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:35:43,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 22:35:43,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893448249] [2024-11-11 22:35:43,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:35:43,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 22:35:43,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:35:43,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 22:35:43,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 22:35:43,063 INFO L87 Difference]: Start difference. First operand 8219 states and 11038 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:35:48,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:35:48,056 INFO L93 Difference]: Finished difference Result 11976 states and 17928 transitions. [2024-11-11 22:35:48,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 22:35:48,061 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2024-11-11 22:35:48,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:35:48,072 INFO L225 Difference]: With dead ends: 11976 [2024-11-11 22:35:48,072 INFO L226 Difference]: Without dead ends: 10472 [2024-11-11 22:35:48,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 22:35:48,081 INFO L435 NwaCegarLoop]: 762 mSDtfsCounter, 2313 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5154 mSolverCounterSat, 1148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2313 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 6302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1148 IncrementalHoareTripleChecker+Valid, 5154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-11-11 22:35:48,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2313 Valid, 780 Invalid, 6302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1148 Valid, 5154 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2024-11-11 22:35:48,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10472 states. [2024-11-11 22:35:48,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10472 to 10472. [2024-11-11 22:35:48,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10472 states, 10470 states have (on average 1.3531041069723018) internal successors, (14167), 10471 states have internal predecessors, (14167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:35:48,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10472 states to 10472 states and 14167 transitions. [2024-11-11 22:35:48,513 INFO L78 Accepts]: Start accepts. Automaton has 10472 states and 14167 transitions. Word has length 85 [2024-11-11 22:35:48,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:35:48,514 INFO L471 AbstractCegarLoop]: Abstraction has 10472 states and 14167 transitions. [2024-11-11 22:35:48,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:35:48,514 INFO L276 IsEmpty]: Start isEmpty. Operand 10472 states and 14167 transitions. [2024-11-11 22:35:48,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-11 22:35:48,516 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:35:48,516 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:35:48,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-11 22:35:48,516 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:35:48,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:35:48,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1041724949, now seen corresponding path program 1 times [2024-11-11 22:35:48,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:35:48,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534140881] [2024-11-11 22:35:48,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:35:48,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:35:48,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:35:48,607 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:35:48,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:35:48,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534140881] [2024-11-11 22:35:48,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534140881] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:35:48,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:35:48,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 22:35:48,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263952533] [2024-11-11 22:35:48,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:35:48,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:35:48,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:35:48,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:35:48,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:35:48,609 INFO L87 Difference]: Start difference. First operand 10472 states and 14167 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:35:51,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:35:51,439 INFO L93 Difference]: Finished difference Result 17233 states and 25219 transitions. [2024-11-11 22:35:51,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:35:51,439 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2024-11-11 22:35:51,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:35:51,453 INFO L225 Difference]: With dead ends: 17233 [2024-11-11 22:35:51,453 INFO L226 Difference]: Without dead ends: 13476 [2024-11-11 22:35:51,459 INFO L434 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-11-11 22:35:51,459 INFO L435 NwaCegarLoop]: 1039 mSDtfsCounter, 775 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 2319 mSolverCounterSat, 746 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 775 SdHoareTripleChecker+Valid, 1116 SdHoareTripleChecker+Invalid, 3065 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 746 IncrementalHoareTripleChecker+Valid, 2319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-11 22:35:51,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [775 Valid, 1116 Invalid, 3065 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [746 Valid, 2319 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-11 22:35:51,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13476 states. [2024-11-11 22:35:51,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13476 to 13476. [2024-11-11 22:35:51,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13476 states, 13474 states have (on average 1.3839245955172925) internal successors, (18647), 13475 states have internal predecessors, (18647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:35:51,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13476 states to 13476 states and 18647 transitions. [2024-11-11 22:35:51,874 INFO L78 Accepts]: Start accepts. Automaton has 13476 states and 18647 transitions. Word has length 87 [2024-11-11 22:35:51,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:35:51,875 INFO L471 AbstractCegarLoop]: Abstraction has 13476 states and 18647 transitions. [2024-11-11 22:35:51,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:35:51,875 INFO L276 IsEmpty]: Start isEmpty. Operand 13476 states and 18647 transitions. [2024-11-11 22:35:51,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-11 22:35:51,877 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:35:51,877 INFO L218 NwaCegarLoop]: trace histogram [4, 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, 1, 1] [2024-11-11 22:35:51,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-11 22:35:51,877 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:35:51,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:35:51,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1645833661, now seen corresponding path program 1 times [2024-11-11 22:35:51,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:35:51,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215954246] [2024-11-11 22:35:51,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:35:51,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:35:51,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:35:52,533 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 31 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:35:52,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:35:52,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215954246] [2024-11-11 22:35:52,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215954246] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 22:35:52,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [373392724] [2024-11-11 22:35:52,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:35:52,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:35:52,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:35:52,536 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 22:35:52,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-11 22:35:52,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:35:52,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-11 22:35:52,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 22:35:53,182 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 33 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:35:53,182 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 22:35:54,633 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 31 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:35:54,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [373392724] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 22:35:54,633 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 22:35:54,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 30 [2024-11-11 22:35:54,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046114104] [2024-11-11 22:35:54,634 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 22:35:54,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-11 22:35:54,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:35:54,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-11 22:35:54,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=811, Unknown=0, NotChecked=0, Total=930 [2024-11-11 22:35:54,636 INFO L87 Difference]: Start difference. First operand 13476 states and 18647 transitions. Second operand has 31 states, 31 states have (on average 7.580645161290323) internal successors, (235), 30 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:35:56,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:35:56,167 INFO L93 Difference]: Finished difference Result 17490 states and 23668 transitions. [2024-11-11 22:35:56,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-11 22:35:56,167 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 7.580645161290323) internal successors, (235), 30 states have internal predecessors, (235), 0 states have call successors, (0), 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 99 [2024-11-11 22:35:56,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:35:56,182 INFO L225 Difference]: With dead ends: 17490 [2024-11-11 22:35:56,182 INFO L226 Difference]: Without dead ends: 13622 [2024-11-11 22:35:56,188 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 182 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 654 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=741, Invalid=2565, Unknown=0, NotChecked=0, Total=3306 [2024-11-11 22:35:56,189 INFO L435 NwaCegarLoop]: 1536 mSDtfsCounter, 22923 mSDsluCounter, 12428 mSDsCounter, 0 mSdLazyCounter, 997 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22923 SdHoareTripleChecker+Valid, 13964 SdHoareTripleChecker+Invalid, 1039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 997 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 22:35:56,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22923 Valid, 13964 Invalid, 1039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 997 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 22:35:56,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13622 states. [2024-11-11 22:35:56,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13622 to 13444. [2024-11-11 22:35:56,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13444 states, 13442 states have (on average 1.3773248028567178) internal successors, (18514), 13443 states have internal predecessors, (18514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:35:56,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13444 states to 13444 states and 18514 transitions. [2024-11-11 22:35:56,553 INFO L78 Accepts]: Start accepts. Automaton has 13444 states and 18514 transitions. Word has length 99 [2024-11-11 22:35:56,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:35:56,553 INFO L471 AbstractCegarLoop]: Abstraction has 13444 states and 18514 transitions. [2024-11-11 22:35:56,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 7.580645161290323) internal successors, (235), 30 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:35:56,554 INFO L276 IsEmpty]: Start isEmpty. Operand 13444 states and 18514 transitions. [2024-11-11 22:35:56,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-11 22:35:56,555 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:35:56,555 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:35:56,568 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-11 22:35:56,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:35:56,760 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:35:56,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:35:56,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1960996049, now seen corresponding path program 1 times [2024-11-11 22:35:56,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:35:56,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312333180] [2024-11-11 22:35:56,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:35:56,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:35:56,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:35:57,669 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 25 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:35:57,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:35:57,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312333180] [2024-11-11 22:35:57,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312333180] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 22:35:57,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748349784] [2024-11-11 22:35:57,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:35:57,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:35:57,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:35:57,673 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 22:35:57,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-11 22:35:57,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:35:57,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-11 22:35:57,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 22:35:58,498 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 38 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:35:58,498 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 22:35:59,797 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 34 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:35:59,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1748349784] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 22:35:59,798 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 22:35:59,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 11, 11] total 41 [2024-11-11 22:35:59,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484750844] [2024-11-11 22:35:59,798 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 22:35:59,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-11 22:35:59,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:35:59,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-11 22:35:59,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1586, Unknown=0, NotChecked=0, Total=1722 [2024-11-11 22:35:59,800 INFO L87 Difference]: Start difference. First operand 13444 states and 18514 transitions. Second operand has 42 states, 42 states have (on average 6.309523809523809) internal successors, (265), 41 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)