./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.5.1.ufo.UNBOUNDED.pals+Problem12_label09.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f 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.5.1.ufo.UNBOUNDED.pals+Problem12_label09.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 44a148d9de1532cb566543d7eae5d77d4b586265aeb908201e957f15a6f85f92 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 00:53:40,857 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 00:53:40,920 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 00:53:40,924 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 00:53:40,926 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 00:53:40,949 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 00:53:40,949 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 00:53:40,949 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 00:53:40,950 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 00:53:40,953 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 00:53:40,953 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 00:53:40,953 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 00:53:40,954 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 00:53:40,954 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 00:53:40,954 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 00:53:40,954 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 00:53:40,955 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 00:53:40,955 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 00:53:40,956 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 00:53:40,956 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 00:53:40,956 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 00:53:40,957 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 00:53:40,957 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 00:53:40,957 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 00:53:40,957 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 00:53:40,958 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 00:53:40,958 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 00:53:40,958 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 00:53:40,958 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 00:53:40,959 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 00:53:40,959 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 00:53:40,959 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 00:53:40,959 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 00:53:40,959 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 00:53:40,959 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 00:53:40,960 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 00:53:40,960 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 00:53:40,960 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 00:53:40,961 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 00:53:40,961 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 00:53:40,962 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 00:53:40,962 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 00:53:40,963 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 -> 44a148d9de1532cb566543d7eae5d77d4b586265aeb908201e957f15a6f85f92 [2024-11-10 00:53:41,187 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 00:53:41,205 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 00:53:41,207 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 00:53:41,208 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 00:53:41,211 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 00:53:41,212 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.5.1.ufo.UNBOUNDED.pals+Problem12_label09.c [2024-11-10 00:53:42,525 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 00:53:42,902 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 00:53:42,904 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.1.ufo.UNBOUNDED.pals+Problem12_label09.c [2024-11-10 00:53:42,934 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0ecc835b/6db39a539e31467b87d714dace62b316/FLAGc6133881d [2024-11-10 00:53:43,097 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0ecc835b/6db39a539e31467b87d714dace62b316 [2024-11-10 00:53:43,101 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 00:53:43,103 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 00:53:43,104 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 00:53:43,104 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 00:53:43,112 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 00:53:43,113 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:53:43" (1/1) ... [2024-11-10 00:53:43,113 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@575b36b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:53:43, skipping insertion in model container [2024-11-10 00:53:43,114 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:53:43" (1/1) ... [2024-11-10 00:53:43,252 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 00:53:43,576 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.5.1.ufo.UNBOUNDED.pals+Problem12_label09.c[11705,11718] [2024-11-10 00:53:43,634 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.5.1.ufo.UNBOUNDED.pals+Problem12_label09.c[19453,19466] [2024-11-10 00:53:44,132 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 00:53:44,142 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 00:53:44,177 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.5.1.ufo.UNBOUNDED.pals+Problem12_label09.c[11705,11718] [2024-11-10 00:53:44,188 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.5.1.ufo.UNBOUNDED.pals+Problem12_label09.c[19453,19466] [2024-11-10 00:53:44,472 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 00:53:44,494 INFO L204 MainTranslator]: Completed translation [2024-11-10 00:53:44,495 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:53:44 WrapperNode [2024-11-10 00:53:44,495 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 00:53:44,496 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 00:53:44,496 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 00:53:44,496 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 00:53:44,503 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:53:44" (1/1) ... [2024-11-10 00:53:44,551 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:53:44" (1/1) ... [2024-11-10 00:53:44,744 INFO L138 Inliner]: procedures = 37, calls = 22, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 5096 [2024-11-10 00:53:44,745 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 00:53:44,745 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 00:53:44,746 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 00:53:44,746 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 00:53:44,754 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:53:44" (1/1) ... [2024-11-10 00:53:44,754 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:53:44" (1/1) ... [2024-11-10 00:53:44,804 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:53:44" (1/1) ... [2024-11-10 00:53:44,956 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-10 00:53:44,956 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:53:44" (1/1) ... [2024-11-10 00:53:44,956 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:53:44" (1/1) ... [2024-11-10 00:53:45,126 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:53:44" (1/1) ... [2024-11-10 00:53:45,137 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:53:44" (1/1) ... [2024-11-10 00:53:45,152 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:53:44" (1/1) ... [2024-11-10 00:53:45,168 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:53:44" (1/1) ... [2024-11-10 00:53:45,221 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 00:53:45,222 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 00:53:45,222 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 00:53:45,223 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 00:53:45,224 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:53:44" (1/1) ... [2024-11-10 00:53:45,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 00:53:45,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:53:45,253 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-10 00:53:45,255 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-10 00:53:45,291 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 00:53:45,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 00:53:45,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 00:53:45,292 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 00:53:45,368 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 00:53:45,370 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 00:53:50,042 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2131: havoc calculate_output_#t~ret37#1; [2024-11-10 00:53:50,042 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3610: havoc calculate_output2_#t~ret38#1; [2024-11-10 00:53:50,042 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L5100: havoc calculate_output3_#t~ret39#1; [2024-11-10 00:53:50,302 INFO L? ?]: Removed 2081 outVars from TransFormulas that were not future-live. [2024-11-10 00:53:50,302 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 00:53:50,337 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 00:53:50,338 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 00:53:50,338 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 12:53:50 BoogieIcfgContainer [2024-11-10 00:53:50,338 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 00:53:50,340 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 00:53:50,340 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 00:53:50,343 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 00:53:50,344 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 12:53:43" (1/3) ... [2024-11-10 00:53:50,344 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18ab9155 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:53:50, skipping insertion in model container [2024-11-10 00:53:50,344 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:53:44" (2/3) ... [2024-11-10 00:53:50,344 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18ab9155 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:53:50, skipping insertion in model container [2024-11-10 00:53:50,346 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 12:53:50" (3/3) ... [2024-11-10 00:53:50,346 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.1.ufo.UNBOUNDED.pals+Problem12_label09.c [2024-11-10 00:53:50,360 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 00:53:50,361 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-10 00:53:50,443 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 00:53:50,453 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;@3201396e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 00:53:50,453 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-10 00:53:50,468 INFO L276 IsEmpty]: Start isEmpty. Operand has 908 states, 905 states have (on average 2.648618784530387) internal successors, (2397), 907 states have internal predecessors, (2397), 0 states have call successors, (0), 0 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-10 00:53:50,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-10 00:53:50,476 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:53:50,477 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:53:50,477 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:53:50,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:53:50,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1381072168, now seen corresponding path program 1 times [2024-11-10 00:53:50,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:53:50,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680574550] [2024-11-10 00:53:50,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:53:50,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:53:50,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:53:50,735 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-10 00:53:50,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:53:50,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680574550] [2024-11-10 00:53:50,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680574550] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:53:50,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:53:50,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 00:53:50,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100135267] [2024-11-10 00:53:50,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:53:50,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 00:53:50,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:53:50,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 00:53:50,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 00:53:50,771 INFO L87 Difference]: Start difference. First operand has 908 states, 905 states have (on average 2.648618784530387) internal successors, (2397), 907 states have internal predecessors, (2397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 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-10 00:53:50,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:53:50,841 INFO L93 Difference]: Finished difference Result 1775 states and 4720 transitions. [2024-11-10 00:53:50,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 00:53:50,845 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2024-11-10 00:53:50,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:53:50,867 INFO L225 Difference]: With dead ends: 1775 [2024-11-10 00:53:50,867 INFO L226 Difference]: Without dead ends: 840 [2024-11-10 00:53:50,878 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 00:53:50,880 INFO L432 NwaCegarLoop]: 2326 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2326 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:53:50,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2326 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:53:50,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2024-11-10 00:53:50,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 840. [2024-11-10 00:53:50,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 840 states, 838 states have (on average 2.6992840095465396) internal successors, (2262), 839 states have internal predecessors, (2262), 0 states have call successors, (0), 0 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-10 00:53:50,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 2262 transitions. [2024-11-10 00:53:50,973 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 2262 transitions. Word has length 26 [2024-11-10 00:53:50,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:53:50,974 INFO L471 AbstractCegarLoop]: Abstraction has 840 states and 2262 transitions. [2024-11-10 00:53:50,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 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-10 00:53:50,974 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 2262 transitions. [2024-11-10 00:53:50,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-10 00:53:50,975 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:53:50,975 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:53:50,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 00:53:50,976 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:53:50,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:53:50,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1789896393, now seen corresponding path program 1 times [2024-11-10 00:53:50,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:53:50,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74523521] [2024-11-10 00:53:50,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:53:50,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:53:51,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:53:51,118 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-10 00:53:51,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:53:51,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74523521] [2024-11-10 00:53:51,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74523521] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:53:51,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:53:51,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:53:51,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257306821] [2024-11-10 00:53:51,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:53:51,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:53:51,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:53:51,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:53:51,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:53:51,122 INFO L87 Difference]: Start difference. First operand 840 states and 2262 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 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-10 00:53:51,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:53:51,232 INFO L93 Difference]: Finished difference Result 891 states and 2339 transitions. [2024-11-10 00:53:51,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:53:51,237 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2024-11-10 00:53:51,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:53:51,241 INFO L225 Difference]: With dead ends: 891 [2024-11-10 00:53:51,241 INFO L226 Difference]: Without dead ends: 840 [2024-11-10 00:53:51,241 INFO L431 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-10 00:53:51,246 INFO L432 NwaCegarLoop]: 2260 mSDtfsCounter, 0 mSDsluCounter, 6744 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 9004 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:53:51,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 9004 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:53:51,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2024-11-10 00:53:51,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 840. [2024-11-10 00:53:51,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 840 states, 838 states have (on average 2.662291169451074) internal successors, (2231), 839 states have internal predecessors, (2231), 0 states have call successors, (0), 0 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-10 00:53:51,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 2231 transitions. [2024-11-10 00:53:51,277 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 2231 transitions. Word has length 26 [2024-11-10 00:53:51,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:53:51,277 INFO L471 AbstractCegarLoop]: Abstraction has 840 states and 2231 transitions. [2024-11-10 00:53:51,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 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-10 00:53:51,277 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 2231 transitions. [2024-11-10 00:53:51,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-10 00:53:51,282 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:53:51,282 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:53:51,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 00:53:51,283 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:53:51,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:53:51,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1922131449, now seen corresponding path program 1 times [2024-11-10 00:53:51,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:53:51,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326888592] [2024-11-10 00:53:51,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:53:51,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:53:51,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:53:51,473 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-10 00:53:51,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:53:51,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326888592] [2024-11-10 00:53:51,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326888592] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:53:51,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:53:51,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 00:53:51,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868463503] [2024-11-10 00:53:51,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:53:51,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 00:53:51,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:53:51,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 00:53:51,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:53:51,477 INFO L87 Difference]: Start difference. First operand 840 states and 2231 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 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-10 00:53:51,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:53:51,683 INFO L93 Difference]: Finished difference Result 1310 states and 2961 transitions. [2024-11-10 00:53:51,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 00:53:51,685 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 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-10 00:53:51,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:53:51,691 INFO L225 Difference]: With dead ends: 1310 [2024-11-10 00:53:51,691 INFO L226 Difference]: Without dead ends: 1263 [2024-11-10 00:53:51,692 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2024-11-10 00:53:51,694 INFO L432 NwaCegarLoop]: 2225 mSDtfsCounter, 11419 mSDsluCounter, 1210 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11419 SdHoareTripleChecker+Valid, 3435 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:53:51,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11419 Valid, 3435 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:53:51,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1263 states. [2024-11-10 00:53:51,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1263 to 884. [2024-11-10 00:53:51,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 884 states, 882 states have (on average 2.6077097505668934) internal successors, (2300), 883 states have internal predecessors, (2300), 0 states have call successors, (0), 0 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-10 00:53:51,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 2300 transitions. [2024-11-10 00:53:51,717 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 2300 transitions. Word has length 56 [2024-11-10 00:53:51,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:53:51,718 INFO L471 AbstractCegarLoop]: Abstraction has 884 states and 2300 transitions. [2024-11-10 00:53:51,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 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-10 00:53:51,718 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 2300 transitions. [2024-11-10 00:53:51,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-10 00:53:51,722 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:53:51,722 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:53:51,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 00:53:51,723 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:53:51,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:53:51,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1673221541, now seen corresponding path program 1 times [2024-11-10 00:53:51,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:53:51,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839564986] [2024-11-10 00:53:51,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:53:51,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:53:51,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:53:51,981 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-10 00:53:51,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:53:51,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839564986] [2024-11-10 00:53:51,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839564986] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:53:51,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:53:51,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 00:53:51,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196533901] [2024-11-10 00:53:51,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:53:51,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 00:53:51,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:53:51,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 00:53:51,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:53:51,984 INFO L87 Difference]: Start difference. First operand 884 states and 2300 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 0 states have call successors, (0), 0 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-10 00:53:52,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:53:52,119 INFO L93 Difference]: Finished difference Result 978 states and 2444 transitions. [2024-11-10 00:53:52,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 00:53:52,120 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2024-11-10 00:53:52,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:53:52,123 INFO L225 Difference]: With dead ends: 978 [2024-11-10 00:53:52,123 INFO L226 Difference]: Without dead ends: 887 [2024-11-10 00:53:52,124 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2024-11-10 00:53:52,125 INFO L432 NwaCegarLoop]: 2224 mSDtfsCounter, 6540 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6540 SdHoareTripleChecker+Valid, 2501 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:53:52,125 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6540 Valid, 2501 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:53:52,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2024-11-10 00:53:52,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 884. [2024-11-10 00:53:52,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 884 states, 882 states have (on average 2.606575963718821) internal successors, (2299), 883 states have internal predecessors, (2299), 0 states have call successors, (0), 0 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-10 00:53:52,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 2299 transitions. [2024-11-10 00:53:52,141 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 2299 transitions. Word has length 58 [2024-11-10 00:53:52,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:53:52,142 INFO L471 AbstractCegarLoop]: Abstraction has 884 states and 2299 transitions. [2024-11-10 00:53:52,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 0 states have call successors, (0), 0 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-10 00:53:52,142 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 2299 transitions. [2024-11-10 00:53:52,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-10 00:53:52,143 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:53:52,143 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:53:52,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 00:53:52,143 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:53:52,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:53:52,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1393558986, now seen corresponding path program 1 times [2024-11-10 00:53:52,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:53:52,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016336848] [2024-11-10 00:53:52,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:53:52,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:53:52,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:53:52,222 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-10 00:53:52,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:53:52,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016336848] [2024-11-10 00:53:52,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016336848] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:53:52,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:53:52,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:53:52,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136854012] [2024-11-10 00:53:52,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:53:52,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:53:52,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:53:52,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:53:52,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:53:52,224 INFO L87 Difference]: Start difference. First operand 884 states and 2299 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 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-10 00:53:52,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:53:52,282 INFO L93 Difference]: Finished difference Result 1054 states and 2561 transitions. [2024-11-10 00:53:52,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:53:52,287 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 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-10 00:53:52,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:53:52,294 INFO L225 Difference]: With dead ends: 1054 [2024-11-10 00:53:52,294 INFO L226 Difference]: Without dead ends: 963 [2024-11-10 00:53:52,295 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:53:52,295 INFO L432 NwaCegarLoop]: 2227 mSDtfsCounter, 2168 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2168 SdHoareTripleChecker+Valid, 2293 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:53:52,296 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2168 Valid, 2293 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:53:52,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2024-11-10 00:53:52,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 958. [2024-11-10 00:53:52,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 958 states, 956 states have (on average 2.521966527196653) internal successors, (2411), 957 states have internal predecessors, (2411), 0 states have call successors, (0), 0 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-10 00:53:52,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 2411 transitions. [2024-11-10 00:53:52,393 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 2411 transitions. Word has length 59 [2024-11-10 00:53:52,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:53:52,394 INFO L471 AbstractCegarLoop]: Abstraction has 958 states and 2411 transitions. [2024-11-10 00:53:52,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 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-10 00:53:52,394 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 2411 transitions. [2024-11-10 00:53:52,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-10 00:53:52,395 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:53:52,395 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:53:52,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 00:53:52,395 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:53:52,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:53:52,396 INFO L85 PathProgramCache]: Analyzing trace with hash 691569053, now seen corresponding path program 1 times [2024-11-10 00:53:52,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:53:52,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925682032] [2024-11-10 00:53:52,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:53:52,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:53:52,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:53:52,472 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-10 00:53:52,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:53:52,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925682032] [2024-11-10 00:53:52,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925682032] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:53:52,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:53:52,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:53:52,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441719798] [2024-11-10 00:53:52,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:53:52,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:53:52,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:53:52,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:53:52,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:53:52,477 INFO L87 Difference]: Start difference. First operand 958 states and 2411 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 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-10 00:53:52,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:53:52,523 INFO L93 Difference]: Finished difference Result 1272 states and 2889 transitions. [2024-11-10 00:53:52,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:53:52,524 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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-10 00:53:52,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:53:52,531 INFO L225 Difference]: With dead ends: 1272 [2024-11-10 00:53:52,532 INFO L226 Difference]: Without dead ends: 1107 [2024-11-10 00:53:52,532 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:53:52,533 INFO L432 NwaCegarLoop]: 2280 mSDtfsCounter, 2181 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2181 SdHoareTripleChecker+Valid, 2358 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-10 00:53:52,533 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2181 Valid, 2358 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:53:52,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2024-11-10 00:53:52,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 1104. [2024-11-10 00:53:52,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1104 states, 1102 states have (on average 2.386569872958258) internal successors, (2630), 1103 states have internal predecessors, (2630), 0 states have call successors, (0), 0 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-10 00:53:52,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1104 states to 1104 states and 2630 transitions. [2024-11-10 00:53:52,580 INFO L78 Accepts]: Start accepts. Automaton has 1104 states and 2630 transitions. Word has length 60 [2024-11-10 00:53:52,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:53:52,580 INFO L471 AbstractCegarLoop]: Abstraction has 1104 states and 2630 transitions. [2024-11-10 00:53:52,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 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-10 00:53:52,580 INFO L276 IsEmpty]: Start isEmpty. Operand 1104 states and 2630 transitions. [2024-11-10 00:53:52,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-10 00:53:52,581 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:53:52,584 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:53:52,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 00:53:52,584 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:53:52,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:53:52,585 INFO L85 PathProgramCache]: Analyzing trace with hash -309840675, now seen corresponding path program 1 times [2024-11-10 00:53:52,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:53:52,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655207920] [2024-11-10 00:53:52,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:53:52,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:53:52,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:53:52,657 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-10 00:53:52,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:53:52,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655207920] [2024-11-10 00:53:52,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655207920] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:53:52,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:53:52,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:53:52,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169387937] [2024-11-10 00:53:52,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:53:52,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:53:52,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:53:52,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:53:52,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:53:52,661 INFO L87 Difference]: Start difference. First operand 1104 states and 2630 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 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-10 00:53:52,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:53:52,720 INFO L93 Difference]: Finished difference Result 1694 states and 3518 transitions. [2024-11-10 00:53:52,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:53:52,721 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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-10 00:53:52,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:53:52,728 INFO L225 Difference]: With dead ends: 1694 [2024-11-10 00:53:52,732 INFO L226 Difference]: Without dead ends: 1383 [2024-11-10 00:53:52,733 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:53:52,733 INFO L432 NwaCegarLoop]: 2278 mSDtfsCounter, 2179 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2179 SdHoareTripleChecker+Valid, 2360 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-10 00:53:52,734 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2179 Valid, 2360 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:53:52,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2024-11-10 00:53:52,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 1380. [2024-11-10 00:53:52,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1380 states, 1378 states have (on average 2.2031930333817127) internal successors, (3036), 1379 states have internal predecessors, (3036), 0 states have call successors, (0), 0 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-10 00:53:52,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1380 states to 1380 states and 3036 transitions. [2024-11-10 00:53:52,780 INFO L78 Accepts]: Start accepts. Automaton has 1380 states and 3036 transitions. Word has length 60 [2024-11-10 00:53:52,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:53:52,780 INFO L471 AbstractCegarLoop]: Abstraction has 1380 states and 3036 transitions. [2024-11-10 00:53:52,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 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-10 00:53:52,781 INFO L276 IsEmpty]: Start isEmpty. Operand 1380 states and 3036 transitions. [2024-11-10 00:53:52,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-10 00:53:52,781 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:53:52,781 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:53:52,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 00:53:52,782 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:53:52,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:53:52,785 INFO L85 PathProgramCache]: Analyzing trace with hash -324290531, now seen corresponding path program 1 times [2024-11-10 00:53:52,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:53:52,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723542190] [2024-11-10 00:53:52,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:53:52,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:53:52,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:53:52,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:53:52,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:53:52,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723542190] [2024-11-10 00:53:52,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723542190] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:53:52,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:53:52,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:53:52,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162981303] [2024-11-10 00:53:52,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:53:52,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:53:52,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:53:52,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:53:52,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:53:52,844 INFO L87 Difference]: Start difference. First operand 1380 states and 3036 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 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-10 00:53:52,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:53:52,876 INFO L93 Difference]: Finished difference Result 2490 states and 4680 transitions. [2024-11-10 00:53:52,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:53:52,877 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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-10 00:53:52,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:53:52,883 INFO L225 Difference]: With dead ends: 2490 [2024-11-10 00:53:52,883 INFO L226 Difference]: Without dead ends: 1903 [2024-11-10 00:53:52,884 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:53:52,884 INFO L432 NwaCegarLoop]: 2276 mSDtfsCounter, 2177 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2177 SdHoareTripleChecker+Valid, 2362 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-10 00:53:52,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2177 Valid, 2362 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:53:52,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1903 states. [2024-11-10 00:53:52,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1903 to 1900. [2024-11-10 00:53:52,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1900 states, 1898 states have (on average 1.993677555321391) internal successors, (3784), 1899 states have internal predecessors, (3784), 0 states have call successors, (0), 0 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-10 00:53:52,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1900 states to 1900 states and 3784 transitions. [2024-11-10 00:53:52,917 INFO L78 Accepts]: Start accepts. Automaton has 1900 states and 3784 transitions. Word has length 60 [2024-11-10 00:53:52,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:53:52,917 INFO L471 AbstractCegarLoop]: Abstraction has 1900 states and 3784 transitions. [2024-11-10 00:53:52,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 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-10 00:53:52,917 INFO L276 IsEmpty]: Start isEmpty. Operand 1900 states and 3784 transitions. [2024-11-10 00:53:52,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-10 00:53:52,918 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:53:52,918 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:53:52,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 00:53:52,918 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:53:52,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:53:52,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1767312221, now seen corresponding path program 1 times [2024-11-10 00:53:52,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:53:52,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794811114] [2024-11-10 00:53:52,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:53:52,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:53:52,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:53:52,967 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-10 00:53:52,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:53:52,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794811114] [2024-11-10 00:53:52,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794811114] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:53:52,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:53:52,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:53:52,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379550625] [2024-11-10 00:53:52,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:53:52,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:53:52,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:53:52,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:53:52,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:53:52,969 INFO L87 Difference]: Start difference. First operand 1900 states and 3784 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 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-10 00:53:53,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:53:53,049 INFO L93 Difference]: Finished difference Result 3986 states and 6812 transitions. [2024-11-10 00:53:53,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:53:53,049 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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-10 00:53:53,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:53:53,066 INFO L225 Difference]: With dead ends: 3986 [2024-11-10 00:53:53,067 INFO L226 Difference]: Without dead ends: 2879 [2024-11-10 00:53:53,069 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:53:53,074 INFO L432 NwaCegarLoop]: 2274 mSDtfsCounter, 2175 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2175 SdHoareTripleChecker+Valid, 2364 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-10 00:53:53,075 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2175 Valid, 2364 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:53:53,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2879 states. [2024-11-10 00:53:53,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2879 to 2876. [2024-11-10 00:53:53,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2876 states, 2874 states have (on average 1.7926235212247739) internal successors, (5152), 2875 states have internal predecessors, (5152), 0 states have call successors, (0), 0 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-10 00:53:53,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2876 states to 2876 states and 5152 transitions. [2024-11-10 00:53:53,179 INFO L78 Accepts]: Start accepts. Automaton has 2876 states and 5152 transitions. Word has length 60 [2024-11-10 00:53:53,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:53:53,179 INFO L471 AbstractCegarLoop]: Abstraction has 2876 states and 5152 transitions. [2024-11-10 00:53:53,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 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-10 00:53:53,179 INFO L276 IsEmpty]: Start isEmpty. Operand 2876 states and 5152 transitions. [2024-11-10 00:53:53,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-10 00:53:53,183 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:53:53,183 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:53:53,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 00:53:53,183 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:53:53,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:53:53,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1243035166, now seen corresponding path program 1 times [2024-11-10 00:53:53,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:53:53,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627081967] [2024-11-10 00:53:53,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:53:53,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:53:53,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:53:53,395 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-10 00:53:53,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:53:53,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627081967] [2024-11-10 00:53:53,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627081967] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:53:53,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:53:53,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:53:53,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986805864] [2024-11-10 00:53:53,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:53:53,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 00:53:53,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:53:53,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 00:53:53,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:53:53,397 INFO L87 Difference]: Start difference. First operand 2876 states and 5152 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 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-10 00:53:53,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:53:53,480 INFO L93 Difference]: Finished difference Result 2975 states and 5282 transitions. [2024-11-10 00:53:53,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 00:53:53,480 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 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-10 00:53:53,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:53:53,489 INFO L225 Difference]: With dead ends: 2975 [2024-11-10 00:53:53,490 INFO L226 Difference]: Without dead ends: 2972 [2024-11-10 00:53:53,491 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:53:53,491 INFO L432 NwaCegarLoop]: 2225 mSDtfsCounter, 0 mSDsluCounter, 13337 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 15562 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:53:53,492 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 15562 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:53:53,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2972 states. [2024-11-10 00:53:53,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2972 to 2972. [2024-11-10 00:53:53,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2972 states, 2970 states have (on average 1.7616161616161616) internal successors, (5232), 2971 states have internal predecessors, (5232), 0 states have call successors, (0), 0 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-10 00:53:53,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2972 states to 2972 states and 5232 transitions. [2024-11-10 00:53:53,543 INFO L78 Accepts]: Start accepts. Automaton has 2972 states and 5232 transitions. Word has length 60 [2024-11-10 00:53:53,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:53:53,543 INFO L471 AbstractCegarLoop]: Abstraction has 2972 states and 5232 transitions. [2024-11-10 00:53:53,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 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-10 00:53:53,544 INFO L276 IsEmpty]: Start isEmpty. Operand 2972 states and 5232 transitions. [2024-11-10 00:53:53,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-10 00:53:53,545 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:53:53,546 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:53:53,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 00:53:53,546 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:53:53,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:53:53,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1092605501, now seen corresponding path program 1 times [2024-11-10 00:53:53,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:53:53,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099004708] [2024-11-10 00:53:53,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:53:53,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:53:53,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:53:53,586 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-10 00:53:53,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:53:53,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099004708] [2024-11-10 00:53:53,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099004708] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:53:53,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:53:53,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:53:53,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457032684] [2024-11-10 00:53:53,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:53:53,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:53:53,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:53:53,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:53:53,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:53:53,588 INFO L87 Difference]: Start difference. First operand 2972 states and 5232 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:53:53,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:53:53,630 INFO L93 Difference]: Finished difference Result 5286 states and 8537 transitions. [2024-11-10 00:53:53,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:53:53,631 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-11-10 00:53:53,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:53:53,641 INFO L225 Difference]: With dead ends: 5286 [2024-11-10 00:53:53,641 INFO L226 Difference]: Without dead ends: 4034 [2024-11-10 00:53:53,643 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:53:53,643 INFO L432 NwaCegarLoop]: 2285 mSDtfsCounter, 2180 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2180 SdHoareTripleChecker+Valid, 2359 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-10 00:53:53,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2180 Valid, 2359 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:53:53,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4034 states. [2024-11-10 00:53:53,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4034 to 4031. [2024-11-10 00:53:53,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4031 states, 4029 states have (on average 1.6607098535616778) internal successors, (6691), 4030 states have internal predecessors, (6691), 0 states have call successors, (0), 0 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-10 00:53:53,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4031 states to 4031 states and 6691 transitions. [2024-11-10 00:53:53,777 INFO L78 Accepts]: Start accepts. Automaton has 4031 states and 6691 transitions. Word has length 62 [2024-11-10 00:53:53,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:53:53,778 INFO L471 AbstractCegarLoop]: Abstraction has 4031 states and 6691 transitions. [2024-11-10 00:53:53,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:53:53,778 INFO L276 IsEmpty]: Start isEmpty. Operand 4031 states and 6691 transitions. [2024-11-10 00:53:53,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-10 00:53:53,778 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:53:53,779 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:53:53,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 00:53:53,779 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:53:53,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:53:53,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1647498914, now seen corresponding path program 1 times [2024-11-10 00:53:53,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:53:53,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487583572] [2024-11-10 00:53:53,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:53:53,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:53:53,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:53:53,887 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-10 00:53:53,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:53:53,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487583572] [2024-11-10 00:53:53,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487583572] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:53:53,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:53:53,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:53:53,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134629547] [2024-11-10 00:53:53,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:53:53,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 00:53:53,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:53:53,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 00:53:53,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 00:53:53,889 INFO L87 Difference]: Start difference. First operand 4031 states and 6691 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 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-10 00:54:01,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:54:01,243 INFO L93 Difference]: Finished difference Result 6290 states and 13044 transitions. [2024-11-10 00:54:01,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 00:54:01,244 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2024-11-10 00:54:01,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:54:01,262 INFO L225 Difference]: With dead ends: 6290 [2024-11-10 00:54:01,266 INFO L226 Difference]: Without dead ends: 5535 [2024-11-10 00:54:01,268 INFO L431 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-10 00:54:01,269 INFO L432 NwaCegarLoop]: 805 mSDtfsCounter, 4447 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 7874 mSolverCounterSat, 1245 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4447 SdHoareTripleChecker+Valid, 828 SdHoareTripleChecker+Invalid, 9119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1245 IncrementalHoareTripleChecker+Valid, 7874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:54:01,269 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4447 Valid, 828 Invalid, 9119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1245 Valid, 7874 Invalid, 0 Unknown, 0 Unchecked, 7.1s Time] [2024-11-10 00:54:01,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5535 states. [2024-11-10 00:54:01,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5535 to 5535. [2024-11-10 00:54:01,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5535 states, 5533 states have (on average 1.8125790710283751) internal successors, (10029), 5534 states have internal predecessors, (10029), 0 states have call successors, (0), 0 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-10 00:54:01,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5535 states to 5535 states and 10029 transitions. [2024-11-10 00:54:01,546 INFO L78 Accepts]: Start accepts. Automaton has 5535 states and 10029 transitions. Word has length 69 [2024-11-10 00:54:01,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:54:01,550 INFO L471 AbstractCegarLoop]: Abstraction has 5535 states and 10029 transitions. [2024-11-10 00:54:01,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 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-10 00:54:01,551 INFO L276 IsEmpty]: Start isEmpty. Operand 5535 states and 10029 transitions. [2024-11-10 00:54:01,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-10 00:54:01,553 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:54:01,553 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 00:54:01,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 00:54:01,553 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:54:01,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:54:01,554 INFO L85 PathProgramCache]: Analyzing trace with hash 304318565, now seen corresponding path program 1 times [2024-11-10 00:54:01,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:54:01,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721801566] [2024-11-10 00:54:01,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:54:01,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:54:01,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:54:01,866 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-10 00:54:01,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:54:01,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721801566] [2024-11-10 00:54:01,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721801566] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:54:01,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:54:01,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 00:54:01,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627739330] [2024-11-10 00:54:01,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:54:01,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 00:54:01,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:54:01,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 00:54:01,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:54:01,868 INFO L87 Difference]: Start difference. First operand 5535 states and 10029 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 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-10 00:54:02,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:54:02,148 INFO L93 Difference]: Finished difference Result 22417 states and 33625 transitions. [2024-11-10 00:54:02,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 00:54:02,149 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-11-10 00:54:02,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:54:02,178 INFO L225 Difference]: With dead ends: 22417 [2024-11-10 00:54:02,179 INFO L226 Difference]: Without dead ends: 19182 [2024-11-10 00:54:02,189 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-10 00:54:02,190 INFO L432 NwaCegarLoop]: 2303 mSDtfsCounter, 9080 mSDsluCounter, 2729 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9080 SdHoareTripleChecker+Valid, 5032 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:54:02,190 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9080 Valid, 5032 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:54:02,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19182 states. [2024-11-10 00:54:02,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19182 to 8767. [2024-11-10 00:54:02,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8767 states, 8765 states have (on average 1.6553337136337707) internal successors, (14509), 8766 states have internal predecessors, (14509), 0 states have call successors, (0), 0 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-10 00:54:02,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8767 states to 8767 states and 14509 transitions. [2024-11-10 00:54:02,407 INFO L78 Accepts]: Start accepts. Automaton has 8767 states and 14509 transitions. Word has length 81 [2024-11-10 00:54:02,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:54:02,408 INFO L471 AbstractCegarLoop]: Abstraction has 8767 states and 14509 transitions. [2024-11-10 00:54:02,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 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-10 00:54:02,408 INFO L276 IsEmpty]: Start isEmpty. Operand 8767 states and 14509 transitions. [2024-11-10 00:54:02,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-10 00:54:02,409 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:54:02,409 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 00:54:02,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 00:54:02,410 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:54:02,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:54:02,410 INFO L85 PathProgramCache]: Analyzing trace with hash -697091163, now seen corresponding path program 1 times [2024-11-10 00:54:02,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:54:02,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721203464] [2024-11-10 00:54:02,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:54:02,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:54:02,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:54:02,523 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-10 00:54:02,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:54:02,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721203464] [2024-11-10 00:54:02,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721203464] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:54:02,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:54:02,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 00:54:02,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221136654] [2024-11-10 00:54:02,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:54:02,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 00:54:02,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:54:02,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 00:54:02,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:54:02,525 INFO L87 Difference]: Start difference. First operand 8767 states and 14509 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-10 00:54:02,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:54:02,986 INFO L93 Difference]: Finished difference Result 25649 states and 38105 transitions. [2024-11-10 00:54:02,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 00:54:02,986 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-11-10 00:54:02,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:54:03,016 INFO L225 Difference]: With dead ends: 25649 [2024-11-10 00:54:03,016 INFO L226 Difference]: Without dead ends: 22414 [2024-11-10 00:54:03,023 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-10 00:54:03,024 INFO L432 NwaCegarLoop]: 2299 mSDtfsCounter, 9102 mSDsluCounter, 2674 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9102 SdHoareTripleChecker+Valid, 4973 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:54:03,024 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9102 Valid, 4973 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:54:03,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22414 states. [2024-11-10 00:54:03,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22414 to 13631. [2024-11-10 00:54:03,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13631 states, 13629 states have (on average 1.5552865213882163) internal successors, (21197), 13630 states have internal predecessors, (21197), 0 states have call successors, (0), 0 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-10 00:54:03,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13631 states to 13631 states and 21197 transitions. [2024-11-10 00:54:03,297 INFO L78 Accepts]: Start accepts. Automaton has 13631 states and 21197 transitions. Word has length 81 [2024-11-10 00:54:03,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:54:03,297 INFO L471 AbstractCegarLoop]: Abstraction has 13631 states and 21197 transitions. [2024-11-10 00:54:03,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-10 00:54:03,298 INFO L276 IsEmpty]: Start isEmpty. Operand 13631 states and 21197 transitions. [2024-11-10 00:54:03,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-10 00:54:03,299 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:54:03,299 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 00:54:03,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 00:54:03,300 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:54:03,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:54:03,300 INFO L85 PathProgramCache]: Analyzing trace with hash -711541019, now seen corresponding path program 1 times [2024-11-10 00:54:03,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:54:03,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140486017] [2024-11-10 00:54:03,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:54:03,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:54:03,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:54:03,406 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-10 00:54:03,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:54:03,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140486017] [2024-11-10 00:54:03,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140486017] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:54:03,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:54:03,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 00:54:03,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298952361] [2024-11-10 00:54:03,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:54:03,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 00:54:03,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:54:03,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 00:54:03,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:54:03,408 INFO L87 Difference]: Start difference. First operand 13631 states and 21197 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 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-10 00:54:03,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:54:03,872 INFO L93 Difference]: Finished difference Result 28881 states and 42585 transitions. [2024-11-10 00:54:03,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 00:54:03,873 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-11-10 00:54:03,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:54:03,908 INFO L225 Difference]: With dead ends: 28881 [2024-11-10 00:54:03,909 INFO L226 Difference]: Without dead ends: 25646 [2024-11-10 00:54:03,916 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-10 00:54:03,917 INFO L432 NwaCegarLoop]: 2295 mSDtfsCounter, 9145 mSDsluCounter, 2657 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9145 SdHoareTripleChecker+Valid, 4952 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:54:03,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9145 Valid, 4952 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:54:03,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25646 states. [2024-11-10 00:54:04,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25646 to 16863. [2024-11-10 00:54:04,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16863 states, 16861 states have (on average 1.5228634126089793) internal successors, (25677), 16862 states have internal predecessors, (25677), 0 states have call successors, (0), 0 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-10 00:54:04,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16863 states to 16863 states and 25677 transitions. [2024-11-10 00:54:04,250 INFO L78 Accepts]: Start accepts. Automaton has 16863 states and 25677 transitions. Word has length 81 [2024-11-10 00:54:04,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:54:04,250 INFO L471 AbstractCegarLoop]: Abstraction has 16863 states and 25677 transitions. [2024-11-10 00:54:04,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 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-10 00:54:04,251 INFO L276 IsEmpty]: Start isEmpty. Operand 16863 states and 25677 transitions. [2024-11-10 00:54:04,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-10 00:54:04,253 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:54:04,253 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 00:54:04,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 00:54:04,254 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:54:04,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:54:04,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1380061733, now seen corresponding path program 1 times [2024-11-10 00:54:04,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:54:04,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113582565] [2024-11-10 00:54:04,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:54:04,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:54:04,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:54:04,397 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-10 00:54:04,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:54:04,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113582565] [2024-11-10 00:54:04,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113582565] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:54:04,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:54:04,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 00:54:04,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814608520] [2024-11-10 00:54:04,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:54:04,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 00:54:04,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:54:04,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 00:54:04,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:54:04,402 INFO L87 Difference]: Start difference. First operand 16863 states and 25677 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 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-10 00:54:04,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:54:04,801 INFO L93 Difference]: Finished difference Result 32113 states and 47065 transitions. [2024-11-10 00:54:04,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 00:54:04,801 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-11-10 00:54:04,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:54:04,841 INFO L225 Difference]: With dead ends: 32113 [2024-11-10 00:54:04,842 INFO L226 Difference]: Without dead ends: 28878 [2024-11-10 00:54:04,853 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-10 00:54:04,853 INFO L432 NwaCegarLoop]: 2301 mSDtfsCounter, 9090 mSDsluCounter, 2711 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9090 SdHoareTripleChecker+Valid, 5012 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:54:04,854 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9090 Valid, 5012 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:54:04,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28878 states. [2024-11-10 00:54:05,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28878 to 20095. [2024-11-10 00:54:05,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20095 states, 20093 states have (on average 1.5008709500821182) internal successors, (30157), 20094 states have internal predecessors, (30157), 0 states have call successors, (0), 0 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-10 00:54:05,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20095 states to 20095 states and 30157 transitions. [2024-11-10 00:54:05,525 INFO L78 Accepts]: Start accepts. Automaton has 20095 states and 30157 transitions. Word has length 81 [2024-11-10 00:54:05,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:54:05,525 INFO L471 AbstractCegarLoop]: Abstraction has 20095 states and 30157 transitions. [2024-11-10 00:54:05,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 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-10 00:54:05,525 INFO L276 IsEmpty]: Start isEmpty. Operand 20095 states and 30157 transitions. [2024-11-10 00:54:05,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-10 00:54:05,532 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:54:05,532 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 00:54:05,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 00:54:05,532 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:54:05,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:54:05,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1613241913, now seen corresponding path program 1 times [2024-11-10 00:54:05,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:54:05,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681197050] [2024-11-10 00:54:05,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:54:05,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:54:05,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:54:05,621 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:54:05,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:54:05,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681197050] [2024-11-10 00:54:05,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681197050] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:54:05,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:54:05,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:54:05,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783153056] [2024-11-10 00:54:05,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:54:05,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:54:05,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:54:05,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:54:05,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:54:05,623 INFO L87 Difference]: Start difference. First operand 20095 states and 30157 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 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-10 00:54:05,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:54:05,890 INFO L93 Difference]: Finished difference Result 32795 states and 47960 transitions. [2024-11-10 00:54:05,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:54:05,890 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2024-11-10 00:54:05,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:54:05,910 INFO L225 Difference]: With dead ends: 32795 [2024-11-10 00:54:05,911 INFO L226 Difference]: Without dead ends: 15000 [2024-11-10 00:54:05,929 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:54:05,929 INFO L432 NwaCegarLoop]: 2273 mSDtfsCounter, 51 mSDsluCounter, 2216 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 4489 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-10 00:54:05,929 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 4489 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:54:05,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15000 states. [2024-11-10 00:54:06,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15000 to 14997. [2024-11-10 00:54:06,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14997 states, 14995 states have (on average 1.5420473491163722) internal successors, (23123), 14996 states have internal predecessors, (23123), 0 states have call successors, (0), 0 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-10 00:54:06,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14997 states to 14997 states and 23123 transitions. [2024-11-10 00:54:06,431 INFO L78 Accepts]: Start accepts. Automaton has 14997 states and 23123 transitions. Word has length 83 [2024-11-10 00:54:06,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:54:06,431 INFO L471 AbstractCegarLoop]: Abstraction has 14997 states and 23123 transitions. [2024-11-10 00:54:06,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 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-10 00:54:06,431 INFO L276 IsEmpty]: Start isEmpty. Operand 14997 states and 23123 transitions. [2024-11-10 00:54:06,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-10 00:54:06,433 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:54:06,433 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 00:54:06,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 00:54:06,433 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:54:06,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:54:06,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1687926011, now seen corresponding path program 1 times [2024-11-10 00:54:06,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:54:06,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477191214] [2024-11-10 00:54:06,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:54:06,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:54:06,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:54:06,542 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 00:54:06,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:54:06,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477191214] [2024-11-10 00:54:06,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477191214] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:54:06,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:54:06,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 00:54:06,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189373385] [2024-11-10 00:54:06,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:54:06,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 00:54:06,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:54:06,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 00:54:06,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:54:06,544 INFO L87 Difference]: Start difference. First operand 14997 states and 23123 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:54:06,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:54:06,948 INFO L93 Difference]: Finished difference Result 26535 states and 39295 transitions. [2024-11-10 00:54:06,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 00:54:06,948 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2024-11-10 00:54:06,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:54:06,973 INFO L225 Difference]: With dead ends: 26535 [2024-11-10 00:54:06,973 INFO L226 Difference]: Without dead ends: 24228 [2024-11-10 00:54:06,980 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-10 00:54:06,981 INFO L432 NwaCegarLoop]: 2293 mSDtfsCounter, 9089 mSDsluCounter, 2853 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9089 SdHoareTripleChecker+Valid, 5146 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:54:06,981 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9089 Valid, 5146 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:54:06,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24228 states. [2024-11-10 00:54:07,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24228 to 17301. [2024-11-10 00:54:07,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17301 states, 17299 states have (on average 1.521648650210995) internal successors, (26323), 17300 states have internal predecessors, (26323), 0 states have call successors, (0), 0 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-10 00:54:07,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17301 states to 17301 states and 26323 transitions. [2024-11-10 00:54:07,362 INFO L78 Accepts]: Start accepts. Automaton has 17301 states and 26323 transitions. Word has length 83 [2024-11-10 00:54:07,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:54:07,363 INFO L471 AbstractCegarLoop]: Abstraction has 17301 states and 26323 transitions. [2024-11-10 00:54:07,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:54:07,364 INFO L276 IsEmpty]: Start isEmpty. Operand 17301 states and 26323 transitions. [2024-11-10 00:54:07,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-10 00:54:07,366 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:54:07,366 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 00:54:07,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 00:54:07,366 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:54:07,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:54:07,368 INFO L85 PathProgramCache]: Analyzing trace with hash -604865433, now seen corresponding path program 1 times [2024-11-10 00:54:07,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:54:07,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240722318] [2024-11-10 00:54:07,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:54:07,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:54:07,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:54:07,462 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:54:07,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:54:07,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240722318] [2024-11-10 00:54:07,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240722318] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:54:07,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:54:07,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:54:07,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786361809] [2024-11-10 00:54:07,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:54:07,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:54:07,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:54:07,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:54:07,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:54:07,466 INFO L87 Difference]: Start difference. First operand 17301 states and 26323 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) 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-10 00:54:07,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:54:07,631 INFO L93 Difference]: Finished difference Result 24795 states and 36727 transitions. [2024-11-10 00:54:07,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:54:07,632 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) 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-10 00:54:07,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:54:07,646 INFO L225 Difference]: With dead ends: 24795 [2024-11-10 00:54:07,646 INFO L226 Difference]: Without dead ends: 9816 [2024-11-10 00:54:07,659 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:54:07,660 INFO L432 NwaCegarLoop]: 2266 mSDtfsCounter, 44 mSDsluCounter, 2208 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 4474 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-10 00:54:07,660 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 4474 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:54:07,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9816 states. [2024-11-10 00:54:07,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9816 to 9813. [2024-11-10 00:54:07,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9813 states, 9811 states have (on average 1.6123738660686984) internal successors, (15819), 9812 states have internal predecessors, (15819), 0 states have call successors, (0), 0 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-10 00:54:07,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9813 states to 9813 states and 15819 transitions. [2024-11-10 00:54:07,907 INFO L78 Accepts]: Start accepts. Automaton has 9813 states and 15819 transitions. Word has length 85 [2024-11-10 00:54:07,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:54:07,908 INFO L471 AbstractCegarLoop]: Abstraction has 9813 states and 15819 transitions. [2024-11-10 00:54:07,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) 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-10 00:54:07,908 INFO L276 IsEmpty]: Start isEmpty. Operand 9813 states and 15819 transitions. [2024-11-10 00:54:07,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-10 00:54:07,910 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:54:07,911 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 00:54:07,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 00:54:07,911 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:54:07,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:54:07,912 INFO L85 PathProgramCache]: Analyzing trace with hash 884605097, now seen corresponding path program 1 times [2024-11-10 00:54:07,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:54:07,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47394850] [2024-11-10 00:54:07,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:54:07,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:54:07,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:54:08,010 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:54:08,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:54:08,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47394850] [2024-11-10 00:54:08,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47394850] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:54:08,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:54:08,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:54:08,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627598598] [2024-11-10 00:54:08,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:54:08,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:54:08,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:54:08,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:54:08,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:54:08,012 INFO L87 Difference]: Start difference. First operand 9813 states and 15819 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-10 00:54:08,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:54:08,131 INFO L93 Difference]: Finished difference Result 13563 states and 20971 transitions. [2024-11-10 00:54:08,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:54:08,131 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-10 00:54:08,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:54:08,139 INFO L225 Difference]: With dead ends: 13563 [2024-11-10 00:54:08,139 INFO L226 Difference]: Without dead ends: 6072 [2024-11-10 00:54:08,145 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:54:08,146 INFO L432 NwaCegarLoop]: 2259 mSDtfsCounter, 39 mSDsluCounter, 2200 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 4459 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-10 00:54:08,146 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 4459 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:54:08,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6072 states. [2024-11-10 00:54:08,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6072 to 6069. [2024-11-10 00:54:08,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6069 states, 6067 states have (on average 1.7502884456897974) internal successors, (10619), 6068 states have internal predecessors, (10619), 0 states have call successors, (0), 0 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-10 00:54:08,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6069 states to 6069 states and 10619 transitions. [2024-11-10 00:54:08,243 INFO L78 Accepts]: Start accepts. Automaton has 6069 states and 10619 transitions. Word has length 87 [2024-11-10 00:54:08,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:54:08,244 INFO L471 AbstractCegarLoop]: Abstraction has 6069 states and 10619 transitions. [2024-11-10 00:54:08,244 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-10 00:54:08,244 INFO L276 IsEmpty]: Start isEmpty. Operand 6069 states and 10619 transitions. [2024-11-10 00:54:08,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-10 00:54:08,245 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:54:08,245 INFO L215 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, 1, 1] [2024-11-10 00:54:08,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-10 00:54:08,246 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:54:08,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:54:08,246 INFO L85 PathProgramCache]: Analyzing trace with hash -2145385200, now seen corresponding path program 1 times [2024-11-10 00:54:08,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:54:08,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962197441] [2024-11-10 00:54:08,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:54:08,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:54:08,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:54:08,345 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:54:08,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:54:08,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962197441] [2024-11-10 00:54:08,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962197441] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:54:08,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:54:08,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:54:08,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270412292] [2024-11-10 00:54:08,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:54:08,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:54:08,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:54:08,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:54:08,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:54:08,347 INFO L87 Difference]: Start difference. First operand 6069 states and 10619 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 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-10 00:54:08,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:54:08,391 INFO L93 Difference]: Finished difference Result 7947 states and 13171 transitions. [2024-11-10 00:54:08,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:54:08,392 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2024-11-10 00:54:08,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:54:08,397 INFO L225 Difference]: With dead ends: 7947 [2024-11-10 00:54:08,397 INFO L226 Difference]: Without dead ends: 4200 [2024-11-10 00:54:08,400 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:54:08,401 INFO L432 NwaCegarLoop]: 2252 mSDtfsCounter, 36 mSDsluCounter, 2192 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 4444 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-10 00:54:08,401 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 4444 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:54:08,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4200 states. [2024-11-10 00:54:08,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4200 to 4197. [2024-11-10 00:54:08,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4197 states, 4195 states have (on average 1.9177592371871275) internal successors, (8045), 4196 states have internal predecessors, (8045), 0 states have call successors, (0), 0 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-10 00:54:08,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4197 states to 4197 states and 8045 transitions. [2024-11-10 00:54:08,456 INFO L78 Accepts]: Start accepts. Automaton has 4197 states and 8045 transitions. Word has length 89 [2024-11-10 00:54:08,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:54:08,456 INFO L471 AbstractCegarLoop]: Abstraction has 4197 states and 8045 transitions. [2024-11-10 00:54:08,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 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-10 00:54:08,456 INFO L276 IsEmpty]: Start isEmpty. Operand 4197 states and 8045 transitions. [2024-11-10 00:54:08,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-10 00:54:08,457 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:54:08,457 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 00:54:08,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-10 00:54:08,458 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:54:08,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:54:08,458 INFO L85 PathProgramCache]: Analyzing trace with hash 2015095447, now seen corresponding path program 1 times [2024-11-10 00:54:08,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:54:08,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850728756] [2024-11-10 00:54:08,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:54:08,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:54:08,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:54:08,526 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:54:08,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:54:08,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850728756] [2024-11-10 00:54:08,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850728756] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:54:08,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:54:08,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:54:08,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321175270] [2024-11-10 00:54:08,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:54:08,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:54:08,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:54:08,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:54:08,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:54:08,528 INFO L87 Difference]: Start difference. First operand 4197 states and 8045 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 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-10 00:54:08,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:54:08,561 INFO L93 Difference]: Finished difference Result 5139 states and 9310 transitions. [2024-11-10 00:54:08,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:54:08,561 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2024-11-10 00:54:08,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:54:08,566 INFO L225 Difference]: With dead ends: 5139 [2024-11-10 00:54:08,566 INFO L226 Difference]: Without dead ends: 3264 [2024-11-10 00:54:08,568 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:54:08,569 INFO L432 NwaCegarLoop]: 2245 mSDtfsCounter, 33 mSDsluCounter, 2184 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 4429 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-10 00:54:08,569 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 4429 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:54:08,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3264 states. [2024-11-10 00:54:08,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3264 to 3261. [2024-11-10 00:54:08,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3261 states, 3259 states have (on average 2.077631175207119) internal successors, (6771), 3260 states have internal predecessors, (6771), 0 states have call successors, (0), 0 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-10 00:54:08,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3261 states to 3261 states and 6771 transitions. [2024-11-10 00:54:08,609 INFO L78 Accepts]: Start accepts. Automaton has 3261 states and 6771 transitions. Word has length 91 [2024-11-10 00:54:08,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:54:08,609 INFO L471 AbstractCegarLoop]: Abstraction has 3261 states and 6771 transitions. [2024-11-10 00:54:08,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 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-10 00:54:08,610 INFO L276 IsEmpty]: Start isEmpty. Operand 3261 states and 6771 transitions. [2024-11-10 00:54:08,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-10 00:54:08,610 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:54:08,611 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 00:54:08,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-10 00:54:08,611 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:54:08,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:54:08,611 INFO L85 PathProgramCache]: Analyzing trace with hash -196861634, now seen corresponding path program 1 times [2024-11-10 00:54:08,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:54:08,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011158347] [2024-11-10 00:54:08,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:54:08,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:54:08,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:54:08,978 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:54:08,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:54:08,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011158347] [2024-11-10 00:54:08,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011158347] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:54:08,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1230462156] [2024-11-10 00:54:08,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:54:08,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:54:08,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:54:08,981 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-10 00:54:08,982 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-10 00:54:09,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:54:09,145 INFO L255 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-10 00:54:09,152 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:54:09,662 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:54:09,662 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:54:10,554 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:54:10,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1230462156] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:54:10,554 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:54:10,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2024-11-10 00:54:10,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861416963] [2024-11-10 00:54:10,555 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:54:10,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-10 00:54:10,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:54:10,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-10 00:54:10,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=513, Unknown=0, NotChecked=0, Total=600 [2024-11-10 00:54:10,556 INFO L87 Difference]: Start difference. First operand 3261 states and 6771 transitions. Second operand has 25 states, 25 states have (on average 10.44) internal successors, (261), 24 states have internal predecessors, (261), 0 states have call successors, (0), 0 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-10 00:54:11,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:54:11,905 INFO L93 Difference]: Finished difference Result 7286 states and 12141 transitions. [2024-11-10 00:54:11,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-10 00:54:11,905 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 10.44) internal successors, (261), 24 states have internal predecessors, (261), 0 states have call successors, (0), 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 93 [2024-11-10 00:54:11,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:54:11,912 INFO L225 Difference]: With dead ends: 7286 [2024-11-10 00:54:11,913 INFO L226 Difference]: Without dead ends: 6347 [2024-11-10 00:54:11,915 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 570 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=551, Invalid=2205, Unknown=0, NotChecked=0, Total=2756 [2024-11-10 00:54:11,915 INFO L432 NwaCegarLoop]: 2189 mSDtfsCounter, 22704 mSDsluCounter, 7374 mSDsCounter, 0 mSdLazyCounter, 917 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22704 SdHoareTripleChecker+Valid, 9563 SdHoareTripleChecker+Invalid, 940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 00:54:11,915 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22704 Valid, 9563 Invalid, 940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 917 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 00:54:11,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6347 states. [2024-11-10 00:54:12,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6347 to 6277. [2024-11-10 00:54:12,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6277 states, 6275 states have (on average 1.7005577689243028) internal successors, (10671), 6276 states have internal predecessors, (10671), 0 states have call successors, (0), 0 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-10 00:54:12,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6277 states to 6277 states and 10671 transitions. [2024-11-10 00:54:12,027 INFO L78 Accepts]: Start accepts. Automaton has 6277 states and 10671 transitions. Word has length 93 [2024-11-10 00:54:12,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:54:12,028 INFO L471 AbstractCegarLoop]: Abstraction has 6277 states and 10671 transitions. [2024-11-10 00:54:12,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 10.44) internal successors, (261), 24 states have internal predecessors, (261), 0 states have call successors, (0), 0 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-10 00:54:12,028 INFO L276 IsEmpty]: Start isEmpty. Operand 6277 states and 10671 transitions. [2024-11-10 00:54:12,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-10 00:54:12,029 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:54:12,029 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 00:54:12,044 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-10 00:54:12,230 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,SelfDestructingSolverStorable22 [2024-11-10 00:54:12,230 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:54:12,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:54:12,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1391570274, now seen corresponding path program 1 times [2024-11-10 00:54:12,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:54:12,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52596137] [2024-11-10 00:54:12,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:54:12,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:54:12,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:54:12,579 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:54:12,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:54:12,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52596137] [2024-11-10 00:54:12,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52596137] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:54:12,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [848261767] [2024-11-10 00:54:12,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:54:12,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:54:12,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:54:12,582 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-10 00:54:12,583 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-10 00:54:12,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:54:12,722 INFO L255 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-10 00:54:12,725 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:54:13,107 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:54:13,108 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:54:13,734 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:54:13,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [848261767] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:54:13,735 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:54:13,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2024-11-10 00:54:13,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70507070] [2024-11-10 00:54:13,735 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:54:13,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-10 00:54:13,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:54:13,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-10 00:54:13,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2024-11-10 00:54:13,736 INFO L87 Difference]: Start difference. First operand 6277 states and 10671 transitions. Second operand has 25 states, 25 states have (on average 9.16) internal successors, (229), 24 states have internal predecessors, (229), 0 states have call successors, (0), 0 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-10 00:54:15,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:54:15,118 INFO L93 Difference]: Finished difference Result 16572 states and 24109 transitions. [2024-11-10 00:54:15,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-10 00:54:15,119 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 9.16) internal successors, (229), 24 states have internal predecessors, (229), 0 states have call successors, (0), 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 93 [2024-11-10 00:54:15,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:54:15,130 INFO L225 Difference]: With dead ends: 16572 [2024-11-10 00:54:15,131 INFO L226 Difference]: Without dead ends: 12617 [2024-11-10 00:54:15,135 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=586, Invalid=2276, Unknown=0, NotChecked=0, Total=2862 [2024-11-10 00:54:15,136 INFO L432 NwaCegarLoop]: 2250 mSDtfsCounter, 24813 mSDsluCounter, 9637 mSDsCounter, 0 mSdLazyCounter, 874 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24813 SdHoareTripleChecker+Valid, 11887 SdHoareTripleChecker+Invalid, 899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 00:54:15,136 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24813 Valid, 11887 Invalid, 899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 874 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 00:54:15,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12617 states. [2024-11-10 00:54:15,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12617 to 12533. [2024-11-10 00:54:15,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12533 states, 12531 states have (on average 1.4914212752374112) internal successors, (18689), 12532 states have internal predecessors, (18689), 0 states have call successors, (0), 0 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-10 00:54:15,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12533 states to 12533 states and 18689 transitions. [2024-11-10 00:54:15,361 INFO L78 Accepts]: Start accepts. Automaton has 12533 states and 18689 transitions. Word has length 93 [2024-11-10 00:54:15,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:54:15,361 INFO L471 AbstractCegarLoop]: Abstraction has 12533 states and 18689 transitions. [2024-11-10 00:54:15,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 9.16) internal successors, (229), 24 states have internal predecessors, (229), 0 states have call successors, (0), 0 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-10 00:54:15,362 INFO L276 IsEmpty]: Start isEmpty. Operand 12533 states and 18689 transitions. [2024-11-10 00:54:15,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-10 00:54:15,364 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:54:15,364 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 00:54:15,377 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-10 00:54:15,567 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,SelfDestructingSolverStorable23 [2024-11-10 00:54:15,568 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:54:15,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:54:15,568 INFO L85 PathProgramCache]: Analyzing trace with hash 799660954, now seen corresponding path program 1 times [2024-11-10 00:54:15,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:54:15,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096392580] [2024-11-10 00:54:15,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:54:15,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:54:15,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:54:15,804 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:54:15,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:54:15,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096392580] [2024-11-10 00:54:15,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096392580] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:54:15,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [283651874] [2024-11-10 00:54:15,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:54:15,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:54:15,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:54:15,808 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-10 00:54:15,812 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-10 00:54:15,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:54:15,958 INFO L255 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-10 00:54:15,960 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:54:42,335 WARN L286 SmtUtils]: Spent 5.37s on a formula simplification. DAG size of input: 299 DAG size of output: 285 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)