./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label03.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d 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.8.ufo.UNBOUNDED.pals+Problem12_label03.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 5d6ca24940c3ee50144301bfe2ad5c39a9e1b17caba3dcee976fe158697f7f6f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 09:50:46,527 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 09:50:46,576 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 09:50:46,584 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 09:50:46,584 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 09:50:46,618 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 09:50:46,618 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 09:50:46,619 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 09:50:46,619 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 09:50:46,619 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 09:50:46,620 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 09:50:46,620 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 09:50:46,620 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 09:50:46,621 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 09:50:46,621 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 09:50:46,622 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 09:50:46,622 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 09:50:46,622 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 09:50:46,623 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 09:50:46,623 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 09:50:46,623 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 09:50:46,624 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 09:50:46,624 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 09:50:46,625 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 09:50:46,625 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 09:50:46,625 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 09:50:46,625 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 09:50:46,626 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 09:50:46,626 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 09:50:46,626 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 09:50:46,627 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 09:50:46,627 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 09:50:46,627 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 09:50:46,628 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 09:50:46,628 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 09:50:46,628 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 09:50:46,628 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 09:50:46,629 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 09:50:46,629 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 09:50:46,629 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 09:50:46,630 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 09:50:46,630 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 09:50:46,630 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 -> 5d6ca24940c3ee50144301bfe2ad5c39a9e1b17caba3dcee976fe158697f7f6f [2024-11-16 09:50:46,872 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 09:50:46,895 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 09:50:46,899 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 09:50:46,900 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 09:50:46,901 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 09:50:46,903 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label03.c [2024-11-16 09:50:48,339 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 09:50:48,808 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 09:50:48,810 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label03.c [2024-11-16 09:50:48,846 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cad1a94b7/0a4a8a32cb1b476e9ffd37872936632b/FLAG2b4a5e6b7 [2024-11-16 09:50:48,863 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cad1a94b7/0a4a8a32cb1b476e9ffd37872936632b [2024-11-16 09:50:48,866 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 09:50:48,867 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 09:50:48,869 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 09:50:48,869 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 09:50:48,875 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 09:50:48,877 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 09:50:48" (1/1) ... [2024-11-16 09:50:48,878 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e628139 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:50:48, skipping insertion in model container [2024-11-16 09:50:48,878 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 09:50:48" (1/1) ... [2024-11-16 09:50:48,991 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 09:50:49,380 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.8.ufo.UNBOUNDED.pals+Problem12_label03.c[26888,26901] [2024-11-16 09:50:49,420 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.8.ufo.UNBOUNDED.pals+Problem12_label03.c[29225,29238] [2024-11-16 09:50:50,129 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 09:50:50,146 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 09:50:50,209 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.8.ufo.UNBOUNDED.pals+Problem12_label03.c[26888,26901] [2024-11-16 09:50:50,217 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.8.ufo.UNBOUNDED.pals+Problem12_label03.c[29225,29238] [2024-11-16 09:50:50,631 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 09:50:50,660 INFO L204 MainTranslator]: Completed translation [2024-11-16 09:50:50,660 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:50:50 WrapperNode [2024-11-16 09:50:50,661 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 09:50:50,661 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 09:50:50,662 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 09:50:50,662 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 09:50:50,668 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:50:50" (1/1) ... [2024-11-16 09:50:50,714 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:50:50" (1/1) ... [2024-11-16 09:50:50,958 INFO L138 Inliner]: procedures = 40, calls = 25, calls flagged for inlining = 20, calls inlined = 20, statements flattened = 5289 [2024-11-16 09:50:50,958 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 09:50:50,959 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 09:50:50,959 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 09:50:50,959 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 09:50:51,053 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:50:50" (1/1) ... [2024-11-16 09:50:51,054 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:50:50" (1/1) ... [2024-11-16 09:50:51,086 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:50:50" (1/1) ... [2024-11-16 09:50:51,242 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-16 09:50:51,243 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:50:50" (1/1) ... [2024-11-16 09:50:51,243 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:50:50" (1/1) ... [2024-11-16 09:50:51,427 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:50:50" (1/1) ... [2024-11-16 09:50:51,457 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:50:50" (1/1) ... [2024-11-16 09:50:51,494 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:50:50" (1/1) ... [2024-11-16 09:50:51,517 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:50:50" (1/1) ... [2024-11-16 09:50:51,675 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 09:50:51,680 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 09:50:51,680 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 09:50:51,680 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 09:50:51,681 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:50:50" (1/1) ... [2024-11-16 09:50:51,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 09:50:51,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 09:50:51,728 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-16 09:50:51,732 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-16 09:50:51,777 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 09:50:51,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 09:50:51,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 09:50:51,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 09:50:51,938 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 09:50:51,940 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 09:50:56,210 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L2375: havoc calculate_output_#t~ret49#1; [2024-11-16 09:50:56,210 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L3854: havoc calculate_output2_#t~ret50#1; [2024-11-16 09:50:56,210 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L5344: havoc calculate_output3_#t~ret51#1; [2024-11-16 09:50:56,357 INFO L? ?]: Removed 759 outVars from TransFormulas that were not future-live. [2024-11-16 09:50:56,358 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 09:50:56,394 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 09:50:56,398 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 09:50:56,399 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 09:50:56 BoogieIcfgContainer [2024-11-16 09:50:56,399 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 09:50:56,401 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 09:50:56,401 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 09:50:56,404 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 09:50:56,404 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 09:50:48" (1/3) ... [2024-11-16 09:50:56,405 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b68d96c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 09:50:56, skipping insertion in model container [2024-11-16 09:50:56,405 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:50:50" (2/3) ... [2024-11-16 09:50:56,405 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b68d96c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 09:50:56, skipping insertion in model container [2024-11-16 09:50:56,405 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 09:50:56" (3/3) ... [2024-11-16 09:50:56,406 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label03.c [2024-11-16 09:50:56,421 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 09:50:56,422 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-16 09:50:56,516 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 09:50:56,524 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;@38854a3a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 09:50:56,524 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-16 09:50:56,536 INFO L276 IsEmpty]: Start isEmpty. Operand has 956 states, 953 states have (on average 1.8961175236096537) internal successors, (1807), 955 states have internal predecessors, (1807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:50:56,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-16 09:50:56,544 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:50:56,544 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] [2024-11-16 09:50:56,545 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:50:56,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:50:56,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1666824899, now seen corresponding path program 1 times [2024-11-16 09:50:56,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:50:56,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198618199] [2024-11-16 09:50:56,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:50:56,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:50:56,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:50:56,969 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-16 09:50:56,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:50:56,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198618199] [2024-11-16 09:50:56,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198618199] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:50:56,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:50:56,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 09:50:56,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402949678] [2024-11-16 09:50:56,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:50:56,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 09:50:56,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:50:57,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 09:50:57,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 09:50:57,004 INFO L87 Difference]: Start difference. First operand has 956 states, 953 states have (on average 1.8961175236096537) internal successors, (1807), 955 states have internal predecessors, (1807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:51:00,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:51:00,206 INFO L93 Difference]: Finished difference Result 2597 states and 4983 transitions. [2024-11-16 09:51:00,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 09:51:00,208 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2024-11-16 09:51:00,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:51:00,227 INFO L225 Difference]: With dead ends: 2597 [2024-11-16 09:51:00,228 INFO L226 Difference]: Without dead ends: 1640 [2024-11-16 09:51:00,234 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-16 09:51:00,237 INFO L432 NwaCegarLoop]: 380 mSDtfsCounter, 1109 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 2437 mSolverCounterSat, 771 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1109 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 3208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 771 IncrementalHoareTripleChecker+Valid, 2437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-16 09:51:00,238 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1109 Valid, 393 Invalid, 3208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [771 Valid, 2437 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-16 09:51:00,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1640 states. [2024-11-16 09:51:00,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1640 to 1640. [2024-11-16 09:51:00,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1640 states, 1638 states have (on average 1.8388278388278387) internal successors, (3012), 1639 states have internal predecessors, (3012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:51:00,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1640 states to 1640 states and 3012 transitions. [2024-11-16 09:51:00,364 INFO L78 Accepts]: Start accepts. Automaton has 1640 states and 3012 transitions. Word has length 22 [2024-11-16 09:51:00,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:51:00,365 INFO L471 AbstractCegarLoop]: Abstraction has 1640 states and 3012 transitions. [2024-11-16 09:51:00,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:51:00,365 INFO L276 IsEmpty]: Start isEmpty. Operand 1640 states and 3012 transitions. [2024-11-16 09:51:00,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-16 09:51:00,369 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:51:00,369 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-16 09:51:00,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 09:51:00,370 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:51:00,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:51:00,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1978190791, now seen corresponding path program 1 times [2024-11-16 09:51:00,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:51:00,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235916535] [2024-11-16 09:51:00,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:51:00,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:51:00,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:51:00,621 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-16 09:51:00,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:51:00,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235916535] [2024-11-16 09:51:00,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235916535] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:51:00,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:51:00,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 09:51:00,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971293286] [2024-11-16 09:51:00,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:51:00,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 09:51:00,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:51:00,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 09:51:00,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 09:51:00,627 INFO L87 Difference]: Start difference. First operand 1640 states and 3012 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:51:00,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:51:00,728 INFO L93 Difference]: Finished difference Result 1709 states and 3119 transitions. [2024-11-16 09:51:00,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 09:51:00,728 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-11-16 09:51:00,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:51:00,735 INFO L225 Difference]: With dead ends: 1709 [2024-11-16 09:51:00,735 INFO L226 Difference]: Without dead ends: 1640 [2024-11-16 09:51:00,737 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-16 09:51:00,739 INFO L432 NwaCegarLoop]: 1670 mSDtfsCounter, 0 mSDsluCounter, 4944 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6614 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 09:51:00,740 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6614 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 09:51:00,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1640 states. [2024-11-16 09:51:00,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1640 to 1640. [2024-11-16 09:51:00,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1640 states, 1638 states have (on average 1.8015873015873016) internal successors, (2951), 1639 states have internal predecessors, (2951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:51:00,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1640 states to 1640 states and 2951 transitions. [2024-11-16 09:51:00,781 INFO L78 Accepts]: Start accepts. Automaton has 1640 states and 2951 transitions. Word has length 32 [2024-11-16 09:51:00,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:51:00,781 INFO L471 AbstractCegarLoop]: Abstraction has 1640 states and 2951 transitions. [2024-11-16 09:51:00,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:51:00,782 INFO L276 IsEmpty]: Start isEmpty. Operand 1640 states and 2951 transitions. [2024-11-16 09:51:00,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-16 09:51:00,787 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:51:00,787 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-16 09:51:00,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 09:51:00,788 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:51:00,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:51:00,788 INFO L85 PathProgramCache]: Analyzing trace with hash 936364211, now seen corresponding path program 1 times [2024-11-16 09:51:00,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:51:00,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152735566] [2024-11-16 09:51:00,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:51:00,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:51:00,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:51:01,200 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:51:01,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:51:01,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152735566] [2024-11-16 09:51:01,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152735566] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:51:01,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:51:01,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 09:51:01,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444204319] [2024-11-16 09:51:01,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:51:01,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 09:51:01,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:51:01,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 09:51:01,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 09:51:01,208 INFO L87 Difference]: Start difference. First operand 1640 states and 2951 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:51:06,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:51:06,521 INFO L93 Difference]: Finished difference Result 5403 states and 9847 transitions. [2024-11-16 09:51:06,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 09:51:06,522 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2024-11-16 09:51:06,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:51:06,538 INFO L225 Difference]: With dead ends: 5403 [2024-11-16 09:51:06,539 INFO L226 Difference]: Without dead ends: 3896 [2024-11-16 09:51:06,541 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 09:51:06,545 INFO L432 NwaCegarLoop]: 865 mSDtfsCounter, 2517 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 5154 mSolverCounterSat, 1148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2517 SdHoareTripleChecker+Valid, 888 SdHoareTripleChecker+Invalid, 6302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1148 IncrementalHoareTripleChecker+Valid, 5154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2024-11-16 09:51:06,545 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2517 Valid, 888 Invalid, 6302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1148 Valid, 5154 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2024-11-16 09:51:06,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3896 states. [2024-11-16 09:51:06,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3896 to 3896. [2024-11-16 09:51:06,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3896 states, 3894 states have (on average 1.5621468926553672) internal successors, (6083), 3895 states have internal predecessors, (6083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:51:06,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3896 states to 3896 states and 6083 transitions. [2024-11-16 09:51:06,641 INFO L78 Accepts]: Start accepts. Automaton has 3896 states and 6083 transitions. Word has length 92 [2024-11-16 09:51:06,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:51:06,642 INFO L471 AbstractCegarLoop]: Abstraction has 3896 states and 6083 transitions. [2024-11-16 09:51:06,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:51:06,642 INFO L276 IsEmpty]: Start isEmpty. Operand 3896 states and 6083 transitions. [2024-11-16 09:51:06,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-16 09:51:06,647 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:51:06,648 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 09:51:06,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 09:51:06,649 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:51:06,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:51:06,650 INFO L85 PathProgramCache]: Analyzing trace with hash -760950915, now seen corresponding path program 1 times [2024-11-16 09:51:06,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:51:06,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424984601] [2024-11-16 09:51:06,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:51:06,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:51:06,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:51:07,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:51:07,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:51:07,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424984601] [2024-11-16 09:51:07,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424984601] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:51:07,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:51:07,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-16 09:51:07,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820864967] [2024-11-16 09:51:07,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:51:07,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 09:51:07,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:51:07,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 09:51:07,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-16 09:51:07,120 INFO L87 Difference]: Start difference. First operand 3896 states and 6083 transitions. Second operand has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:51:07,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:51:07,584 INFO L93 Difference]: Finished difference Result 4936 states and 7731 transitions. [2024-11-16 09:51:07,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-16 09:51:07,585 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2024-11-16 09:51:07,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:51:07,603 INFO L225 Difference]: With dead ends: 4936 [2024-11-16 09:51:07,603 INFO L226 Difference]: Without dead ends: 4871 [2024-11-16 09:51:07,606 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=344, Unknown=0, NotChecked=0, Total=506 [2024-11-16 09:51:07,607 INFO L432 NwaCegarLoop]: 1605 mSDtfsCounter, 13562 mSDsluCounter, 4183 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13562 SdHoareTripleChecker+Valid, 5788 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 09:51:07,607 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13562 Valid, 5788 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 09:51:07,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4871 states. [2024-11-16 09:51:07,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4871 to 3958. [2024-11-16 09:51:07,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3958 states, 3956 states have (on average 1.5626895854398382) internal successors, (6182), 3957 states have internal predecessors, (6182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:51:07,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3958 states to 3958 states and 6182 transitions. [2024-11-16 09:51:07,687 INFO L78 Accepts]: Start accepts. Automaton has 3958 states and 6182 transitions. Word has length 92 [2024-11-16 09:51:07,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:51:07,687 INFO L471 AbstractCegarLoop]: Abstraction has 3958 states and 6182 transitions. [2024-11-16 09:51:07,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:51:07,688 INFO L276 IsEmpty]: Start isEmpty. Operand 3958 states and 6182 transitions. [2024-11-16 09:51:07,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-16 09:51:07,689 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:51:07,689 INFO L215 NwaCegarLoop]: trace histogram [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-16 09:51:07,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 09:51:07,689 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:51:07,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:51:07,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1081540776, now seen corresponding path program 1 times [2024-11-16 09:51:07,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:51:07,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424879460] [2024-11-16 09:51:07,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:51:07,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:51:07,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:51:07,818 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-16 09:51:07,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:51:07,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424879460] [2024-11-16 09:51:07,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424879460] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:51:07,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:51:07,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 09:51:07,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510527378] [2024-11-16 09:51:07,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:51:07,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 09:51:07,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:51:07,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 09:51:07,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 09:51:07,823 INFO L87 Difference]: Start difference. First operand 3958 states and 6182 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:51:10,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:51:10,503 INFO L93 Difference]: Finished difference Result 10729 states and 17244 transitions. [2024-11-16 09:51:10,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 09:51:10,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 states have internal predecessors, (78), 0 states have call successors, (0), 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-16 09:51:10,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:51:10,525 INFO L225 Difference]: With dead ends: 10729 [2024-11-16 09:51:10,525 INFO L226 Difference]: Without dead ends: 6966 [2024-11-16 09:51:10,530 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-16 09:51:10,531 INFO L432 NwaCegarLoop]: 639 mSDtfsCounter, 895 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 2261 mSolverCounterSat, 652 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 895 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 2913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 652 IncrementalHoareTripleChecker+Valid, 2261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-16 09:51:10,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [895 Valid, 648 Invalid, 2913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [652 Valid, 2261 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-16 09:51:10,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6966 states. [2024-11-16 09:51:10,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6966 to 6966. [2024-11-16 09:51:10,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6966 states, 6964 states have (on average 1.42303273980471) internal successors, (9910), 6965 states have internal predecessors, (9910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:51:10,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6966 states to 6966 states and 9910 transitions. [2024-11-16 09:51:10,651 INFO L78 Accepts]: Start accepts. Automaton has 6966 states and 9910 transitions. Word has length 94 [2024-11-16 09:51:10,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:51:10,653 INFO L471 AbstractCegarLoop]: Abstraction has 6966 states and 9910 transitions. [2024-11-16 09:51:10,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:51:10,653 INFO L276 IsEmpty]: Start isEmpty. Operand 6966 states and 9910 transitions. [2024-11-16 09:51:10,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-16 09:51:10,654 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:51:10,654 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 09:51:10,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 09:51:10,655 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:51:10,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:51:10,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1159971551, now seen corresponding path program 1 times [2024-11-16 09:51:10,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:51:10,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174244121] [2024-11-16 09:51:10,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:51:10,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:51:10,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:51:11,219 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-16 09:51:11,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:51:11,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174244121] [2024-11-16 09:51:11,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174244121] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:51:11,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:51:11,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-16 09:51:11,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798857296] [2024-11-16 09:51:11,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:51:11,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 09:51:11,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:51:11,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 09:51:11,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-16 09:51:11,222 INFO L87 Difference]: Start difference. First operand 6966 states and 9910 transitions. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 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-16 09:51:11,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:51:11,711 INFO L93 Difference]: Finished difference Result 7096 states and 10114 transitions. [2024-11-16 09:51:11,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 09:51:11,712 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 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 94 [2024-11-16 09:51:11,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:51:11,743 INFO L225 Difference]: With dead ends: 7096 [2024-11-16 09:51:11,743 INFO L226 Difference]: Without dead ends: 6969 [2024-11-16 09:51:11,747 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2024-11-16 09:51:11,750 INFO L432 NwaCegarLoop]: 1601 mSDtfsCounter, 10675 mSDsluCounter, 703 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10675 SdHoareTripleChecker+Valid, 2304 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 09:51:11,751 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10675 Valid, 2304 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 09:51:11,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6969 states. [2024-11-16 09:51:11,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6969 to 6966. [2024-11-16 09:51:11,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6966 states, 6964 states have (on average 1.4228891441700173) internal successors, (9909), 6965 states have internal predecessors, (9909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:51:11,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6966 states to 6966 states and 9909 transitions. [2024-11-16 09:51:11,938 INFO L78 Accepts]: Start accepts. Automaton has 6966 states and 9909 transitions. Word has length 94 [2024-11-16 09:51:11,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:51:11,938 INFO L471 AbstractCegarLoop]: Abstraction has 6966 states and 9909 transitions. [2024-11-16 09:51:11,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 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-16 09:51:11,938 INFO L276 IsEmpty]: Start isEmpty. Operand 6966 states and 9909 transitions. [2024-11-16 09:51:11,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-16 09:51:11,939 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:51:11,940 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 09:51:11,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 09:51:11,940 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:51:11,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:51:11,941 INFO L85 PathProgramCache]: Analyzing trace with hash -971768378, now seen corresponding path program 1 times [2024-11-16 09:51:11,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:51:11,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603441134] [2024-11-16 09:51:11,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:51:11,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:51:11,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:51:12,076 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-16 09:51:12,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:51:12,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603441134] [2024-11-16 09:51:12,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603441134] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:51:12,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:51:12,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 09:51:12,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040216779] [2024-11-16 09:51:12,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:51:12,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 09:51:12,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:51:12,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 09:51:12,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 09:51:12,079 INFO L87 Difference]: Start difference. First operand 6966 states and 9909 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:51:12,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:51:12,137 INFO L93 Difference]: Finished difference Result 7208 states and 10291 transitions. [2024-11-16 09:51:12,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 09:51:12,138 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2024-11-16 09:51:12,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:51:12,160 INFO L225 Difference]: With dead ends: 7208 [2024-11-16 09:51:12,161 INFO L226 Difference]: Without dead ends: 7081 [2024-11-16 09:51:12,165 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-16 09:51:12,166 INFO L432 NwaCegarLoop]: 1607 mSDtfsCounter, 1512 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1512 SdHoareTripleChecker+Valid, 1703 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-16 09:51:12,166 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1512 Valid, 1703 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:51:12,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7081 states. [2024-11-16 09:51:12,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7081 to 7076. [2024-11-16 09:51:12,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7076 states, 7074 states have (on average 1.4250777495052305) internal successors, (10081), 7075 states have internal predecessors, (10081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:51:12,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7076 states to 7076 states and 10081 transitions. [2024-11-16 09:51:12,303 INFO L78 Accepts]: Start accepts. Automaton has 7076 states and 10081 transitions. Word has length 95 [2024-11-16 09:51:12,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:51:12,304 INFO L471 AbstractCegarLoop]: Abstraction has 7076 states and 10081 transitions. [2024-11-16 09:51:12,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:51:12,304 INFO L276 IsEmpty]: Start isEmpty. Operand 7076 states and 10081 transitions. [2024-11-16 09:51:12,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-16 09:51:12,305 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:51:12,305 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, 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-16 09:51:12,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 09:51:12,306 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:51:12,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:51:12,306 INFO L85 PathProgramCache]: Analyzing trace with hash 45305697, now seen corresponding path program 1 times [2024-11-16 09:51:12,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:51:12,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576528462] [2024-11-16 09:51:12,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:51:12,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:51:12,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:51:12,404 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-16 09:51:12,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:51:12,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576528462] [2024-11-16 09:51:12,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576528462] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:51:12,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:51:12,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 09:51:12,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904262833] [2024-11-16 09:51:12,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:51:12,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 09:51:12,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:51:12,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 09:51:12,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 09:51:12,405 INFO L87 Difference]: Start difference. First operand 7076 states and 10081 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-16 09:51:12,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:51:12,451 INFO L93 Difference]: Finished difference Result 7534 states and 10799 transitions. [2024-11-16 09:51:12,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 09:51:12,452 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-16 09:51:12,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:51:12,466 INFO L225 Difference]: With dead ends: 7534 [2024-11-16 09:51:12,466 INFO L226 Difference]: Without dead ends: 7297 [2024-11-16 09:51:12,470 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-16 09:51:12,472 INFO L432 NwaCegarLoop]: 1690 mSDtfsCounter, 1531 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1531 SdHoareTripleChecker+Valid, 1798 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-16 09:51:12,472 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1531 Valid, 1798 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:51:12,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7297 states. [2024-11-16 09:51:12,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7297 to 7294. [2024-11-16 09:51:12,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7294 states, 7292 states have (on average 1.4289632473944047) internal successors, (10420), 7293 states have internal predecessors, (10420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:51:12,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7294 states to 7294 states and 10420 transitions. [2024-11-16 09:51:12,598 INFO L78 Accepts]: Start accepts. Automaton has 7294 states and 10420 transitions. Word has length 96 [2024-11-16 09:51:12,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:51:12,599 INFO L471 AbstractCegarLoop]: Abstraction has 7294 states and 10420 transitions. [2024-11-16 09:51:12,599 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-16 09:51:12,600 INFO L276 IsEmpty]: Start isEmpty. Operand 7294 states and 10420 transitions. [2024-11-16 09:51:12,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-16 09:51:12,601 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:51:12,601 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, 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-16 09:51:12,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 09:51:12,601 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:51:12,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:51:12,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1153405601, now seen corresponding path program 1 times [2024-11-16 09:51:12,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:51:12,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821997025] [2024-11-16 09:51:12,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:51:12,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:51:12,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:51:12,693 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-16 09:51:12,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:51:12,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821997025] [2024-11-16 09:51:12,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821997025] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:51:12,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:51:12,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 09:51:12,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211774769] [2024-11-16 09:51:12,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:51:12,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 09:51:12,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:51:12,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 09:51:12,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 09:51:12,695 INFO L87 Difference]: Start difference. First operand 7294 states and 10420 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-16 09:51:12,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:51:12,757 INFO L93 Difference]: Finished difference Result 8172 states and 11788 transitions. [2024-11-16 09:51:12,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 09:51:12,757 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-16 09:51:12,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:51:12,769 INFO L225 Difference]: With dead ends: 8172 [2024-11-16 09:51:12,770 INFO L226 Difference]: Without dead ends: 7717 [2024-11-16 09:51:12,773 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-16 09:51:12,774 INFO L432 NwaCegarLoop]: 1688 mSDtfsCounter, 1529 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1529 SdHoareTripleChecker+Valid, 1800 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-16 09:51:12,774 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1529 Valid, 1800 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:51:12,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7717 states. [2024-11-16 09:51:12,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7717 to 7714. [2024-11-16 09:51:12,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7714 states, 7712 states have (on average 1.4349066390041494) internal successors, (11066), 7713 states have internal predecessors, (11066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:51:12,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7714 states to 7714 states and 11066 transitions. [2024-11-16 09:51:12,900 INFO L78 Accepts]: Start accepts. Automaton has 7714 states and 11066 transitions. Word has length 96 [2024-11-16 09:51:12,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:51:12,900 INFO L471 AbstractCegarLoop]: Abstraction has 7714 states and 11066 transitions. [2024-11-16 09:51:12,900 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-16 09:51:12,900 INFO L276 IsEmpty]: Start isEmpty. Operand 7714 states and 11066 transitions. [2024-11-16 09:51:12,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-16 09:51:12,901 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:51:12,902 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, 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-16 09:51:12,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 09:51:12,902 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:51:12,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:51:12,906 INFO L85 PathProgramCache]: Analyzing trace with hash 380864801, now seen corresponding path program 1 times [2024-11-16 09:51:12,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:51:12,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510769888] [2024-11-16 09:51:12,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:51:12,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:51:12,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:51:13,000 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-16 09:51:13,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:51:13,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510769888] [2024-11-16 09:51:13,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510769888] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:51:13,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:51:13,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 09:51:13,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039488684] [2024-11-16 09:51:13,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:51:13,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 09:51:13,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:51:13,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 09:51:13,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 09:51:13,003 INFO L87 Difference]: Start difference. First operand 7714 states and 11066 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-16 09:51:13,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:51:13,065 INFO L93 Difference]: Finished difference Result 9400 states and 13670 transitions. [2024-11-16 09:51:13,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 09:51:13,065 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-16 09:51:13,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:51:13,132 INFO L225 Difference]: With dead ends: 9400 [2024-11-16 09:51:13,132 INFO L226 Difference]: Without dead ends: 8525 [2024-11-16 09:51:13,135 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-16 09:51:13,136 INFO L432 NwaCegarLoop]: 1676 mSDtfsCounter, 1525 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1525 SdHoareTripleChecker+Valid, 1796 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-16 09:51:13,136 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1525 Valid, 1796 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:51:13,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8525 states. [2024-11-16 09:51:13,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8525 to 8522. [2024-11-16 09:51:13,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8522 states, 8520 states have (on average 1.4429577464788732) internal successors, (12294), 8521 states have internal predecessors, (12294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:51:13,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8522 states to 8522 states and 12294 transitions. [2024-11-16 09:51:13,275 INFO L78 Accepts]: Start accepts. Automaton has 8522 states and 12294 transitions. Word has length 96 [2024-11-16 09:51:13,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:51:13,275 INFO L471 AbstractCegarLoop]: Abstraction has 8522 states and 12294 transitions. [2024-11-16 09:51:13,276 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-16 09:51:13,276 INFO L276 IsEmpty]: Start isEmpty. Operand 8522 states and 12294 transitions. [2024-11-16 09:51:13,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-16 09:51:13,277 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:51:13,277 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, 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-16 09:51:13,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 09:51:13,277 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:51:13,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:51:13,278 INFO L85 PathProgramCache]: Analyzing trace with hash -620544927, now seen corresponding path program 1 times [2024-11-16 09:51:13,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:51:13,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736479018] [2024-11-16 09:51:13,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:51:13,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:51:13,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:51:13,371 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-16 09:51:13,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:51:13,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736479018] [2024-11-16 09:51:13,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736479018] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:51:13,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:51:13,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 09:51:13,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370313171] [2024-11-16 09:51:13,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:51:13,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 09:51:13,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:51:13,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 09:51:13,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 09:51:13,374 INFO L87 Difference]: Start difference. First operand 8522 states and 12294 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-16 09:51:13,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:51:13,467 INFO L93 Difference]: Finished difference Result 11760 states and 17242 transitions. [2024-11-16 09:51:13,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 09:51:13,467 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-16 09:51:13,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:51:13,486 INFO L225 Difference]: With dead ends: 11760 [2024-11-16 09:51:13,487 INFO L226 Difference]: Without dead ends: 10077 [2024-11-16 09:51:13,494 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-16 09:51:13,494 INFO L432 NwaCegarLoop]: 1674 mSDtfsCounter, 1523 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1523 SdHoareTripleChecker+Valid, 1798 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-16 09:51:13,495 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1523 Valid, 1798 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:51:13,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10077 states. [2024-11-16 09:51:13,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10077 to 10074. [2024-11-16 09:51:13,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10074 states, 10072 states have (on average 1.4517474185861796) internal successors, (14622), 10073 states have internal predecessors, (14622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:51:13,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10074 states to 10074 states and 14622 transitions. [2024-11-16 09:51:13,681 INFO L78 Accepts]: Start accepts. Automaton has 10074 states and 14622 transitions. Word has length 96 [2024-11-16 09:51:13,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:51:13,682 INFO L471 AbstractCegarLoop]: Abstraction has 10074 states and 14622 transitions. [2024-11-16 09:51:13,682 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-16 09:51:13,682 INFO L276 IsEmpty]: Start isEmpty. Operand 10074 states and 14622 transitions. [2024-11-16 09:51:13,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-16 09:51:13,683 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:51:13,683 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 09:51:13,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 09:51:13,683 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:51:13,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:51:13,684 INFO L85 PathProgramCache]: Analyzing trace with hash -634994783, now seen corresponding path program 1 times [2024-11-16 09:51:13,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:51:13,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846102587] [2024-11-16 09:51:13,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:51:13,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:51:13,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:51:13,782 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-16 09:51:13,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:51:13,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846102587] [2024-11-16 09:51:13,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846102587] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:51:13,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:51:13,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 09:51:13,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843923435] [2024-11-16 09:51:13,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:51:13,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 09:51:13,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:51:13,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 09:51:13,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 09:51:13,786 INFO L87 Difference]: Start difference. First operand 10074 states and 14622 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-16 09:51:13,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:51:13,919 INFO L93 Difference]: Finished difference Result 16288 states and 24002 transitions. [2024-11-16 09:51:13,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 09:51:13,919 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-16 09:51:13,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:51:13,942 INFO L225 Difference]: With dead ends: 16288 [2024-11-16 09:51:13,943 INFO L226 Difference]: Without dead ends: 13053 [2024-11-16 09:51:13,952 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-16 09:51:13,953 INFO L432 NwaCegarLoop]: 1672 mSDtfsCounter, 1521 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1521 SdHoareTripleChecker+Valid, 1800 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-16 09:51:13,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1521 Valid, 1800 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:51:13,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13053 states. [2024-11-16 09:51:14,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13053 to 13050. [2024-11-16 09:51:14,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13050 states, 13048 states have (on average 1.457847946045371) internal successors, (19022), 13049 states have internal predecessors, (19022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:51:14,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13050 states to 13050 states and 19022 transitions. [2024-11-16 09:51:14,373 INFO L78 Accepts]: Start accepts. Automaton has 13050 states and 19022 transitions. Word has length 96 [2024-11-16 09:51:14,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:51:14,374 INFO L471 AbstractCegarLoop]: Abstraction has 13050 states and 19022 transitions. [2024-11-16 09:51:14,374 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-16 09:51:14,374 INFO L276 IsEmpty]: Start isEmpty. Operand 13050 states and 19022 transitions. [2024-11-16 09:51:14,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-16 09:51:14,375 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:51:14,375 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, 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-16 09:51:14,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-16 09:51:14,376 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:51:14,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:51:14,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1456607969, now seen corresponding path program 1 times [2024-11-16 09:51:14,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:51:14,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376831215] [2024-11-16 09:51:14,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:51:14,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:51:14,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:51:14,489 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-16 09:51:14,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:51:14,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376831215] [2024-11-16 09:51:14,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376831215] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:51:14,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:51:14,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 09:51:14,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738202499] [2024-11-16 09:51:14,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:51:14,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 09:51:14,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:51:14,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 09:51:14,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 09:51:14,492 INFO L87 Difference]: Start difference. First operand 13050 states and 19022 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-16 09:51:14,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:51:14,765 INFO L93 Difference]: Finished difference Result 24960 states and 36754 transitions. [2024-11-16 09:51:14,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 09:51:14,766 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-16 09:51:14,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:51:14,802 INFO L225 Difference]: With dead ends: 24960 [2024-11-16 09:51:14,802 INFO L226 Difference]: Without dead ends: 18749 [2024-11-16 09:51:14,817 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-16 09:51:14,819 INFO L432 NwaCegarLoop]: 1670 mSDtfsCounter, 1519 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1519 SdHoareTripleChecker+Valid, 1802 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-16 09:51:14,819 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1519 Valid, 1802 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:51:14,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18749 states. [2024-11-16 09:51:15,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18749 to 18746. [2024-11-16 09:51:15,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18746 states, 18744 states have (on average 1.4569995731967562) internal successors, (27310), 18745 states have internal predecessors, (27310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:51:15,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18746 states to 18746 states and 27310 transitions. [2024-11-16 09:51:15,220 INFO L78 Accepts]: Start accepts. Automaton has 18746 states and 27310 transitions. Word has length 96 [2024-11-16 09:51:15,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:51:15,220 INFO L471 AbstractCegarLoop]: Abstraction has 18746 states and 27310 transitions. [2024-11-16 09:51:15,220 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-16 09:51:15,221 INFO L276 IsEmpty]: Start isEmpty. Operand 18746 states and 27310 transitions. [2024-11-16 09:51:15,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-16 09:51:15,222 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:51:15,222 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, 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-16 09:51:15,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-16 09:51:15,222 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:51:15,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:51:15,223 INFO L85 PathProgramCache]: Analyzing trace with hash 932330914, now seen corresponding path program 1 times [2024-11-16 09:51:15,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:51:15,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197105628] [2024-11-16 09:51:15,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:51:15,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:51:15,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:51:15,619 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-16 09:51:15,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:51:15,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197105628] [2024-11-16 09:51:15,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197105628] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:51:15,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:51:15,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 09:51:15,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680652451] [2024-11-16 09:51:15,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:51:15,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 09:51:15,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:51:15,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 09:51:15,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-16 09:51:15,621 INFO L87 Difference]: Start difference. First operand 18746 states and 27310 transitions. Second operand has 8 states, 8 states have (on average 12.0) internal successors, (96), 8 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-16 09:51:15,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:51:15,849 INFO L93 Difference]: Finished difference Result 19133 states and 27824 transitions. [2024-11-16 09:51:15,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 09:51:15,850 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 8 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-16 09:51:15,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:51:15,887 INFO L225 Difference]: With dead ends: 19133 [2024-11-16 09:51:15,888 INFO L226 Difference]: Without dead ends: 19130 [2024-11-16 09:51:15,895 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-16 09:51:15,896 INFO L432 NwaCegarLoop]: 1605 mSDtfsCounter, 0 mSDsluCounter, 9617 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11222 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-16 09:51:15,897 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11222 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:51:15,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19130 states. [2024-11-16 09:51:16,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19130 to 19130. [2024-11-16 09:51:16,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19130 states, 19128 states have (on average 1.4444792973651193) internal successors, (27630), 19129 states have internal predecessors, (27630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:51:16,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19130 states to 19130 states and 27630 transitions. [2024-11-16 09:51:16,280 INFO L78 Accepts]: Start accepts. Automaton has 19130 states and 27630 transitions. Word has length 96 [2024-11-16 09:51:16,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:51:16,280 INFO L471 AbstractCegarLoop]: Abstraction has 19130 states and 27630 transitions. [2024-11-16 09:51:16,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 8 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-16 09:51:16,280 INFO L276 IsEmpty]: Start isEmpty. Operand 19130 states and 27630 transitions. [2024-11-16 09:51:16,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-16 09:51:16,281 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:51:16,282 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 09:51:16,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-16 09:51:16,282 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:51:16,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:51:16,282 INFO L85 PathProgramCache]: Analyzing trace with hash 662939105, now seen corresponding path program 1 times [2024-11-16 09:51:16,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:51:16,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138749649] [2024-11-16 09:51:16,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:51:16,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:51:16,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:51:16,369 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-16 09:51:16,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:51:16,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138749649] [2024-11-16 09:51:16,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138749649] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:51:16,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:51:16,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 09:51:16,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152239347] [2024-11-16 09:51:16,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:51:16,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 09:51:16,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:51:16,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 09:51:16,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 09:51:16,371 INFO L87 Difference]: Start difference. First operand 19130 states and 27630 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-16 09:51:16,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:51:16,802 INFO L93 Difference]: Finished difference Result 42688 states and 61682 transitions. [2024-11-16 09:51:16,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 09:51:16,803 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-16 09:51:16,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:51:16,865 INFO L225 Difference]: With dead ends: 42688 [2024-11-16 09:51:16,865 INFO L226 Difference]: Without dead ends: 30397 [2024-11-16 09:51:16,888 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-16 09:51:16,889 INFO L432 NwaCegarLoop]: 1686 mSDtfsCounter, 1527 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1527 SdHoareTripleChecker+Valid, 1802 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-16 09:51:16,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1527 Valid, 1802 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:51:16,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30397 states. [2024-11-16 09:51:17,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30397 to 30394. [2024-11-16 09:51:17,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30394 states, 30392 states have (on average 1.431363516714925) internal successors, (43502), 30393 states have internal predecessors, (43502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:51:17,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30394 states to 30394 states and 43502 transitions. [2024-11-16 09:51:17,660 INFO L78 Accepts]: Start accepts. Automaton has 30394 states and 43502 transitions. Word has length 96 [2024-11-16 09:51:17,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:51:17,661 INFO L471 AbstractCegarLoop]: Abstraction has 30394 states and 43502 transitions. [2024-11-16 09:51:17,661 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-16 09:51:17,661 INFO L276 IsEmpty]: Start isEmpty. Operand 30394 states and 43502 transitions. [2024-11-16 09:51:17,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-16 09:51:17,662 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:51:17,662 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, 1, 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-16 09:51:17,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-16 09:51:17,662 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:51:17,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:51:17,663 INFO L85 PathProgramCache]: Analyzing trace with hash 373352353, now seen corresponding path program 1 times [2024-11-16 09:51:17,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:51:17,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47246692] [2024-11-16 09:51:17,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:51:17,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:51:17,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:51:17,747 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-16 09:51:17,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:51:17,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47246692] [2024-11-16 09:51:17,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47246692] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:51:17,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:51:17,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 09:51:17,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123960292] [2024-11-16 09:51:17,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:51:17,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 09:51:17,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:51:17,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 09:51:17,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 09:51:17,751 INFO L87 Difference]: Start difference. First operand 30394 states and 43502 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-16 09:51:18,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:51:18,713 INFO L93 Difference]: Finished difference Result 54980 states and 79095 transitions. [2024-11-16 09:51:18,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 09:51:18,714 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-16 09:51:18,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:51:18,795 INFO L225 Difference]: With dead ends: 54980 [2024-11-16 09:51:18,795 INFO L226 Difference]: Without dead ends: 41920 [2024-11-16 09:51:18,822 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-16 09:51:18,823 INFO L432 NwaCegarLoop]: 1695 mSDtfsCounter, 1530 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1530 SdHoareTripleChecker+Valid, 1799 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-16 09:51:18,823 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1530 Valid, 1799 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:51:18,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41920 states. [2024-11-16 09:51:19,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41920 to 41917. [2024-11-16 09:51:19,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41917 states, 41915 states have (on average 1.4257664320648933) internal successors, (59761), 41916 states have internal predecessors, (59761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:51:19,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41917 states to 41917 states and 59761 transitions. [2024-11-16 09:51:19,932 INFO L78 Accepts]: Start accepts. Automaton has 41917 states and 59761 transitions. Word has length 98 [2024-11-16 09:51:19,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:51:19,933 INFO L471 AbstractCegarLoop]: Abstraction has 41917 states and 59761 transitions. [2024-11-16 09:51:19,933 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-16 09:51:19,933 INFO L276 IsEmpty]: Start isEmpty. Operand 41917 states and 59761 transitions. [2024-11-16 09:51:19,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-16 09:51:19,941 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:51:19,941 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 09:51:19,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-16 09:51:19,941 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:51:19,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:51:19,942 INFO L85 PathProgramCache]: Analyzing trace with hash -80776029, now seen corresponding path program 1 times [2024-11-16 09:51:19,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:51:19,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598622193] [2024-11-16 09:51:19,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:51:19,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:51:20,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:51:20,489 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-16 09:51:20,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:51:20,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598622193] [2024-11-16 09:51:20,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598622193] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:51:20,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:51:20,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-16 09:51:20,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511693556] [2024-11-16 09:51:20,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:51:20,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 09:51:20,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:51:20,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 09:51:20,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-16 09:51:20,493 INFO L87 Difference]: Start difference. First operand 41917 states and 59761 transitions. Second operand has 10 states, 10 states have (on average 11.9) internal successors, (119), 10 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:51:25,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:51:25,179 INFO L93 Difference]: Finished difference Result 329688 states and 470019 transitions. [2024-11-16 09:51:25,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 09:51:25,180 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.9) internal successors, (119), 10 states have internal predecessors, (119), 0 states have call successors, (0), 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 123 [2024-11-16 09:51:25,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:51:26,075 INFO L225 Difference]: With dead ends: 329688 [2024-11-16 09:51:26,075 INFO L226 Difference]: Without dead ends: 294613 [2024-11-16 09:51:26,154 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-11-16 09:51:26,158 INFO L432 NwaCegarLoop]: 1721 mSDtfsCounter, 11803 mSDsluCounter, 3441 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11803 SdHoareTripleChecker+Valid, 5162 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 09:51:26,159 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11803 Valid, 5162 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 09:51:26,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294613 states. [2024-11-16 09:51:29,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294613 to 76989. [2024-11-16 09:51:29,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76989 states, 76987 states have (on average 1.4213438632496396) internal successors, (109425), 76988 states have internal predecessors, (109425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:51:29,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76989 states to 76989 states and 109425 transitions. [2024-11-16 09:51:29,916 INFO L78 Accepts]: Start accepts. Automaton has 76989 states and 109425 transitions. Word has length 123 [2024-11-16 09:51:29,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:51:29,917 INFO L471 AbstractCegarLoop]: Abstraction has 76989 states and 109425 transitions. [2024-11-16 09:51:29,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.9) internal successors, (119), 10 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:51:29,917 INFO L276 IsEmpty]: Start isEmpty. Operand 76989 states and 109425 transitions. [2024-11-16 09:51:29,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-16 09:51:29,927 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:51:29,927 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 09:51:29,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-16 09:51:29,928 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:51:29,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:51:29,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1027323875, now seen corresponding path program 1 times [2024-11-16 09:51:29,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:51:29,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067640445] [2024-11-16 09:51:29,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:51:29,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:51:29,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:51:30,264 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-16 09:51:30,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:51:30,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067640445] [2024-11-16 09:51:30,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067640445] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:51:30,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:51:30,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-16 09:51:30,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426567809] [2024-11-16 09:51:30,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:51:30,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 09:51:30,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:51:30,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 09:51:30,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-16 09:51:30,267 INFO L87 Difference]: Start difference. First operand 76989 states and 109425 transitions. Second operand has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:51:36,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:51:36,482 INFO L93 Difference]: Finished difference Result 364760 states and 519683 transitions. [2024-11-16 09:51:36,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 09:51:36,483 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 0 states have call successors, (0), 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 123 [2024-11-16 09:51:36,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:51:37,013 INFO L225 Difference]: With dead ends: 364760 [2024-11-16 09:51:37,013 INFO L226 Difference]: Without dead ends: 329685 [2024-11-16 09:51:37,111 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-11-16 09:51:37,111 INFO L432 NwaCegarLoop]: 1717 mSDtfsCounter, 11858 mSDsluCounter, 3223 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11858 SdHoareTripleChecker+Valid, 4940 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 09:51:37,112 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11858 Valid, 4940 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 09:51:37,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329685 states. [2024-11-16 09:51:42,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329685 to 129725. [2024-11-16 09:51:42,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129725 states, 129723 states have (on average 1.415824487561959) internal successors, (183665), 129724 states have internal predecessors, (183665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:51:42,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129725 states to 129725 states and 183665 transitions. [2024-11-16 09:51:42,798 INFO L78 Accepts]: Start accepts. Automaton has 129725 states and 183665 transitions. Word has length 123 [2024-11-16 09:51:42,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:51:42,798 INFO L471 AbstractCegarLoop]: Abstraction has 129725 states and 183665 transitions. [2024-11-16 09:51:42,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:51:42,799 INFO L276 IsEmpty]: Start isEmpty. Operand 129725 states and 183665 transitions. [2024-11-16 09:51:42,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-16 09:51:42,834 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:51:42,835 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 09:51:42,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-16 09:51:42,835 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:51:42,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:51:42,835 INFO L85 PathProgramCache]: Analyzing trace with hash 254783075, now seen corresponding path program 1 times [2024-11-16 09:51:42,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:51:42,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496523415] [2024-11-16 09:51:42,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:51:42,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:51:42,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:51:43,146 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-16 09:51:43,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:51:43,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496523415] [2024-11-16 09:51:43,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496523415] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:51:43,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:51:43,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-16 09:51:43,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684956947] [2024-11-16 09:51:43,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:51:43,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 09:51:43,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:51:43,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 09:51:43,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-16 09:51:43,149 INFO L87 Difference]: Start difference. First operand 129725 states and 183665 transitions. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:51:50,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:51:50,298 INFO L93 Difference]: Finished difference Result 399832 states and 569347 transitions. [2024-11-16 09:51:50,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 09:51:50,298 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 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 123 [2024-11-16 09:51:50,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:51:50,871 INFO L225 Difference]: With dead ends: 399832 [2024-11-16 09:51:50,872 INFO L226 Difference]: Without dead ends: 364757 [2024-11-16 09:51:50,962 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-11-16 09:51:50,963 INFO L432 NwaCegarLoop]: 1713 mSDtfsCounter, 11930 mSDsluCounter, 3253 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11930 SdHoareTripleChecker+Valid, 4966 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 09:51:50,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11930 Valid, 4966 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 09:51:51,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364757 states. [2024-11-16 09:51:57,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364757 to 164797. [2024-11-16 09:51:57,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164797 states, 164795 states have (on average 1.4158742680299767) internal successors, (233329), 164796 states have internal predecessors, (233329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:51:57,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164797 states to 164797 states and 233329 transitions. [2024-11-16 09:51:57,593 INFO L78 Accepts]: Start accepts. Automaton has 164797 states and 233329 transitions. Word has length 123 [2024-11-16 09:51:57,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:51:57,593 INFO L471 AbstractCegarLoop]: Abstraction has 164797 states and 233329 transitions. [2024-11-16 09:51:57,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:51:57,593 INFO L276 IsEmpty]: Start isEmpty. Operand 164797 states and 233329 transitions. [2024-11-16 09:51:57,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-16 09:51:57,607 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:51:57,607 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 09:51:57,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-16 09:51:57,608 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:51:57,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:51:57,608 INFO L85 PathProgramCache]: Analyzing trace with hash -746626653, now seen corresponding path program 1 times [2024-11-16 09:51:57,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:51:57,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923541413] [2024-11-16 09:51:57,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:51:57,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:51:57,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:51:57,905 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-16 09:51:57,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:51:57,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923541413] [2024-11-16 09:51:57,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923541413] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:51:57,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:51:57,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-16 09:51:57,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411614574] [2024-11-16 09:51:57,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:51:57,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 09:51:57,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:51:57,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 09:51:57,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-16 09:51:57,907 INFO L87 Difference]: Start difference. First operand 164797 states and 233329 transitions. Second operand has 10 states, 10 states have (on average 11.1) internal successors, (111), 10 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)