/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_LAZY.epf -i ../../../trunk/examples/svcomp/combinations/pc_sfifo_3.cil+token_ring.06.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 20:04:54,356 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 20:04:54,357 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 20:04:54,407 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 20:04:54,407 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 20:04:54,408 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 20:04:54,408 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 20:04:54,409 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 20:04:54,410 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 20:04:54,411 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 20:04:54,411 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 20:04:54,413 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 20:04:54,414 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 20:04:54,414 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 20:04:54,415 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 20:04:54,415 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 20:04:54,416 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 20:04:54,416 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 20:04:54,417 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 20:04:54,418 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 20:04:54,419 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 20:04:54,420 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 20:04:54,420 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 20:04:54,421 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 20:04:54,422 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 20:04:54,423 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 20:04:54,423 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 20:04:54,423 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 20:04:54,424 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 20:04:54,424 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 20:04:54,424 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 20:04:54,425 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 20:04:54,425 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 20:04:54,425 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 20:04:54,426 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 20:04:54,426 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 20:04:54,426 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 20:04:54,427 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 20:04:54,427 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 20:04:54,427 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 20:04:54,428 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 20:04:54,428 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_LAZY.epf [2022-01-10 20:04:54,442 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 20:04:54,442 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 20:04:54,442 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 20:04:54,442 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 20:04:54,446 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 20:04:54,447 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 20:04:54,447 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 20:04:54,447 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 20:04:54,447 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 20:04:54,447 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 20:04:54,448 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 20:04:54,448 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 20:04:54,448 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 20:04:54,448 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 20:04:54,448 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 20:04:54,449 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 20:04:54,449 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 20:04:54,449 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 20:04:54,449 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 20:04:54,449 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 20:04:54,449 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 20:04:54,449 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 20:04:54,449 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 20:04:54,449 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 20:04:54,450 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 20:04:54,450 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 20:04:54,450 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 20:04:54,450 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 20:04:54,450 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 20:04:54,450 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 20:04:54,450 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 20:04:54,450 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 20:04:54,451 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 20:04:54,451 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_LAZY 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 20:04:54,615 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 20:04:54,633 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 20:04:54,636 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 20:04:54,637 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 20:04:54,638 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 20:04:54,639 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/combinations/pc_sfifo_3.cil+token_ring.06.cil-2.c [2022-01-10 20:04:54,708 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c37aa8d48/fb2095dbba7f4cdd9e21f64912876345/FLAG071d7d4b5 [2022-01-10 20:04:55,134 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 20:04:55,135 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_3.cil+token_ring.06.cil-2.c [2022-01-10 20:04:55,145 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c37aa8d48/fb2095dbba7f4cdd9e21f64912876345/FLAG071d7d4b5 [2022-01-10 20:04:55,156 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c37aa8d48/fb2095dbba7f4cdd9e21f64912876345 [2022-01-10 20:04:55,157 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 20:04:55,158 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 20:04:55,161 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 20:04:55,161 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 20:04:55,164 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 20:04:55,165 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 08:04:55" (1/1) ... [2022-01-10 20:04:55,165 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5de95f33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:04:55, skipping insertion in model container [2022-01-10 20:04:55,166 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 08:04:55" (1/1) ... [2022-01-10 20:04:55,170 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 20:04:55,210 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 20:04:55,331 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_3.cil+token_ring.06.cil-2.c[911,924] [2022-01-10 20:04:55,365 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_3.cil+token_ring.06.cil-2.c[8416,8429] [2022-01-10 20:04:55,414 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 20:04:55,431 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 20:04:55,439 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_3.cil+token_ring.06.cil-2.c[911,924] [2022-01-10 20:04:55,453 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_3.cil+token_ring.06.cil-2.c[8416,8429] [2022-01-10 20:04:55,485 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 20:04:55,504 INFO L208 MainTranslator]: Completed translation [2022-01-10 20:04:55,505 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:04:55 WrapperNode [2022-01-10 20:04:55,505 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 20:04:55,505 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 20:04:55,506 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 20:04:55,506 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 20:04:55,512 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:04:55" (1/1) ... [2022-01-10 20:04:55,521 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:04:55" (1/1) ... [2022-01-10 20:04:55,577 INFO L137 Inliner]: procedures = 68, calls = 79, calls flagged for inlining = 74, calls inlined = 146, statements flattened = 2054 [2022-01-10 20:04:55,577 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 20:04:55,578 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 20:04:55,578 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 20:04:55,578 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 20:04:55,590 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:04:55" (1/1) ... [2022-01-10 20:04:55,590 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:04:55" (1/1) ... [2022-01-10 20:04:55,597 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:04:55" (1/1) ... [2022-01-10 20:04:55,597 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:04:55" (1/1) ... [2022-01-10 20:04:55,614 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:04:55" (1/1) ... [2022-01-10 20:04:55,659 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:04:55" (1/1) ... [2022-01-10 20:04:55,662 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:04:55" (1/1) ... [2022-01-10 20:04:55,667 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 20:04:55,668 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 20:04:55,668 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 20:04:55,668 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 20:04:55,683 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:04:55" (1/1) ... [2022-01-10 20:04:55,689 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 20:04:55,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 20:04:55,719 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 20:04:55,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 20:04:55,753 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 20:04:55,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 20:04:55,753 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 20:04:55,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 20:04:55,833 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 20:04:55,834 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 20:04:57,066 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##107: assume !(1bv32 == ~q_free~0); [2022-01-10 20:04:57,067 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##106: assume 1bv32 == ~q_free~0;~c_dr_st~0 := 2bv32;~c_dr_pc~0 := 2bv32;~a_t~0 := do_read_c_~a~0#1; [2022-01-10 20:04:57,067 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 20:04:57,085 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 20:04:57,086 INFO L299 CfgBuilder]: Removed 13 assume(true) statements. [2022-01-10 20:04:57,088 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 08:04:57 BoogieIcfgContainer [2022-01-10 20:04:57,088 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 20:04:57,088 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 20:04:57,089 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 20:04:57,091 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 20:04:57,093 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 08:04:57" (1/1) ... [2022-01-10 20:04:57,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 08:04:57 BasicIcfg [2022-01-10 20:04:57,332 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 20:04:57,335 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 20:04:57,335 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 20:04:57,337 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 20:04:57,337 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 08:04:55" (1/4) ... [2022-01-10 20:04:57,338 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@455a4d74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 08:04:57, skipping insertion in model container [2022-01-10 20:04:57,338 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:04:55" (2/4) ... [2022-01-10 20:04:57,338 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@455a4d74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 08:04:57, skipping insertion in model container [2022-01-10 20:04:57,338 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 08:04:57" (3/4) ... [2022-01-10 20:04:57,338 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@455a4d74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 08:04:57, skipping insertion in model container [2022-01-10 20:04:57,339 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 08:04:57" (4/4) ... [2022-01-10 20:04:57,339 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.06.cil-2.cTransformedIcfg [2022-01-10 20:04:57,343 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 20:04:57,343 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-01-10 20:04:57,385 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 20:04:57,389 INFO L339 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 20:04:57,389 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-01-10 20:04:57,409 INFO L276 IsEmpty]: Start isEmpty. Operand has 830 states, 826 states have (on average 1.5351089588377724) internal successors, (1268), 829 states have internal predecessors, (1268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:04:57,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-10 20:04:57,414 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:04:57,415 INFO L514 BasicCegarLoop]: 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] [2022-01-10 20:04:57,415 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:04:57,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:04:57,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1469726069, now seen corresponding path program 1 times [2022-01-10 20:04:57,433 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:04:57,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096685393] [2022-01-10 20:04:57,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:04:57,434 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:04:57,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:04:57,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:04:57,698 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:04:57,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096685393] [2022-01-10 20:04:57,698 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096685393] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:04:57,698 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:04:57,698 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:04:57,700 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79861900] [2022-01-10 20:04:57,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:04:57,703 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:04:57,703 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:04:57,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:04:57,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:04:57,731 INFO L87 Difference]: Start difference. First operand has 830 states, 826 states have (on average 1.5351089588377724) internal successors, (1268), 829 states have internal predecessors, (1268), 0 states have call successors, (0), 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 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:04:57,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:04:57,922 INFO L93 Difference]: Finished difference Result 1692 states and 2581 transitions. [2022-01-10 20:04:57,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:04:57,924 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2022-01-10 20:04:57,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:04:57,936 INFO L225 Difference]: With dead ends: 1692 [2022-01-10 20:04:57,936 INFO L226 Difference]: Without dead ends: 953 [2022-01-10 20:04:57,940 INFO L932 BasicCegarLoop]: 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 [2022-01-10 20:04:57,947 INFO L933 BasicCegarLoop]: 1230 mSDtfsCounter, 185 mSDsluCounter, 1198 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 2428 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 20:04:57,948 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [185 Valid, 2428 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 20:04:57,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2022-01-10 20:04:58,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 949. [2022-01-10 20:04:58,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 949 states, 946 states have (on average 1.4915433403805496) internal successors, (1411), 948 states have internal predecessors, (1411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:04:58,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 1411 transitions. [2022-01-10 20:04:58,031 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 1411 transitions. Word has length 44 [2022-01-10 20:04:58,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:04:58,032 INFO L470 AbstractCegarLoop]: Abstraction has 949 states and 1411 transitions. [2022-01-10 20:04:58,032 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:04:58,032 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 1411 transitions. [2022-01-10 20:04:58,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-10 20:04:58,033 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:04:58,034 INFO L514 BasicCegarLoop]: 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] [2022-01-10 20:04:58,034 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 20:04:58,034 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:04:58,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:04:58,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1327564427, now seen corresponding path program 1 times [2022-01-10 20:04:58,035 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:04:58,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968925232] [2022-01-10 20:04:58,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:04:58,035 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:04:58,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:04:58,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:04:58,081 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:04:58,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968925232] [2022-01-10 20:04:58,081 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968925232] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:04:58,082 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:04:58,082 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:04:58,082 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118590841] [2022-01-10 20:04:58,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:04:58,083 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:04:58,083 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:04:58,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:04:58,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:04:58,084 INFO L87 Difference]: Start difference. First operand 949 states and 1411 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:04:58,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:04:58,193 INFO L93 Difference]: Finished difference Result 1367 states and 2016 transitions. [2022-01-10 20:04:58,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:04:58,194 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2022-01-10 20:04:58,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:04:58,197 INFO L225 Difference]: With dead ends: 1367 [2022-01-10 20:04:58,197 INFO L226 Difference]: Without dead ends: 1127 [2022-01-10 20:04:58,199 INFO L932 BasicCegarLoop]: 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 [2022-01-10 20:04:58,200 INFO L933 BasicCegarLoop]: 1215 mSDtfsCounter, 1189 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1189 SdHoareTripleChecker+Valid, 1350 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 20:04:58,200 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1189 Valid, 1350 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 20:04:58,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1127 states. [2022-01-10 20:04:58,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1127 to 1119. [2022-01-10 20:04:58,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1119 states, 1116 states have (on average 1.474910394265233) internal successors, (1646), 1118 states have internal predecessors, (1646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:04:58,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1119 states to 1119 states and 1646 transitions. [2022-01-10 20:04:58,243 INFO L78 Accepts]: Start accepts. Automaton has 1119 states and 1646 transitions. Word has length 44 [2022-01-10 20:04:58,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:04:58,244 INFO L470 AbstractCegarLoop]: Abstraction has 1119 states and 1646 transitions. [2022-01-10 20:04:58,245 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:04:58,247 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 1646 transitions. [2022-01-10 20:04:58,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-01-10 20:04:58,256 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:04:58,256 INFO L514 BasicCegarLoop]: 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] [2022-01-10 20:04:58,256 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 20:04:58,256 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:04:58,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:04:58,257 INFO L85 PathProgramCache]: Analyzing trace with hash 2095229846, now seen corresponding path program 1 times [2022-01-10 20:04:58,257 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:04:58,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463049891] [2022-01-10 20:04:58,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:04:58,257 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:04:58,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:04:58,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:04:58,325 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:04:58,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463049891] [2022-01-10 20:04:58,326 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463049891] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:04:58,326 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:04:58,326 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:04:58,326 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591660695] [2022-01-10 20:04:58,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:04:58,327 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:04:58,328 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:04:58,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:04:58,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:04:58,329 INFO L87 Difference]: Start difference. First operand 1119 states and 1646 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:04:58,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:04:58,383 INFO L93 Difference]: Finished difference Result 1841 states and 2680 transitions. [2022-01-10 20:04:58,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:04:58,384 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2022-01-10 20:04:58,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:04:58,388 INFO L225 Difference]: With dead ends: 1841 [2022-01-10 20:04:58,388 INFO L226 Difference]: Without dead ends: 1445 [2022-01-10 20:04:58,392 INFO L932 BasicCegarLoop]: 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 [2022-01-10 20:04:58,394 INFO L933 BasicCegarLoop]: 1209 mSDtfsCounter, 1173 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1173 SdHoareTripleChecker+Valid, 1347 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:04:58,395 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1173 Valid, 1347 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:04:58,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2022-01-10 20:04:58,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1437. [2022-01-10 20:04:58,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1437 states, 1434 states have (on average 1.4497907949790796) internal successors, (2079), 1436 states have internal predecessors, (2079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:04:58,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1437 states to 1437 states and 2079 transitions. [2022-01-10 20:04:58,431 INFO L78 Accepts]: Start accepts. Automaton has 1437 states and 2079 transitions. Word has length 45 [2022-01-10 20:04:58,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:04:58,431 INFO L470 AbstractCegarLoop]: Abstraction has 1437 states and 2079 transitions. [2022-01-10 20:04:58,431 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:04:58,431 INFO L276 IsEmpty]: Start isEmpty. Operand 1437 states and 2079 transitions. [2022-01-10 20:04:58,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-01-10 20:04:58,432 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:04:58,432 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:04:58,433 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 20:04:58,433 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:04:58,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:04:58,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1062238367, now seen corresponding path program 1 times [2022-01-10 20:04:58,433 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:04:58,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688501415] [2022-01-10 20:04:58,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:04:58,434 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:04:58,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:04:58,505 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-10 20:04:58,505 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:04:58,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688501415] [2022-01-10 20:04:58,505 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688501415] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:04:58,506 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:04:58,506 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:04:58,506 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584310775] [2022-01-10 20:04:58,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:04:58,506 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:04:58,506 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:04:58,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:04:58,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:04:58,507 INFO L87 Difference]: Start difference. First operand 1437 states and 2079 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:04:58,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:04:58,587 INFO L93 Difference]: Finished difference Result 2805 states and 3981 transitions. [2022-01-10 20:04:58,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:04:58,588 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2022-01-10 20:04:58,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:04:58,594 INFO L225 Difference]: With dead ends: 2805 [2022-01-10 20:04:58,595 INFO L226 Difference]: Without dead ends: 2109 [2022-01-10 20:04:58,598 INFO L932 BasicCegarLoop]: 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 [2022-01-10 20:04:58,602 INFO L933 BasicCegarLoop]: 1212 mSDtfsCounter, 1168 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1168 SdHoareTripleChecker+Valid, 1377 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:04:58,603 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1168 Valid, 1377 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:04:58,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2109 states. [2022-01-10 20:04:58,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2109 to 2105. [2022-01-10 20:04:58,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2105 states, 2102 states have (on average 1.4105613701236916) internal successors, (2965), 2104 states have internal predecessors, (2965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:04:58,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2105 states to 2105 states and 2965 transitions. [2022-01-10 20:04:58,694 INFO L78 Accepts]: Start accepts. Automaton has 2105 states and 2965 transitions. Word has length 59 [2022-01-10 20:04:58,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:04:58,696 INFO L470 AbstractCegarLoop]: Abstraction has 2105 states and 2965 transitions. [2022-01-10 20:04:58,696 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:04:58,696 INFO L276 IsEmpty]: Start isEmpty. Operand 2105 states and 2965 transitions. [2022-01-10 20:04:58,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-01-10 20:04:58,697 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:04:58,697 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:04:58,697 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 20:04:58,698 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:04:58,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:04:58,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1325989051, now seen corresponding path program 1 times [2022-01-10 20:04:58,699 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:04:58,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736490235] [2022-01-10 20:04:58,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:04:58,700 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:04:58,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:04:58,755 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:04:58,755 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:04:58,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736490235] [2022-01-10 20:04:58,756 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736490235] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:04:58,756 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:04:58,756 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:04:58,756 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467698687] [2022-01-10 20:04:58,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:04:58,756 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:04:58,756 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:04:58,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:04:58,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:04:58,757 INFO L87 Difference]: Start difference. First operand 2105 states and 2965 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:04:58,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:04:58,862 INFO L93 Difference]: Finished difference Result 4729 states and 6547 transitions. [2022-01-10 20:04:58,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:04:58,863 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2022-01-10 20:04:58,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:04:58,872 INFO L225 Difference]: With dead ends: 4729 [2022-01-10 20:04:58,873 INFO L226 Difference]: Without dead ends: 3409 [2022-01-10 20:04:58,875 INFO L932 BasicCegarLoop]: 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 [2022-01-10 20:04:58,875 INFO L933 BasicCegarLoop]: 1363 mSDtfsCounter, 146 mSDsluCounter, 1199 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 2562 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:04:58,876 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 2562 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:04:58,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3409 states. [2022-01-10 20:04:59,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3409 to 3409. [2022-01-10 20:04:59,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3409 states, 3406 states have (on average 1.3778625954198473) internal successors, (4693), 3408 states have internal predecessors, (4693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:04:59,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3409 states to 3409 states and 4693 transitions. [2022-01-10 20:04:59,015 INFO L78 Accepts]: Start accepts. Automaton has 3409 states and 4693 transitions. Word has length 61 [2022-01-10 20:04:59,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:04:59,017 INFO L470 AbstractCegarLoop]: Abstraction has 3409 states and 4693 transitions. [2022-01-10 20:04:59,017 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:04:59,017 INFO L276 IsEmpty]: Start isEmpty. Operand 3409 states and 4693 transitions. [2022-01-10 20:04:59,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-10 20:04:59,021 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:04:59,022 INFO L514 BasicCegarLoop]: 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, 1] [2022-01-10 20:04:59,022 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 20:04:59,022 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:04:59,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:04:59,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1294775676, now seen corresponding path program 1 times [2022-01-10 20:04:59,023 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:04:59,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759744123] [2022-01-10 20:04:59,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:04:59,023 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:04:59,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:04:59,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:04:59,075 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:04:59,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759744123] [2022-01-10 20:04:59,075 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759744123] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:04:59,075 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:04:59,075 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:04:59,076 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082028948] [2022-01-10 20:04:59,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:04:59,076 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:04:59,077 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:04:59,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:04:59,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:04:59,077 INFO L87 Difference]: Start difference. First operand 3409 states and 4693 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:04:59,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:04:59,147 INFO L93 Difference]: Finished difference Result 4086 states and 5707 transitions. [2022-01-10 20:04:59,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:04:59,148 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-10 20:04:59,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:04:59,157 INFO L225 Difference]: With dead ends: 4086 [2022-01-10 20:04:59,157 INFO L226 Difference]: Without dead ends: 3409 [2022-01-10 20:04:59,159 INFO L932 BasicCegarLoop]: 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 [2022-01-10 20:04:59,160 INFO L933 BasicCegarLoop]: 1214 mSDtfsCounter, 1016 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1016 SdHoareTripleChecker+Valid, 1408 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:04:59,160 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1016 Valid, 1408 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:04:59,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3409 states. [2022-01-10 20:04:59,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3409 to 3409. [2022-01-10 20:04:59,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3409 states, 3406 states have (on average 1.3775689958896067) internal successors, (4692), 3408 states have internal predecessors, (4692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:04:59,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3409 states to 3409 states and 4692 transitions. [2022-01-10 20:04:59,259 INFO L78 Accepts]: Start accepts. Automaton has 3409 states and 4692 transitions. Word has length 99 [2022-01-10 20:04:59,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:04:59,259 INFO L470 AbstractCegarLoop]: Abstraction has 3409 states and 4692 transitions. [2022-01-10 20:04:59,260 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:04:59,260 INFO L276 IsEmpty]: Start isEmpty. Operand 3409 states and 4692 transitions. [2022-01-10 20:04:59,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-10 20:04:59,265 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:04:59,265 INFO L514 BasicCegarLoop]: 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, 1] [2022-01-10 20:04:59,265 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 20:04:59,265 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:04:59,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:04:59,266 INFO L85 PathProgramCache]: Analyzing trace with hash -853021181, now seen corresponding path program 1 times [2022-01-10 20:04:59,266 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:04:59,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50187857] [2022-01-10 20:04:59,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:04:59,266 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:04:59,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:04:59,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:04:59,330 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:04:59,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50187857] [2022-01-10 20:04:59,331 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50187857] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:04:59,331 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:04:59,331 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:04:59,331 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906759777] [2022-01-10 20:04:59,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:04:59,332 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:04:59,332 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:04:59,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:04:59,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:04:59,332 INFO L87 Difference]: Start difference. First operand 3409 states and 4692 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:04:59,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:04:59,444 INFO L93 Difference]: Finished difference Result 4620 states and 6495 transitions. [2022-01-10 20:04:59,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:04:59,445 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-10 20:04:59,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:04:59,458 INFO L225 Difference]: With dead ends: 4620 [2022-01-10 20:04:59,458 INFO L226 Difference]: Without dead ends: 3950 [2022-01-10 20:04:59,460 INFO L932 BasicCegarLoop]: 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 [2022-01-10 20:04:59,461 INFO L933 BasicCegarLoop]: 1209 mSDtfsCounter, 1124 mSDsluCounter, 868 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1124 SdHoareTripleChecker+Valid, 2077 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:04:59,462 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1124 Valid, 2077 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:04:59,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3950 states. [2022-01-10 20:04:59,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3950 to 3948. [2022-01-10 20:04:59,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3948 states, 3945 states have (on average 1.3913814955640051) internal successors, (5489), 3947 states have internal predecessors, (5489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:04:59,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3948 states to 3948 states and 5489 transitions. [2022-01-10 20:04:59,591 INFO L78 Accepts]: Start accepts. Automaton has 3948 states and 5489 transitions. Word has length 99 [2022-01-10 20:04:59,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:04:59,592 INFO L470 AbstractCegarLoop]: Abstraction has 3948 states and 5489 transitions. [2022-01-10 20:04:59,592 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:04:59,592 INFO L276 IsEmpty]: Start isEmpty. Operand 3948 states and 5489 transitions. [2022-01-10 20:04:59,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-10 20:04:59,598 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:04:59,599 INFO L514 BasicCegarLoop]: 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, 1] [2022-01-10 20:04:59,599 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 20:04:59,599 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:04:59,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:04:59,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1008276771, now seen corresponding path program 1 times [2022-01-10 20:04:59,600 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:04:59,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128990241] [2022-01-10 20:04:59,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:04:59,600 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:04:59,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:04:59,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:04:59,641 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:04:59,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128990241] [2022-01-10 20:04:59,641 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128990241] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:04:59,641 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:04:59,641 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:04:59,641 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632068597] [2022-01-10 20:04:59,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:04:59,641 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:04:59,642 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:04:59,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:04:59,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:04:59,642 INFO L87 Difference]: Start difference. First operand 3948 states and 5489 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:04:59,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:04:59,753 INFO L93 Difference]: Finished difference Result 5156 states and 7286 transitions. [2022-01-10 20:04:59,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:04:59,754 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-10 20:04:59,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:04:59,763 INFO L225 Difference]: With dead ends: 5156 [2022-01-10 20:04:59,764 INFO L226 Difference]: Without dead ends: 3948 [2022-01-10 20:04:59,766 INFO L932 BasicCegarLoop]: 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 [2022-01-10 20:04:59,766 INFO L933 BasicCegarLoop]: 1203 mSDtfsCounter, 1194 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1194 SdHoareTripleChecker+Valid, 1203 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:04:59,766 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1194 Valid, 1203 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:04:59,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3948 states. [2022-01-10 20:04:59,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3948 to 3948. [2022-01-10 20:04:59,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3948 states, 3945 states have (on average 1.3893536121673005) internal successors, (5481), 3947 states have internal predecessors, (5481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:04:59,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3948 states to 3948 states and 5481 transitions. [2022-01-10 20:04:59,874 INFO L78 Accepts]: Start accepts. Automaton has 3948 states and 5481 transitions. Word has length 99 [2022-01-10 20:04:59,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:04:59,874 INFO L470 AbstractCegarLoop]: Abstraction has 3948 states and 5481 transitions. [2022-01-10 20:04:59,874 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:04:59,875 INFO L276 IsEmpty]: Start isEmpty. Operand 3948 states and 5481 transitions. [2022-01-10 20:04:59,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-10 20:04:59,878 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:04:59,878 INFO L514 BasicCegarLoop]: 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, 1] [2022-01-10 20:04:59,878 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 20:04:59,879 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:04:59,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:04:59,879 INFO L85 PathProgramCache]: Analyzing trace with hash -455702013, now seen corresponding path program 1 times [2022-01-10 20:04:59,879 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:04:59,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191142347] [2022-01-10 20:04:59,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:04:59,879 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:04:59,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:04:59,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:04:59,908 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:04:59,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191142347] [2022-01-10 20:04:59,908 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191142347] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:04:59,908 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:04:59,908 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:04:59,908 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889947249] [2022-01-10 20:04:59,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:04:59,909 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:04:59,909 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:04:59,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:04:59,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:04:59,909 INFO L87 Difference]: Start difference. First operand 3948 states and 5481 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:05:00,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:05:00,007 INFO L93 Difference]: Finished difference Result 5155 states and 7269 transitions. [2022-01-10 20:05:00,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:05:00,007 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-10 20:05:00,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:05:00,018 INFO L225 Difference]: With dead ends: 5155 [2022-01-10 20:05:00,018 INFO L226 Difference]: Without dead ends: 3948 [2022-01-10 20:05:00,021 INFO L932 BasicCegarLoop]: 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 [2022-01-10 20:05:00,022 INFO L933 BasicCegarLoop]: 1198 mSDtfsCounter, 1188 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1188 SdHoareTripleChecker+Valid, 1198 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:05:00,022 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1188 Valid, 1198 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:05:00,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3948 states. [2022-01-10 20:05:00,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3948 to 3948. [2022-01-10 20:05:00,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3948 states, 3945 states have (on average 1.3873257287705958) internal successors, (5473), 3947 states have internal predecessors, (5473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:05:00,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3948 states to 3948 states and 5473 transitions. [2022-01-10 20:05:00,173 INFO L78 Accepts]: Start accepts. Automaton has 3948 states and 5473 transitions. Word has length 99 [2022-01-10 20:05:00,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:05:00,176 INFO L470 AbstractCegarLoop]: Abstraction has 3948 states and 5473 transitions. [2022-01-10 20:05:00,176 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:05:00,177 INFO L276 IsEmpty]: Start isEmpty. Operand 3948 states and 5473 transitions. [2022-01-10 20:05:00,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-10 20:05:00,182 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:05:00,182 INFO L514 BasicCegarLoop]: 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, 1] [2022-01-10 20:05:00,182 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-10 20:05:00,183 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:05:00,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:05:00,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1713830179, now seen corresponding path program 1 times [2022-01-10 20:05:00,183 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:05:00,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125630325] [2022-01-10 20:05:00,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:05:00,183 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:05:00,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:05:00,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:05:00,220 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:05:00,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125630325] [2022-01-10 20:05:00,220 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125630325] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:05:00,220 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:05:00,220 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:05:00,220 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039041462] [2022-01-10 20:05:00,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:05:00,220 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:05:00,220 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:05:00,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:05:00,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:05:00,221 INFO L87 Difference]: Start difference. First operand 3948 states and 5473 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:05:00,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:05:00,336 INFO L93 Difference]: Finished difference Result 5154 states and 7252 transitions. [2022-01-10 20:05:00,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:05:00,336 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-10 20:05:00,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:05:00,347 INFO L225 Difference]: With dead ends: 5154 [2022-01-10 20:05:00,347 INFO L226 Difference]: Without dead ends: 3948 [2022-01-10 20:05:00,350 INFO L932 BasicCegarLoop]: 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 [2022-01-10 20:05:00,350 INFO L933 BasicCegarLoop]: 1193 mSDtfsCounter, 1182 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1182 SdHoareTripleChecker+Valid, 1193 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:05:00,350 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1182 Valid, 1193 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:05:00,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3948 states. [2022-01-10 20:05:00,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3948 to 3948. [2022-01-10 20:05:00,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3948 states, 3945 states have (on average 1.385297845373891) internal successors, (5465), 3947 states have internal predecessors, (5465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:05:00,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3948 states to 3948 states and 5465 transitions. [2022-01-10 20:05:00,474 INFO L78 Accepts]: Start accepts. Automaton has 3948 states and 5465 transitions. Word has length 99 [2022-01-10 20:05:00,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:05:00,474 INFO L470 AbstractCegarLoop]: Abstraction has 3948 states and 5465 transitions. [2022-01-10 20:05:00,474 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:05:00,474 INFO L276 IsEmpty]: Start isEmpty. Operand 3948 states and 5465 transitions. [2022-01-10 20:05:00,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-10 20:05:00,478 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:05:00,478 INFO L514 BasicCegarLoop]: 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, 1] [2022-01-10 20:05:00,479 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-10 20:05:00,479 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:05:00,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:05:00,479 INFO L85 PathProgramCache]: Analyzing trace with hash 259794435, now seen corresponding path program 1 times [2022-01-10 20:05:00,479 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:05:00,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297066621] [2022-01-10 20:05:00,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:05:00,480 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:05:00,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:05:00,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:05:00,513 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:05:00,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297066621] [2022-01-10 20:05:00,513 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297066621] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:05:00,513 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:05:00,514 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:05:00,514 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626700333] [2022-01-10 20:05:00,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:05:00,514 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:05:00,514 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:05:00,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:05:00,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:05:00,515 INFO L87 Difference]: Start difference. First operand 3948 states and 5465 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:05:00,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:05:00,612 INFO L93 Difference]: Finished difference Result 5153 states and 7235 transitions. [2022-01-10 20:05:00,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:05:00,613 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-10 20:05:00,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:05:00,627 INFO L225 Difference]: With dead ends: 5153 [2022-01-10 20:05:00,628 INFO L226 Difference]: Without dead ends: 3948 [2022-01-10 20:05:00,630 INFO L932 BasicCegarLoop]: 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 [2022-01-10 20:05:00,631 INFO L933 BasicCegarLoop]: 1188 mSDtfsCounter, 1176 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1176 SdHoareTripleChecker+Valid, 1188 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:05:00,631 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1176 Valid, 1188 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:05:00,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3948 states. [2022-01-10 20:05:00,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3948 to 3948. [2022-01-10 20:05:00,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3948 states, 3945 states have (on average 1.3832699619771862) internal successors, (5457), 3947 states have internal predecessors, (5457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:05:00,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3948 states to 3948 states and 5457 transitions. [2022-01-10 20:05:00,776 INFO L78 Accepts]: Start accepts. Automaton has 3948 states and 5457 transitions. Word has length 99 [2022-01-10 20:05:00,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:05:00,777 INFO L470 AbstractCegarLoop]: Abstraction has 3948 states and 5457 transitions. [2022-01-10 20:05:00,777 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:05:00,777 INFO L276 IsEmpty]: Start isEmpty. Operand 3948 states and 5457 transitions. [2022-01-10 20:05:00,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-10 20:05:00,781 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:05:00,781 INFO L514 BasicCegarLoop]: 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, 1] [2022-01-10 20:05:00,781 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-10 20:05:00,781 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:05:00,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:05:00,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1034035933, now seen corresponding path program 1 times [2022-01-10 20:05:00,781 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:05:00,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446367404] [2022-01-10 20:05:00,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:05:00,782 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:05:00,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:05:00,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:05:00,806 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:05:00,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446367404] [2022-01-10 20:05:00,806 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446367404] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:05:00,806 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:05:00,806 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:05:00,806 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948882743] [2022-01-10 20:05:00,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:05:00,806 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:05:00,807 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:05:00,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:05:00,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:05:00,807 INFO L87 Difference]: Start difference. First operand 3948 states and 5457 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:05:00,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:05:00,901 INFO L93 Difference]: Finished difference Result 5152 states and 7218 transitions. [2022-01-10 20:05:00,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:05:00,901 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-10 20:05:00,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:05:00,907 INFO L225 Difference]: With dead ends: 5152 [2022-01-10 20:05:00,907 INFO L226 Difference]: Without dead ends: 3948 [2022-01-10 20:05:00,910 INFO L932 BasicCegarLoop]: 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 [2022-01-10 20:05:00,910 INFO L933 BasicCegarLoop]: 1183 mSDtfsCounter, 1170 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1170 SdHoareTripleChecker+Valid, 1183 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:05:00,910 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1170 Valid, 1183 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:05:00,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3948 states. [2022-01-10 20:05:01,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3948 to 3948. [2022-01-10 20:05:01,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3948 states, 3945 states have (on average 1.3812420785804815) internal successors, (5449), 3947 states have internal predecessors, (5449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:05:01,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3948 states to 3948 states and 5449 transitions. [2022-01-10 20:05:01,036 INFO L78 Accepts]: Start accepts. Automaton has 3948 states and 5449 transitions. Word has length 99 [2022-01-10 20:05:01,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:05:01,036 INFO L470 AbstractCegarLoop]: Abstraction has 3948 states and 5449 transitions. [2022-01-10 20:05:01,036 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:05:01,037 INFO L276 IsEmpty]: Start isEmpty. Operand 3948 states and 5449 transitions. [2022-01-10 20:05:01,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-10 20:05:01,040 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:05:01,040 INFO L514 BasicCegarLoop]: 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, 1] [2022-01-10 20:05:01,041 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-10 20:05:01,041 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:05:01,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:05:01,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1629961725, now seen corresponding path program 1 times [2022-01-10 20:05:01,041 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:05:01,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715762773] [2022-01-10 20:05:01,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:05:01,042 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:05:01,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:05:01,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:05:01,066 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:05:01,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715762773] [2022-01-10 20:05:01,066 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715762773] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:05:01,067 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:05:01,067 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:05:01,067 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853723077] [2022-01-10 20:05:01,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:05:01,067 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:05:01,067 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:05:01,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:05:01,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:05:01,068 INFO L87 Difference]: Start difference. First operand 3948 states and 5449 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:05:01,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:05:01,165 INFO L93 Difference]: Finished difference Result 5151 states and 7201 transitions. [2022-01-10 20:05:01,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:05:01,165 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-10 20:05:01,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:05:01,172 INFO L225 Difference]: With dead ends: 5151 [2022-01-10 20:05:01,172 INFO L226 Difference]: Without dead ends: 3948 [2022-01-10 20:05:01,174 INFO L932 BasicCegarLoop]: 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 [2022-01-10 20:05:01,175 INFO L933 BasicCegarLoop]: 1178 mSDtfsCounter, 1164 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1164 SdHoareTripleChecker+Valid, 1178 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:05:01,175 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1164 Valid, 1178 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:05:01,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3948 states. [2022-01-10 20:05:01,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3948 to 3948. [2022-01-10 20:05:01,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3948 states, 3945 states have (on average 1.3792141951837769) internal successors, (5441), 3947 states have internal predecessors, (5441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:05:01,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3948 states to 3948 states and 5441 transitions. [2022-01-10 20:05:01,307 INFO L78 Accepts]: Start accepts. Automaton has 3948 states and 5441 transitions. Word has length 99 [2022-01-10 20:05:01,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:05:01,308 INFO L470 AbstractCegarLoop]: Abstraction has 3948 states and 5441 transitions. [2022-01-10 20:05:01,308 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:05:01,308 INFO L276 IsEmpty]: Start isEmpty. Operand 3948 states and 5441 transitions. [2022-01-10 20:05:01,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-10 20:05:01,312 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:05:01,313 INFO L514 BasicCegarLoop]: 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, 1] [2022-01-10 20:05:01,313 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-10 20:05:01,313 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:05:01,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:05:01,313 INFO L85 PathProgramCache]: Analyzing trace with hash -956448477, now seen corresponding path program 1 times [2022-01-10 20:05:01,313 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:05:01,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099817766] [2022-01-10 20:05:01,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:05:01,314 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:05:01,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:05:01,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:05:01,339 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:05:01,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099817766] [2022-01-10 20:05:01,340 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099817766] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:05:01,340 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:05:01,340 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:05:01,340 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233797578] [2022-01-10 20:05:01,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:05:01,340 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:05:01,340 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:05:01,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:05:01,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:05:01,341 INFO L87 Difference]: Start difference. First operand 3948 states and 5441 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:05:01,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:05:01,466 INFO L93 Difference]: Finished difference Result 5150 states and 7184 transitions. [2022-01-10 20:05:01,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:05:01,467 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-10 20:05:01,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:05:01,473 INFO L225 Difference]: With dead ends: 5150 [2022-01-10 20:05:01,474 INFO L226 Difference]: Without dead ends: 3948 [2022-01-10 20:05:01,476 INFO L932 BasicCegarLoop]: 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 [2022-01-10 20:05:01,477 INFO L933 BasicCegarLoop]: 1155 mSDtfsCounter, 1077 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1077 SdHoareTripleChecker+Valid, 1223 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:05:01,477 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1077 Valid, 1223 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:05:01,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3948 states. [2022-01-10 20:05:01,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3948 to 3948. [2022-01-10 20:05:01,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3948 states, 3945 states have (on average 1.3731305449936628) internal successors, (5417), 3947 states have internal predecessors, (5417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:05:01,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3948 states to 3948 states and 5417 transitions. [2022-01-10 20:05:01,626 INFO L78 Accepts]: Start accepts. Automaton has 3948 states and 5417 transitions. Word has length 99 [2022-01-10 20:05:01,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:05:01,626 INFO L470 AbstractCegarLoop]: Abstraction has 3948 states and 5417 transitions. [2022-01-10 20:05:01,626 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:05:01,626 INFO L276 IsEmpty]: Start isEmpty. Operand 3948 states and 5417 transitions. [2022-01-10 20:05:01,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-10 20:05:01,630 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:05:01,630 INFO L514 BasicCegarLoop]: 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, 1] [2022-01-10 20:05:01,630 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-10 20:05:01,630 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:05:01,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:05:01,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1449602430, now seen corresponding path program 1 times [2022-01-10 20:05:01,631 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:05:01,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663087821] [2022-01-10 20:05:01,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:05:01,631 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:05:01,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:05:01,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:05:01,656 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:05:01,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663087821] [2022-01-10 20:05:01,656 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663087821] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:05:01,656 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:05:01,656 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:05:01,656 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296349394] [2022-01-10 20:05:01,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:05:01,656 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:05:01,657 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:05:01,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:05:01,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:05:01,657 INFO L87 Difference]: Start difference. First operand 3948 states and 5417 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:05:01,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:05:01,810 INFO L93 Difference]: Finished difference Result 5148 states and 7133 transitions. [2022-01-10 20:05:01,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:05:01,811 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-10 20:05:01,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:05:01,815 INFO L225 Difference]: With dead ends: 5148 [2022-01-10 20:05:01,815 INFO L226 Difference]: Without dead ends: 3948 [2022-01-10 20:05:01,817 INFO L932 BasicCegarLoop]: 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 [2022-01-10 20:05:01,817 INFO L933 BasicCegarLoop]: 1141 mSDtfsCounter, 1062 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1062 SdHoareTripleChecker+Valid, 1208 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:05:01,818 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1062 Valid, 1208 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:05:01,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3948 states. [2022-01-10 20:05:01,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3948 to 3948. [2022-01-10 20:05:01,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3948 states, 3945 states have (on average 1.3670468948035488) internal successors, (5393), 3947 states have internal predecessors, (5393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:05:01,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3948 states to 3948 states and 5393 transitions. [2022-01-10 20:05:01,983 INFO L78 Accepts]: Start accepts. Automaton has 3948 states and 5393 transitions. Word has length 99 [2022-01-10 20:05:01,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:05:01,983 INFO L470 AbstractCegarLoop]: Abstraction has 3948 states and 5393 transitions. [2022-01-10 20:05:01,984 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:05:01,984 INFO L276 IsEmpty]: Start isEmpty. Operand 3948 states and 5393 transitions. [2022-01-10 20:05:01,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-10 20:05:01,988 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:05:01,988 INFO L514 BasicCegarLoop]: 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, 1] [2022-01-10 20:05:01,988 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-10 20:05:01,989 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:05:01,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:05:01,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1130814879, now seen corresponding path program 1 times [2022-01-10 20:05:01,989 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:05:01,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418069985] [2022-01-10 20:05:01,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:05:01,989 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:05:02,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:05:02,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:05:02,025 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:05:02,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418069985] [2022-01-10 20:05:02,026 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418069985] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:05:02,026 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:05:02,026 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:05:02,026 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235851167] [2022-01-10 20:05:02,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:05:02,027 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:05:02,027 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:05:02,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:05:02,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:05:02,027 INFO L87 Difference]: Start difference. First operand 3948 states and 5393 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:05:02,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:05:02,176 INFO L93 Difference]: Finished difference Result 5147 states and 7084 transitions. [2022-01-10 20:05:02,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:05:02,177 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-10 20:05:02,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:05:02,183 INFO L225 Difference]: With dead ends: 5147 [2022-01-10 20:05:02,183 INFO L226 Difference]: Without dead ends: 3948 [2022-01-10 20:05:02,185 INFO L932 BasicCegarLoop]: 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 [2022-01-10 20:05:02,186 INFO L933 BasicCegarLoop]: 1127 mSDtfsCounter, 1048 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1048 SdHoareTripleChecker+Valid, 1193 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:05:02,186 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1048 Valid, 1193 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:05:02,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3948 states. [2022-01-10 20:05:02,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3948 to 3948. [2022-01-10 20:05:02,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3948 states, 3945 states have (on average 1.3609632446134348) internal successors, (5369), 3947 states have internal predecessors, (5369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:05:02,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3948 states to 3948 states and 5369 transitions. [2022-01-10 20:05:02,332 INFO L78 Accepts]: Start accepts. Automaton has 3948 states and 5369 transitions. Word has length 99 [2022-01-10 20:05:02,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:05:02,332 INFO L470 AbstractCegarLoop]: Abstraction has 3948 states and 5369 transitions. [2022-01-10 20:05:02,332 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:05:02,332 INFO L276 IsEmpty]: Start isEmpty. Operand 3948 states and 5369 transitions. [2022-01-10 20:05:02,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-10 20:05:02,336 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:05:02,337 INFO L514 BasicCegarLoop]: 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, 1] [2022-01-10 20:05:02,337 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-10 20:05:02,337 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:05:02,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:05:02,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1253664832, now seen corresponding path program 1 times [2022-01-10 20:05:02,337 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:05:02,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389412761] [2022-01-10 20:05:02,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:05:02,337 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:05:02,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:05:02,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:05:02,364 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:05:02,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389412761] [2022-01-10 20:05:02,364 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389412761] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:05:02,364 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:05:02,365 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:05:02,365 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310161268] [2022-01-10 20:05:02,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:05:02,365 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:05:02,365 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:05:02,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:05:02,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:05:02,366 INFO L87 Difference]: Start difference. First operand 3948 states and 5369 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:05:02,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:05:02,496 INFO L93 Difference]: Finished difference Result 5146 states and 7035 transitions. [2022-01-10 20:05:02,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:05:02,497 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-10 20:05:02,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:05:02,503 INFO L225 Difference]: With dead ends: 5146 [2022-01-10 20:05:02,503 INFO L226 Difference]: Without dead ends: 3948 [2022-01-10 20:05:02,505 INFO L932 BasicCegarLoop]: 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 [2022-01-10 20:05:02,505 INFO L933 BasicCegarLoop]: 1113 mSDtfsCounter, 1034 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1034 SdHoareTripleChecker+Valid, 1178 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:05:02,505 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1034 Valid, 1178 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:05:02,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3948 states. [2022-01-10 20:05:02,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3948 to 3948. [2022-01-10 20:05:02,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3948 states, 3945 states have (on average 1.3548795944233207) internal successors, (5345), 3947 states have internal predecessors, (5345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:05:02,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3948 states to 3948 states and 5345 transitions. [2022-01-10 20:05:02,666 INFO L78 Accepts]: Start accepts. Automaton has 3948 states and 5345 transitions. Word has length 99 [2022-01-10 20:05:02,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:05:02,666 INFO L470 AbstractCegarLoop]: Abstraction has 3948 states and 5345 transitions. [2022-01-10 20:05:02,666 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:05:02,666 INFO L276 IsEmpty]: Start isEmpty. Operand 3948 states and 5345 transitions. [2022-01-10 20:05:02,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-10 20:05:02,671 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:05:02,671 INFO L514 BasicCegarLoop]: 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, 1] [2022-01-10 20:05:02,671 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-10 20:05:02,671 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:05:02,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:05:02,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1779440097, now seen corresponding path program 1 times [2022-01-10 20:05:02,672 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:05:02,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899300716] [2022-01-10 20:05:02,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:05:02,672 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:05:02,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:05:02,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:05:02,696 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:05:02,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899300716] [2022-01-10 20:05:02,696 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899300716] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:05:02,696 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:05:02,696 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:05:02,696 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021543820] [2022-01-10 20:05:02,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:05:02,696 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:05:02,696 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:05:02,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:05:02,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:05:02,697 INFO L87 Difference]: Start difference. First operand 3948 states and 5345 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:05:02,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:05:02,840 INFO L93 Difference]: Finished difference Result 5145 states and 6986 transitions. [2022-01-10 20:05:02,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:05:02,840 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-10 20:05:02,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:05:02,846 INFO L225 Difference]: With dead ends: 5145 [2022-01-10 20:05:02,847 INFO L226 Difference]: Without dead ends: 3948 [2022-01-10 20:05:02,849 INFO L932 BasicCegarLoop]: 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 [2022-01-10 20:05:02,849 INFO L933 BasicCegarLoop]: 1099 mSDtfsCounter, 1020 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1020 SdHoareTripleChecker+Valid, 1163 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:05:02,850 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1020 Valid, 1163 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:05:02,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3948 states. [2022-01-10 20:05:03,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3948 to 3948. [2022-01-10 20:05:03,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3948 states, 3945 states have (on average 1.3487959442332067) internal successors, (5321), 3947 states have internal predecessors, (5321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:05:03,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3948 states to 3948 states and 5321 transitions. [2022-01-10 20:05:03,010 INFO L78 Accepts]: Start accepts. Automaton has 3948 states and 5321 transitions. Word has length 99 [2022-01-10 20:05:03,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:05:03,010 INFO L470 AbstractCegarLoop]: Abstraction has 3948 states and 5321 transitions. [2022-01-10 20:05:03,011 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:05:03,011 INFO L276 IsEmpty]: Start isEmpty. Operand 3948 states and 5321 transitions. [2022-01-10 20:05:03,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-10 20:05:03,014 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:05:03,014 INFO L514 BasicCegarLoop]: 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, 1] [2022-01-10 20:05:03,014 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-10 20:05:03,015 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:05:03,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:05:03,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1004980734, now seen corresponding path program 1 times [2022-01-10 20:05:03,015 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:05:03,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130001499] [2022-01-10 20:05:03,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:05:03,015 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:05:03,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:05:03,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:05:03,069 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:05:03,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130001499] [2022-01-10 20:05:03,069 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130001499] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:05:03,069 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:05:03,069 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:05:03,070 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841431765] [2022-01-10 20:05:03,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:05:03,070 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:05:03,070 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:05:03,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:05:03,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:05:03,070 INFO L87 Difference]: Start difference. First operand 3948 states and 5321 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:05:03,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:05:03,225 INFO L93 Difference]: Finished difference Result 5144 states and 6937 transitions. [2022-01-10 20:05:03,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:05:03,226 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-10 20:05:03,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:05:03,233 INFO L225 Difference]: With dead ends: 5144 [2022-01-10 20:05:03,233 INFO L226 Difference]: Without dead ends: 3948 [2022-01-10 20:05:03,235 INFO L932 BasicCegarLoop]: 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 [2022-01-10 20:05:03,236 INFO L933 BasicCegarLoop]: 1085 mSDtfsCounter, 1006 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1006 SdHoareTripleChecker+Valid, 1148 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:05:03,236 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1006 Valid, 1148 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:05:03,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3948 states. [2022-01-10 20:05:03,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3948 to 3948. [2022-01-10 20:05:03,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3948 states, 3945 states have (on average 1.3427122940430924) internal successors, (5297), 3947 states have internal predecessors, (5297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:05:03,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3948 states to 3948 states and 5297 transitions. [2022-01-10 20:05:03,402 INFO L78 Accepts]: Start accepts. Automaton has 3948 states and 5297 transitions. Word has length 99 [2022-01-10 20:05:03,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:05:03,402 INFO L470 AbstractCegarLoop]: Abstraction has 3948 states and 5297 transitions. [2022-01-10 20:05:03,402 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:05:03,402 INFO L276 IsEmpty]: Start isEmpty. Operand 3948 states and 5297 transitions. [2022-01-10 20:05:03,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-10 20:05:03,406 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:05:03,406 INFO L514 BasicCegarLoop]: 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, 1] [2022-01-10 20:05:03,406 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-10 20:05:03,407 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:05:03,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:05:03,407 INFO L85 PathProgramCache]: Analyzing trace with hash -979577123, now seen corresponding path program 1 times [2022-01-10 20:05:03,407 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:05:03,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135452990] [2022-01-10 20:05:03,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:05:03,407 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:05:03,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:05:03,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:05:03,450 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:05:03,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135452990] [2022-01-10 20:05:03,450 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135452990] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:05:03,450 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:05:03,450 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 20:05:03,450 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886867003] [2022-01-10 20:05:03,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:05:03,450 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 20:05:03,450 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:05:03,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 20:05:03,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 20:05:03,451 INFO L87 Difference]: Start difference. First operand 3948 states and 5297 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:05:03,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:05:03,778 INFO L93 Difference]: Finished difference Result 5659 states and 7609 transitions. [2022-01-10 20:05:03,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 20:05:03,778 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-10 20:05:03,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:05:03,785 INFO L225 Difference]: With dead ends: 5659 [2022-01-10 20:05:03,785 INFO L226 Difference]: Without dead ends: 4470 [2022-01-10 20:05:03,788 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 20:05:03,788 INFO L933 BasicCegarLoop]: 1177 mSDtfsCounter, 2518 mSDsluCounter, 1664 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2518 SdHoareTripleChecker+Valid, 2841 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 20:05:03,788 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2518 Valid, 2841 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 20:05:03,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4470 states. [2022-01-10 20:05:03,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4470 to 3954. [2022-01-10 20:05:03,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3954 states, 3951 states have (on average 1.3381422424702607) internal successors, (5287), 3953 states have internal predecessors, (5287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:05:04,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3954 states to 3954 states and 5287 transitions. [2022-01-10 20:05:04,002 INFO L78 Accepts]: Start accepts. Automaton has 3954 states and 5287 transitions. Word has length 99 [2022-01-10 20:05:04,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:05:04,002 INFO L470 AbstractCegarLoop]: Abstraction has 3954 states and 5287 transitions. [2022-01-10 20:05:04,003 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:05:04,003 INFO L276 IsEmpty]: Start isEmpty. Operand 3954 states and 5287 transitions. [2022-01-10 20:05:04,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-10 20:05:04,007 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:05:04,007 INFO L514 BasicCegarLoop]: 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, 1] [2022-01-10 20:05:04,007 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-10 20:05:04,007 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:05:04,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:05:04,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1587653986, now seen corresponding path program 1 times [2022-01-10 20:05:04,008 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:05:04,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494375101] [2022-01-10 20:05:04,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:05:04,008 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:05:04,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:05:04,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:05:04,043 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:05:04,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494375101] [2022-01-10 20:05:04,043 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494375101] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:05:04,043 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:05:04,043 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 20:05:04,044 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687321222] [2022-01-10 20:05:04,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:05:04,044 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 20:05:04,044 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:05:04,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 20:05:04,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 20:05:04,045 INFO L87 Difference]: Start difference. First operand 3954 states and 5287 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:05:04,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:05:04,312 INFO L93 Difference]: Finished difference Result 5831 states and 7793 transitions. [2022-01-10 20:05:04,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 20:05:04,313 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-10 20:05:04,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:05:04,320 INFO L225 Difference]: With dead ends: 5831 [2022-01-10 20:05:04,321 INFO L226 Difference]: Without dead ends: 4650 [2022-01-10 20:05:04,323 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 20:05:04,323 INFO L933 BasicCegarLoop]: 1130 mSDtfsCounter, 2273 mSDsluCounter, 2095 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2273 SdHoareTripleChecker+Valid, 3225 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 20:05:04,324 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2273 Valid, 3225 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 20:05:04,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4650 states. [2022-01-10 20:05:04,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4650 to 3960. [2022-01-10 20:05:04,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3960 states, 3957 states have (on average 1.3335860500379075) internal successors, (5277), 3959 states have internal predecessors, (5277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:05:04,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3960 states to 3960 states and 5277 transitions. [2022-01-10 20:05:04,496 INFO L78 Accepts]: Start accepts. Automaton has 3960 states and 5277 transitions. Word has length 99 [2022-01-10 20:05:04,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:05:04,496 INFO L470 AbstractCegarLoop]: Abstraction has 3960 states and 5277 transitions. [2022-01-10 20:05:04,497 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:05:04,497 INFO L276 IsEmpty]: Start isEmpty. Operand 3960 states and 5277 transitions. [2022-01-10 20:05:04,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-10 20:05:04,500 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:05:04,500 INFO L514 BasicCegarLoop]: 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, 1] [2022-01-10 20:05:04,501 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-10 20:05:04,501 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:05:04,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:05:04,501 INFO L85 PathProgramCache]: Analyzing trace with hash -894261281, now seen corresponding path program 1 times [2022-01-10 20:05:04,501 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:05:04,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956891317] [2022-01-10 20:05:04,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:05:04,501 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:05:04,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:05:04,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:05:04,534 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:05:04,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956891317] [2022-01-10 20:05:04,534 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956891317] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:05:04,535 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:05:04,535 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 20:05:04,535 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494562683] [2022-01-10 20:05:04,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:05:04,535 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 20:05:04,535 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:05:04,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 20:05:04,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 20:05:04,536 INFO L87 Difference]: Start difference. First operand 3960 states and 5277 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:05:04,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:05:04,786 INFO L93 Difference]: Finished difference Result 5926 states and 7867 transitions. [2022-01-10 20:05:04,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 20:05:04,786 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-10 20:05:04,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:05:04,794 INFO L225 Difference]: With dead ends: 5926 [2022-01-10 20:05:04,794 INFO L226 Difference]: Without dead ends: 4746 [2022-01-10 20:05:04,796 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 20:05:04,798 INFO L933 BasicCegarLoop]: 1103 mSDtfsCounter, 2148 mSDsluCounter, 2280 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2148 SdHoareTripleChecker+Valid, 3383 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 20:05:04,798 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2148 Valid, 3383 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 20:05:04,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4746 states. [2022-01-10 20:05:04,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4746 to 3966. [2022-01-10 20:05:04,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3966 states, 3963 states have (on average 1.329043653797628) internal successors, (5267), 3965 states have internal predecessors, (5267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:05:04,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3966 states to 3966 states and 5267 transitions. [2022-01-10 20:05:04,968 INFO L78 Accepts]: Start accepts. Automaton has 3966 states and 5267 transitions. Word has length 99 [2022-01-10 20:05:04,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:05:04,969 INFO L470 AbstractCegarLoop]: Abstraction has 3966 states and 5267 transitions. [2022-01-10 20:05:04,969 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:05:04,969 INFO L276 IsEmpty]: Start isEmpty. Operand 3966 states and 5267 transitions. [2022-01-10 20:05:04,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-10 20:05:04,972 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:05:04,972 INFO L514 BasicCegarLoop]: 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, 1] [2022-01-10 20:05:04,972 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-10 20:05:04,972 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:05:04,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:05:04,973 INFO L85 PathProgramCache]: Analyzing trace with hash -902020640, now seen corresponding path program 1 times [2022-01-10 20:05:04,973 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:05:04,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316431276] [2022-01-10 20:05:04,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:05:04,973 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:05:04,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:05:05,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:05:05,002 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:05:05,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316431276] [2022-01-10 20:05:05,002 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316431276] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:05:05,002 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:05:05,002 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:05:05,002 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247712338] [2022-01-10 20:05:05,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:05:05,002 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:05:05,002 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:05:05,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:05:05,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:05:05,003 INFO L87 Difference]: Start difference. First operand 3966 states and 5267 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:05:05,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:05:05,198 INFO L93 Difference]: Finished difference Result 5185 states and 6835 transitions. [2022-01-10 20:05:05,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:05:05,199 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-10 20:05:05,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:05:05,205 INFO L225 Difference]: With dead ends: 5185 [2022-01-10 20:05:05,205 INFO L226 Difference]: Without dead ends: 3966 [2022-01-10 20:05:05,207 INFO L932 BasicCegarLoop]: 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 [2022-01-10 20:05:05,207 INFO L933 BasicCegarLoop]: 1044 mSDtfsCounter, 917 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 917 SdHoareTripleChecker+Valid, 1103 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:05:05,208 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [917 Valid, 1103 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:05:05,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3966 states. [2022-01-10 20:05:05,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3966 to 3966. [2022-01-10 20:05:05,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3966 states, 3963 states have (on average 1.3229876356295736) internal successors, (5243), 3965 states have internal predecessors, (5243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:05:05,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3966 states to 3966 states and 5243 transitions. [2022-01-10 20:05:05,374 INFO L78 Accepts]: Start accepts. Automaton has 3966 states and 5243 transitions. Word has length 99 [2022-01-10 20:05:05,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:05:05,374 INFO L470 AbstractCegarLoop]: Abstraction has 3966 states and 5243 transitions. [2022-01-10 20:05:05,374 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:05:05,375 INFO L276 IsEmpty]: Start isEmpty. Operand 3966 states and 5243 transitions. [2022-01-10 20:05:05,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-10 20:05:05,380 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:05:05,380 INFO L514 BasicCegarLoop]: 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, 1] [2022-01-10 20:05:05,380 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-10 20:05:05,380 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:05:05,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:05:05,381 INFO L85 PathProgramCache]: Analyzing trace with hash -690669727, now seen corresponding path program 1 times [2022-01-10 20:05:05,381 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:05:05,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094674404] [2022-01-10 20:05:05,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:05:05,381 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:05:05,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:05:05,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:05:05,416 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:05:05,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094674404] [2022-01-10 20:05:05,416 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094674404] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:05:05,416 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:05:05,416 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:05:05,416 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652557693] [2022-01-10 20:05:05,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:05:05,416 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:05:05,416 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:05:05,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:05:05,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:05:05,417 INFO L87 Difference]: Start difference. First operand 3966 states and 5243 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:05:05,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:05:05,656 INFO L93 Difference]: Finished difference Result 6295 states and 8205 transitions. [2022-01-10 20:05:05,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:05:05,656 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-10 20:05:05,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:05:05,664 INFO L225 Difference]: With dead ends: 6295 [2022-01-10 20:05:05,664 INFO L226 Difference]: Without dead ends: 5083 [2022-01-10 20:05:05,667 INFO L932 BasicCegarLoop]: 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 [2022-01-10 20:05:05,668 INFO L933 BasicCegarLoop]: 1045 mSDtfsCounter, 933 mSDsluCounter, 733 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 933 SdHoareTripleChecker+Valid, 1778 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:05:05,668 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [933 Valid, 1778 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:05:05,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5083 states. [2022-01-10 20:05:05,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5083 to 4987. [2022-01-10 20:05:05,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4987 states, 4984 states have (on average 1.3101926163723916) internal successors, (6530), 4986 states have internal predecessors, (6530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:05:05,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4987 states to 4987 states and 6530 transitions. [2022-01-10 20:05:05,955 INFO L78 Accepts]: Start accepts. Automaton has 4987 states and 6530 transitions. Word has length 99 [2022-01-10 20:05:05,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:05:05,956 INFO L470 AbstractCegarLoop]: Abstraction has 4987 states and 6530 transitions. [2022-01-10 20:05:05,956 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:05:05,956 INFO L276 IsEmpty]: Start isEmpty. Operand 4987 states and 6530 transitions. [2022-01-10 20:05:05,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-01-10 20:05:05,961 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:05:05,961 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2022-01-10 20:05:05,961 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-10 20:05:05,961 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:05:05,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:05:05,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1145437260, now seen corresponding path program 1 times [2022-01-10 20:05:05,962 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:05:05,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035747774] [2022-01-10 20:05:05,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:05:05,967 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:05:05,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:05:06,018 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-10 20:05:06,018 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:05:06,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035747774] [2022-01-10 20:05:06,019 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035747774] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:05:06,019 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:05:06,019 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:05:06,019 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766080730] [2022-01-10 20:05:06,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:05:06,019 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:05:06,019 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:05:06,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:05:06,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:05:06,020 INFO L87 Difference]: Start difference. First operand 4987 states and 6530 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) [2022-01-10 20:05:06,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:05:06,351 INFO L93 Difference]: Finished difference Result 10067 states and 13414 transitions. [2022-01-10 20:05:06,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:05:06,352 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 103 [2022-01-10 20:05:06,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:05:06,365 INFO L225 Difference]: With dead ends: 10067 [2022-01-10 20:05:06,365 INFO L226 Difference]: Without dead ends: 7527 [2022-01-10 20:05:06,371 INFO L932 BasicCegarLoop]: 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 [2022-01-10 20:05:06,371 INFO L933 BasicCegarLoop]: 1053 mSDtfsCounter, 131 mSDsluCounter, 1006 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 2059 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:05:06,372 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 2059 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:05:06,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7527 states. [2022-01-10 20:05:06,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7527 to 7523. [2022-01-10 20:05:06,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7523 states, 7520 states have (on average 1.3172872340425532) internal successors, (9906), 7522 states have internal predecessors, (9906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:05:06,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7523 states to 7523 states and 9906 transitions. [2022-01-10 20:05:06,862 INFO L78 Accepts]: Start accepts. Automaton has 7523 states and 9906 transitions. Word has length 103 [2022-01-10 20:05:06,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:05:06,862 INFO L470 AbstractCegarLoop]: Abstraction has 7523 states and 9906 transitions. [2022-01-10 20:05:06,862 INFO L471 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) [2022-01-10 20:05:06,862 INFO L276 IsEmpty]: Start isEmpty. Operand 7523 states and 9906 transitions. [2022-01-10 20:05:06,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-01-10 20:05:06,868 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:05:06,868 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2022-01-10 20:05:06,868 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-10 20:05:06,868 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:05:06,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:05:06,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1054237478, now seen corresponding path program 1 times [2022-01-10 20:05:06,868 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:05:06,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915186705] [2022-01-10 20:05:06,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:05:06,869 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:05:06,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:05:06,898 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:05:06,898 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:05:06,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915186705] [2022-01-10 20:05:06,898 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915186705] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:05:06,898 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:05:06,898 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:05:06,899 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985393666] [2022-01-10 20:05:06,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:05:06,899 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:05:06,899 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:05:06,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:05:06,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:05:06,899 INFO L87 Difference]: Start difference. First operand 7523 states and 9906 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:05:07,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:05:07,237 INFO L93 Difference]: Finished difference Result 10091 states and 13410 transitions. [2022-01-10 20:05:07,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:05:07,237 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2022-01-10 20:05:07,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:05:07,240 INFO L225 Difference]: With dead ends: 10091 [2022-01-10 20:05:07,241 INFO L226 Difference]: Without dead ends: 2262 [2022-01-10 20:05:07,247 INFO L932 BasicCegarLoop]: 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 [2022-01-10 20:05:07,247 INFO L933 BasicCegarLoop]: 1159 mSDtfsCounter, 112 mSDsluCounter, 1022 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 2181 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:05:07,248 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 2181 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:05:07,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2262 states. [2022-01-10 20:05:07,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2262 to 2262. [2022-01-10 20:05:07,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2262 states, 2261 states have (on average 1.2649270234409553) internal successors, (2860), 2261 states have internal predecessors, (2860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:05:07,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2262 states to 2262 states and 2860 transitions. [2022-01-10 20:05:07,389 INFO L78 Accepts]: Start accepts. Automaton has 2262 states and 2860 transitions. Word has length 104 [2022-01-10 20:05:07,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:05:07,389 INFO L470 AbstractCegarLoop]: Abstraction has 2262 states and 2860 transitions. [2022-01-10 20:05:07,389 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:05:07,389 INFO L276 IsEmpty]: Start isEmpty. Operand 2262 states and 2860 transitions. [2022-01-10 20:05:07,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-01-10 20:05:07,390 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:05:07,390 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:05:07,390 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-10 20:05:07,390 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:05:07,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:05:07,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1146681871, now seen corresponding path program 1 times [2022-01-10 20:05:07,391 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:05:07,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281596234] [2022-01-10 20:05:07,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:05:07,391 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:05:07,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:05:07,441 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:05:07,441 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:05:07,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281596234] [2022-01-10 20:05:07,442 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281596234] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:05:07,442 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:05:07,442 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:05:07,442 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322588569] [2022-01-10 20:05:07,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:05:07,442 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:05:07,442 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:05:07,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:05:07,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:05:07,443 INFO L87 Difference]: Start difference. First operand 2262 states and 2860 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:05:07,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:05:07,705 INFO L93 Difference]: Finished difference Result 6589 states and 8352 transitions. [2022-01-10 20:05:07,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:05:07,705 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 160 [2022-01-10 20:05:07,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:05:07,711 INFO L225 Difference]: With dead ends: 6589 [2022-01-10 20:05:07,712 INFO L226 Difference]: Without dead ends: 4362 [2022-01-10 20:05:07,714 INFO L932 BasicCegarLoop]: 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 [2022-01-10 20:05:07,714 INFO L933 BasicCegarLoop]: 849 mSDtfsCounter, 758 mSDsluCounter, 733 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 758 SdHoareTripleChecker+Valid, 1582 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:05:07,715 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [758 Valid, 1582 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:05:07,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4362 states. [2022-01-10 20:05:07,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4362 to 4176. [2022-01-10 20:05:07,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4176 states, 4175 states have (on average 1.262754491017964) internal successors, (5272), 4175 states have internal predecessors, (5272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:05:07,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4176 states to 4176 states and 5272 transitions. [2022-01-10 20:05:07,919 INFO L78 Accepts]: Start accepts. Automaton has 4176 states and 5272 transitions. Word has length 160 [2022-01-10 20:05:07,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:05:07,919 INFO L470 AbstractCegarLoop]: Abstraction has 4176 states and 5272 transitions. [2022-01-10 20:05:07,919 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:05:07,919 INFO L276 IsEmpty]: Start isEmpty. Operand 4176 states and 5272 transitions. [2022-01-10 20:05:07,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-01-10 20:05:07,921 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:05:07,921 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:05:07,921 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-01-10 20:05:07,921 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:05:07,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:05:07,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1741162640, now seen corresponding path program 1 times [2022-01-10 20:05:07,921 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:05:07,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782718711] [2022-01-10 20:05:07,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:05:07,922 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:05:07,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:05:07,959 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:05:07,960 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:05:07,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782718711] [2022-01-10 20:05:07,960 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782718711] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:05:07,960 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:05:07,960 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:05:07,960 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028133253] [2022-01-10 20:05:07,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:05:07,960 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:05:07,961 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:05:07,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:05:07,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:05:07,961 INFO L87 Difference]: Start difference. First operand 4176 states and 5272 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:05:08,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:05:08,420 INFO L93 Difference]: Finished difference Result 12146 states and 15254 transitions. [2022-01-10 20:05:08,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:05:08,421 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 160 [2022-01-10 20:05:08,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:05:08,432 INFO L225 Difference]: With dead ends: 12146 [2022-01-10 20:05:08,433 INFO L226 Difference]: Without dead ends: 8060 [2022-01-10 20:05:08,438 INFO L932 BasicCegarLoop]: 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 [2022-01-10 20:05:08,438 INFO L933 BasicCegarLoop]: 874 mSDtfsCounter, 759 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 759 SdHoareTripleChecker+Valid, 1610 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:05:08,439 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [759 Valid, 1610 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:05:08,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8060 states. [2022-01-10 20:05:08,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8060 to 7890. [2022-01-10 20:05:08,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7890 states, 7889 states have (on average 1.248066928634808) internal successors, (9846), 7889 states have internal predecessors, (9846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:05:08,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7890 states to 7890 states and 9846 transitions. [2022-01-10 20:05:08,855 INFO L78 Accepts]: Start accepts. Automaton has 7890 states and 9846 transitions. Word has length 160 [2022-01-10 20:05:08,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:05:08,855 INFO L470 AbstractCegarLoop]: Abstraction has 7890 states and 9846 transitions. [2022-01-10 20:05:08,856 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:05:08,856 INFO L276 IsEmpty]: Start isEmpty. Operand 7890 states and 9846 transitions. [2022-01-10 20:05:08,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-01-10 20:05:08,859 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:05:08,859 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:05:08,859 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-01-10 20:05:08,859 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:05:08,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:05:08,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1211233635, now seen corresponding path program 1 times [2022-01-10 20:05:08,859 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:05:08,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931899921] [2022-01-10 20:05:08,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:05:08,860 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:05:08,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:05:08,928 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:05:08,928 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:05:08,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931899921] [2022-01-10 20:05:08,928 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931899921] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:05:08,928 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:05:08,928 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:05:08,928 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720936758] [2022-01-10 20:05:08,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:05:08,928 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:05:08,929 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:05:08,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:05:08,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:05:08,929 INFO L87 Difference]: Start difference. First operand 7890 states and 9846 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:05:09,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:05:09,706 INFO L93 Difference]: Finished difference Result 22532 states and 28047 transitions. [2022-01-10 20:05:09,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:05:09,706 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 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 161 [2022-01-10 20:05:09,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:05:09,725 INFO L225 Difference]: With dead ends: 22532 [2022-01-10 20:05:09,726 INFO L226 Difference]: Without dead ends: 14732 [2022-01-10 20:05:09,737 INFO L932 BasicCegarLoop]: 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 [2022-01-10 20:05:09,737 INFO L933 BasicCegarLoop]: 1208 mSDtfsCounter, 618 mSDsluCounter, 839 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 618 SdHoareTripleChecker+Valid, 2047 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:05:09,738 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [618 Valid, 2047 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:05:09,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14732 states. [2022-01-10 20:05:10,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14732 to 14730. [2022-01-10 20:05:10,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14730 states, 14729 states have (on average 1.2400706090026479) internal successors, (18265), 14729 states have internal predecessors, (18265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:05:10,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14730 states to 14730 states and 18265 transitions. [2022-01-10 20:05:10,638 INFO L78 Accepts]: Start accepts. Automaton has 14730 states and 18265 transitions. Word has length 161 [2022-01-10 20:05:10,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:05:10,639 INFO L470 AbstractCegarLoop]: Abstraction has 14730 states and 18265 transitions. [2022-01-10 20:05:10,639 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:05:10,639 INFO L276 IsEmpty]: Start isEmpty. Operand 14730 states and 18265 transitions. [2022-01-10 20:05:10,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-01-10 20:05:10,643 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:05:10,643 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:05:10,643 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-01-10 20:05:10,643 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:05:10,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:05:10,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1516868164, now seen corresponding path program 1 times [2022-01-10 20:05:10,644 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:05:10,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971646605] [2022-01-10 20:05:10,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:05:10,644 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:05:10,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:05:10,680 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-10 20:05:10,680 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:05:10,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971646605] [2022-01-10 20:05:10,680 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971646605] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:05:10,680 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:05:10,680 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:05:10,681 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34923103] [2022-01-10 20:05:10,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:05:10,681 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:05:10,681 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:05:10,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:05:10,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:05:10,681 INFO L87 Difference]: Start difference. First operand 14730 states and 18265 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:05:11,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:05:11,498 INFO L93 Difference]: Finished difference Result 29288 states and 36330 transitions. [2022-01-10 20:05:11,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:05:11,499 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 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 161 [2022-01-10 20:05:11,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:05:11,514 INFO L225 Difference]: With dead ends: 29288 [2022-01-10 20:05:11,515 INFO L226 Difference]: Without dead ends: 14648 [2022-01-10 20:05:11,526 INFO L932 BasicCegarLoop]: 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 [2022-01-10 20:05:11,527 INFO L933 BasicCegarLoop]: 859 mSDtfsCounter, 853 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 853 SdHoareTripleChecker+Valid, 860 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:05:11,527 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [853 Valid, 860 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:05:11,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14648 states. [2022-01-10 20:05:12,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14648 to 14648. [2022-01-10 20:05:12,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14648 states, 14647 states have (on average 1.2404587970232812) internal successors, (18169), 14647 states have internal predecessors, (18169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:05:12,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14648 states to 14648 states and 18169 transitions. [2022-01-10 20:05:12,360 INFO L78 Accepts]: Start accepts. Automaton has 14648 states and 18169 transitions. Word has length 161 [2022-01-10 20:05:12,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:05:12,361 INFO L470 AbstractCegarLoop]: Abstraction has 14648 states and 18169 transitions. [2022-01-10 20:05:12,361 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:05:12,361 INFO L276 IsEmpty]: Start isEmpty. Operand 14648 states and 18169 transitions. [2022-01-10 20:05:12,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-01-10 20:05:12,365 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:05:12,365 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:05:12,365 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-01-10 20:05:12,366 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:05:12,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:05:12,366 INFO L85 PathProgramCache]: Analyzing trace with hash 903276285, now seen corresponding path program 1 times [2022-01-10 20:05:12,366 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:05:12,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288391960] [2022-01-10 20:05:12,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:05:12,366 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:05:12,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:05:12,408 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:05:12,408 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:05:12,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288391960] [2022-01-10 20:05:12,408 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288391960] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:05:12,408 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:05:12,408 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:05:12,408 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683306517] [2022-01-10 20:05:12,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:05:12,409 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:05:12,409 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:05:12,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:05:12,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:05:12,409 INFO L87 Difference]: Start difference. First operand 14648 states and 18169 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:05:13,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:05:13,875 INFO L93 Difference]: Finished difference Result 41981 states and 52008 transitions. [2022-01-10 20:05:13,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:05:13,875 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 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 162 [2022-01-10 20:05:13,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:05:13,913 INFO L225 Difference]: With dead ends: 41981 [2022-01-10 20:05:13,914 INFO L226 Difference]: Without dead ends: 27423 [2022-01-10 20:05:13,930 INFO L932 BasicCegarLoop]: 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 [2022-01-10 20:05:13,931 INFO L933 BasicCegarLoop]: 1177 mSDtfsCounter, 623 mSDsluCounter, 837 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 623 SdHoareTripleChecker+Valid, 2014 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:05:13,931 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [623 Valid, 2014 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:05:13,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27423 states. [2022-01-10 20:05:15,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27423 to 27421. [2022-01-10 20:05:15,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27421 states, 27420 states have (on average 1.2358132749817652) internal successors, (33886), 27420 states have internal predecessors, (33886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:05:15,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27421 states to 27421 states and 33886 transitions. [2022-01-10 20:05:15,740 INFO L78 Accepts]: Start accepts. Automaton has 27421 states and 33886 transitions. Word has length 162 [2022-01-10 20:05:15,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:05:15,740 INFO L470 AbstractCegarLoop]: Abstraction has 27421 states and 33886 transitions. [2022-01-10 20:05:15,740 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:05:15,741 INFO L276 IsEmpty]: Start isEmpty. Operand 27421 states and 33886 transitions. [2022-01-10 20:05:15,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-01-10 20:05:15,748 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:05:15,748 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:05:15,749 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-01-10 20:05:15,749 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:05:15,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:05:15,749 INFO L85 PathProgramCache]: Analyzing trace with hash 597641756, now seen corresponding path program 1 times [2022-01-10 20:05:15,749 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:05:15,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262549954] [2022-01-10 20:05:15,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:05:15,749 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:05:15,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:05:15,773 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-10 20:05:15,773 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:05:15,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262549954] [2022-01-10 20:05:15,773 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262549954] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:05:15,773 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:05:15,774 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:05:15,774 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655736766] [2022-01-10 20:05:15,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:05:15,774 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:05:15,774 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:05:15,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:05:15,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:05:15,775 INFO L87 Difference]: Start difference. First operand 27421 states and 33886 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:05:17,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:05:17,295 INFO L93 Difference]: Finished difference Result 54671 states and 67575 transitions. [2022-01-10 20:05:17,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:05:17,295 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 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 162 [2022-01-10 20:05:17,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:05:17,333 INFO L225 Difference]: With dead ends: 54671 [2022-01-10 20:05:17,333 INFO L226 Difference]: Without dead ends: 27340 [2022-01-10 20:05:17,359 INFO L932 BasicCegarLoop]: 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 [2022-01-10 20:05:17,360 INFO L933 BasicCegarLoop]: 858 mSDtfsCounter, 851 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 851 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:05:17,360 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [851 Valid, 859 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:05:17,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27340 states. [2022-01-10 20:05:19,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27340 to 27340. [2022-01-10 20:05:19,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27340 states, 27339 states have (on average 1.2360364314715242) internal successors, (33792), 27339 states have internal predecessors, (33792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:05:19,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27340 states to 27340 states and 33792 transitions. [2022-01-10 20:05:19,313 INFO L78 Accepts]: Start accepts. Automaton has 27340 states and 33792 transitions. Word has length 162 [2022-01-10 20:05:19,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:05:19,313 INFO L470 AbstractCegarLoop]: Abstraction has 27340 states and 33792 transitions. [2022-01-10 20:05:19,313 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:05:19,313 INFO L276 IsEmpty]: Start isEmpty. Operand 27340 states and 33792 transitions. [2022-01-10 20:05:19,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-01-10 20:05:19,321 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:05:19,321 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:05:19,322 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-01-10 20:05:19,322 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:05:19,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:05:19,322 INFO L85 PathProgramCache]: Analyzing trace with hash -978233650, now seen corresponding path program 1 times [2022-01-10 20:05:19,322 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:05:19,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275244384] [2022-01-10 20:05:19,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:05:19,323 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:05:19,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:05:19,365 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:05:19,365 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:05:19,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275244384] [2022-01-10 20:05:19,365 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275244384] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:05:19,365 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:05:19,365 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:05:19,365 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202037179] [2022-01-10 20:05:19,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:05:19,366 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:05:19,366 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:05:19,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:05:19,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:05:19,366 INFO L87 Difference]: Start difference. First operand 27340 states and 33792 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:05:22,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:05:22,540 INFO L93 Difference]: Finished difference Result 79440 states and 98157 transitions. [2022-01-10 20:05:22,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:05:22,541 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 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 163 [2022-01-10 20:05:22,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:05:22,626 INFO L225 Difference]: With dead ends: 79440 [2022-01-10 20:05:22,626 INFO L226 Difference]: Without dead ends: 52190 [2022-01-10 20:05:22,659 INFO L932 BasicCegarLoop]: 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 [2022-01-10 20:05:22,662 INFO L933 BasicCegarLoop]: 1032 mSDtfsCounter, 760 mSDsluCounter, 826 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 760 SdHoareTripleChecker+Valid, 1858 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:05:22,662 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [760 Valid, 1858 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:05:22,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52190 states. [2022-01-10 20:05:26,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52190 to 51036. [2022-01-10 20:05:26,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51036 states, 51035 states have (on average 1.2326246693445675) internal successors, (62907), 51035 states have internal predecessors, (62907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:05:26,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51036 states to 51036 states and 62907 transitions. [2022-01-10 20:05:26,156 INFO L78 Accepts]: Start accepts. Automaton has 51036 states and 62907 transitions. Word has length 163 [2022-01-10 20:05:26,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:05:26,157 INFO L470 AbstractCegarLoop]: Abstraction has 51036 states and 62907 transitions. [2022-01-10 20:05:26,157 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:05:26,157 INFO L276 IsEmpty]: Start isEmpty. Operand 51036 states and 62907 transitions. [2022-01-10 20:05:26,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-01-10 20:05:26,170 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:05:26,170 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:05:26,171 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-01-10 20:05:26,171 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:05:26,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:05:26,171 INFO L85 PathProgramCache]: Analyzing trace with hash 122450991, now seen corresponding path program 1 times [2022-01-10 20:05:26,171 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:05:26,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622909730] [2022-01-10 20:05:26,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:05:26,171 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:05:26,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:05:26,196 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-10 20:05:26,197 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:05:26,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622909730] [2022-01-10 20:05:26,197 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622909730] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:05:26,197 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:05:26,197 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:05:26,197 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671133721] [2022-01-10 20:05:26,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:05:26,197 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:05:26,197 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:05:26,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:05:26,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:05:26,198 INFO L87 Difference]: Start difference. First operand 51036 states and 62907 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:05:29,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:05:29,435 INFO L93 Difference]: Finished difference Result 101932 states and 125654 transitions. [2022-01-10 20:05:29,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:05:29,435 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 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 163 [2022-01-10 20:05:29,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:05:29,504 INFO L225 Difference]: With dead ends: 101932 [2022-01-10 20:05:29,504 INFO L226 Difference]: Without dead ends: 50956 [2022-01-10 20:05:29,538 INFO L932 BasicCegarLoop]: 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 [2022-01-10 20:05:29,538 INFO L933 BasicCegarLoop]: 857 mSDtfsCounter, 849 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 849 SdHoareTripleChecker+Valid, 858 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:05:29,539 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [849 Valid, 858 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:05:29,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50956 states. [2022-01-10 20:05:32,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50956 to 50956. [2022-01-10 20:05:32,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50956 states, 50955 states have (on average 1.2327543911294279) internal successors, (62815), 50955 states have internal predecessors, (62815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:05:33,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50956 states to 50956 states and 62815 transitions. [2022-01-10 20:05:33,018 INFO L78 Accepts]: Start accepts. Automaton has 50956 states and 62815 transitions. Word has length 163 [2022-01-10 20:05:33,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:05:33,018 INFO L470 AbstractCegarLoop]: Abstraction has 50956 states and 62815 transitions. [2022-01-10 20:05:33,018 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:05:33,018 INFO L276 IsEmpty]: Start isEmpty. Operand 50956 states and 62815 transitions. [2022-01-10 20:05:33,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-01-10 20:05:33,030 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:05:33,030 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:05:33,030 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-01-10 20:05:33,030 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:05:33,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:05:33,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1261562481, now seen corresponding path program 1 times [2022-01-10 20:05:33,031 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:05:33,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069338102] [2022-01-10 20:05:33,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:05:33,031 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:05:33,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:05:33,066 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:05:33,067 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:05:33,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069338102] [2022-01-10 20:05:33,067 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069338102] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:05:33,067 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:05:33,067 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:05:33,067 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583139905] [2022-01-10 20:05:33,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:05:33,067 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:05:33,068 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:05:33,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:05:33,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:05:33,068 INFO L87 Difference]: Start difference. First operand 50956 states and 62815 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:05:39,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:05:39,000 INFO L93 Difference]: Finished difference Result 146983 states and 181114 transitions. [2022-01-10 20:05:39,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:05:39,001 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 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 164 [2022-01-10 20:05:39,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:05:39,151 INFO L225 Difference]: With dead ends: 146983 [2022-01-10 20:05:39,152 INFO L226 Difference]: Without dead ends: 96117 [2022-01-10 20:05:39,203 INFO L932 BasicCegarLoop]: 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 [2022-01-10 20:05:39,203 INFO L933 BasicCegarLoop]: 999 mSDtfsCounter, 760 mSDsluCounter, 824 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 760 SdHoareTripleChecker+Valid, 1823 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:05:39,203 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [760 Valid, 1823 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:05:39,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96117 states. [2022-01-10 20:05:45,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96117 to 94707. [2022-01-10 20:05:45,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94707 states, 94706 states have (on average 1.2296580998036026) internal successors, (116456), 94706 states have internal predecessors, (116456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:05:45,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94707 states to 94707 states and 116456 transitions. [2022-01-10 20:05:45,403 INFO L78 Accepts]: Start accepts. Automaton has 94707 states and 116456 transitions. Word has length 164 [2022-01-10 20:05:45,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:05:45,403 INFO L470 AbstractCegarLoop]: Abstraction has 94707 states and 116456 transitions. [2022-01-10 20:05:45,403 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:05:45,404 INFO L276 IsEmpty]: Start isEmpty. Operand 94707 states and 116456 transitions. [2022-01-10 20:05:45,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-01-10 20:05:45,427 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:05:45,427 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:05:45,428 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-01-10 20:05:45,428 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:05:45,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:05:45,428 INFO L85 PathProgramCache]: Analyzing trace with hash -215687892, now seen corresponding path program 1 times [2022-01-10 20:05:45,428 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:05:45,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218149081] [2022-01-10 20:05:45,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:05:45,429 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:05:45,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:05:45,452 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-10 20:05:45,452 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:05:45,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218149081] [2022-01-10 20:05:45,452 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218149081] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:05:45,452 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:05:45,452 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:05:45,453 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943709091] [2022-01-10 20:05:45,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:05:45,453 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:05:45,453 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:05:45,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:05:45,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:05:45,453 INFO L87 Difference]: Start difference. First operand 94707 states and 116456 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:05:51,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:05:51,627 INFO L93 Difference]: Finished difference Result 189268 states and 232746 transitions. [2022-01-10 20:05:51,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:05:51,628 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 164 [2022-01-10 20:05:51,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:05:51,779 INFO L225 Difference]: With dead ends: 189268 [2022-01-10 20:05:51,780 INFO L226 Difference]: Without dead ends: 94628 [2022-01-10 20:05:51,851 INFO L932 BasicCegarLoop]: 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 [2022-01-10 20:05:51,851 INFO L933 BasicCegarLoop]: 856 mSDtfsCounter, 847 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 847 SdHoareTripleChecker+Valid, 857 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:05:51,851 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [847 Valid, 857 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:05:51,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94628 states. [2022-01-10 20:05:58,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94628 to 94628. [2022-01-10 20:05:58,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94628 states, 94627 states have (on average 1.2297335855516924) internal successors, (116366), 94627 states have internal predecessors, (116366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:05:58,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94628 states to 94628 states and 116366 transitions. [2022-01-10 20:05:58,449 INFO L78 Accepts]: Start accepts. Automaton has 94628 states and 116366 transitions. Word has length 164 [2022-01-10 20:05:58,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:05:58,449 INFO L470 AbstractCegarLoop]: Abstraction has 94628 states and 116366 transitions. [2022-01-10 20:05:58,449 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:05:58,449 INFO L276 IsEmpty]: Start isEmpty. Operand 94628 states and 116366 transitions. [2022-01-10 20:05:58,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 20:05:58,473 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:05:58,474 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:05:58,474 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-01-10 20:05:58,474 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:05:58,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:05:58,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1979041926, now seen corresponding path program 1 times [2022-01-10 20:05:58,475 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:05:58,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378393825] [2022-01-10 20:05:58,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:05:58,475 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:05:58,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:05:58,523 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:05:58,523 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:05:58,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378393825] [2022-01-10 20:05:58,524 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378393825] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:05:58,524 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:05:58,524 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:05:58,524 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968072527] [2022-01-10 20:05:58,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:05:58,525 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:05:58,525 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:05:58,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:05:58,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:05:58,527 INFO L87 Difference]: Start difference. First operand 94628 states and 116366 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)