./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.6.ufo.BOUNDED-12.pals+Problem12_label02.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.6.ufo.BOUNDED-12.pals+Problem12_label02.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 1453ce65a083ed4648e89d203499c9b326168da5d5976c2f3d65b9d62166ef3b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 00:57:37,592 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 00:57:37,664 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 00:57:37,671 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 00:57:37,672 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 00:57:37,699 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 00:57:37,700 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 00:57:37,701 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 00:57:37,701 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 00:57:37,703 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 00:57:37,703 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 00:57:37,704 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 00:57:37,704 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 00:57:37,706 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 00:57:37,707 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 00:57:37,707 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 00:57:37,707 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 00:57:37,708 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 00:57:37,708 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 00:57:37,709 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 00:57:37,709 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 00:57:37,710 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 00:57:37,710 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 00:57:37,711 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 00:57:37,711 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 00:57:37,711 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 00:57:37,712 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 00:57:37,712 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 00:57:37,712 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 00:57:37,713 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 00:57:37,713 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 00:57:37,713 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 00:57:37,714 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 00:57:37,714 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 00:57:37,714 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 00:57:37,715 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 00:57:37,715 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 00:57:37,715 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 00:57:37,716 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 00:57:37,716 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 00:57:37,716 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 00:57:37,717 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 00:57:37,717 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 -> 1453ce65a083ed4648e89d203499c9b326168da5d5976c2f3d65b9d62166ef3b [2024-11-10 00:57:38,006 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 00:57:38,031 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 00:57:38,034 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 00:57:38,035 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 00:57:38,036 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 00:57:38,037 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.6.ufo.BOUNDED-12.pals+Problem12_label02.c [2024-11-10 00:57:39,447 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 00:57:39,897 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 00:57:39,899 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.6.ufo.BOUNDED-12.pals+Problem12_label02.c [2024-11-10 00:57:39,929 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/888357440/931626cb55224096b69b6d68772f3f6d/FLAGf4cc83403 [2024-11-10 00:57:40,034 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/888357440/931626cb55224096b69b6d68772f3f6d [2024-11-10 00:57:40,039 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 00:57:40,041 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 00:57:40,042 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 00:57:40,044 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 00:57:40,050 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 00:57:40,050 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:57:40" (1/1) ... [2024-11-10 00:57:40,051 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d42c607 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:57:40, skipping insertion in model container [2024-11-10 00:57:40,051 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:57:40" (1/1) ... [2024-11-10 00:57:40,152 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 00:57:40,525 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.6.ufo.BOUNDED-12.pals+Problem12_label02.c[15482,15495] [2024-11-10 00:57:40,602 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.6.ufo.BOUNDED-12.pals+Problem12_label02.c[22772,22785] [2024-11-10 00:57:41,230 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 00:57:41,240 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 00:57:41,274 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.6.ufo.BOUNDED-12.pals+Problem12_label02.c[15482,15495] [2024-11-10 00:57:41,289 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.6.ufo.BOUNDED-12.pals+Problem12_label02.c[22772,22785] [2024-11-10 00:57:41,683 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 00:57:41,712 INFO L204 MainTranslator]: Completed translation [2024-11-10 00:57:41,713 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:57:41 WrapperNode [2024-11-10 00:57:41,713 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 00:57:41,714 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 00:57:41,714 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 00:57:41,715 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 00:57:41,722 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:57:41" (1/1) ... [2024-11-10 00:57:41,782 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:57:41" (1/1) ... [2024-11-10 00:57:42,013 INFO L138 Inliner]: procedures = 37, calls = 23, calls flagged for inlining = 18, calls inlined = 18, statements flattened = 5157 [2024-11-10 00:57:42,014 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 00:57:42,015 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 00:57:42,015 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 00:57:42,015 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 00:57:42,025 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:57:41" (1/1) ... [2024-11-10 00:57:42,025 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:57:41" (1/1) ... [2024-11-10 00:57:42,154 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:57:41" (1/1) ... [2024-11-10 00:57:42,330 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:57:42,330 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:57:41" (1/1) ... [2024-11-10 00:57:42,330 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:57:41" (1/1) ... [2024-11-10 00:57:42,542 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:57:41" (1/1) ... [2024-11-10 00:57:42,593 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:57:41" (1/1) ... [2024-11-10 00:57:42,638 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:57:41" (1/1) ... [2024-11-10 00:57:42,682 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:57:41" (1/1) ... [2024-11-10 00:57:42,774 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 00:57:42,779 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 00:57:42,780 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 00:57:42,780 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 00:57:42,781 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:57:41" (1/1) ... [2024-11-10 00:57:42,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 00:57:42,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:57:42,818 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:57:42,822 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:57:42,865 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 00:57:42,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 00:57:42,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 00:57:42,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 00:57:42,964 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 00:57:42,966 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 00:57:48,174 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3683: havoc calculate_output2_#t~ret43#1; [2024-11-10 00:57:48,174 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L5173: havoc calculate_output3_#t~ret44#1; [2024-11-10 00:57:48,174 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2204: havoc calculate_output_#t~ret42#1; [2024-11-10 00:57:48,411 INFO L? ?]: Removed 2086 outVars from TransFormulas that were not future-live. [2024-11-10 00:57:48,411 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 00:57:48,455 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 00:57:48,456 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 00:57:48,456 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 12:57:48 BoogieIcfgContainer [2024-11-10 00:57:48,456 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 00:57:48,460 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 00:57:48,460 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 00:57:48,463 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 00:57:48,463 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 12:57:40" (1/3) ... [2024-11-10 00:57:48,464 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29a506ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:57:48, skipping insertion in model container [2024-11-10 00:57:48,464 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:57:41" (2/3) ... [2024-11-10 00:57:48,465 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29a506ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:57:48, skipping insertion in model container [2024-11-10 00:57:48,466 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 12:57:48" (3/3) ... [2024-11-10 00:57:48,467 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.ufo.BOUNDED-12.pals+Problem12_label02.c [2024-11-10 00:57:48,483 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 00:57:48,483 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-10 00:57:48,576 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 00:57:48,586 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;@5ea060d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 00:57:48,587 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-10 00:57:48,598 INFO L276 IsEmpty]: Start isEmpty. Operand has 921 states, 918 states have (on average 2.6383442265795205) internal successors, (2422), 920 states have internal predecessors, (2422), 0 states have call successors, (0), 0 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:57:48,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-10 00:57:48,607 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:57:48,608 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] [2024-11-10 00:57:48,608 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:57:48,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:57:48,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1962490224, now seen corresponding path program 1 times [2024-11-10 00:57:48,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:57:48,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648530161] [2024-11-10 00:57:48,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:57:48,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:57:48,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:57:48,876 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:57:48,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:57:48,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648530161] [2024-11-10 00:57:48,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648530161] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:57:48,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:57:48,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 00:57:48,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344889342] [2024-11-10 00:57:48,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:57:48,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 00:57:48,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:57:48,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 00:57:48,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 00:57:48,915 INFO L87 Difference]: Start difference. First operand has 921 states, 918 states have (on average 2.6383442265795205) internal successors, (2422), 920 states have internal predecessors, (2422), 0 states have call successors, (0), 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 14.0) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 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:57:49,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:57:49,002 INFO L93 Difference]: Finished difference Result 1794 states and 4754 transitions. [2024-11-10 00:57:49,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 00:57:49,004 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2024-11-10 00:57:49,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:57:49,028 INFO L225 Difference]: With dead ends: 1794 [2024-11-10 00:57:49,028 INFO L226 Difference]: Without dead ends: 853 [2024-11-10 00:57:49,033 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:57:49,036 INFO L432 NwaCegarLoop]: 2354 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, 2354 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:57:49,037 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2354 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:57:49,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states. [2024-11-10 00:57:49,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 853. [2024-11-10 00:57:49,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 853 states, 851 states have (on average 2.6874265569917744) internal successors, (2287), 852 states have internal predecessors, (2287), 0 states have call successors, (0), 0 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:57:49,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 2287 transitions. [2024-11-10 00:57:49,140 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 2287 transitions. Word has length 28 [2024-11-10 00:57:49,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:57:49,141 INFO L471 AbstractCegarLoop]: Abstraction has 853 states and 2287 transitions. [2024-11-10 00:57:49,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 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:57:49,142 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 2287 transitions. [2024-11-10 00:57:49,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-10 00:57:49,144 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:57:49,144 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] [2024-11-10 00:57:49,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 00:57:49,145 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:57:49,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:57:49,146 INFO L85 PathProgramCache]: Analyzing trace with hash -75566065, now seen corresponding path program 1 times [2024-11-10 00:57:49,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:57:49,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231828225] [2024-11-10 00:57:49,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:57:49,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:57:49,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:57:49,378 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:57:49,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:57:49,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231828225] [2024-11-10 00:57:49,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231828225] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:57:49,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:57:49,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:57:49,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136884333] [2024-11-10 00:57:49,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:57:49,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:57:49,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:57:49,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:57:49,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:57:49,388 INFO L87 Difference]: Start difference. First operand 853 states and 2287 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 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:57:49,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:57:49,502 INFO L93 Difference]: Finished difference Result 908 states and 2371 transitions. [2024-11-10 00:57:49,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:57:49,503 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2024-11-10 00:57:49,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:57:49,507 INFO L225 Difference]: With dead ends: 908 [2024-11-10 00:57:49,508 INFO L226 Difference]: Without dead ends: 853 [2024-11-10 00:57:49,509 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:57:49,510 INFO L432 NwaCegarLoop]: 2285 mSDtfsCounter, 0 mSDsluCounter, 6810 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 9095 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:57:49,511 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 9095 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:57:49,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states. [2024-11-10 00:57:49,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 853. [2024-11-10 00:57:49,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 853 states, 851 states have (on average 2.6404230317273796) internal successors, (2247), 852 states have internal predecessors, (2247), 0 states have call successors, (0), 0 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:57:49,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 2247 transitions. [2024-11-10 00:57:49,583 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 2247 transitions. Word has length 28 [2024-11-10 00:57:49,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:57:49,583 INFO L471 AbstractCegarLoop]: Abstraction has 853 states and 2247 transitions. [2024-11-10 00:57:49,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 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:57:49,584 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 2247 transitions. [2024-11-10 00:57:49,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-10 00:57:49,588 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:57:49,588 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] [2024-11-10 00:57:49,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 00:57:49,589 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:57:49,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:57:49,590 INFO L85 PathProgramCache]: Analyzing trace with hash 143963266, now seen corresponding path program 1 times [2024-11-10 00:57:49,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:57:49,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500147955] [2024-11-10 00:57:49,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:57:49,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:57:49,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:57:49,897 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:57:49,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:57:49,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500147955] [2024-11-10 00:57:49,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500147955] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:57:49,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:57:49,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:57:49,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380729081] [2024-11-10 00:57:49,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:57:49,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 00:57:49,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:57:49,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 00:57:49,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 00:57:49,903 INFO L87 Difference]: Start difference. First operand 853 states and 2247 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 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:57:58,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:57:58,104 INFO L93 Difference]: Finished difference Result 3112 states and 8600 transitions. [2024-11-10 00:57:58,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 00:57:58,104 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2024-11-10 00:57:58,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:57:58,115 INFO L225 Difference]: With dead ends: 3112 [2024-11-10 00:57:58,116 INFO L226 Difference]: Without dead ends: 2357 [2024-11-10 00:57:58,117 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:57:58,118 INFO L432 NwaCegarLoop]: 803 mSDtfsCounter, 4481 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 8074 mSolverCounterSat, 1153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4481 SdHoareTripleChecker+Valid, 826 SdHoareTripleChecker+Invalid, 9227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1153 IncrementalHoareTripleChecker+Valid, 8074 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:57:58,119 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4481 Valid, 826 Invalid, 9227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1153 Valid, 8074 Invalid, 0 Unknown, 0 Unchecked, 8.0s Time] [2024-11-10 00:57:58,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2357 states. [2024-11-10 00:57:58,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2357 to 2357. [2024-11-10 00:57:58,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2357 states, 2355 states have (on average 2.4301486199575373) internal successors, (5723), 2356 states have internal predecessors, (5723), 0 states have call successors, (0), 0 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:57:58,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2357 states to 2357 states and 5723 transitions. [2024-11-10 00:57:58,180 INFO L78 Accepts]: Start accepts. Automaton has 2357 states and 5723 transitions. Word has length 65 [2024-11-10 00:57:58,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:57:58,182 INFO L471 AbstractCegarLoop]: Abstraction has 2357 states and 5723 transitions. [2024-11-10 00:57:58,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 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:57:58,182 INFO L276 IsEmpty]: Start isEmpty. Operand 2357 states and 5723 transitions. [2024-11-10 00:57:58,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-10 00:57:58,187 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:57:58,188 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] [2024-11-10 00:57:58,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 00:57:58,188 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:57:58,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:57:58,189 INFO L85 PathProgramCache]: Analyzing trace with hash 954186912, now seen corresponding path program 1 times [2024-11-10 00:57:58,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:57:58,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910217691] [2024-11-10 00:57:58,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:57:58,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:57:58,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:57:58,409 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:57:58,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:57:58,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910217691] [2024-11-10 00:57:58,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910217691] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:57:58,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:57:58,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:57:58,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985221834] [2024-11-10 00:57:58,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:57:58,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 00:57:58,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:57:58,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 00:57:58,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:57:58,411 INFO L87 Difference]: Start difference. First operand 2357 states and 5723 transitions. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 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:57:58,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:57:58,681 INFO L93 Difference]: Finished difference Result 2969 states and 6683 transitions. [2024-11-10 00:57:58,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 00:57:58,682 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2024-11-10 00:57:58,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:57:58,694 INFO L225 Difference]: With dead ends: 2969 [2024-11-10 00:57:58,695 INFO L226 Difference]: Without dead ends: 2918 [2024-11-10 00:57:58,696 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2024-11-10 00:57:58,697 INFO L432 NwaCegarLoop]: 2243 mSDtfsCounter, 13829 mSDsluCounter, 2098 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13829 SdHoareTripleChecker+Valid, 4341 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:57:58,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13829 Valid, 4341 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:57:58,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2918 states. [2024-11-10 00:57:58,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2918 to 2405. [2024-11-10 00:57:58,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2405 states, 2403 states have (on average 2.4132334581772783) internal successors, (5799), 2404 states have internal predecessors, (5799), 0 states have call successors, (0), 0 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:57:58,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2405 states to 2405 states and 5799 transitions. [2024-11-10 00:57:58,756 INFO L78 Accepts]: Start accepts. Automaton has 2405 states and 5799 transitions. Word has length 67 [2024-11-10 00:57:58,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:57:58,756 INFO L471 AbstractCegarLoop]: Abstraction has 2405 states and 5799 transitions. [2024-11-10 00:57:58,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 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:57:58,756 INFO L276 IsEmpty]: Start isEmpty. Operand 2405 states and 5799 transitions. [2024-11-10 00:57:58,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-10 00:57:58,759 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:57:58,759 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:57:58,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 00:57:58,759 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:57:58,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:57:58,760 INFO L85 PathProgramCache]: Analyzing trace with hash 139981634, now seen corresponding path program 1 times [2024-11-10 00:57:58,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:57:58,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165372031] [2024-11-10 00:57:58,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:57:58,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:57:58,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:57:59,140 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:57:59,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:57:59,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165372031] [2024-11-10 00:57:59,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165372031] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:57:59,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:57:59,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:57:59,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526092268] [2024-11-10 00:57:59,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:57:59,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 00:57:59,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:57:59,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 00:57:59,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:57:59,143 INFO L87 Difference]: Start difference. First operand 2405 states and 5799 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 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:57:59,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:57:59,414 INFO L93 Difference]: Finished difference Result 2507 states and 5957 transitions. [2024-11-10 00:57:59,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 00:57:59,423 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 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:57:59,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:57:59,438 INFO L225 Difference]: With dead ends: 2507 [2024-11-10 00:57:59,439 INFO L226 Difference]: Without dead ends: 2408 [2024-11-10 00:57:59,440 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2024-11-10 00:57:59,441 INFO L432 NwaCegarLoop]: 2239 mSDtfsCounter, 2216 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2216 SdHoareTripleChecker+Valid, 2704 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:57:59,441 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2216 Valid, 2704 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:57:59,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2408 states. [2024-11-10 00:57:59,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2408 to 2405. [2024-11-10 00:57:59,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2405 states, 2403 states have (on average 2.412817311693716) internal successors, (5798), 2404 states have internal predecessors, (5798), 0 states have call successors, (0), 0 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:57:59,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2405 states to 2405 states and 5798 transitions. [2024-11-10 00:57:59,496 INFO L78 Accepts]: Start accepts. Automaton has 2405 states and 5798 transitions. Word has length 69 [2024-11-10 00:57:59,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:57:59,497 INFO L471 AbstractCegarLoop]: Abstraction has 2405 states and 5798 transitions. [2024-11-10 00:57:59,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 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:57:59,497 INFO L276 IsEmpty]: Start isEmpty. Operand 2405 states and 5798 transitions. [2024-11-10 00:57:59,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-10 00:57:59,498 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:57:59,498 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, 1] [2024-11-10 00:57:59,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 00:57:59,498 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:57:59,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:57:59,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1768282563, now seen corresponding path program 1 times [2024-11-10 00:57:59,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:57:59,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292258135] [2024-11-10 00:57:59,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:57:59,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:57:59,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:57:59,567 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:57:59,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:57:59,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292258135] [2024-11-10 00:57:59,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292258135] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:57:59,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:57:59,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:57:59,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782720085] [2024-11-10 00:57:59,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:57:59,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:57:59,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:57:59,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:57:59,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:57:59,570 INFO L87 Difference]: Start difference. First operand 2405 states and 5798 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 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:57:59,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:57:59,604 INFO L93 Difference]: Finished difference Result 2591 states and 6088 transitions. [2024-11-10 00:57:59,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:57:59,604 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2024-11-10 00:57:59,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:57:59,616 INFO L225 Difference]: With dead ends: 2591 [2024-11-10 00:57:59,616 INFO L226 Difference]: Without dead ends: 2492 [2024-11-10 00:57:59,618 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:57:59,620 INFO L432 NwaCegarLoop]: 2253 mSDtfsCounter, 2174 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2174 SdHoareTripleChecker+Valid, 2328 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:57:59,621 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2174 Valid, 2328 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:57:59,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2492 states. [2024-11-10 00:57:59,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2492 to 2489. [2024-11-10 00:57:59,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2489 states, 2487 states have (on average 2.3835946924004827) internal successors, (5928), 2488 states have internal predecessors, (5928), 0 states have call successors, (0), 0 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:57:59,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2489 states to 2489 states and 5928 transitions. [2024-11-10 00:57:59,680 INFO L78 Accepts]: Start accepts. Automaton has 2489 states and 5928 transitions. Word has length 70 [2024-11-10 00:57:59,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:57:59,681 INFO L471 AbstractCegarLoop]: Abstraction has 2489 states and 5928 transitions. [2024-11-10 00:57:59,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 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:57:59,682 INFO L276 IsEmpty]: Start isEmpty. Operand 2489 states and 5928 transitions. [2024-11-10 00:57:59,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-10 00:57:59,683 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:57:59,683 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, 1, 1] [2024-11-10 00:57:59,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 00:57:59,684 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:57:59,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:57:59,684 INFO L85 PathProgramCache]: Analyzing trace with hash 195638852, now seen corresponding path program 1 times [2024-11-10 00:57:59,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:57:59,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743204935] [2024-11-10 00:57:59,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:57:59,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:57:59,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:57:59,748 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:57:59,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:57:59,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743204935] [2024-11-10 00:57:59,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743204935] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:57:59,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:57:59,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:57:59,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895295475] [2024-11-10 00:57:59,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:57:59,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:57:59,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:57:59,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:57:59,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:57:59,751 INFO L87 Difference]: Start difference. First operand 2489 states and 5928 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 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:57:59,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:57:59,792 INFO L93 Difference]: Finished difference Result 2682 states and 6228 transitions. [2024-11-10 00:57:59,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:57:59,793 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 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 71 [2024-11-10 00:57:59,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:57:59,804 INFO L225 Difference]: With dead ends: 2682 [2024-11-10 00:57:59,804 INFO L226 Difference]: Without dead ends: 2583 [2024-11-10 00:57:59,806 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:57:59,806 INFO L432 NwaCegarLoop]: 2311 mSDtfsCounter, 2190 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2190 SdHoareTripleChecker+Valid, 2392 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:57:59,807 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2190 Valid, 2392 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:57:59,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2583 states. [2024-11-10 00:57:59,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2583 to 2580. [2024-11-10 00:57:59,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2580 states, 2578 states have (on average 2.3537626066718387) internal successors, (6068), 2579 states have internal predecessors, (6068), 0 states have call successors, (0), 0 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:57:59,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2580 states to 2580 states and 6068 transitions. [2024-11-10 00:57:59,865 INFO L78 Accepts]: Start accepts. Automaton has 2580 states and 6068 transitions. Word has length 71 [2024-11-10 00:57:59,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:57:59,866 INFO L471 AbstractCegarLoop]: Abstraction has 2580 states and 6068 transitions. [2024-11-10 00:57:59,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 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:57:59,866 INFO L276 IsEmpty]: Start isEmpty. Operand 2580 states and 6068 transitions. [2024-11-10 00:57:59,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-10 00:57:59,867 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:57:59,867 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, 1, 1] [2024-11-10 00:57:59,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 00:57:59,868 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:57:59,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:57:59,868 INFO L85 PathProgramCache]: Analyzing trace with hash -576901948, now seen corresponding path program 1 times [2024-11-10 00:57:59,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:57:59,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569816685] [2024-11-10 00:57:59,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:57:59,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:57:59,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:57:59,926 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:57:59,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:57:59,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569816685] [2024-11-10 00:57:59,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569816685] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:57:59,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:57:59,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:57:59,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282732672] [2024-11-10 00:57:59,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:57:59,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:57:59,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:57:59,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:57:59,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:57:59,928 INFO L87 Difference]: Start difference. First operand 2580 states and 6068 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 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:57:59,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:57:59,969 INFO L93 Difference]: Finished difference Result 3098 states and 6870 transitions. [2024-11-10 00:57:59,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:57:59,970 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 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 71 [2024-11-10 00:57:59,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:57:59,981 INFO L225 Difference]: With dead ends: 3098 [2024-11-10 00:57:59,981 INFO L226 Difference]: Without dead ends: 2827 [2024-11-10 00:57:59,983 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:57:59,983 INFO L432 NwaCegarLoop]: 2303 mSDtfsCounter, 2186 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2186 SdHoareTripleChecker+Valid, 2392 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:57:59,983 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2186 Valid, 2392 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:57:59,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2827 states. [2024-11-10 00:58:00,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2827 to 2824. [2024-11-10 00:58:00,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2824 states, 2822 states have (on average 2.2820694542877393) internal successors, (6440), 2823 states have internal predecessors, (6440), 0 states have call successors, (0), 0 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:58:00,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2824 states to 2824 states and 6440 transitions. [2024-11-10 00:58:00,049 INFO L78 Accepts]: Start accepts. Automaton has 2824 states and 6440 transitions. Word has length 71 [2024-11-10 00:58:00,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:58:00,049 INFO L471 AbstractCegarLoop]: Abstraction has 2824 states and 6440 transitions. [2024-11-10 00:58:00,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 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:58:00,050 INFO L276 IsEmpty]: Start isEmpty. Operand 2824 states and 6440 transitions. [2024-11-10 00:58:00,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-10 00:58:00,053 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:58:00,053 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, 1, 1] [2024-11-10 00:58:00,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 00:58:00,053 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:58:00,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:58:00,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1578311676, now seen corresponding path program 1 times [2024-11-10 00:58:00,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:58:00,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358972424] [2024-11-10 00:58:00,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:58:00,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:58:00,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:58:00,117 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:58:00,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:58:00,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358972424] [2024-11-10 00:58:00,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358972424] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:58:00,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:58:00,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:58:00,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883207516] [2024-11-10 00:58:00,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:58:00,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:58:00,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:58:00,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:58:00,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:58:00,120 INFO L87 Difference]: Start difference. First operand 2824 states and 6440 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 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:58:00,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:58:00,168 INFO L93 Difference]: Finished difference Result 3806 states and 7944 transitions. [2024-11-10 00:58:00,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:58:00,168 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 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 71 [2024-11-10 00:58:00,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:58:00,184 INFO L225 Difference]: With dead ends: 3806 [2024-11-10 00:58:00,184 INFO L226 Difference]: Without dead ends: 3291 [2024-11-10 00:58:00,187 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:58:00,187 INFO L432 NwaCegarLoop]: 2301 mSDtfsCounter, 2184 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2184 SdHoareTripleChecker+Valid, 2394 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:58:00,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2184 Valid, 2394 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:58:00,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3291 states. [2024-11-10 00:58:00,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3291 to 3288. [2024-11-10 00:58:00,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3288 states, 3286 states have (on average 2.1716372489348754) internal successors, (7136), 3287 states have internal predecessors, (7136), 0 states have call successors, (0), 0 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:58:00,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3288 states to 3288 states and 7136 transitions. [2024-11-10 00:58:00,265 INFO L78 Accepts]: Start accepts. Automaton has 3288 states and 7136 transitions. Word has length 71 [2024-11-10 00:58:00,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:58:00,266 INFO L471 AbstractCegarLoop]: Abstraction has 3288 states and 7136 transitions. [2024-11-10 00:58:00,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 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:58:00,266 INFO L276 IsEmpty]: Start isEmpty. Operand 3288 states and 7136 transitions. [2024-11-10 00:58:00,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-10 00:58:00,267 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:58:00,267 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, 1, 1] [2024-11-10 00:58:00,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 00:58:00,267 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:58:00,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:58:00,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1592761532, now seen corresponding path program 1 times [2024-11-10 00:58:00,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:58:00,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073566534] [2024-11-10 00:58:00,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:58:00,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:58:00,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:58:00,330 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:58:00,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:58:00,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073566534] [2024-11-10 00:58:00,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073566534] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:58:00,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:58:00,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:58:00,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738508719] [2024-11-10 00:58:00,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:58:00,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:58:00,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:58:00,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:58:00,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:58:00,332 INFO L87 Difference]: Start difference. First operand 3288 states and 7136 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 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:58:00,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:58:00,387 INFO L93 Difference]: Finished difference Result 5150 states and 9948 transitions. [2024-11-10 00:58:00,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:58:00,387 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 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 71 [2024-11-10 00:58:00,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:58:00,397 INFO L225 Difference]: With dead ends: 5150 [2024-11-10 00:58:00,397 INFO L226 Difference]: Without dead ends: 4171 [2024-11-10 00:58:00,401 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:58:00,402 INFO L432 NwaCegarLoop]: 2299 mSDtfsCounter, 2182 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2182 SdHoareTripleChecker+Valid, 2396 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:58:00,402 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2182 Valid, 2396 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:58:00,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4171 states. [2024-11-10 00:58:00,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4171 to 4168. [2024-11-10 00:58:00,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4168 states, 4166 states have (on average 2.0240038406144985) internal successors, (8432), 4167 states have internal predecessors, (8432), 0 states have call successors, (0), 0 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:58:00,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4168 states to 4168 states and 8432 transitions. [2024-11-10 00:58:00,500 INFO L78 Accepts]: Start accepts. Automaton has 4168 states and 8432 transitions. Word has length 71 [2024-11-10 00:58:00,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:58:00,501 INFO L471 AbstractCegarLoop]: Abstraction has 4168 states and 8432 transitions. [2024-11-10 00:58:00,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 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:58:00,501 INFO L276 IsEmpty]: Start isEmpty. Operand 4168 states and 8432 transitions. [2024-11-10 00:58:00,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-10 00:58:00,502 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:58:00,502 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, 1, 1] [2024-11-10 00:58:00,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 00:58:00,502 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:58:00,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:58:00,503 INFO L85 PathProgramCache]: Analyzing trace with hash 498841220, now seen corresponding path program 1 times [2024-11-10 00:58:00,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:58:00,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454830312] [2024-11-10 00:58:00,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:58:00,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:58:00,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:58:00,560 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:58:00,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:58:00,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454830312] [2024-11-10 00:58:00,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454830312] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:58:00,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:58:00,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:58:00,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523089699] [2024-11-10 00:58:00,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:58:00,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:58:00,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:58:00,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:58:00,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:58:00,563 INFO L87 Difference]: Start difference. First operand 4168 states and 8432 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 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:58:00,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:58:00,645 INFO L93 Difference]: Finished difference Result 7694 states and 13668 transitions. [2024-11-10 00:58:00,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:58:00,646 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 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 71 [2024-11-10 00:58:00,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:58:00,659 INFO L225 Difference]: With dead ends: 7694 [2024-11-10 00:58:00,659 INFO L226 Difference]: Without dead ends: 5835 [2024-11-10 00:58:00,664 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:58:00,665 INFO L432 NwaCegarLoop]: 2297 mSDtfsCounter, 2180 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2180 SdHoareTripleChecker+Valid, 2398 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:58:00,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2180 Valid, 2398 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:58:00,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5835 states. [2024-11-10 00:58:00,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5835 to 5832. [2024-11-10 00:58:00,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5832 states, 5830 states have (on average 1.857975986277873) internal successors, (10832), 5831 states have internal predecessors, (10832), 0 states have call successors, (0), 0 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:58:00,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5832 states to 5832 states and 10832 transitions. [2024-11-10 00:58:00,895 INFO L78 Accepts]: Start accepts. Automaton has 5832 states and 10832 transitions. Word has length 71 [2024-11-10 00:58:00,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:58:00,895 INFO L471 AbstractCegarLoop]: Abstraction has 5832 states and 10832 transitions. [2024-11-10 00:58:00,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 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:58:00,896 INFO L276 IsEmpty]: Start isEmpty. Operand 5832 states and 10832 transitions. [2024-11-10 00:58:00,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-10 00:58:00,896 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:58:00,897 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, 1, 1] [2024-11-10 00:58:00,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 00:58:00,897 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:58:00,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:58:00,897 INFO L85 PathProgramCache]: Analyzing trace with hash -25435835, now seen corresponding path program 1 times [2024-11-10 00:58:00,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:58:00,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131009774] [2024-11-10 00:58:00,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:58:00,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:58:00,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:58:01,131 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:58:01,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:58:01,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131009774] [2024-11-10 00:58:01,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131009774] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:58:01,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:58:01,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:58:01,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729361351] [2024-11-10 00:58:01,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:58:01,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 00:58:01,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:58:01,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 00:58:01,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:58:01,134 INFO L87 Difference]: Start difference. First operand 5832 states and 10832 transitions. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 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:58:01,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:58:01,254 INFO L93 Difference]: Finished difference Result 6027 states and 11090 transitions. [2024-11-10 00:58:01,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 00:58:01,255 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 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 71 [2024-11-10 00:58:01,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:58:01,267 INFO L225 Difference]: With dead ends: 6027 [2024-11-10 00:58:01,267 INFO L226 Difference]: Without dead ends: 6024 [2024-11-10 00:58:01,269 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:58:01,270 INFO L432 NwaCegarLoop]: 2241 mSDtfsCounter, 0 mSDsluCounter, 13433 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 15674 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:58:01,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 15674 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:58:01,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6024 states. [2024-11-10 00:58:01,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6024 to 6024. [2024-11-10 00:58:01,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6024 states, 6022 states have (on average 1.8279641315177682) internal successors, (11008), 6023 states have internal predecessors, (11008), 0 states have call successors, (0), 0 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:58:01,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6024 states to 6024 states and 11008 transitions. [2024-11-10 00:58:01,406 INFO L78 Accepts]: Start accepts. Automaton has 6024 states and 11008 transitions. Word has length 71 [2024-11-10 00:58:01,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:58:01,406 INFO L471 AbstractCegarLoop]: Abstraction has 6024 states and 11008 transitions. [2024-11-10 00:58:01,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 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:58:01,406 INFO L276 IsEmpty]: Start isEmpty. Operand 6024 states and 11008 transitions. [2024-11-10 00:58:01,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-10 00:58:01,407 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:58:01,407 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, 1, 1] [2024-11-10 00:58:01,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 00:58:01,407 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:58:01,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:58:01,408 INFO L85 PathProgramCache]: Analyzing trace with hash -294827644, now seen corresponding path program 1 times [2024-11-10 00:58:01,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:58:01,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353518783] [2024-11-10 00:58:01,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:58:01,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:58:01,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:58:01,467 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:58:01,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:58:01,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353518783] [2024-11-10 00:58:01,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353518783] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:58:01,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:58:01,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:58:01,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306433710] [2024-11-10 00:58:01,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:58:01,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:58:01,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:58:01,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:58:01,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:58:01,469 INFO L87 Difference]: Start difference. First operand 6024 states and 11008 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 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:58:01,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:58:01,607 INFO L93 Difference]: Finished difference Result 13070 states and 21060 transitions. [2024-11-10 00:58:01,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:58:01,608 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 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 71 [2024-11-10 00:58:01,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:58:01,628 INFO L225 Difference]: With dead ends: 13070 [2024-11-10 00:58:01,628 INFO L226 Difference]: Without dead ends: 9355 [2024-11-10 00:58:01,637 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:58:01,638 INFO L432 NwaCegarLoop]: 2313 mSDtfsCounter, 2188 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2188 SdHoareTripleChecker+Valid, 2398 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:58:01,639 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2188 Valid, 2398 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:58:01,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9355 states. [2024-11-10 00:58:01,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9355 to 9352. [2024-11-10 00:58:01,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9352 states, 9350 states have (on average 1.6684491978609626) internal successors, (15600), 9351 states have internal predecessors, (15600), 0 states have call successors, (0), 0 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:58:01,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9352 states to 9352 states and 15600 transitions. [2024-11-10 00:58:01,968 INFO L78 Accepts]: Start accepts. Automaton has 9352 states and 15600 transitions. Word has length 71 [2024-11-10 00:58:01,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:58:01,968 INFO L471 AbstractCegarLoop]: Abstraction has 9352 states and 15600 transitions. [2024-11-10 00:58:01,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 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:58:01,969 INFO L276 IsEmpty]: Start isEmpty. Operand 9352 states and 15600 transitions. [2024-11-10 00:58:01,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-10 00:58:01,973 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:58:01,973 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:58:01,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 00:58:01,974 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:58:01,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:58:01,974 INFO L85 PathProgramCache]: Analyzing trace with hash 674170550, now seen corresponding path program 1 times [2024-11-10 00:58:01,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:58:01,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053949482] [2024-11-10 00:58:01,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:58:01,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:58:02,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:58:02,215 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 00:58:02,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:58:02,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053949482] [2024-11-10 00:58:02,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053949482] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:58:02,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:58:02,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:58:02,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572070084] [2024-11-10 00:58:02,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:58:02,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 00:58:02,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:58:02,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 00:58:02,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:58:02,219 INFO L87 Difference]: Start difference. First operand 9352 states and 15600 transitions. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 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:58:03,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:58:03,330 INFO L93 Difference]: Finished difference Result 51069 states and 74494 transitions. [2024-11-10 00:58:03,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 00:58:03,331 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-11-10 00:58:03,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:58:03,415 INFO L225 Difference]: With dead ends: 51069 [2024-11-10 00:58:03,415 INFO L226 Difference]: Without dead ends: 46074 [2024-11-10 00:58:03,429 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-11-10 00:58:03,430 INFO L432 NwaCegarLoop]: 2324 mSDtfsCounter, 11454 mSDsluCounter, 3062 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11454 SdHoareTripleChecker+Valid, 5386 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:58:03,430 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11454 Valid, 5386 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:58:03,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46074 states. [2024-11-10 00:58:03,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46074 to 15400. [2024-11-10 00:58:03,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15400 states, 15398 states have (on average 1.5617612676971036) internal successors, (24048), 15399 states have internal predecessors, (24048), 0 states have call successors, (0), 0 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:58:04,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15400 states to 15400 states and 24048 transitions. [2024-11-10 00:58:04,026 INFO L78 Accepts]: Start accepts. Automaton has 15400 states and 24048 transitions. Word has length 94 [2024-11-10 00:58:04,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:58:04,027 INFO L471 AbstractCegarLoop]: Abstraction has 15400 states and 24048 transitions. [2024-11-10 00:58:04,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 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:58:04,027 INFO L276 IsEmpty]: Start isEmpty. Operand 15400 states and 24048 transitions. [2024-11-10 00:58:04,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-10 00:58:04,033 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:58:04,033 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:58:04,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 00:58:04,034 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:58:04,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:58:04,034 INFO L85 PathProgramCache]: Analyzing trace with hash -98370250, now seen corresponding path program 1 times [2024-11-10 00:58:04,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:58:04,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141716839] [2024-11-10 00:58:04,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:58:04,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:58:04,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:58:04,238 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-10 00:58:04,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:58:04,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141716839] [2024-11-10 00:58:04,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141716839] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:58:04,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:58:04,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:58:04,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266413603] [2024-11-10 00:58:04,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:58:04,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 00:58:04,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:58:04,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 00:58:04,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:58:04,241 INFO L87 Difference]: Start difference. First operand 15400 states and 24048 transitions. Second operand has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 0 states have call successors, (0), 0 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:58:05,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:58:05,217 INFO L93 Difference]: Finished difference Result 58109 states and 84382 transitions. [2024-11-10 00:58:05,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 00:58:05,218 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-11-10 00:58:05,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:58:05,329 INFO L225 Difference]: With dead ends: 58109 [2024-11-10 00:58:05,330 INFO L226 Difference]: Without dead ends: 51066 [2024-11-10 00:58:05,352 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-11-10 00:58:05,352 INFO L432 NwaCegarLoop]: 2326 mSDtfsCounter, 11515 mSDsluCounter, 3068 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11515 SdHoareTripleChecker+Valid, 5394 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:58:05,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11515 Valid, 5394 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:58:05,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51066 states. [2024-11-10 00:58:06,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51066 to 24936. [2024-11-10 00:58:06,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24936 states, 24934 states have (on average 1.4983556589396005) internal successors, (37360), 24935 states have internal predecessors, (37360), 0 states have call successors, (0), 0 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:58:06,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24936 states to 24936 states and 37360 transitions. [2024-11-10 00:58:06,375 INFO L78 Accepts]: Start accepts. Automaton has 24936 states and 37360 transitions. Word has length 94 [2024-11-10 00:58:06,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:58:06,375 INFO L471 AbstractCegarLoop]: Abstraction has 24936 states and 37360 transitions. [2024-11-10 00:58:06,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 0 states have call successors, (0), 0 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:58:06,376 INFO L276 IsEmpty]: Start isEmpty. Operand 24936 states and 37360 transitions. [2024-11-10 00:58:06,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-10 00:58:06,381 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:58:06,381 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:58:06,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 00:58:06,381 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:58:06,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:58:06,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1099779978, now seen corresponding path program 1 times [2024-11-10 00:58:06,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:58:06,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016964134] [2024-11-10 00:58:06,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:58:06,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:58:06,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:58:06,576 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-10 00:58:06,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:58:06,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016964134] [2024-11-10 00:58:06,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016964134] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:58:06,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:58:06,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:58:06,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439342722] [2024-11-10 00:58:06,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:58:06,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 00:58:06,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:58:06,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 00:58:06,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:58:06,580 INFO L87 Difference]: Start difference. First operand 24936 states and 37360 transitions. Second operand has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 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:58:08,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:58:08,063 INFO L93 Difference]: Finished difference Result 65149 states and 94238 transitions. [2024-11-10 00:58:08,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 00:58:08,064 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-11-10 00:58:08,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:58:08,179 INFO L225 Difference]: With dead ends: 65149 [2024-11-10 00:58:08,179 INFO L226 Difference]: Without dead ends: 58106 [2024-11-10 00:58:08,204 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-11-10 00:58:08,205 INFO L432 NwaCegarLoop]: 2323 mSDtfsCounter, 11561 mSDsluCounter, 3020 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11561 SdHoareTripleChecker+Valid, 5343 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:58:08,205 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11561 Valid, 5343 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:58:08,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58106 states. [2024-11-10 00:58:09,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58106 to 31976. [2024-11-10 00:58:09,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31976 states, 31974 states have (on average 1.4766998186026146) internal successors, (47216), 31975 states have internal predecessors, (47216), 0 states have call successors, (0), 0 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:58:09,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31976 states to 31976 states and 47216 transitions. [2024-11-10 00:58:09,468 INFO L78 Accepts]: Start accepts. Automaton has 31976 states and 47216 transitions. Word has length 94 [2024-11-10 00:58:09,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:58:09,468 INFO L471 AbstractCegarLoop]: Abstraction has 31976 states and 47216 transitions. [2024-11-10 00:58:09,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 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:58:09,468 INFO L276 IsEmpty]: Start isEmpty. Operand 31976 states and 47216 transitions. [2024-11-10 00:58:09,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-10 00:58:09,474 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:58:09,474 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:58:09,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 00:58:09,474 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:58:09,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:58:09,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1114229834, now seen corresponding path program 1 times [2024-11-10 00:58:09,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:58:09,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742253830] [2024-11-10 00:58:09,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:58:09,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:58:09,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:58:09,669 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-10 00:58:09,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:58:09,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742253830] [2024-11-10 00:58:09,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742253830] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:58:09,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:58:09,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:58:09,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155971992] [2024-11-10 00:58:09,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:58:09,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 00:58:09,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:58:09,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 00:58:09,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:58:09,672 INFO L87 Difference]: Start difference. First operand 31976 states and 47216 transitions. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 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:58:10,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:58:10,892 INFO L93 Difference]: Finished difference Result 72189 states and 104094 transitions. [2024-11-10 00:58:10,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 00:58:10,893 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-11-10 00:58:10,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:58:11,003 INFO L225 Difference]: With dead ends: 72189 [2024-11-10 00:58:11,004 INFO L226 Difference]: Without dead ends: 65146 [2024-11-10 00:58:11,021 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-11-10 00:58:11,022 INFO L432 NwaCegarLoop]: 2320 mSDtfsCounter, 11610 mSDsluCounter, 3023 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11610 SdHoareTripleChecker+Valid, 5343 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:58:11,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11610 Valid, 5343 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:58:11,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65146 states. [2024-11-10 00:58:12,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65146 to 39016. [2024-11-10 00:58:12,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39016 states, 39014 states have (on average 1.4628594863382376) internal successors, (57072), 39015 states have internal predecessors, (57072), 0 states have call successors, (0), 0 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:58:12,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39016 states to 39016 states and 57072 transitions. [2024-11-10 00:58:12,366 INFO L78 Accepts]: Start accepts. Automaton has 39016 states and 57072 transitions. Word has length 94 [2024-11-10 00:58:12,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:58:12,367 INFO L471 AbstractCegarLoop]: Abstraction has 39016 states and 57072 transitions. [2024-11-10 00:58:12,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 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:58:12,367 INFO L276 IsEmpty]: Start isEmpty. Operand 39016 states and 57072 transitions. [2024-11-10 00:58:12,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-10 00:58:12,373 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:58:12,373 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:58:12,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 00:58:12,373 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:58:12,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:58:12,374 INFO L85 PathProgramCache]: Analyzing trace with hash 977372918, now seen corresponding path program 1 times [2024-11-10 00:58:12,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:58:12,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201439478] [2024-11-10 00:58:12,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:58:12,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:58:12,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:58:12,542 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-10 00:58:12,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:58:12,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201439478] [2024-11-10 00:58:12,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201439478] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:58:12,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:58:12,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:58:12,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760007978] [2024-11-10 00:58:12,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:58:12,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 00:58:12,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:58:12,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 00:58:12,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:58:12,544 INFO L87 Difference]: Start difference. First operand 39016 states and 57072 transitions. Second operand has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 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:58:14,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:58:14,227 INFO L93 Difference]: Finished difference Result 79229 states and 113950 transitions. [2024-11-10 00:58:14,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 00:58:14,228 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-11-10 00:58:14,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:58:14,345 INFO L225 Difference]: With dead ends: 79229 [2024-11-10 00:58:14,346 INFO L226 Difference]: Without dead ends: 72186 [2024-11-10 00:58:14,378 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-11-10 00:58:14,379 INFO L432 NwaCegarLoop]: 2320 mSDtfsCounter, 11522 mSDsluCounter, 3103 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11522 SdHoareTripleChecker+Valid, 5423 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:58:14,379 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11522 Valid, 5423 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:58:14,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72186 states. [2024-11-10 00:58:15,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72186 to 46056. [2024-11-10 00:58:15,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46056 states, 46054 states have (on average 1.4532505319841924) internal successors, (66928), 46055 states have internal predecessors, (66928), 0 states have call successors, (0), 0 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:58:15,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46056 states to 46056 states and 66928 transitions. [2024-11-10 00:58:15,870 INFO L78 Accepts]: Start accepts. Automaton has 46056 states and 66928 transitions. Word has length 94 [2024-11-10 00:58:15,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:58:15,870 INFO L471 AbstractCegarLoop]: Abstraction has 46056 states and 66928 transitions. [2024-11-10 00:58:15,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 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:58:15,871 INFO L276 IsEmpty]: Start isEmpty. Operand 46056 states and 66928 transitions. [2024-11-10 00:58:15,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-10 00:58:15,878 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:58:15,878 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:58:15,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 00:58:15,878 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:58:15,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:58:15,879 INFO L85 PathProgramCache]: Analyzing trace with hash 183704054, now seen corresponding path program 1 times [2024-11-10 00:58:15,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:58:15,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806707921] [2024-11-10 00:58:15,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:58:15,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:58:15,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:58:16,044 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-10 00:58:16,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:58:16,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806707921] [2024-11-10 00:58:16,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806707921] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:58:16,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:58:16,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:58:16,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364749345] [2024-11-10 00:58:16,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:58:16,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 00:58:16,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:58:16,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 00:58:16,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:58:16,048 INFO L87 Difference]: Start difference. First operand 46056 states and 66928 transitions. Second operand has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 0 states have call successors, (0), 0 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:58:18,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:58:18,026 INFO L93 Difference]: Finished difference Result 86269 states and 123806 transitions. [2024-11-10 00:58:18,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 00:58:18,026 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-11-10 00:58:18,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:58:18,138 INFO L225 Difference]: With dead ends: 86269 [2024-11-10 00:58:18,138 INFO L226 Difference]: Without dead ends: 79226 [2024-11-10 00:58:18,164 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-11-10 00:58:18,164 INFO L432 NwaCegarLoop]: 2321 mSDtfsCounter, 11462 mSDsluCounter, 3241 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11462 SdHoareTripleChecker+Valid, 5562 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:58:18,165 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11462 Valid, 5562 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:58:18,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79226 states. [2024-11-10 00:58:19,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79226 to 53096. [2024-11-10 00:58:19,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53096 states, 53094 states have (on average 1.446189776622594) internal successors, (76784), 53095 states have internal predecessors, (76784), 0 states have call successors, (0), 0 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:58:19,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53096 states to 53096 states and 76784 transitions. [2024-11-10 00:58:19,944 INFO L78 Accepts]: Start accepts. Automaton has 53096 states and 76784 transitions. Word has length 94 [2024-11-10 00:58:19,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:58:19,945 INFO L471 AbstractCegarLoop]: Abstraction has 53096 states and 76784 transitions. [2024-11-10 00:58:19,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 0 states have call successors, (0), 0 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:58:19,945 INFO L276 IsEmpty]: Start isEmpty. Operand 53096 states and 76784 transitions. [2024-11-10 00:58:19,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-10 00:58:19,954 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:58:19,954 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:58:19,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 00:58:19,955 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:58:19,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:58:19,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1627197400, now seen corresponding path program 1 times [2024-11-10 00:58:19,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:58:19,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545108034] [2024-11-10 00:58:19,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:58:19,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:58:19,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:58:20,116 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:58:20,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:58:20,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545108034] [2024-11-10 00:58:20,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545108034] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:58:20,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:58:20,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:58:20,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687513978] [2024-11-10 00:58:20,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:58:20,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:58:20,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:58:20,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:58:20,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:58:20,119 INFO L87 Difference]: Start difference. First operand 53096 states and 76784 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 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:58:21,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:58:21,680 INFO L93 Difference]: Finished difference Result 103886 states and 147924 transitions. [2024-11-10 00:58:21,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:58:21,681 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2024-11-10 00:58:21,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:58:21,750 INFO L225 Difference]: With dead ends: 103886 [2024-11-10 00:58:21,750 INFO L226 Difference]: Without dead ends: 53099 [2024-11-10 00:58:21,778 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:58:21,779 INFO L432 NwaCegarLoop]: 2291 mSDtfsCounter, 52 mSDsluCounter, 2235 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 4526 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:58:21,779 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 4526 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:58:21,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53099 states. [2024-11-10 00:58:23,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53099 to 53096. [2024-11-10 00:58:23,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53096 states, 53094 states have (on average 1.4332316269258296) internal successors, (76096), 53095 states have internal predecessors, (76096), 0 states have call successors, (0), 0 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:58:23,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53096 states to 53096 states and 76096 transitions. [2024-11-10 00:58:23,585 INFO L78 Accepts]: Start accepts. Automaton has 53096 states and 76096 transitions. Word has length 96 [2024-11-10 00:58:23,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:58:23,586 INFO L471 AbstractCegarLoop]: Abstraction has 53096 states and 76096 transitions. [2024-11-10 00:58:23,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 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:58:23,586 INFO L276 IsEmpty]: Start isEmpty. Operand 53096 states and 76096 transitions. [2024-11-10 00:58:23,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-10 00:58:23,590 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:58:23,590 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:58:23,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-10 00:58:23,590 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:58:23,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:58:23,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1559669992, now seen corresponding path program 1 times [2024-11-10 00:58:23,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:58:23,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773308334] [2024-11-10 00:58:23,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:58:23,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:58:23,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:58:23,687 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:58:23,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:58:23,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773308334] [2024-11-10 00:58:23,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773308334] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:58:23,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:58:23,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:58:23,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130631223] [2024-11-10 00:58:23,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:58:23,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:58:23,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:58:23,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:58:23,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:58:23,689 INFO L87 Difference]: Start difference. First operand 53096 states and 76096 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 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:58:24,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:58:24,117 INFO L93 Difference]: Finished difference Result 71845 states and 102284 transitions. [2024-11-10 00:58:24,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:58:24,117 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2024-11-10 00:58:24,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:58:24,336 INFO L225 Difference]: With dead ends: 71845 [2024-11-10 00:58:24,336 INFO L226 Difference]: Without dead ends: 21058 [2024-11-10 00:58:24,352 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:58:24,353 INFO L432 NwaCegarLoop]: 2289 mSDtfsCounter, 48 mSDsluCounter, 2234 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 4523 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:58:24,354 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 4523 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:58:24,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21058 states. [2024-11-10 00:58:24,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21058 to 21048. [2024-11-10 00:58:24,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21048 states, 21046 states have (on average 1.5007127245082201) internal successors, (31584), 21047 states have internal predecessors, (31584), 0 states have call successors, (0), 0 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:58:24,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21048 states to 21048 states and 31584 transitions. [2024-11-10 00:58:24,754 INFO L78 Accepts]: Start accepts. Automaton has 21048 states and 31584 transitions. Word has length 96 [2024-11-10 00:58:24,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:58:24,754 INFO L471 AbstractCegarLoop]: Abstraction has 21048 states and 31584 transitions. [2024-11-10 00:58:24,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 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:58:24,754 INFO L276 IsEmpty]: Start isEmpty. Operand 21048 states and 31584 transitions. [2024-11-10 00:58:24,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-10 00:58:24,757 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:58:24,757 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:58:24,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-10 00:58:24,757 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:58:24,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:58:24,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1304586086, now seen corresponding path program 1 times [2024-11-10 00:58:24,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:58:24,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179062941] [2024-11-10 00:58:24,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:58:24,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:58:24,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:58:24,946 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:58:24,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:58:24,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179062941] [2024-11-10 00:58:24,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179062941] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:58:24,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:58:24,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:58:24,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199663483] [2024-11-10 00:58:24,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:58:24,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:58:24,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:58:24,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:58:24,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:58:24,948 INFO L87 Difference]: Start difference. First operand 21048 states and 31584 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 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:58:25,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:58:25,245 INFO L93 Difference]: Finished difference Result 30414 states and 44548 transitions. [2024-11-10 00:58:25,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:58:25,246 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 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 98 [2024-11-10 00:58:25,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:58:25,266 INFO L225 Difference]: With dead ends: 30414 [2024-11-10 00:58:25,266 INFO L226 Difference]: Without dead ends: 11691 [2024-11-10 00:58:25,285 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:58:25,286 INFO L432 NwaCegarLoop]: 2283 mSDtfsCounter, 46 mSDsluCounter, 2219 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 4502 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:58:25,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 4502 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:58:25,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11691 states. [2024-11-10 00:58:25,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11691 to 11688. [2024-11-10 00:58:25,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11688 states, 11686 states have (on average 1.5834331678932057) internal successors, (18504), 11687 states have internal predecessors, (18504), 0 states have call successors, (0), 0 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:58:25,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11688 states to 11688 states and 18504 transitions. [2024-11-10 00:58:25,608 INFO L78 Accepts]: Start accepts. Automaton has 11688 states and 18504 transitions. Word has length 98 [2024-11-10 00:58:25,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:58:25,609 INFO L471 AbstractCegarLoop]: Abstraction has 11688 states and 18504 transitions. [2024-11-10 00:58:25,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 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:58:25,609 INFO L276 IsEmpty]: Start isEmpty. Operand 11688 states and 18504 transitions. [2024-11-10 00:58:25,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-10 00:58:25,611 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:58:25,611 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:58:25,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-10 00:58:25,612 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:58:25,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:58:25,612 INFO L85 PathProgramCache]: Analyzing trace with hash 687095265, now seen corresponding path program 1 times [2024-11-10 00:58:25,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:58:25,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891763232] [2024-11-10 00:58:25,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:58:25,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:58:25,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:58:25,723 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:58:25,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:58:25,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891763232] [2024-11-10 00:58:25,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891763232] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:58:25,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:58:25,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:58:25,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371455654] [2024-11-10 00:58:25,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:58:25,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:58:25,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:58:25,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:58:25,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:58:25,725 INFO L87 Difference]: Start difference. First operand 11688 states and 18504 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 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:58:25,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:58:25,980 INFO L93 Difference]: Finished difference Result 16374 states and 24928 transitions. [2024-11-10 00:58:25,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:58:25,981 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 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 100 [2024-11-10 00:58:25,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:58:25,997 INFO L225 Difference]: With dead ends: 16374 [2024-11-10 00:58:25,998 INFO L226 Difference]: Without dead ends: 7011 [2024-11-10 00:58:26,008 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:58:26,008 INFO L432 NwaCegarLoop]: 2276 mSDtfsCounter, 43 mSDsluCounter, 2211 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 4487 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:58:26,009 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 4487 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:58:26,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7011 states. [2024-11-10 00:58:26,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7011 to 7008. [2024-11-10 00:58:26,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7008 states, 7006 states have (on average 1.7162432200970597) internal successors, (12024), 7007 states have internal predecessors, (12024), 0 states have call successors, (0), 0 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:58:26,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7008 states to 7008 states and 12024 transitions. [2024-11-10 00:58:26,278 INFO L78 Accepts]: Start accepts. Automaton has 7008 states and 12024 transitions. Word has length 100 [2024-11-10 00:58:26,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:58:26,278 INFO L471 AbstractCegarLoop]: Abstraction has 7008 states and 12024 transitions. [2024-11-10 00:58:26,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 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:58:26,279 INFO L276 IsEmpty]: Start isEmpty. Operand 7008 states and 12024 transitions. [2024-11-10 00:58:26,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-10 00:58:26,281 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:58:26,281 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:58:26,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-10 00:58:26,281 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:58:26,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:58:26,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1321194568, now seen corresponding path program 1 times [2024-11-10 00:58:26,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:58:26,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714374951] [2024-11-10 00:58:26,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:58:26,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:58:26,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:58:26,413 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:58:26,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:58:26,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714374951] [2024-11-10 00:58:26,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714374951] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:58:26,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:58:26,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:58:26,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722085080] [2024-11-10 00:58:26,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:58:26,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:58:26,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:58:26,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:58:26,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:58:26,417 INFO L87 Difference]: Start difference. First operand 7008 states and 12024 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 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:58:26,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:58:26,552 INFO L93 Difference]: Finished difference Result 9354 states and 15208 transitions. [2024-11-10 00:58:26,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:58:26,552 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 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 102 [2024-11-10 00:58:26,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:58:26,562 INFO L225 Difference]: With dead ends: 9354 [2024-11-10 00:58:26,563 INFO L226 Difference]: Without dead ends: 4671 [2024-11-10 00:58:26,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:58:26,570 INFO L432 NwaCegarLoop]: 2269 mSDtfsCounter, 40 mSDsluCounter, 2203 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 4472 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:58:26,571 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 4472 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:58:26,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4671 states. [2024-11-10 00:58:26,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4671 to 4668. [2024-11-10 00:58:26,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4668 states, 4666 states have (on average 1.888984140591513) internal successors, (8814), 4667 states have internal predecessors, (8814), 0 states have call successors, (0), 0 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:58:26,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4668 states to 4668 states and 8814 transitions. [2024-11-10 00:58:26,728 INFO L78 Accepts]: Start accepts. Automaton has 4668 states and 8814 transitions. Word has length 102 [2024-11-10 00:58:26,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:58:26,728 INFO L471 AbstractCegarLoop]: Abstraction has 4668 states and 8814 transitions. [2024-11-10 00:58:26,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 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:58:26,729 INFO L276 IsEmpty]: Start isEmpty. Operand 4668 states and 8814 transitions. [2024-11-10 00:58:26,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-10 00:58:26,730 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:58:26,730 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:58:26,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-10 00:58:26,731 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:58:26,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:58:26,731 INFO L85 PathProgramCache]: Analyzing trace with hash 503630799, now seen corresponding path program 1 times [2024-11-10 00:58:26,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:58:26,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479265056] [2024-11-10 00:58:26,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:58:26,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:58:26,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:58:26,861 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:58:26,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:58:26,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479265056] [2024-11-10 00:58:26,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479265056] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:58:26,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:58:26,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:58:26,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540857682] [2024-11-10 00:58:26,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:58:26,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:58:26,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:58:26,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:58:26,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:58:26,864 INFO L87 Difference]: Start difference. First operand 4668 states and 8814 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 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:58:26,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:58:26,925 INFO L93 Difference]: Finished difference Result 5844 states and 10393 transitions. [2024-11-10 00:58:26,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:58:26,925 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 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 104 [2024-11-10 00:58:26,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:58:26,933 INFO L225 Difference]: With dead ends: 5844 [2024-11-10 00:58:26,933 INFO L226 Difference]: Without dead ends: 3501 [2024-11-10 00:58:26,936 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:58:26,937 INFO L432 NwaCegarLoop]: 2262 mSDtfsCounter, 37 mSDsluCounter, 2195 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 4457 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:58:26,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 4457 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:58:26,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3501 states. [2024-11-10 00:58:27,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3501 to 3498. [2024-11-10 00:58:27,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3498 states, 3496 states have (on average 2.066361556064073) internal successors, (7224), 3497 states have internal predecessors, (7224), 0 states have call successors, (0), 0 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:58:27,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3498 states to 3498 states and 7224 transitions. [2024-11-10 00:58:27,035 INFO L78 Accepts]: Start accepts. Automaton has 3498 states and 7224 transitions. Word has length 104 [2024-11-10 00:58:27,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:58:27,036 INFO L471 AbstractCegarLoop]: Abstraction has 3498 states and 7224 transitions. [2024-11-10 00:58:27,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 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:58:27,040 INFO L276 IsEmpty]: Start isEmpty. Operand 3498 states and 7224 transitions. [2024-11-10 00:58:27,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-10 00:58:27,042 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:58:27,042 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:58:27,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-10 00:58:27,042 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:58:27,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:58:27,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1015442314, now seen corresponding path program 1 times [2024-11-10 00:58:27,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:58:27,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993486982] [2024-11-10 00:58:27,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:58:27,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:58:27,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:58:27,562 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:58:27,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:58:27,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993486982] [2024-11-10 00:58:27,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993486982] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:58:27,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1272395323] [2024-11-10 00:58:27,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:58:27,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:58:27,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:58:27,565 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:58:27,567 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:58:27,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:58:27,773 INFO L255 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-10 00:58:27,780 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:58:28,482 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:58:28,482 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:58:29,860 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:58:29,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1272395323] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:58:29,860 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:58:29,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2024-11-10 00:58:29,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602456672] [2024-11-10 00:58:29,861 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:58:29,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-10 00:58:29,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:58:29,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-10 00:58:29,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2024-11-10 00:58:29,864 INFO L87 Difference]: Start difference. First operand 3498 states and 7224 transitions. Second operand has 25 states, 25 states have (on average 11.68) internal successors, (292), 24 states have internal predecessors, (292), 0 states have call successors, (0), 0 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:58:31,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:58:31,540 INFO L93 Difference]: Finished difference Result 8499 states and 13898 transitions. [2024-11-10 00:58:31,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-10 00:58:31,541 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 11.68) internal successors, (292), 24 states have internal predecessors, (292), 0 states have call successors, (0), 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 106 [2024-11-10 00:58:31,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:58:31,553 INFO L225 Difference]: With dead ends: 8499 [2024-11-10 00:58:31,553 INFO L226 Difference]: Without dead ends: 7326 [2024-11-10 00:58:31,557 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 625 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=611, Invalid=2469, Unknown=0, NotChecked=0, Total=3080 [2024-11-10 00:58:31,557 INFO L432 NwaCegarLoop]: 2213 mSDtfsCounter, 25193 mSDsluCounter, 11662 mSDsCounter, 0 mSdLazyCounter, 971 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25193 SdHoareTripleChecker+Valid, 13875 SdHoareTripleChecker+Invalid, 997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 971 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 00:58:31,558 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25193 Valid, 13875 Invalid, 997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 971 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 00:58:31,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7326 states. [2024-11-10 00:58:31,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7326 to 7248. [2024-11-10 00:58:31,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7248 states, 7246 states have (on average 1.6676787192934033) internal successors, (12084), 7247 states have internal predecessors, (12084), 0 states have call successors, (0), 0 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:58:31,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7248 states to 7248 states and 12084 transitions. [2024-11-10 00:58:31,746 INFO L78 Accepts]: Start accepts. Automaton has 7248 states and 12084 transitions. Word has length 106 [2024-11-10 00:58:31,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:58:31,746 INFO L471 AbstractCegarLoop]: Abstraction has 7248 states and 12084 transitions. [2024-11-10 00:58:31,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 11.68) internal successors, (292), 24 states have internal predecessors, (292), 0 states have call successors, (0), 0 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:58:31,747 INFO L276 IsEmpty]: Start isEmpty. Operand 7248 states and 12084 transitions. [2024-11-10 00:58:31,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-10 00:58:31,748 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:58:31,749 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:58:31,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-10 00:58:31,949 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,SelfDestructingSolverStorable25 [2024-11-10 00:58:31,950 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:58:31,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:58:31,950 INFO L85 PathProgramCache]: Analyzing trace with hash -261752906, now seen corresponding path program 1 times [2024-11-10 00:58:31,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:58:31,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622214742] [2024-11-10 00:58:31,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:58:31,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:58:31,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:58:32,850 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:58:32,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:58:32,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622214742] [2024-11-10 00:58:32,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622214742] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:58:32,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1046713306] [2024-11-10 00:58:32,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:58:32,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:58:32,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:58:32,853 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:58:32,855 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:58:33,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:58:33,021 INFO L255 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-10 00:58:33,023 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:58:33,472 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:58:33,472 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:58:34,275 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:58:34,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1046713306] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:58:34,275 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:58:34,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 27 [2024-11-10 00:58:34,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625731911] [2024-11-10 00:58:34,275 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:58:34,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-10 00:58:34,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:58:34,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-10 00:58:34,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=662, Unknown=0, NotChecked=0, Total=756 [2024-11-10 00:58:34,277 INFO L87 Difference]: Start difference. First operand 7248 states and 12084 transitions. Second operand has 28 states, 28 states have (on average 10.0) internal successors, (280), 27 states have internal predecessors, (280), 0 states have call successors, (0), 0 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:58:36,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:58:36,906 INFO L93 Difference]: Finished difference Result 31989 states and 44738 transitions. [2024-11-10 00:58:36,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-11-10 00:58:36,907 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 10.0) internal successors, (280), 27 states have internal predecessors, (280), 0 states have call successors, (0), 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 106 [2024-11-10 00:58:36,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:58:36,941 INFO L225 Difference]: With dead ends: 31989 [2024-11-10 00:58:36,941 INFO L226 Difference]: Without dead ends: 27066 [2024-11-10 00:58:36,952 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 981 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=859, Invalid=3697, Unknown=0, NotChecked=0, Total=4556 [2024-11-10 00:58:36,952 INFO L432 NwaCegarLoop]: 2227 mSDtfsCounter, 25636 mSDsluCounter, 12109 mSDsCounter, 0 mSdLazyCounter, 1404 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25636 SdHoareTripleChecker+Valid, 14336 SdHoareTripleChecker+Invalid, 1438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 00:58:36,952 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25636 Valid, 14336 Invalid, 1438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1404 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 00:58:36,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27066 states. [2024-11-10 00:58:37,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27066 to 26808. [2024-11-10 00:58:37,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26808 states, 26806 states have (on average 1.390882638215325) internal successors, (37284), 26807 states have internal predecessors, (37284), 0 states have call successors, (0), 0 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:58:37,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26808 states to 26808 states and 37284 transitions. [2024-11-10 00:58:37,686 INFO L78 Accepts]: Start accepts. Automaton has 26808 states and 37284 transitions. Word has length 106 [2024-11-10 00:58:37,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:58:37,686 INFO L471 AbstractCegarLoop]: Abstraction has 26808 states and 37284 transitions. [2024-11-10 00:58:37,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 10.0) internal successors, (280), 27 states have internal predecessors, (280), 0 states have call successors, (0), 0 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:58:37,686 INFO L276 IsEmpty]: Start isEmpty. Operand 26808 states and 37284 transitions. [2024-11-10 00:58:37,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-10 00:58:37,690 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:58:37,690 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:58:37,703 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 00:58:37,891 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,SelfDestructingSolverStorable26 [2024-11-10 00:58:37,891 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:58:37,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:58:37,892 INFO L85 PathProgramCache]: Analyzing trace with hash 105713073, now seen corresponding path program 1 times [2024-11-10 00:58:37,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:58:37,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365378881] [2024-11-10 00:58:37,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:58:37,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:58:37,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:58:38,290 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:58:38,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:58:38,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365378881] [2024-11-10 00:58:38,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365378881] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:58:38,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [897498913] [2024-11-10 00:58:38,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:58:38,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:58:38,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:58:38,294 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:58:38,295 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:58:38,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:58:38,499 INFO L255 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-10 00:58:38,507 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:58:40,630 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:58:40,630 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:58:42,605 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:58:42,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [897498913] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:58:42,606 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:58:42,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15, 15] total 35 [2024-11-10 00:58:42,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599139140] [2024-11-10 00:58:42,607 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:58:42,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-10 00:58:42,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:58:42,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-10 00:58:42,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=1032, Unknown=0, NotChecked=0, Total=1260 [2024-11-10 00:58:42,609 INFO L87 Difference]: Start difference. First operand 26808 states and 37284 transitions. Second operand has 36 states, 36 states have (on average 7.555555555555555) internal successors, (272), 35 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)