./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.6.ufo.UNBOUNDED.pals+Problem12_label08.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.UNBOUNDED.pals+Problem12_label08.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 5661dd51a89476ec423182a94520e4ccb4afe3fa5cba3e5cadf7302b2a1362a5 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 00:59:09,217 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 00:59:09,309 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 00:59:09,313 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 00:59:09,315 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 00:59:09,343 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 00:59:09,343 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 00:59:09,344 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 00:59:09,344 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 00:59:09,344 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 00:59:09,345 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 00:59:09,345 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 00:59:09,345 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 00:59:09,346 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 00:59:09,347 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 00:59:09,348 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 00:59:09,349 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 00:59:09,352 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 00:59:09,352 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 00:59:09,353 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 00:59:09,353 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 00:59:09,353 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 00:59:09,353 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 00:59:09,354 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 00:59:09,354 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 00:59:09,354 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 00:59:09,354 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 00:59:09,354 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 00:59:09,355 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 00:59:09,355 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 00:59:09,355 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 00:59:09,355 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 00:59:09,355 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 00:59:09,356 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 00:59:09,356 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 00:59:09,356 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 00:59:09,356 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 00:59:09,356 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 00:59:09,357 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 00:59:09,357 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 00:59:09,358 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 00:59:09,359 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 00:59:09,360 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 -> 5661dd51a89476ec423182a94520e4ccb4afe3fa5cba3e5cadf7302b2a1362a5 [2024-11-10 00:59:09,652 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 00:59:09,680 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 00:59:09,684 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 00:59:09,685 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 00:59:09,685 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 00:59:09,689 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.6.ufo.UNBOUNDED.pals+Problem12_label08.c [2024-11-10 00:59:11,130 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 00:59:11,552 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 00:59:11,553 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.6.ufo.UNBOUNDED.pals+Problem12_label08.c [2024-11-10 00:59:11,592 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9a159ea3/910775eed3e4442099d67ef2566ce3b4/FLAGab68f17d1 [2024-11-10 00:59:11,608 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9a159ea3/910775eed3e4442099d67ef2566ce3b4 [2024-11-10 00:59:11,611 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 00:59:11,612 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 00:59:11,613 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 00:59:11,613 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 00:59:11,618 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 00:59:11,619 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:59:11" (1/1) ... [2024-11-10 00:59:11,620 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b78e0d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:59:11, skipping insertion in model container [2024-11-10 00:59:11,620 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:59:11" (1/1) ... [2024-11-10 00:59:11,738 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 00:59:12,034 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.UNBOUNDED.pals+Problem12_label08.c[15510,15523] [2024-11-10 00:59:12,071 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.UNBOUNDED.pals+Problem12_label08.c[19017,19030] [2024-11-10 00:59:12,788 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 00:59:12,799 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 00:59:12,883 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.UNBOUNDED.pals+Problem12_label08.c[15510,15523] [2024-11-10 00:59:12,893 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.UNBOUNDED.pals+Problem12_label08.c[19017,19030] [2024-11-10 00:59:13,263 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 00:59:13,297 INFO L204 MainTranslator]: Completed translation [2024-11-10 00:59:13,298 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:59:13 WrapperNode [2024-11-10 00:59:13,298 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 00:59:13,299 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 00:59:13,300 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 00:59:13,300 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 00:59:13,307 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:59:13" (1/1) ... [2024-11-10 00:59:13,364 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:59:13" (1/1) ... [2024-11-10 00:59:13,638 INFO L138 Inliner]: procedures = 38, calls = 23, calls flagged for inlining = 18, calls inlined = 18, statements flattened = 5155 [2024-11-10 00:59:13,638 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 00:59:13,639 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 00:59:13,639 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 00:59:13,639 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 00:59:13,650 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:59:13" (1/1) ... [2024-11-10 00:59:13,651 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:59:13" (1/1) ... [2024-11-10 00:59:13,815 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:59:13" (1/1) ... [2024-11-10 00:59:13,960 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:59:13,961 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:59:13" (1/1) ... [2024-11-10 00:59:13,961 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:59:13" (1/1) ... [2024-11-10 00:59:14,103 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:59:13" (1/1) ... [2024-11-10 00:59:14,124 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:59:13" (1/1) ... [2024-11-10 00:59:14,149 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:59:13" (1/1) ... [2024-11-10 00:59:14,169 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:59:13" (1/1) ... [2024-11-10 00:59:14,242 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 00:59:14,245 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 00:59:14,246 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 00:59:14,246 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 00:59:14,247 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:59:13" (1/1) ... [2024-11-10 00:59:14,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 00:59:14,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:59:14,280 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:59:14,283 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:59:14,400 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 00:59:14,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 00:59:14,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 00:59:14,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 00:59:14,617 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 00:59:14,620 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 00:59:20,557 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3685: havoc calculate_output2_#t~ret42#1; [2024-11-10 00:59:20,558 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L5175: havoc calculate_output3_#t~ret43#1; [2024-11-10 00:59:20,558 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2206: havoc calculate_output_#t~ret41#1; [2024-11-10 00:59:20,849 INFO L? ?]: Removed 2086 outVars from TransFormulas that were not future-live. [2024-11-10 00:59:20,850 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 00:59:20,893 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 00:59:20,893 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 00:59:20,894 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 12:59:20 BoogieIcfgContainer [2024-11-10 00:59:20,894 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 00:59:20,896 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 00:59:20,897 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 00:59:20,901 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 00:59:20,901 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 12:59:11" (1/3) ... [2024-11-10 00:59:20,902 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@af57443 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:59:20, skipping insertion in model container [2024-11-10 00:59:20,902 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:59:13" (2/3) ... [2024-11-10 00:59:20,902 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@af57443 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:59:20, skipping insertion in model container [2024-11-10 00:59:20,902 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 12:59:20" (3/3) ... [2024-11-10 00:59:20,903 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.ufo.UNBOUNDED.pals+Problem12_label08.c [2024-11-10 00:59:20,924 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 00:59:20,925 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-10 00:59:21,041 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 00:59:21,049 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;@4797bb19, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 00:59:21,050 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-10 00:59:21,064 INFO L276 IsEmpty]: Start isEmpty. Operand has 923 states, 920 states have (on average 2.635869565217391) internal successors, (2425), 922 states have internal predecessors, (2425), 0 states have call successors, (0), 0 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:59:21,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-10 00:59:21,076 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:59:21,077 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:59:21,078 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:59:21,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:59:21,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1166387314, now seen corresponding path program 1 times [2024-11-10 00:59:21,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:59:21,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627093544] [2024-11-10 00:59:21,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:59:21,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:59:21,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:59:21,363 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:59:21,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:59:21,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627093544] [2024-11-10 00:59:21,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627093544] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:59:21,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:59:21,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 00:59:21,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901539743] [2024-11-10 00:59:21,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:59:21,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 00:59:21,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:59:21,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 00:59:21,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 00:59:21,404 INFO L87 Difference]: Start difference. First operand has 923 states, 920 states have (on average 2.635869565217391) internal successors, (2425), 922 states have internal predecessors, (2425), 0 states have call successors, (0), 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:59:21,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:59:21,511 INFO L93 Difference]: Finished difference Result 1796 states and 4758 transitions. [2024-11-10 00:59:21,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 00:59:21,514 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:59:21,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:59:21,539 INFO L225 Difference]: With dead ends: 1796 [2024-11-10 00:59:21,539 INFO L226 Difference]: Without dead ends: 855 [2024-11-10 00:59:21,550 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:59:21,554 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:59:21,555 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:59:21,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2024-11-10 00:59:21,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 855. [2024-11-10 00:59:21,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 855 states, 853 states have (on average 2.6846424384525207) internal successors, (2290), 854 states have internal predecessors, (2290), 0 states have call successors, (0), 0 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:59:21,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 2290 transitions. [2024-11-10 00:59:21,654 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 2290 transitions. Word has length 28 [2024-11-10 00:59:21,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:59:21,654 INFO L471 AbstractCegarLoop]: Abstraction has 855 states and 2290 transitions. [2024-11-10 00:59:21,654 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:59:21,655 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 2290 transitions. [2024-11-10 00:59:21,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-10 00:59:21,656 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:59:21,656 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:59:21,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 00:59:21,657 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:59:21,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:59:21,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1090523693, now seen corresponding path program 1 times [2024-11-10 00:59:21,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:59:21,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366267717] [2024-11-10 00:59:21,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:59:21,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:59:21,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:59:21,959 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:59:21,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:59:21,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366267717] [2024-11-10 00:59:21,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366267717] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:59:21,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:59:21,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:59:21,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035024515] [2024-11-10 00:59:21,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:59:21,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:59:21,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:59:21,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:59:21,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:59:21,967 INFO L87 Difference]: Start difference. First operand 855 states and 2290 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:59:22,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:59:22,098 INFO L93 Difference]: Finished difference Result 912 states and 2377 transitions. [2024-11-10 00:59:22,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:59:22,099 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:59:22,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:59:22,104 INFO L225 Difference]: With dead ends: 912 [2024-11-10 00:59:22,104 INFO L226 Difference]: Without dead ends: 855 [2024-11-10 00:59:22,105 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:59:22,107 INFO L432 NwaCegarLoop]: 2288 mSDtfsCounter, 0 mSDsluCounter, 6819 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 9107 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:59:22,107 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 9107 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:59:22,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2024-11-10 00:59:22,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 855. [2024-11-10 00:59:22,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 855 states, 853 states have (on average 2.637749120750293) internal successors, (2250), 854 states have internal predecessors, (2250), 0 states have call successors, (0), 0 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:59:22,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 2250 transitions. [2024-11-10 00:59:22,140 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 2250 transitions. Word has length 28 [2024-11-10 00:59:22,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:59:22,141 INFO L471 AbstractCegarLoop]: Abstraction has 855 states and 2250 transitions. [2024-11-10 00:59:22,142 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:59:22,142 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 2250 transitions. [2024-11-10 00:59:22,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-10 00:59:22,143 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:59:22,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, 1, 1, 1, 1] [2024-11-10 00:59:22,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 00:59:22,144 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:59:22,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:59:22,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1115229612, now seen corresponding path program 1 times [2024-11-10 00:59:22,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:59:22,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203110691] [2024-11-10 00:59:22,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:59:22,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:59:22,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:59:22,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:59:22,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:59:22,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203110691] [2024-11-10 00:59:22,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203110691] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:59:22,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:59:22,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 00:59:22,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720429939] [2024-11-10 00:59:22,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:59:22,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:59:22,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:59:22,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:59:22,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:59:22,229 INFO L87 Difference]: Start difference. First operand 855 states and 2250 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:26,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:59:26,784 INFO L93 Difference]: Finished difference Result 2362 states and 6486 transitions. [2024-11-10 00:59:26,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:59:26,785 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-11-10 00:59:26,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:59:26,793 INFO L225 Difference]: With dead ends: 2362 [2024-11-10 00:59:26,794 INFO L226 Difference]: Without dead ends: 1607 [2024-11-10 00:59:26,795 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:59:26,798 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 1572 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 3800 mSolverCounterSat, 704 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1572 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 4504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 704 IncrementalHoareTripleChecker+Valid, 3800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-11-10 00:59:26,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1572 Valid, 219 Invalid, 4504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [704 Valid, 3800 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-11-10 00:59:26,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1607 states. [2024-11-10 00:59:26,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1607 to 1607. [2024-11-10 00:59:26,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1607 states, 1605 states have (on average 2.6791277258566977) internal successors, (4300), 1606 states have internal predecessors, (4300), 0 states have call successors, (0), 0 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:59:26,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1607 states to 1607 states and 4300 transitions. [2024-11-10 00:59:26,847 INFO L78 Accepts]: Start accepts. Automaton has 1607 states and 4300 transitions. Word has length 32 [2024-11-10 00:59:26,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:59:26,848 INFO L471 AbstractCegarLoop]: Abstraction has 1607 states and 4300 transitions. [2024-11-10 00:59:26,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:26,848 INFO L276 IsEmpty]: Start isEmpty. Operand 1607 states and 4300 transitions. [2024-11-10 00:59:26,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-10 00:59:26,852 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:59:26,852 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:59:26,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 00:59:26,853 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:59:26,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:59:26,853 INFO L85 PathProgramCache]: Analyzing trace with hash 165928225, now seen corresponding path program 1 times [2024-11-10 00:59:26,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:59:26,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660286451] [2024-11-10 00:59:26,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:59:26,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:59:26,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:59:27,108 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:59:27,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:59:27,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660286451] [2024-11-10 00:59:27,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660286451] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:59:27,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:59:27,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:59:27,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981771598] [2024-11-10 00:59:27,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:59:27,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 00:59:27,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:59:27,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 00:59:27,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:59:27,112 INFO L87 Difference]: Start difference. First operand 1607 states and 4300 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:59:27,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:59:27,433 INFO L93 Difference]: Finished difference Result 2243 states and 5296 transitions. [2024-11-10 00:59:27,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 00:59:27,434 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:59:27,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:59:27,444 INFO L225 Difference]: With dead ends: 2243 [2024-11-10 00:59:27,445 INFO L226 Difference]: Without dead ends: 2190 [2024-11-10 00:59:27,446 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:59:27,447 INFO L432 NwaCegarLoop]: 2244 mSDtfsCounter, 13988 mSDsluCounter, 1586 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13988 SdHoareTripleChecker+Valid, 3830 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:59:27,447 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13988 Valid, 3830 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:59:27,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2190 states. [2024-11-10 00:59:27,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2190 to 1657. [2024-11-10 00:59:27,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1657 states, 1655 states have (on average 2.6459214501510573) internal successors, (4379), 1656 states have internal predecessors, (4379), 0 states have call successors, (0), 0 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:59:27,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1657 states to 1657 states and 4379 transitions. [2024-11-10 00:59:27,539 INFO L78 Accepts]: Start accepts. Automaton has 1657 states and 4379 transitions. Word has length 67 [2024-11-10 00:59:27,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:59:27,540 INFO L471 AbstractCegarLoop]: Abstraction has 1657 states and 4379 transitions. [2024-11-10 00:59:27,541 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:59:27,541 INFO L276 IsEmpty]: Start isEmpty. Operand 1657 states and 4379 transitions. [2024-11-10 00:59:27,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-10 00:59:27,543 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:59:27,543 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:59:27,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 00:59:27,543 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:59:27,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:59:27,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1462372477, now seen corresponding path program 1 times [2024-11-10 00:59:27,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:59:27,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784174055] [2024-11-10 00:59:27,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:59:27,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:59:27,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:59:27,984 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:59:27,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:59:27,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784174055] [2024-11-10 00:59:27,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784174055] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:59:27,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:59:27,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:59:27,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034263828] [2024-11-10 00:59:27,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:59:27,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 00:59:27,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:59:27,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 00:59:27,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:59:27,987 INFO L87 Difference]: Start difference. First operand 1657 states and 4379 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:59:28,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:59:28,243 INFO L93 Difference]: Finished difference Result 1763 states and 4543 transitions. [2024-11-10 00:59:28,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 00:59:28,244 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:59:28,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:59:28,252 INFO L225 Difference]: With dead ends: 1763 [2024-11-10 00:59:28,253 INFO L226 Difference]: Without dead ends: 1660 [2024-11-10 00:59:28,253 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:59:28,255 INFO L432 NwaCegarLoop]: 2242 mSDtfsCounter, 4398 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4398 SdHoareTripleChecker+Valid, 2652 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:59:28,255 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4398 Valid, 2652 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:59:28,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1660 states. [2024-11-10 00:59:28,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1660 to 1657. [2024-11-10 00:59:28,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1657 states, 1655 states have (on average 2.6453172205438067) internal successors, (4378), 1656 states have internal predecessors, (4378), 0 states have call successors, (0), 0 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:59:28,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1657 states to 1657 states and 4378 transitions. [2024-11-10 00:59:28,294 INFO L78 Accepts]: Start accepts. Automaton has 1657 states and 4378 transitions. Word has length 69 [2024-11-10 00:59:28,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:59:28,296 INFO L471 AbstractCegarLoop]: Abstraction has 1657 states and 4378 transitions. [2024-11-10 00:59:28,296 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:59:28,296 INFO L276 IsEmpty]: Start isEmpty. Operand 1657 states and 4378 transitions. [2024-11-10 00:59:28,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-10 00:59:28,298 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:59:28,298 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:28,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 00:59:28,299 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:59:28,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:59:28,299 INFO L85 PathProgramCache]: Analyzing trace with hash -660054622, now seen corresponding path program 1 times [2024-11-10 00:59:28,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:59:28,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504903899] [2024-11-10 00:59:28,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:59:28,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:59:28,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:59:28,428 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:59:28,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:59:28,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504903899] [2024-11-10 00:59:28,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504903899] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:59:28,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:59:28,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:59:28,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88713653] [2024-11-10 00:59:28,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:59:28,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:59:28,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:59:28,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:59:28,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:59:28,430 INFO L87 Difference]: Start difference. First operand 1657 states and 4378 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:59:28,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:59:28,478 INFO L93 Difference]: Finished difference Result 1851 states and 4680 transitions. [2024-11-10 00:59:28,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:59:28,479 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:59:28,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:59:28,487 INFO L225 Difference]: With dead ends: 1851 [2024-11-10 00:59:28,487 INFO L226 Difference]: Without dead ends: 1748 [2024-11-10 00:59:28,488 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:59:28,489 INFO L432 NwaCegarLoop]: 2246 mSDtfsCounter, 2176 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2176 SdHoareTripleChecker+Valid, 2322 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:59:28,491 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2176 Valid, 2322 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:59:28,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1748 states. [2024-11-10 00:59:28,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1748 to 1743. [2024-11-10 00:59:28,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1743 states, 1741 states have (on average 2.5904652498564045) internal successors, (4510), 1742 states have internal predecessors, (4510), 0 states have call successors, (0), 0 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:59:28,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1743 states to 1743 states and 4510 transitions. [2024-11-10 00:59:28,534 INFO L78 Accepts]: Start accepts. Automaton has 1743 states and 4510 transitions. Word has length 70 [2024-11-10 00:59:28,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:59:28,535 INFO L471 AbstractCegarLoop]: Abstraction has 1743 states and 4510 transitions. [2024-11-10 00:59:28,536 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:59:28,536 INFO L276 IsEmpty]: Start isEmpty. Operand 1743 states and 4510 transitions. [2024-11-10 00:59:28,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-10 00:59:28,537 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:59:28,537 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:59:28,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 00:59:28,538 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:59:28,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:59:28,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1454056645, now seen corresponding path program 1 times [2024-11-10 00:59:28,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:59:28,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397381585] [2024-11-10 00:59:28,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:59:28,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:59:28,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:59:28,615 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:59:28,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:59:28,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397381585] [2024-11-10 00:59:28,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397381585] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:59:28,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:59:28,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:59:28,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385351258] [2024-11-10 00:59:28,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:59:28,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:59:28,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:59:28,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:59:28,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:59:28,618 INFO L87 Difference]: Start difference. First operand 1743 states and 4510 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:59:28,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:59:28,659 INFO L93 Difference]: Finished difference Result 2105 states and 5068 transitions. [2024-11-10 00:59:28,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:59:28,660 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:59:28,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:59:28,669 INFO L225 Difference]: With dead ends: 2105 [2024-11-10 00:59:28,670 INFO L226 Difference]: Without dead ends: 1916 [2024-11-10 00:59:28,670 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:59:28,671 INFO L432 NwaCegarLoop]: 2299 mSDtfsCounter, 2189 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2189 SdHoareTripleChecker+Valid, 2391 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:59:28,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2189 Valid, 2391 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:59:28,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1916 states. [2024-11-10 00:59:28,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1916 to 1913. [2024-11-10 00:59:28,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1913 states, 1911 states have (on average 2.4955520669806384) internal successors, (4769), 1912 states have internal predecessors, (4769), 0 states have call successors, (0), 0 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:59:28,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1913 states to 1913 states and 4769 transitions. [2024-11-10 00:59:28,720 INFO L78 Accepts]: Start accepts. Automaton has 1913 states and 4769 transitions. Word has length 71 [2024-11-10 00:59:28,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:59:28,720 INFO L471 AbstractCegarLoop]: Abstraction has 1913 states and 4769 transitions. [2024-11-10 00:59:28,720 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:59:28,721 INFO L276 IsEmpty]: Start isEmpty. Operand 1913 states and 4769 transitions. [2024-11-10 00:59:28,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-10 00:59:28,721 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:59:28,722 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:59:28,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 00:59:28,722 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:59:28,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:59:28,723 INFO L85 PathProgramCache]: Analyzing trace with hash 452646917, now seen corresponding path program 1 times [2024-11-10 00:59:28,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:59:28,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540442878] [2024-11-10 00:59:28,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:59:28,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:59:28,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:59:28,797 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:59:28,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:59:28,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540442878] [2024-11-10 00:59:28,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540442878] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:59:28,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:59:28,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:59:28,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266902336] [2024-11-10 00:59:28,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:59:28,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:59:28,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:59:28,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:59:28,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:59:28,802 INFO L87 Difference]: Start difference. First operand 1913 states and 4769 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:59:28,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:59:28,845 INFO L93 Difference]: Finished difference Result 2599 states and 5817 transitions. [2024-11-10 00:59:28,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:59:28,846 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:59:28,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:59:28,856 INFO L225 Difference]: With dead ends: 2599 [2024-11-10 00:59:28,857 INFO L226 Difference]: Without dead ends: 2240 [2024-11-10 00:59:28,858 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:59:28,859 INFO L432 NwaCegarLoop]: 2297 mSDtfsCounter, 2187 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2187 SdHoareTripleChecker+Valid, 2393 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:59:28,859 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2187 Valid, 2393 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:59:28,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2240 states. [2024-11-10 00:59:28,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2240 to 2237. [2024-11-10 00:59:28,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2237 states, 2235 states have (on average 2.3512304250559284) internal successors, (5255), 2236 states have internal predecessors, (5255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:28,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2237 states to 2237 states and 5255 transitions. [2024-11-10 00:59:28,920 INFO L78 Accepts]: Start accepts. Automaton has 2237 states and 5255 transitions. Word has length 71 [2024-11-10 00:59:28,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:59:28,920 INFO L471 AbstractCegarLoop]: Abstraction has 2237 states and 5255 transitions. [2024-11-10 00:59:28,920 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:59:28,920 INFO L276 IsEmpty]: Start isEmpty. Operand 2237 states and 5255 transitions. [2024-11-10 00:59:28,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-10 00:59:28,921 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:59:28,921 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:59:28,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 00:59:28,921 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:59:28,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:59:28,922 INFO L85 PathProgramCache]: Analyzing trace with hash 438197061, now seen corresponding path program 1 times [2024-11-10 00:59:28,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:59:28,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010831201] [2024-11-10 00:59:28,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:59:28,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:59:28,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:59:28,989 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:59:28,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:59:28,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010831201] [2024-11-10 00:59:28,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010831201] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:59:28,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:59:28,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:59:28,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617112205] [2024-11-10 00:59:28,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:59:28,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:59:28,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:59:28,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:59:28,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:59:28,994 INFO L87 Difference]: Start difference. First operand 2237 states and 5255 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:59:29,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:59:29,046 INFO L93 Difference]: Finished difference Result 3539 states and 7219 transitions. [2024-11-10 00:59:29,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:59:29,047 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:59:29,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:59:29,060 INFO L225 Difference]: With dead ends: 3539 [2024-11-10 00:59:29,061 INFO L226 Difference]: Without dead ends: 2856 [2024-11-10 00:59:29,062 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:59:29,063 INFO L432 NwaCegarLoop]: 2295 mSDtfsCounter, 2185 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2185 SdHoareTripleChecker+Valid, 2395 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:59:29,063 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2185 Valid, 2395 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:59:29,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2856 states. [2024-11-10 00:59:29,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2856 to 2853. [2024-11-10 00:59:29,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2853 states, 2851 states have (on average 2.161697649947387) internal successors, (6163), 2852 states have internal predecessors, (6163), 0 states have call successors, (0), 0 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:59:29,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2853 states to 2853 states and 6163 transitions. [2024-11-10 00:59:29,193 INFO L78 Accepts]: Start accepts. Automaton has 2853 states and 6163 transitions. Word has length 71 [2024-11-10 00:59:29,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:59:29,194 INFO L471 AbstractCegarLoop]: Abstraction has 2853 states and 6163 transitions. [2024-11-10 00:59:29,194 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:59:29,194 INFO L276 IsEmpty]: Start isEmpty. Operand 2853 states and 6163 transitions. [2024-11-10 00:59:29,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-10 00:59:29,196 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:59:29,196 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:59:29,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 00:59:29,199 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:59:29,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:59:29,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1765167483, now seen corresponding path program 1 times [2024-11-10 00:59:29,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:59:29,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530994255] [2024-11-10 00:59:29,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:59:29,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:59:29,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:59:29,279 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:59:29,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:59:29,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530994255] [2024-11-10 00:59:29,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530994255] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:59:29,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:59:29,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:59:29,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16484544] [2024-11-10 00:59:29,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:59:29,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:59:29,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:59:29,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:59:29,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:59:29,285 INFO L87 Difference]: Start difference. First operand 2853 states and 6163 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:59:29,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:59:29,373 INFO L93 Difference]: Finished difference Result 5323 states and 9831 transitions. [2024-11-10 00:59:29,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:59:29,374 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:59:29,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:59:29,401 INFO L225 Difference]: With dead ends: 5323 [2024-11-10 00:59:29,401 INFO L226 Difference]: Without dead ends: 4024 [2024-11-10 00:59:29,409 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:59:29,410 INFO L432 NwaCegarLoop]: 2293 mSDtfsCounter, 2183 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2183 SdHoareTripleChecker+Valid, 2397 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:59:29,411 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2183 Valid, 2397 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:59:29,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4024 states. [2024-11-10 00:59:29,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4024 to 4021. [2024-11-10 00:59:29,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4021 states, 4019 states have (on average 1.953471012689724) internal successors, (7851), 4020 states have internal predecessors, (7851), 0 states have call successors, (0), 0 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:59:29,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4021 states to 4021 states and 7851 transitions. [2024-11-10 00:59:29,556 INFO L78 Accepts]: Start accepts. Automaton has 4021 states and 7851 transitions. Word has length 71 [2024-11-10 00:59:29,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:59:29,556 INFO L471 AbstractCegarLoop]: Abstraction has 4021 states and 7851 transitions. [2024-11-10 00:59:29,556 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:59:29,557 INFO L276 IsEmpty]: Start isEmpty. Operand 4021 states and 7851 transitions. [2024-11-10 00:59:29,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-10 00:59:29,558 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:59:29,558 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:59:29,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 00:59:29,558 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:59:29,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:59:29,559 INFO L85 PathProgramCache]: Analyzing trace with hash 2005522758, now seen corresponding path program 1 times [2024-11-10 00:59:29,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:59:29,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158654960] [2024-11-10 00:59:29,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:59:29,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:59:29,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:59:29,847 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:59:29,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:59:29,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158654960] [2024-11-10 00:59:29,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158654960] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:59:29,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:59:29,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:59:29,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366707632] [2024-11-10 00:59:29,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:59:29,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 00:59:29,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:59:29,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 00:59:29,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:59:29,850 INFO L87 Difference]: Start difference. First operand 4021 states and 7851 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:59:30,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:59:30,000 INFO L93 Difference]: Finished difference Result 4120 states and 7981 transitions. [2024-11-10 00:59:30,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 00:59:30,001 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:59:30,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:59:30,012 INFO L225 Difference]: With dead ends: 4120 [2024-11-10 00:59:30,013 INFO L226 Difference]: Without dead ends: 4117 [2024-11-10 00:59:30,015 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:59:30,016 INFO L432 NwaCegarLoop]: 2244 mSDtfsCounter, 0 mSDsluCounter, 13451 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 15695 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:59:30,016 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 15695 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:59:30,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4117 states. [2024-11-10 00:59:30,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4117 to 4117. [2024-11-10 00:59:30,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4117 states, 4115 states have (on average 1.9273390036452005) internal successors, (7931), 4116 states have internal predecessors, (7931), 0 states have call successors, (0), 0 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:59:30,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4117 states to 4117 states and 7931 transitions. [2024-11-10 00:59:30,134 INFO L78 Accepts]: Start accepts. Automaton has 4117 states and 7931 transitions. Word has length 71 [2024-11-10 00:59:30,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:59:30,135 INFO L471 AbstractCegarLoop]: Abstraction has 4117 states and 7931 transitions. [2024-11-10 00:59:30,135 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:59:30,135 INFO L276 IsEmpty]: Start isEmpty. Operand 4117 states and 7931 transitions. [2024-11-10 00:59:30,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-10 00:59:30,136 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:59:30,137 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:59:30,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 00:59:30,137 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:59:30,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:59:30,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1736130949, now seen corresponding path program 1 times [2024-11-10 00:59:30,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:59:30,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302716784] [2024-11-10 00:59:30,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:59:30,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:59:30,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:59:30,194 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:59:30,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:59:30,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302716784] [2024-11-10 00:59:30,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302716784] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:59:30,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:59:30,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:59:30,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185644354] [2024-11-10 00:59:30,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:59:30,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:59:30,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:59:30,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:59:30,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:59:30,197 INFO L87 Difference]: Start difference. First operand 4117 states and 7931 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:59:30,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:59:30,297 INFO L93 Difference]: Finished difference Result 8987 states and 14911 transitions. [2024-11-10 00:59:30,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:59:30,298 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:59:30,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:59:30,314 INFO L225 Difference]: With dead ends: 8987 [2024-11-10 00:59:30,315 INFO L226 Difference]: Without dead ends: 6424 [2024-11-10 00:59:30,320 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:59:30,321 INFO L432 NwaCegarLoop]: 2309 mSDtfsCounter, 2191 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2191 SdHoareTripleChecker+Valid, 2397 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:59:30,321 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2191 Valid, 2397 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:59:30,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6424 states. [2024-11-10 00:59:30,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6424 to 6421. [2024-11-10 00:59:30,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6421 states, 6419 states have (on average 1.7340707275276523) internal successors, (11131), 6420 states have internal predecessors, (11131), 0 states have call successors, (0), 0 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:59:30,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6421 states to 6421 states and 11131 transitions. [2024-11-10 00:59:30,503 INFO L78 Accepts]: Start accepts. Automaton has 6421 states and 11131 transitions. Word has length 71 [2024-11-10 00:59:30,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:59:30,503 INFO L471 AbstractCegarLoop]: Abstraction has 6421 states and 11131 transitions. [2024-11-10 00:59:30,503 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:59:30,503 INFO L276 IsEmpty]: Start isEmpty. Operand 6421 states and 11131 transitions. [2024-11-10 00:59:30,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-10 00:59:30,504 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:59:30,504 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, 1, 1] [2024-11-10 00:59:30,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 00:59:30,505 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:59:30,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:59:30,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1729014533, now seen corresponding path program 1 times [2024-11-10 00:59:30,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:59:30,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827430768] [2024-11-10 00:59:30,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:59:30,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:59:30,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:59:30,570 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:59:30,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:59:30,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827430768] [2024-11-10 00:59:30,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827430768] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:59:30,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:59:30,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:59:30,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984399445] [2024-11-10 00:59:30,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:59:30,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:59:30,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:59:30,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:59:30,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:59:30,573 INFO L87 Difference]: Start difference. First operand 6421 states and 11131 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:30,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:59:30,773 INFO L93 Difference]: Finished difference Result 11551 states and 18500 transitions. [2024-11-10 00:59:30,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:59:30,774 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2024-11-10 00:59:30,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:59:30,791 INFO L225 Difference]: With dead ends: 11551 [2024-11-10 00:59:30,792 INFO L226 Difference]: Without dead ends: 8795 [2024-11-10 00:59:30,797 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:59:30,798 INFO L432 NwaCegarLoop]: 2314 mSDtfsCounter, 2190 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2190 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:59:30,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2190 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:59:30,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8795 states. [2024-11-10 00:59:30,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8795 to 8792. [2024-11-10 00:59:31,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8792 states, 8790 states have (on average 1.6416382252559727) internal successors, (14430), 8791 states have internal predecessors, (14430), 0 states have call successors, (0), 0 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:59:31,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8792 states to 8792 states and 14430 transitions. [2024-11-10 00:59:31,024 INFO L78 Accepts]: Start accepts. Automaton has 8792 states and 14430 transitions. Word has length 73 [2024-11-10 00:59:31,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:59:31,024 INFO L471 AbstractCegarLoop]: Abstraction has 8792 states and 14430 transitions. [2024-11-10 00:59:31,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:31,025 INFO L276 IsEmpty]: Start isEmpty. Operand 8792 states and 14430 transitions. [2024-11-10 00:59:31,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-10 00:59:31,027 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:59:31,028 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:59:31,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 00:59:31,028 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:59:31,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:59:31,029 INFO L85 PathProgramCache]: Analyzing trace with hash 8683955, now seen corresponding path program 1 times [2024-11-10 00:59:31,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:59:31,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360635589] [2024-11-10 00:59:31,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:59:31,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:59:31,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:59:31,232 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:59:31,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:59:31,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360635589] [2024-11-10 00:59:31,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360635589] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:59:31,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:59:31,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:59:31,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463605386] [2024-11-10 00:59:31,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:59:31,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 00:59:31,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:59:31,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 00:59:31,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:59:31,234 INFO L87 Difference]: Start difference. First operand 8792 states and 14430 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:59:32,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:59:32,123 INFO L93 Difference]: Finished difference Result 53741 states and 77772 transitions. [2024-11-10 00:59:32,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 00:59:32,124 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:59:32,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:59:32,220 INFO L225 Difference]: With dead ends: 53741 [2024-11-10 00:59:32,220 INFO L226 Difference]: Without dead ends: 46506 [2024-11-10 00:59:32,242 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:59:32,243 INFO L432 NwaCegarLoop]: 2332 mSDtfsCounter, 11542 mSDsluCounter, 2965 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11542 SdHoareTripleChecker+Valid, 5297 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:59:32,244 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11542 Valid, 5297 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:59:32,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46506 states. [2024-11-10 00:59:32,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46506 to 16024. [2024-11-10 00:59:32,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16024 states, 16022 states have (on average 1.5317688178754212) internal successors, (24542), 16023 states have internal predecessors, (24542), 0 states have call successors, (0), 0 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:59:32,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16024 states to 16024 states and 24542 transitions. [2024-11-10 00:59:32,903 INFO L78 Accepts]: Start accepts. Automaton has 16024 states and 24542 transitions. Word has length 94 [2024-11-10 00:59:32,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:59:32,903 INFO L471 AbstractCegarLoop]: Abstraction has 16024 states and 24542 transitions. [2024-11-10 00:59:32,903 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:59:32,903 INFO L276 IsEmpty]: Start isEmpty. Operand 16024 states and 24542 transitions. [2024-11-10 00:59:32,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-10 00:59:32,908 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:59:32,908 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:59:32,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 00:59:32,908 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:59:32,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:59:32,909 INFO L85 PathProgramCache]: Analyzing trace with hash -992725773, now seen corresponding path program 1 times [2024-11-10 00:59:32,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:59:32,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933638589] [2024-11-10 00:59:32,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:59:32,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:59:32,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:59:33,213 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:59:33,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:59:33,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933638589] [2024-11-10 00:59:33,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933638589] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:59:33,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:59:33,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:59:33,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253323247] [2024-11-10 00:59:33,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:59:33,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 00:59:33,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:59:33,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 00:59:33,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:59:33,216 INFO L87 Difference]: Start difference. First operand 16024 states and 24542 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:59:34,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:59:34,191 INFO L93 Difference]: Finished difference Result 60973 states and 87884 transitions. [2024-11-10 00:59:34,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 00:59:34,192 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:59:34,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:59:34,304 INFO L225 Difference]: With dead ends: 60973 [2024-11-10 00:59:34,304 INFO L226 Difference]: Without dead ends: 53738 [2024-11-10 00:59:34,326 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:59:34,327 INFO L432 NwaCegarLoop]: 2328 mSDtfsCounter, 11593 mSDsluCounter, 2887 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11593 SdHoareTripleChecker+Valid, 5215 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:59:34,327 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11593 Valid, 5215 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:59:34,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53738 states. [2024-11-10 00:59:35,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53738 to 26904. [2024-11-10 00:59:35,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26904 states, 26902 states have (on average 1.4737194260649766) internal successors, (39646), 26903 states have internal predecessors, (39646), 0 states have call successors, (0), 0 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:59:35,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26904 states to 26904 states and 39646 transitions. [2024-11-10 00:59:35,371 INFO L78 Accepts]: Start accepts. Automaton has 26904 states and 39646 transitions. Word has length 94 [2024-11-10 00:59:35,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:59:35,372 INFO L471 AbstractCegarLoop]: Abstraction has 26904 states and 39646 transitions. [2024-11-10 00:59:35,372 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:59:35,372 INFO L276 IsEmpty]: Start isEmpty. Operand 26904 states and 39646 transitions. [2024-11-10 00:59:35,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-10 00:59:35,376 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:59:35,376 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:59:35,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 00:59:35,377 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:59:35,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:59:35,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1007175629, now seen corresponding path program 1 times [2024-11-10 00:59:35,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:59:35,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397706546] [2024-11-10 00:59:35,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:59:35,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:59:35,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:59:35,682 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:59:35,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:59:35,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397706546] [2024-11-10 00:59:35,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397706546] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:59:35,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:59:35,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:59:35,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551988648] [2024-11-10 00:59:35,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:59:35,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 00:59:35,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:59:35,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 00:59:35,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:59:35,686 INFO L87 Difference]: Start difference. First operand 26904 states and 39646 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:59:36,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:59:36,549 INFO L93 Difference]: Finished difference Result 68205 states and 97996 transitions. [2024-11-10 00:59:36,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 00:59:36,550 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:59:36,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:59:36,650 INFO L225 Difference]: With dead ends: 68205 [2024-11-10 00:59:36,651 INFO L226 Difference]: Without dead ends: 60970 [2024-11-10 00:59:36,683 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:59:36,683 INFO L432 NwaCegarLoop]: 2324 mSDtfsCounter, 11645 mSDsluCounter, 2892 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11645 SdHoareTripleChecker+Valid, 5216 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:59:36,684 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11645 Valid, 5216 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:59:36,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60970 states. [2024-11-10 00:59:37,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60970 to 34136. [2024-11-10 00:59:37,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34136 states, 34134 states have (on average 1.4577254350500968) internal successors, (49758), 34135 states have internal predecessors, (49758), 0 states have call successors, (0), 0 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:59:37,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34136 states to 34136 states and 49758 transitions. [2024-11-10 00:59:37,717 INFO L78 Accepts]: Start accepts. Automaton has 34136 states and 49758 transitions. Word has length 94 [2024-11-10 00:59:37,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:59:37,718 INFO L471 AbstractCegarLoop]: Abstraction has 34136 states and 49758 transitions. [2024-11-10 00:59:37,718 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:59:37,718 INFO L276 IsEmpty]: Start isEmpty. Operand 34136 states and 49758 transitions. [2024-11-10 00:59:37,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-10 00:59:37,727 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:59:37,727 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:59:37,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 00:59:37,728 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:59:37,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:59:37,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1084427123, now seen corresponding path program 1 times [2024-11-10 00:59:37,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:59:37,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46157733] [2024-11-10 00:59:37,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:59:37,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:59:37,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:59:37,963 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:59:37,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:59:37,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46157733] [2024-11-10 00:59:37,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46157733] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:59:37,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:59:37,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:59:37,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287577418] [2024-11-10 00:59:37,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:59:37,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 00:59:37,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:59:37,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 00:59:37,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:59:37,966 INFO L87 Difference]: Start difference. First operand 34136 states and 49758 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:59:39,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:59:39,230 INFO L93 Difference]: Finished difference Result 75437 states and 108108 transitions. [2024-11-10 00:59:39,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 00:59:39,230 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:59:39,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:59:39,342 INFO L225 Difference]: With dead ends: 75437 [2024-11-10 00:59:39,342 INFO L226 Difference]: Without dead ends: 68202 [2024-11-10 00:59:39,384 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:59:39,384 INFO L432 NwaCegarLoop]: 2333 mSDtfsCounter, 11542 mSDsluCounter, 2990 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11542 SdHoareTripleChecker+Valid, 5323 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:59:39,385 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11542 Valid, 5323 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:59:39,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68202 states. [2024-11-10 00:59:40,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68202 to 41368. [2024-11-10 00:59:40,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41368 states, 41366 states have (on average 1.4473238891843543) internal successors, (59870), 41367 states have internal predecessors, (59870), 0 states have call successors, (0), 0 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:59:40,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41368 states to 41368 states and 59870 transitions. [2024-11-10 00:59:40,847 INFO L78 Accepts]: Start accepts. Automaton has 41368 states and 59870 transitions. Word has length 94 [2024-11-10 00:59:40,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:59:40,847 INFO L471 AbstractCegarLoop]: Abstraction has 41368 states and 59870 transitions. [2024-11-10 00:59:40,848 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:59:40,848 INFO L276 IsEmpty]: Start isEmpty. Operand 41368 states and 59870 transitions. [2024-11-10 00:59:40,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-10 00:59:40,853 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:59:40,853 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:59:40,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 00:59:40,854 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:59:40,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:59:40,855 INFO L85 PathProgramCache]: Analyzing trace with hash 290758259, now seen corresponding path program 1 times [2024-11-10 00:59:40,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:59:40,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296341023] [2024-11-10 00:59:40,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:59:40,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:59:40,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:59:41,084 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:59:41,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:59:41,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296341023] [2024-11-10 00:59:41,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296341023] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:59:41,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:59:41,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:59:41,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937350312] [2024-11-10 00:59:41,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:59:41,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 00:59:41,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:59:41,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 00:59:41,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:59:41,088 INFO L87 Difference]: Start difference. First operand 41368 states and 59870 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:59:42,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:59:42,379 INFO L93 Difference]: Finished difference Result 82669 states and 118220 transitions. [2024-11-10 00:59:42,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 00:59:42,380 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:59:42,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:59:42,470 INFO L225 Difference]: With dead ends: 82669 [2024-11-10 00:59:42,470 INFO L226 Difference]: Without dead ends: 75434 [2024-11-10 00:59:42,492 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:59:42,492 INFO L432 NwaCegarLoop]: 2333 mSDtfsCounter, 11483 mSDsluCounter, 3117 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11483 SdHoareTripleChecker+Valid, 5450 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 00:59:42,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11483 Valid, 5450 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 00:59:42,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75434 states. [2024-11-10 00:59:43,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75434 to 48600. [2024-11-10 00:59:43,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48600 states, 48598 states have (on average 1.4400181077410592) internal successors, (69982), 48599 states have internal predecessors, (69982), 0 states have call successors, (0), 0 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:59:43,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48600 states to 48600 states and 69982 transitions. [2024-11-10 00:59:43,682 INFO L78 Accepts]: Start accepts. Automaton has 48600 states and 69982 transitions. Word has length 94 [2024-11-10 00:59:43,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:59:43,682 INFO L471 AbstractCegarLoop]: Abstraction has 48600 states and 69982 transitions. [2024-11-10 00:59:43,683 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:59:43,683 INFO L276 IsEmpty]: Start isEmpty. Operand 48600 states and 69982 transitions. [2024-11-10 00:59:43,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-10 00:59:43,689 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:59:43,689 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:59:43,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 00:59:43,690 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:59:43,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:59:43,690 INFO L85 PathProgramCache]: Analyzing trace with hash 2044706709, now seen corresponding path program 1 times [2024-11-10 00:59:43,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:59:43,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536925206] [2024-11-10 00:59:43,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:59:43,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:59:43,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:59:43,798 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:59:43,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:59:43,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536925206] [2024-11-10 00:59:43,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536925206] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:59:43,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:59:43,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:59:43,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850469895] [2024-11-10 00:59:43,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:59:43,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:59:43,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:59:43,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:59:43,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:59:43,800 INFO L87 Difference]: Start difference. First operand 48600 states and 69982 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:59:45,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:59:45,002 INFO L93 Difference]: Finished difference Result 81910 states and 117019 transitions. [2024-11-10 00:59:45,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:59:45,003 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:59:45,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:59:45,057 INFO L225 Difference]: With dead ends: 81910 [2024-11-10 00:59:45,057 INFO L226 Difference]: Without dead ends: 34867 [2024-11-10 00:59:45,091 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:59:45,092 INFO L432 NwaCegarLoop]: 2300 mSDtfsCounter, 59 mSDsluCounter, 2235 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 4535 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:59:45,093 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 4535 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:59:45,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34867 states. [2024-11-10 00:59:45,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34867 to 34864. [2024-11-10 00:59:45,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34864 states, 34862 states have (on average 1.4582640123917159) internal successors, (50838), 34863 states have internal predecessors, (50838), 0 states have call successors, (0), 0 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:59:45,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34864 states to 34864 states and 50838 transitions. [2024-11-10 00:59:45,905 INFO L78 Accepts]: Start accepts. Automaton has 34864 states and 50838 transitions. Word has length 96 [2024-11-10 00:59:45,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:59:45,905 INFO L471 AbstractCegarLoop]: Abstraction has 34864 states and 50838 transitions. [2024-11-10 00:59:45,905 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:59:45,906 INFO L276 IsEmpty]: Start isEmpty. Operand 34864 states and 50838 transitions. [2024-11-10 00:59:45,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-10 00:59:45,908 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:59:45,908 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, 1, 1] [2024-11-10 00:59:45,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 00:59:45,909 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:59:45,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:59:45,909 INFO L85 PathProgramCache]: Analyzing trace with hash 296051, now seen corresponding path program 1 times [2024-11-10 00:59:45,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:59:45,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782475584] [2024-11-10 00:59:45,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:59:45,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:59:45,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:59:46,093 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:59:46,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:59:46,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782475584] [2024-11-10 00:59:46,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782475584] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:59:46,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:59:46,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:59:46,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111931063] [2024-11-10 00:59:46,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:59:46,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 00:59:46,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:59:46,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 00:59:46,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:59:46,096 INFO L87 Difference]: Start difference. First operand 34864 states and 50838 transitions. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 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:59:47,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:59:47,449 INFO L93 Difference]: Finished difference Result 65605 states and 94244 transitions. [2024-11-10 00:59:47,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 00:59:47,450 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 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:59:47,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:59:47,520 INFO L225 Difference]: With dead ends: 65605 [2024-11-10 00:59:47,520 INFO L226 Difference]: Without dead ends: 60482 [2024-11-10 00:59:47,531 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-11-10 00:59:47,533 INFO L432 NwaCegarLoop]: 2321 mSDtfsCounter, 11508 mSDsluCounter, 3069 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11508 SdHoareTripleChecker+Valid, 5390 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:59:47,533 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11508 Valid, 5390 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:59:47,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60482 states. [2024-11-10 00:59:48,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60482 to 39984. [2024-11-10 00:59:48,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39984 states, 39982 states have (on average 1.4508028612875794) internal successors, (58006), 39983 states have internal predecessors, (58006), 0 states have call successors, (0), 0 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:59:48,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39984 states to 39984 states and 58006 transitions. [2024-11-10 00:59:48,547 INFO L78 Accepts]: Start accepts. Automaton has 39984 states and 58006 transitions. Word has length 96 [2024-11-10 00:59:48,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:59:48,547 INFO L471 AbstractCegarLoop]: Abstraction has 39984 states and 58006 transitions. [2024-11-10 00:59:48,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 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:59:48,547 INFO L276 IsEmpty]: Start isEmpty. Operand 39984 states and 58006 transitions. [2024-11-10 00:59:48,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-10 00:59:48,551 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:59:48,551 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-10 00:59:48,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-10 00:59:48,551 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:59:48,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:59:48,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1619556455, now seen corresponding path program 1 times [2024-11-10 00:59:48,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:59:48,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039473950] [2024-11-10 00:59:48,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:59:48,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:59:48,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:59:48,669 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:59:48,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:59:48,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039473950] [2024-11-10 00:59:48,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039473950] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:59:48,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:59:48,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 00:59:48,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272121339] [2024-11-10 00:59:48,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:59:48,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:59:48,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:59:48,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:59:48,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:59:48,671 INFO L87 Difference]: Start difference. First operand 39984 states and 58006 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 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:59:53,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:59:53,519 INFO L93 Difference]: Finished difference Result 42995 states and 66342 transitions. [2024-11-10 00:59:53,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:59:53,520 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 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:59:53,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:59:53,566 INFO L225 Difference]: With dead ends: 42995 [2024-11-10 00:59:53,566 INFO L226 Difference]: Without dead ends: 41488 [2024-11-10 00:59:53,574 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:59:53,575 INFO L432 NwaCegarLoop]: 599 mSDtfsCounter, 1542 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 3621 mSolverCounterSat, 652 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1542 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 4273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 652 IncrementalHoareTripleChecker+Valid, 3621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-11-10 00:59:53,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1542 Valid, 608 Invalid, 4273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [652 Valid, 3621 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-11-10 00:59:53,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41488 states. [2024-11-10 00:59:54,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41488 to 41488. [2024-11-10 00:59:54,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41488 states, 41486 states have (on average 1.4776551125680952) internal successors, (61302), 41487 states have internal predecessors, (61302), 0 states have call successors, (0), 0 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:59:54,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41488 states to 41488 states and 61302 transitions. [2024-11-10 00:59:54,479 INFO L78 Accepts]: Start accepts. Automaton has 41488 states and 61302 transitions. Word has length 98 [2024-11-10 00:59:54,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:59:54,479 INFO L471 AbstractCegarLoop]: Abstraction has 41488 states and 61302 transitions. [2024-11-10 00:59:54,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 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:59:54,479 INFO L276 IsEmpty]: Start isEmpty. Operand 41488 states and 61302 transitions. [2024-11-10 00:59:54,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-10 00:59:54,483 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:59:54,483 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, 1, 1] [2024-11-10 00:59:54,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-10 00:59:54,484 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:59:54,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:59:54,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1721101739, now seen corresponding path program 1 times [2024-11-10 00:59:54,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:59:54,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254405710] [2024-11-10 00:59:54,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:59:54,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:59:54,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:59:54,596 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:59:54,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:59:54,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254405710] [2024-11-10 00:59:54,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254405710] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:59:54,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:59:54,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:59:54,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645224815] [2024-11-10 00:59:54,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:59:54,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:59:54,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:59:54,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:59:54,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:59:54,599 INFO L87 Difference]: Start difference. First operand 41488 states and 61302 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:59:55,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:59:55,092 INFO L93 Difference]: Finished difference Result 60694 states and 88186 transitions. [2024-11-10 00:59:55,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:59:55,092 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:59:55,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:59:55,118 INFO L225 Difference]: With dead ends: 60694 [2024-11-10 00:59:55,118 INFO L226 Difference]: Without dead ends: 22291 [2024-11-10 00:59:55,144 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:59:55,144 INFO L432 NwaCegarLoop]: 2293 mSDtfsCounter, 52 mSDsluCounter, 2227 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 4520 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:59:55,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 4520 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:59:55,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22291 states. [2024-11-10 00:59:55,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22291 to 22288. [2024-11-10 00:59:55,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22288 states, 22286 states have (on average 1.5337880283586107) internal successors, (34182), 22287 states have internal predecessors, (34182), 0 states have call successors, (0), 0 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:59:55,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22288 states to 22288 states and 34182 transitions. [2024-11-10 00:59:55,863 INFO L78 Accepts]: Start accepts. Automaton has 22288 states and 34182 transitions. Word has length 98 [2024-11-10 00:59:55,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:59:55,863 INFO L471 AbstractCegarLoop]: Abstraction has 22288 states and 34182 transitions. [2024-11-10 00:59:55,863 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:59:55,863 INFO L276 IsEmpty]: Start isEmpty. Operand 22288 states and 34182 transitions. [2024-11-10 00:59:55,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-10 00:59:55,867 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:59:55,867 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, 1, 1] [2024-11-10 00:59:55,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-10 00:59:55,868 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:59:55,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:59:55,868 INFO L85 PathProgramCache]: Analyzing trace with hash -2089553961, now seen corresponding path program 1 times [2024-11-10 00:59:55,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:59:55,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258972370] [2024-11-10 00:59:55,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:59:55,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:59:55,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:59:56,003 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:59:56,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:59:56,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258972370] [2024-11-10 00:59:56,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258972370] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:59:56,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:59:56,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:59:56,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254887378] [2024-11-10 00:59:56,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:59:56,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:59:56,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:59:56,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:59:56,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:59:56,006 INFO L87 Difference]: Start difference. First operand 22288 states and 34182 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:59:56,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:59:56,514 INFO L93 Difference]: Finished difference Result 31894 states and 47506 transitions. [2024-11-10 00:59:56,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:59:56,515 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:59:56,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:59:56,535 INFO L225 Difference]: With dead ends: 31894 [2024-11-10 00:59:56,535 INFO L226 Difference]: Without dead ends: 12691 [2024-11-10 00:59:56,547 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:59:56,547 INFO L432 NwaCegarLoop]: 2286 mSDtfsCounter, 47 mSDsluCounter, 2219 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 4505 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:59:56,547 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 4505 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:59:56,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12691 states. [2024-11-10 00:59:56,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12691 to 12688. [2024-11-10 00:59:56,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12688 states, 12686 states have (on average 1.6350307425508435) internal successors, (20742), 12687 states have internal predecessors, (20742), 0 states have call successors, (0), 0 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:59:56,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12688 states to 12688 states and 20742 transitions. [2024-11-10 00:59:56,779 INFO L78 Accepts]: Start accepts. Automaton has 12688 states and 20742 transitions. Word has length 100 [2024-11-10 00:59:56,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:59:56,779 INFO L471 AbstractCegarLoop]: Abstraction has 12688 states and 20742 transitions. [2024-11-10 00:59:56,780 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:59:56,780 INFO L276 IsEmpty]: Start isEmpty. Operand 12688 states and 20742 transitions. [2024-11-10 00:59:56,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-10 00:59:56,781 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:59:56,782 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, 1, 1] [2024-11-10 00:59:56,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-10 00:59:56,782 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:59:56,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:59:56,782 INFO L85 PathProgramCache]: Analyzing trace with hash -2047755810, now seen corresponding path program 1 times [2024-11-10 00:59:56,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:59:56,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791145520] [2024-11-10 00:59:56,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:59:56,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:59:56,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:59:56,881 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:59:56,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:59:56,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791145520] [2024-11-10 00:59:56,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791145520] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:59:56,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:59:56,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:59:56,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202491216] [2024-11-10 00:59:56,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:59:56,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:59:56,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:59:56,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:59:56,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:59:56,884 INFO L87 Difference]: Start difference. First operand 12688 states and 20742 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:59:57,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:59:57,027 INFO L93 Difference]: Finished difference Result 17494 states and 27346 transitions. [2024-11-10 00:59:57,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:59:57,027 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:59:57,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:59:57,040 INFO L225 Difference]: With dead ends: 17494 [2024-11-10 00:59:57,040 INFO L226 Difference]: Without dead ends: 7891 [2024-11-10 00:59:57,049 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:59:57,050 INFO L432 NwaCegarLoop]: 2279 mSDtfsCounter, 44 mSDsluCounter, 2211 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 4490 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:59:57,051 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 4490 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:59:57,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7891 states. [2024-11-10 00:59:57,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7891 to 7888. [2024-11-10 00:59:57,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7888 states, 7886 states have (on average 1.7856961704286076) internal successors, (14082), 7887 states have internal predecessors, (14082), 0 states have call successors, (0), 0 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:59:57,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7888 states to 7888 states and 14082 transitions. [2024-11-10 00:59:57,312 INFO L78 Accepts]: Start accepts. Automaton has 7888 states and 14082 transitions. Word has length 102 [2024-11-10 00:59:57,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:59:57,312 INFO L471 AbstractCegarLoop]: Abstraction has 7888 states and 14082 transitions. [2024-11-10 00:59:57,312 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:59:57,312 INFO L276 IsEmpty]: Start isEmpty. Operand 7888 states and 14082 transitions. [2024-11-10 00:59:57,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-10 00:59:57,313 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:59:57,313 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, 1, 1] [2024-11-10 00:59:57,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-10 00:59:57,314 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:59:57,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:59:57,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1649296645, now seen corresponding path program 1 times [2024-11-10 00:59:57,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:59:57,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506883930] [2024-11-10 00:59:57,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:59:57,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:59:57,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:59:57,412 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:59:57,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:59:57,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506883930] [2024-11-10 00:59:57,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506883930] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:59:57,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:59:57,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:59:57,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490357227] [2024-11-10 00:59:57,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:59:57,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:59:57,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:59:57,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:59:57,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:59:57,415 INFO L87 Difference]: Start difference. First operand 7888 states and 14082 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:59:57,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:59:57,505 INFO L93 Difference]: Finished difference Result 10294 states and 17356 transitions. [2024-11-10 00:59:57,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:59:57,506 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:59:57,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:59:57,517 INFO L225 Difference]: With dead ends: 10294 [2024-11-10 00:59:57,517 INFO L226 Difference]: Without dead ends: 5491 [2024-11-10 00:59:57,522 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:59:57,522 INFO L432 NwaCegarLoop]: 2272 mSDtfsCounter, 41 mSDsluCounter, 2203 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 4475 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:59:57,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 4475 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:59:57,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5491 states. [2024-11-10 00:59:57,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5491 to 5488. [2024-11-10 00:59:57,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5488 states, 5486 states have (on average 1.965366387167335) internal successors, (10782), 5487 states have internal predecessors, (10782), 0 states have call successors, (0), 0 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:59:57,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5488 states to 5488 states and 10782 transitions. [2024-11-10 00:59:57,612 INFO L78 Accepts]: Start accepts. Automaton has 5488 states and 10782 transitions. Word has length 104 [2024-11-10 00:59:57,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:59:57,612 INFO L471 AbstractCegarLoop]: Abstraction has 5488 states and 10782 transitions. [2024-11-10 00:59:57,613 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:59:57,613 INFO L276 IsEmpty]: Start isEmpty. Operand 5488 states and 10782 transitions. [2024-11-10 00:59:57,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-10 00:59:57,614 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:59:57,615 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, 1, 1] [2024-11-10 00:59:57,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-10 00:59:57,615 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:59:57,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:59:57,616 INFO L85 PathProgramCache]: Analyzing trace with hash -2017853108, now seen corresponding path program 1 times [2024-11-10 00:59:57,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:59:57,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777148600] [2024-11-10 00:59:57,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:59:57,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:59:57,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:59:57,713 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:59:57,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:59:57,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777148600] [2024-11-10 00:59:57,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777148600] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:59:57,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:59:57,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:59:57,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216215492] [2024-11-10 00:59:57,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:59:57,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:59:57,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:59:57,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:59:57,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:59:57,715 INFO L87 Difference]: Start difference. First operand 5488 states and 10782 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 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:59:57,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:59:57,761 INFO L93 Difference]: Finished difference Result 6694 states and 12406 transitions. [2024-11-10 00:59:57,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:59:57,761 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 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:59:57,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:59:57,766 INFO L225 Difference]: With dead ends: 6694 [2024-11-10 00:59:57,766 INFO L226 Difference]: Without dead ends: 4291 [2024-11-10 00:59:57,768 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:59:57,768 INFO L432 NwaCegarLoop]: 2265 mSDtfsCounter, 38 mSDsluCounter, 2195 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 4460 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:59:57,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 4460 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:59:57,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4291 states. [2024-11-10 00:59:57,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4291 to 4288. [2024-11-10 00:59:57,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4288 states, 4286 states have (on average 2.134157722818479) internal successors, (9147), 4287 states have internal predecessors, (9147), 0 states have call successors, (0), 0 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:59:57,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4288 states to 4288 states and 9147 transitions. [2024-11-10 00:59:57,816 INFO L78 Accepts]: Start accepts. Automaton has 4288 states and 9147 transitions. Word has length 106 [2024-11-10 00:59:57,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:59:57,816 INFO L471 AbstractCegarLoop]: Abstraction has 4288 states and 9147 transitions. [2024-11-10 00:59:57,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 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:59:57,817 INFO L276 IsEmpty]: Start isEmpty. Operand 4288 states and 9147 transitions. [2024-11-10 00:59:57,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-10 00:59:57,817 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:59:57,818 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:59:57,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-10 00:59:57,818 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:59:57,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:59:57,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1799921997, now seen corresponding path program 1 times [2024-11-10 00:59:57,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:59:57,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319820571] [2024-11-10 00:59:57,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:59:57,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:59:57,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:59:58,280 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:59:58,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:59:58,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319820571] [2024-11-10 00:59:58,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319820571] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:59:58,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2068097342] [2024-11-10 00:59:58,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:59:58,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:59:58,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:59:58,284 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:59:58,285 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:59:58,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:59:58,483 INFO L255 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-10 00:59:58,491 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 01:00:00,167 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 01:00:00,168 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 01:00:02,765 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 01:00:02,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2068097342] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 01:00:02,766 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 01:00:02,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 17, 17] total 38 [2024-11-10 01:00:02,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785190597] [2024-11-10 01:00:02,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 01:00:02,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-10 01:00:02,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:00:02,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-10 01:00:02,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=1161, Unknown=0, NotChecked=0, Total=1406 [2024-11-10 01:00:02,769 INFO L87 Difference]: Start difference. First operand 4288 states and 9147 transitions. Second operand has 38 states, 38 states have (on average 7.315789473684211) internal successors, (278), 38 states have internal predecessors, (278), 0 states have call successors, (0), 0 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 01:00:05,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:00:05,368 INFO L93 Difference]: Finished difference Result 10356 states and 17245 transitions. [2024-11-10 01:00:05,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-11-10 01:00:05,369 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 7.315789473684211) internal successors, (278), 38 states have internal predecessors, (278), 0 states have call successors, (0), 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 108 [2024-11-10 01:00:05,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:00:05,383 INFO L225 Difference]: With dead ends: 10356 [2024-11-10 01:00:05,383 INFO L226 Difference]: Without dead ends: 9153 [2024-11-10 01:00:05,389 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1880 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1495, Invalid=4985, Unknown=0, NotChecked=0, Total=6480 [2024-11-10 01:00:05,390 INFO L432 NwaCegarLoop]: 2240 mSDtfsCounter, 26467 mSDsluCounter, 16257 mSDsCounter, 0 mSdLazyCounter, 1237 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26467 SdHoareTripleChecker+Valid, 18497 SdHoareTripleChecker+Invalid, 1311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 01:00:05,390 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26467 Valid, 18497 Invalid, 1311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1237 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 01:00:05,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9153 states. [2024-11-10 01:00:05,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9153 to 6666. [2024-11-10 01:00:05,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6666 states, 6664 states have (on average 1.836734693877551) internal successors, (12240), 6665 states have internal predecessors, (12240), 0 states have call successors, (0), 0 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 01:00:05,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6666 states to 6666 states and 12240 transitions. [2024-11-10 01:00:05,560 INFO L78 Accepts]: Start accepts. Automaton has 6666 states and 12240 transitions. Word has length 108 [2024-11-10 01:00:05,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:00:05,560 INFO L471 AbstractCegarLoop]: Abstraction has 6666 states and 12240 transitions. [2024-11-10 01:00:05,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 7.315789473684211) internal successors, (278), 38 states have internal predecessors, (278), 0 states have call successors, (0), 0 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 01:00:05,561 INFO L276 IsEmpty]: Start isEmpty. Operand 6666 states and 12240 transitions. [2024-11-10 01:00:05,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-10 01:00:05,562 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:00:05,562 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, 1] [2024-11-10 01:00:05,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 01:00:05,763 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,SelfDestructingSolverStorable26 [2024-11-10 01:00:05,764 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:00:05,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:00:05,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1067440103, now seen corresponding path program 1 times [2024-11-10 01:00:05,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:00:05,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136152350] [2024-11-10 01:00:05,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:00:05,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:00:05,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:00:06,164 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 01:00:06,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:00:06,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136152350] [2024-11-10 01:00:06,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136152350] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 01:00:06,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591451698] [2024-11-10 01:00:06,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:00:06,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 01:00:06,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 01:00:06,168 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 01:00:06,170 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 01:00:06,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:00:06,347 INFO L255 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-10 01:00:06,350 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 01:00:07,036 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 01:00:07,037 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 01:00:08,264 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 01:00:08,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1591451698] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 01:00:08,265 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 01:00:08,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 13] total 30 [2024-11-10 01:00:08,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757417031] [2024-11-10 01:00:08,265 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 01:00:08,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-10 01:00:08,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:00:08,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-10 01:00:08,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=706, Unknown=0, NotChecked=0, Total=870 [2024-11-10 01:00:08,267 INFO L87 Difference]: Start difference. First operand 6666 states and 12240 transitions. Second operand has 30 states, 30 states have (on average 9.7) internal successors, (291), 30 states have internal predecessors, (291), 0 states have call successors, (0), 0 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 01:00:09,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:00:09,258 INFO L93 Difference]: Finished difference Result 14089 states and 22029 transitions. [2024-11-10 01:00:09,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-10 01:00:09,259 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 9.7) internal successors, (291), 30 states have internal predecessors, (291), 0 states have call successors, (0), 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 109 [2024-11-10 01:00:09,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:00:09,273 INFO L225 Difference]: With dead ends: 14089 [2024-11-10 01:00:09,273 INFO L226 Difference]: Without dead ends: 10508 [2024-11-10 01:00:09,279 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=468, Invalid=1512, Unknown=0, NotChecked=0, Total=1980 [2024-11-10 01:00:09,279 INFO L432 NwaCegarLoop]: 2228 mSDtfsCounter, 17983 mSDsluCounter, 9210 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17983 SdHoareTripleChecker+Valid, 11438 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 01:00:09,279 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17983 Valid, 11438 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 01:00:09,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10508 states. [2024-11-10 01:00:09,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10508 to 10416. [2024-11-10 01:00:09,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10416 states, 10414 states have (on average 1.6388515459957749) internal successors, (17067), 10415 states have internal predecessors, (17067), 0 states have call successors, (0), 0 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 01:00:09,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10416 states to 10416 states and 17067 transitions. [2024-11-10 01:00:09,508 INFO L78 Accepts]: Start accepts. Automaton has 10416 states and 17067 transitions. Word has length 109 [2024-11-10 01:00:09,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:00:09,509 INFO L471 AbstractCegarLoop]: Abstraction has 10416 states and 17067 transitions. [2024-11-10 01:00:09,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 9.7) internal successors, (291), 30 states have internal predecessors, (291), 0 states have call successors, (0), 0 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 01:00:09,509 INFO L276 IsEmpty]: Start isEmpty. Operand 10416 states and 17067 transitions. [2024-11-10 01:00:09,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-10 01:00:09,510 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:00:09,510 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, 1] [2024-11-10 01:00:09,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-10 01:00:09,711 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,SelfDestructingSolverStorable27 [2024-11-10 01:00:09,711 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:00:09,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:00:09,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1705393453, now seen corresponding path program 1 times [2024-11-10 01:00:09,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:00:09,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189263296] [2024-11-10 01:00:09,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:00:09,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:00:09,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:00:10,439 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 01:00:10,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:00:10,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189263296] [2024-11-10 01:00:10,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189263296] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 01:00:10,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [805283979] [2024-11-10 01:00:10,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:00:10,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 01:00:10,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 01:00:10,441 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 01:00:10,442 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 01:00:10,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:00:10,639 INFO L255 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-10 01:00:10,643 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 01:00:11,198 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 01:00:11,198 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 01:00:12,077 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 01:00:12,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [805283979] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 01:00:12,077 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 01:00:12,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 28 [2024-11-10 01:00:12,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861779905] [2024-11-10 01:00:12,078 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 01:00:12,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-10 01:00:12,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:00:12,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-10 01:00:12,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=704, Unknown=0, NotChecked=0, Total=812 [2024-11-10 01:00:12,079 INFO L87 Difference]: Start difference. First operand 10416 states and 17067 transitions. Second operand has 29 states, 29 states have (on average 10.586206896551724) internal successors, (307), 28 states have internal predecessors, (307), 0 states have call successors, (0), 0 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 01:00:14,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:00:14,233 INFO L93 Difference]: Finished difference Result 39191 states and 54964 transitions. [2024-11-10 01:00:14,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-10 01:00:14,234 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 10.586206896551724) internal successors, (307), 28 states have internal predecessors, (307), 0 states have call successors, (0), 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 109 [2024-11-10 01:00:14,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:00:14,272 INFO L225 Difference]: With dead ends: 39191 [2024-11-10 01:00:14,272 INFO L226 Difference]: Without dead ends: 31860 [2024-11-10 01:00:14,287 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 793 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=751, Invalid=3031, Unknown=0, NotChecked=0, Total=3782 [2024-11-10 01:00:14,287 INFO L432 NwaCegarLoop]: 2223 mSDtfsCounter, 36122 mSDsluCounter, 9598 mSDsCounter, 0 mSdLazyCounter, 1072 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36122 SdHoareTripleChecker+Valid, 11821 SdHoareTripleChecker+Invalid, 1110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1072 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 01:00:14,288 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36122 Valid, 11821 Invalid, 1110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1072 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 01:00:14,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31860 states. [2024-11-10 01:00:15,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31860 to 31676. [2024-11-10 01:00:15,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31676 states, 31674 states have (on average 1.40440108606428) internal successors, (44483), 31675 states have internal predecessors, (44483), 0 states have call successors, (0), 0 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 01:00:15,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31676 states to 31676 states and 44483 transitions. [2024-11-10 01:00:15,108 INFO L78 Accepts]: Start accepts. Automaton has 31676 states and 44483 transitions. Word has length 109 [2024-11-10 01:00:15,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:00:15,108 INFO L471 AbstractCegarLoop]: Abstraction has 31676 states and 44483 transitions. [2024-11-10 01:00:15,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 10.586206896551724) internal successors, (307), 28 states have internal predecessors, (307), 0 states have call successors, (0), 0 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 01:00:15,109 INFO L276 IsEmpty]: Start isEmpty. Operand 31676 states and 44483 transitions. [2024-11-10 01:00:15,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-10 01:00:15,112 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:00:15,112 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, 1, 1, 1] [2024-11-10 01:00:15,131 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-10 01:00:15,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-10 01:00:15,313 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:00:15,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:00:15,314 INFO L85 PathProgramCache]: Analyzing trace with hash 818333428, now seen corresponding path program 1 times [2024-11-10 01:00:15,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:00:15,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100831554] [2024-11-10 01:00:15,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:00:15,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:00:15,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:00:15,746 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 01:00:15,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:00:15,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100831554] [2024-11-10 01:00:15,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100831554] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 01:00:15,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745358396] [2024-11-10 01:00:15,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:00:15,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 01:00:15,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 01:00:15,749 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 01:00:15,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-10 01:00:15,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:00:15,939 INFO L255 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-10 01:00:15,942 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 01:00:17,550 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 01:00:17,550 INFO L311 TraceCheckSpWp]: Computing backward predicates...