/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_NONE.epf -i ../../../trunk/examples/svcomp/combinations/pc_sfifo_1.cil-2+token_ring.10.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-11 01:47:34,443 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-11 01:47:34,444 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-11 01:47:34,469 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-11 01:47:34,469 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-11 01:47:34,470 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-11 01:47:34,471 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-11 01:47:34,472 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-11 01:47:34,473 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-11 01:47:34,474 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-11 01:47:34,474 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-11 01:47:34,475 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-11 01:47:34,475 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-11 01:47:34,476 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-11 01:47:34,477 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-11 01:47:34,477 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-11 01:47:34,478 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-11 01:47:34,500 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-11 01:47:34,502 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-11 01:47:34,503 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-11 01:47:34,504 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-11 01:47:34,513 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-11 01:47:34,515 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-11 01:47:34,515 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-11 01:47:34,518 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-11 01:47:34,518 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-11 01:47:34,518 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-11 01:47:34,519 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-11 01:47:34,519 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-11 01:47:34,520 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-11 01:47:34,521 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-11 01:47:34,521 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-11 01:47:34,522 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-11 01:47:34,523 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-11 01:47:34,531 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-11 01:47:34,532 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-11 01:47:34,532 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-11 01:47:34,532 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-11 01:47:34,533 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-11 01:47:34,533 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-11 01:47:34,534 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-11 01:47:34,535 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_NONE.epf [2022-01-11 01:47:34,554 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-11 01:47:34,554 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-11 01:47:34,554 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-11 01:47:34,554 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-11 01:47:34,557 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-11 01:47:34,557 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-11 01:47:34,557 INFO L138 SettingsManager]: * Use SBE=true [2022-01-11 01:47:34,557 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-11 01:47:34,557 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-11 01:47:34,558 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-11 01:47:34,558 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-11 01:47:34,558 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-11 01:47:34,559 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-11 01:47:34,559 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-11 01:47:34,559 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-11 01:47:34,559 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-11 01:47:34,559 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-11 01:47:34,559 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-11 01:47:34,559 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-11 01:47:34,559 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-11 01:47:34,559 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-11 01:47:34,559 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 01:47:34,559 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-11 01:47:34,560 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-11 01:47:34,560 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-11 01:47:34,560 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-11 01:47:34,560 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-11 01:47:34,560 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-11 01:47:34,560 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-11 01:47:34,560 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-11 01:47:34,560 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-11 01:47:34,560 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-11 01:47:34,561 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-11 01:47:34,561 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_NONE 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-11 01:47:34,752 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-11 01:47:34,764 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-11 01:47:34,766 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-11 01:47:34,766 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-11 01:47:34,769 INFO L275 PluginConnector]: CDTParser initialized [2022-01-11 01:47:34,770 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/combinations/pc_sfifo_1.cil-2+token_ring.10.cil-2.c [2022-01-11 01:47:34,818 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38f03b879/e0ba1edeb7144f89ba1bf1fff73b8549/FLAG5f3e5a67b [2022-01-11 01:47:35,208 INFO L306 CDTParser]: Found 1 translation units. [2022-01-11 01:47:35,209 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_1.cil-2+token_ring.10.cil-2.c [2022-01-11 01:47:35,218 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38f03b879/e0ba1edeb7144f89ba1bf1fff73b8549/FLAG5f3e5a67b [2022-01-11 01:47:35,226 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38f03b879/e0ba1edeb7144f89ba1bf1fff73b8549 [2022-01-11 01:47:35,228 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-11 01:47:35,229 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-11 01:47:35,239 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-11 01:47:35,240 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-11 01:47:35,242 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-11 01:47:35,242 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 01:47:35" (1/1) ... [2022-01-11 01:47:35,243 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e5ca1f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:47:35, skipping insertion in model container [2022-01-11 01:47:35,243 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 01:47:35" (1/1) ... [2022-01-11 01:47:35,247 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-11 01:47:35,282 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-11 01:47:35,414 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_1.cil-2+token_ring.10.cil-2.c[913,926] [2022-01-11 01:47:35,457 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_1.cil-2+token_ring.10.cil-2.c[5977,5990] [2022-01-11 01:47:35,517 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 01:47:35,526 INFO L203 MainTranslator]: Completed pre-run [2022-01-11 01:47:35,534 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_1.cil-2+token_ring.10.cil-2.c[913,926] [2022-01-11 01:47:35,545 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_1.cil-2+token_ring.10.cil-2.c[5977,5990] [2022-01-11 01:47:35,587 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 01:47:35,606 INFO L208 MainTranslator]: Completed translation [2022-01-11 01:47:35,606 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:47:35 WrapperNode [2022-01-11 01:47:35,606 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-11 01:47:35,609 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-11 01:47:35,609 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-11 01:47:35,609 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-11 01:47:35,614 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:47:35" (1/1) ... [2022-01-11 01:47:35,629 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:47:35" (1/1) ... [2022-01-11 01:47:35,691 INFO L137 Inliner]: procedures = 69, calls = 78, calls flagged for inlining = 73, calls inlined = 228, statements flattened = 3439 [2022-01-11 01:47:35,691 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-11 01:47:35,692 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-11 01:47:35,692 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-11 01:47:35,692 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-11 01:47:35,700 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:47:35" (1/1) ... [2022-01-11 01:47:35,701 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:47:35" (1/1) ... [2022-01-11 01:47:35,717 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:47:35" (1/1) ... [2022-01-11 01:47:35,717 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:47:35" (1/1) ... [2022-01-11 01:47:35,761 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:47:35" (1/1) ... [2022-01-11 01:47:35,781 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:47:35" (1/1) ... [2022-01-11 01:47:35,785 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:47:35" (1/1) ... [2022-01-11 01:47:35,793 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-11 01:47:35,800 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-11 01:47:35,800 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-11 01:47:35,800 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-11 01:47:35,801 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:47:35" (1/1) ... [2022-01-11 01:47:35,816 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 01:47:35,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 01:47:35,844 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-11 01:47:35,856 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-11 01:47:35,868 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-11 01:47:35,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-11 01:47:35,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-11 01:47:35,869 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-11 01:47:35,976 INFO L234 CfgBuilder]: Building ICFG [2022-01-11 01:47:35,977 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-11 01:47:37,304 INFO L275 CfgBuilder]: Performing block encoding [2022-01-11 01:47:37,327 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-11 01:47:37,328 INFO L299 CfgBuilder]: Removed 17 assume(true) statements. [2022-01-11 01:47:37,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 01:47:37 BoogieIcfgContainer [2022-01-11 01:47:37,332 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-11 01:47:37,333 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-11 01:47:37,333 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-11 01:47:37,334 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-11 01:47:37,336 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 01:47:37" (1/1) ... [2022-01-11 01:47:37,652 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 01:47:37 BasicIcfg [2022-01-11 01:47:37,652 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-11 01:47:37,654 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-11 01:47:37,654 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-11 01:47:37,656 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-11 01:47:37,656 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 01:47:35" (1/4) ... [2022-01-11 01:47:37,657 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6511283e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 01:47:37, skipping insertion in model container [2022-01-11 01:47:37,657 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:47:35" (2/4) ... [2022-01-11 01:47:37,657 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6511283e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 01:47:37, skipping insertion in model container [2022-01-11 01:47:37,657 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 01:47:37" (3/4) ... [2022-01-11 01:47:37,657 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6511283e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 01:47:37, skipping insertion in model container [2022-01-11 01:47:37,657 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 01:47:37" (4/4) ... [2022-01-11 01:47:37,658 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.10.cil-2.cTransformedIcfg [2022-01-11 01:47:37,662 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-11 01:47:37,662 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-01-11 01:47:37,713 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-11 01:47:37,721 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-11 01:47:37,721 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-01-11 01:47:37,750 INFO L276 IsEmpty]: Start isEmpty. Operand has 1447 states, 1443 states have (on average 1.5100485100485102) internal successors, (2179), 1446 states have internal predecessors, (2179), 0 states have call successors, (0), 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-11 01:47:37,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-11 01:47:37,756 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:37,756 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] [2022-01-11 01:47:37,757 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:47:37,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:37,761 INFO L85 PathProgramCache]: Analyzing trace with hash 2092929598, now seen corresponding path program 1 times [2022-01-11 01:47:37,766 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:37,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365090886] [2022-01-11 01:47:37,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:37,768 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:37,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:37,986 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-11 01:47:37,986 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:37,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365090886] [2022-01-11 01:47:37,987 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365090886] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:37,987 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:37,987 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:47:37,988 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046838847] [2022-01-11 01:47:37,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:37,991 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:37,991 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:38,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:38,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:38,027 INFO L87 Difference]: Start difference. First operand has 1447 states, 1443 states have (on average 1.5100485100485102) internal successors, (2179), 1446 states have internal predecessors, (2179), 0 states have call successors, (0), 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 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 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-11 01:47:38,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:38,173 INFO L93 Difference]: Finished difference Result 2817 states and 4224 transitions. [2022-01-11 01:47:38,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:38,176 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2022-01-11 01:47:38,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:38,194 INFO L225 Difference]: With dead ends: 2817 [2022-01-11 01:47:38,194 INFO L226 Difference]: Without dead ends: 1502 [2022-01-11 01:47:38,201 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-11 01:47:38,207 INFO L933 BasicCegarLoop]: 2149 mSDtfsCounter, 2110 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2110 SdHoareTripleChecker+Valid, 2243 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:38,208 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2110 Valid, 2243 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:38,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1502 states. [2022-01-11 01:47:38,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1502 to 1481. [2022-01-11 01:47:38,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1481 states, 1478 states have (on average 1.4824086603518267) internal successors, (2191), 1480 states have internal predecessors, (2191), 0 states have call successors, (0), 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-11 01:47:38,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1481 states to 1481 states and 2191 transitions. [2022-01-11 01:47:38,287 INFO L78 Accepts]: Start accepts. Automaton has 1481 states and 2191 transitions. Word has length 36 [2022-01-11 01:47:38,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:38,287 INFO L470 AbstractCegarLoop]: Abstraction has 1481 states and 2191 transitions. [2022-01-11 01:47:38,287 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 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-11 01:47:38,287 INFO L276 IsEmpty]: Start isEmpty. Operand 1481 states and 2191 transitions. [2022-01-11 01:47:38,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-01-11 01:47:38,288 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:38,288 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] [2022-01-11 01:47:38,289 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-11 01:47:38,289 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:47:38,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:38,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1806066475, now seen corresponding path program 1 times [2022-01-11 01:47:38,290 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:38,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468471052] [2022-01-11 01:47:38,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:38,290 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:38,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:38,356 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-11 01:47:38,357 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:38,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468471052] [2022-01-11 01:47:38,357 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468471052] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:38,357 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:38,357 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:47:38,357 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620068274] [2022-01-11 01:47:38,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:38,358 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:38,358 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:38,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:38,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:38,359 INFO L87 Difference]: Start difference. First operand 1481 states and 2191 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 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-11 01:47:38,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:38,397 INFO L93 Difference]: Finished difference Result 1650 states and 2426 transitions. [2022-01-11 01:47:38,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:38,397 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2022-01-11 01:47:38,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:38,402 INFO L225 Difference]: With dead ends: 1650 [2022-01-11 01:47:38,402 INFO L226 Difference]: Without dead ends: 1539 [2022-01-11 01:47:38,403 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-11 01:47:38,404 INFO L933 BasicCegarLoop]: 2129 mSDtfsCounter, 60 mSDsluCounter, 2090 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 4219 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:38,404 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 4219 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:38,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1539 states. [2022-01-11 01:47:38,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1539 to 1534. [2022-01-11 01:47:38,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1534 states, 1531 states have (on average 1.4787720444154147) internal successors, (2264), 1533 states have internal predecessors, (2264), 0 states have call successors, (0), 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-11 01:47:38,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1534 states to 1534 states and 2264 transitions. [2022-01-11 01:47:38,427 INFO L78 Accepts]: Start accepts. Automaton has 1534 states and 2264 transitions. Word has length 37 [2022-01-11 01:47:38,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:38,427 INFO L470 AbstractCegarLoop]: Abstraction has 1534 states and 2264 transitions. [2022-01-11 01:47:38,428 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 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-11 01:47:38,428 INFO L276 IsEmpty]: Start isEmpty. Operand 1534 states and 2264 transitions. [2022-01-11 01:47:38,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-01-11 01:47:38,429 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:38,429 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] [2022-01-11 01:47:38,429 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-11 01:47:38,429 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:47:38,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:38,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1651769642, now seen corresponding path program 1 times [2022-01-11 01:47:38,430 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:38,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343240929] [2022-01-11 01:47:38,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:38,430 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:38,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:38,476 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-11 01:47:38,476 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:38,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343240929] [2022-01-11 01:47:38,476 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343240929] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:38,476 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:38,476 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:47:38,477 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406543210] [2022-01-11 01:47:38,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:38,477 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:38,477 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:38,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:38,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:38,478 INFO L87 Difference]: Start difference. First operand 1534 states and 2264 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 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-11 01:47:38,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:38,572 INFO L93 Difference]: Finished difference Result 1851 states and 2700 transitions. [2022-01-11 01:47:38,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:38,572 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2022-01-11 01:47:38,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:38,577 INFO L225 Difference]: With dead ends: 1851 [2022-01-11 01:47:38,577 INFO L226 Difference]: Without dead ends: 1687 [2022-01-11 01:47:38,580 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-11 01:47:38,582 INFO L933 BasicCegarLoop]: 2152 mSDtfsCounter, 2101 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2101 SdHoareTripleChecker+Valid, 2240 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:38,583 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2101 Valid, 2240 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:38,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1687 states. [2022-01-11 01:47:38,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1687 to 1665. [2022-01-11 01:47:38,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1665 states, 1662 states have (on average 1.4681107099879662) internal successors, (2440), 1664 states have internal predecessors, (2440), 0 states have call successors, (0), 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-11 01:47:38,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1665 states to 1665 states and 2440 transitions. [2022-01-11 01:47:38,616 INFO L78 Accepts]: Start accepts. Automaton has 1665 states and 2440 transitions. Word has length 37 [2022-01-11 01:47:38,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:38,616 INFO L470 AbstractCegarLoop]: Abstraction has 1665 states and 2440 transitions. [2022-01-11 01:47:38,616 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 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-11 01:47:38,617 INFO L276 IsEmpty]: Start isEmpty. Operand 1665 states and 2440 transitions. [2022-01-11 01:47:38,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-11 01:47:38,620 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:38,621 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] [2022-01-11 01:47:38,621 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-11 01:47:38,621 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:47:38,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:38,622 INFO L85 PathProgramCache]: Analyzing trace with hash 541854801, now seen corresponding path program 1 times [2022-01-11 01:47:38,622 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:38,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585298572] [2022-01-11 01:47:38,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:38,623 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:38,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:38,699 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-11 01:47:38,699 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:38,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585298572] [2022-01-11 01:47:38,699 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585298572] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:38,699 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:38,699 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:47:38,700 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267932692] [2022-01-11 01:47:38,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:38,700 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:38,700 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:38,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:38,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:38,701 INFO L87 Difference]: Start difference. First operand 1665 states and 2440 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 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-11 01:47:38,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:38,751 INFO L93 Difference]: Finished difference Result 2116 states and 3047 transitions. [2022-01-11 01:47:38,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:38,752 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2022-01-11 01:47:38,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:38,757 INFO L225 Difference]: With dead ends: 2116 [2022-01-11 01:47:38,757 INFO L226 Difference]: Without dead ends: 1821 [2022-01-11 01:47:38,759 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-11 01:47:38,764 INFO L933 BasicCegarLoop]: 2182 mSDtfsCounter, 48 mSDsluCounter, 2117 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 4299 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:38,764 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 4299 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:38,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1821 states. [2022-01-11 01:47:38,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1821 to 1821. [2022-01-11 01:47:38,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1821 states, 1818 states have (on average 1.4455445544554455) internal successors, (2628), 1820 states have internal predecessors, (2628), 0 states have call successors, (0), 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-11 01:47:38,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1821 states to 1821 states and 2628 transitions. [2022-01-11 01:47:38,801 INFO L78 Accepts]: Start accepts. Automaton has 1821 states and 2628 transitions. Word has length 51 [2022-01-11 01:47:38,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:38,802 INFO L470 AbstractCegarLoop]: Abstraction has 1821 states and 2628 transitions. [2022-01-11 01:47:38,802 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 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-11 01:47:38,802 INFO L276 IsEmpty]: Start isEmpty. Operand 1821 states and 2628 transitions. [2022-01-11 01:47:38,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-11 01:47:38,803 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:38,803 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] [2022-01-11 01:47:38,803 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-11 01:47:38,803 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:47:38,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:38,804 INFO L85 PathProgramCache]: Analyzing trace with hash -58126843, now seen corresponding path program 1 times [2022-01-11 01:47:38,804 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:38,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202879181] [2022-01-11 01:47:38,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:38,805 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:38,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:38,865 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-11 01:47:38,866 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:38,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202879181] [2022-01-11 01:47:38,866 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202879181] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:38,866 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:38,866 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:47:38,866 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525194445] [2022-01-11 01:47:38,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:38,867 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:38,867 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:38,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:38,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:38,867 INFO L87 Difference]: Start difference. First operand 1821 states and 2628 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 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-11 01:47:38,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:38,924 INFO L93 Difference]: Finished difference Result 2294 states and 3244 transitions. [2022-01-11 01:47:38,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:38,924 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2022-01-11 01:47:38,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:38,929 INFO L225 Difference]: With dead ends: 2294 [2022-01-11 01:47:38,929 INFO L226 Difference]: Without dead ends: 1929 [2022-01-11 01:47:38,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-11 01:47:38,930 INFO L933 BasicCegarLoop]: 2129 mSDtfsCounter, 2075 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2075 SdHoareTripleChecker+Valid, 2217 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-11 01:47:38,931 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2075 Valid, 2217 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:38,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1929 states. [2022-01-11 01:47:38,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1929 to 1929. [2022-01-11 01:47:38,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1929 states, 1926 states have (on average 1.430944963655244) internal successors, (2756), 1928 states have internal predecessors, (2756), 0 states have call successors, (0), 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-11 01:47:38,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1929 states to 1929 states and 2756 transitions. [2022-01-11 01:47:38,970 INFO L78 Accepts]: Start accepts. Automaton has 1929 states and 2756 transitions. Word has length 55 [2022-01-11 01:47:38,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:38,970 INFO L470 AbstractCegarLoop]: Abstraction has 1929 states and 2756 transitions. [2022-01-11 01:47:38,971 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 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-11 01:47:38,971 INFO L276 IsEmpty]: Start isEmpty. Operand 1929 states and 2756 transitions. [2022-01-11 01:47:38,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-01-11 01:47:38,972 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:38,972 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-11 01:47:38,972 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-11 01:47:38,972 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:47:38,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:38,973 INFO L85 PathProgramCache]: Analyzing trace with hash 2105778975, now seen corresponding path program 1 times [2022-01-11 01:47:38,973 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:38,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899974362] [2022-01-11 01:47:38,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:38,973 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:38,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:39,035 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:39,035 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:39,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899974362] [2022-01-11 01:47:39,036 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899974362] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:39,036 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:39,036 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 01:47:39,036 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722787164] [2022-01-11 01:47:39,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:39,036 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 01:47:39,036 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:39,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 01:47:39,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 01:47:39,037 INFO L87 Difference]: Start difference. First operand 1929 states and 2756 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:39,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:39,177 INFO L93 Difference]: Finished difference Result 3012 states and 4160 transitions. [2022-01-11 01:47:39,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 01:47:39,177 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2022-01-11 01:47:39,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:39,185 INFO L225 Difference]: With dead ends: 3012 [2022-01-11 01:47:39,185 INFO L226 Difference]: Without dead ends: 2589 [2022-01-11 01:47:39,188 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-11 01:47:39,189 INFO L933 BasicCegarLoop]: 2202 mSDtfsCounter, 302 mSDsluCounter, 6524 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 8726 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:39,190 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [302 Valid, 8726 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:39,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2589 states. [2022-01-11 01:47:39,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2589 to 1953. [2022-01-11 01:47:39,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1953 states, 1950 states have (on average 1.4235897435897436) internal successors, (2776), 1952 states have internal predecessors, (2776), 0 states have call successors, (0), 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-11 01:47:39,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1953 states to 1953 states and 2776 transitions. [2022-01-11 01:47:39,259 INFO L78 Accepts]: Start accepts. Automaton has 1953 states and 2776 transitions. Word has length 56 [2022-01-11 01:47:39,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:39,260 INFO L470 AbstractCegarLoop]: Abstraction has 1953 states and 2776 transitions. [2022-01-11 01:47:39,260 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:39,260 INFO L276 IsEmpty]: Start isEmpty. Operand 1953 states and 2776 transitions. [2022-01-11 01:47:39,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-01-11 01:47:39,261 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:39,261 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-11 01:47:39,261 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-11 01:47:39,261 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:47:39,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:39,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1838388384, now seen corresponding path program 1 times [2022-01-11 01:47:39,262 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:39,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455881199] [2022-01-11 01:47:39,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:39,262 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:39,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:39,354 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:39,355 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:39,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455881199] [2022-01-11 01:47:39,355 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455881199] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:39,355 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:39,355 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 01:47:39,355 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615746661] [2022-01-11 01:47:39,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:39,356 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 01:47:39,356 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:39,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 01:47:39,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 01:47:39,356 INFO L87 Difference]: Start difference. First operand 1953 states and 2776 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:39,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:39,469 INFO L93 Difference]: Finished difference Result 2742 states and 3786 transitions. [2022-01-11 01:47:39,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 01:47:39,469 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2022-01-11 01:47:39,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:39,476 INFO L225 Difference]: With dead ends: 2742 [2022-01-11 01:47:39,476 INFO L226 Difference]: Without dead ends: 2244 [2022-01-11 01:47:39,477 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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-11 01:47:39,477 INFO L933 BasicCegarLoop]: 2179 mSDtfsCounter, 276 mSDsluCounter, 6493 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 8672 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:39,478 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [276 Valid, 8672 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:39,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2244 states. [2022-01-11 01:47:39,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2244 to 1851. [2022-01-11 01:47:39,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1851 states, 1848 states have (on average 1.4312770562770563) internal successors, (2645), 1850 states have internal predecessors, (2645), 0 states have call successors, (0), 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-11 01:47:39,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1851 states to 1851 states and 2645 transitions. [2022-01-11 01:47:39,526 INFO L78 Accepts]: Start accepts. Automaton has 1851 states and 2645 transitions. Word has length 56 [2022-01-11 01:47:39,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:39,526 INFO L470 AbstractCegarLoop]: Abstraction has 1851 states and 2645 transitions. [2022-01-11 01:47:39,526 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:39,526 INFO L276 IsEmpty]: Start isEmpty. Operand 1851 states and 2645 transitions. [2022-01-11 01:47:39,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-01-11 01:47:39,527 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:39,527 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-11 01:47:39,528 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-11 01:47:39,528 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:47:39,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:39,528 INFO L85 PathProgramCache]: Analyzing trace with hash 379399360, now seen corresponding path program 1 times [2022-01-11 01:47:39,528 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:39,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942535580] [2022-01-11 01:47:39,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:39,528 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:39,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:39,617 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:39,617 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:39,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942535580] [2022-01-11 01:47:39,617 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942535580] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:39,617 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:39,617 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 01:47:39,618 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663047632] [2022-01-11 01:47:39,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:39,618 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 01:47:39,618 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:39,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 01:47:39,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 01:47:39,619 INFO L87 Difference]: Start difference. First operand 1851 states and 2645 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:39,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:39,729 INFO L93 Difference]: Finished difference Result 1901 states and 2705 transitions. [2022-01-11 01:47:39,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 01:47:39,730 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2022-01-11 01:47:39,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:39,735 INFO L225 Difference]: With dead ends: 1901 [2022-01-11 01:47:39,735 INFO L226 Difference]: Without dead ends: 1899 [2022-01-11 01:47:39,736 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 01:47:39,736 INFO L933 BasicCegarLoop]: 2129 mSDtfsCounter, 4226 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4226 SdHoareTripleChecker+Valid, 2198 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:39,736 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4226 Valid, 2198 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:39,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1899 states. [2022-01-11 01:47:39,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1899 to 1849. [2022-01-11 01:47:39,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1849 states, 1847 states have (on average 1.4304277206280456) internal successors, (2642), 1848 states have internal predecessors, (2642), 0 states have call successors, (0), 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-11 01:47:39,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1849 states to 1849 states and 2642 transitions. [2022-01-11 01:47:39,833 INFO L78 Accepts]: Start accepts. Automaton has 1849 states and 2642 transitions. Word has length 56 [2022-01-11 01:47:39,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:39,833 INFO L470 AbstractCegarLoop]: Abstraction has 1849 states and 2642 transitions. [2022-01-11 01:47:39,833 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:39,833 INFO L276 IsEmpty]: Start isEmpty. Operand 1849 states and 2642 transitions. [2022-01-11 01:47:39,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-01-11 01:47:39,834 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:39,834 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-11 01:47:39,834 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-11 01:47:39,835 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:47:39,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:39,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1123517209, now seen corresponding path program 1 times [2022-01-11 01:47:39,835 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:39,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270717489] [2022-01-11 01:47:39,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:39,835 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:39,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:39,999 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:39,999 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:39,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270717489] [2022-01-11 01:47:39,999 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270717489] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 01:47:40,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [479140516] [2022-01-11 01:47:40,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:40,000 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 01:47:40,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 01:47:40,001 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-11 01:47:40,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-11 01:47:40,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:40,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 651 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-11 01:47:40,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 01:47:40,395 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:40,395 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 01:47:40,645 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:40,645 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [479140516] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 01:47:40,645 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 01:47:40,645 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-01-11 01:47:40,646 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473629723] [2022-01-11 01:47:40,646 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 01:47:40,646 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-11 01:47:40,646 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:40,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-11 01:47:40,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-01-11 01:47:40,647 INFO L87 Difference]: Start difference. First operand 1849 states and 2642 transitions. Second operand has 10 states, 10 states have (on average 15.1) internal successors, (151), 10 states have internal predecessors, (151), 0 states have call successors, (0), 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-11 01:47:40,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:40,890 INFO L93 Difference]: Finished difference Result 2735 states and 3770 transitions. [2022-01-11 01:47:40,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-11 01:47:40,891 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 15.1) internal successors, (151), 10 states have internal predecessors, (151), 0 states have call successors, (0), 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 57 [2022-01-11 01:47:40,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:40,899 INFO L225 Difference]: With dead ends: 2735 [2022-01-11 01:47:40,899 INFO L226 Difference]: Without dead ends: 2733 [2022-01-11 01:47:40,900 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-01-11 01:47:40,901 INFO L933 BasicCegarLoop]: 2204 mSDtfsCounter, 6572 mSDsluCounter, 4694 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6572 SdHoareTripleChecker+Valid, 6898 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:40,902 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6572 Valid, 6898 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:40,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2733 states. [2022-01-11 01:47:41,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2733 to 2121. [2022-01-11 01:47:41,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2121 states, 2119 states have (on average 1.4134025483718735) internal successors, (2995), 2120 states have internal predecessors, (2995), 0 states have call successors, (0), 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-11 01:47:41,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2121 states to 2121 states and 2995 transitions. [2022-01-11 01:47:41,017 INFO L78 Accepts]: Start accepts. Automaton has 2121 states and 2995 transitions. Word has length 57 [2022-01-11 01:47:41,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:41,018 INFO L470 AbstractCegarLoop]: Abstraction has 2121 states and 2995 transitions. [2022-01-11 01:47:41,018 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.1) internal successors, (151), 10 states have internal predecessors, (151), 0 states have call successors, (0), 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-11 01:47:41,018 INFO L276 IsEmpty]: Start isEmpty. Operand 2121 states and 2995 transitions. [2022-01-11 01:47:41,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-01-11 01:47:41,019 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:41,019 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:47:41,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-11 01:47:41,235 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 01:47:41,235 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:47:41,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:41,236 INFO L85 PathProgramCache]: Analyzing trace with hash 848220470, now seen corresponding path program 2 times [2022-01-11 01:47:41,236 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:41,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011285422] [2022-01-11 01:47:41,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:41,236 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:41,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:41,270 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:41,270 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:41,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011285422] [2022-01-11 01:47:41,270 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011285422] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:41,272 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:41,272 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:47:41,273 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413504142] [2022-01-11 01:47:41,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:41,273 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:41,273 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:41,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:41,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:41,274 INFO L87 Difference]: Start difference. First operand 2121 states and 2995 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 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-11 01:47:41,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:41,387 INFO L93 Difference]: Finished difference Result 2628 states and 3655 transitions. [2022-01-11 01:47:41,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:41,388 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 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 72 [2022-01-11 01:47:41,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:41,394 INFO L225 Difference]: With dead ends: 2628 [2022-01-11 01:47:41,394 INFO L226 Difference]: Without dead ends: 2032 [2022-01-11 01:47:41,395 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-11 01:47:41,396 INFO L933 BasicCegarLoop]: 2163 mSDtfsCounter, 2079 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2079 SdHoareTripleChecker+Valid, 2232 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:41,396 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2079 Valid, 2232 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:41,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2032 states. [2022-01-11 01:47:41,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2032 to 2006. [2022-01-11 01:47:41,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2006 states, 2004 states have (on average 1.4186626746506985) internal successors, (2843), 2005 states have internal predecessors, (2843), 0 states have call successors, (0), 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-11 01:47:41,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2006 states to 2006 states and 2843 transitions. [2022-01-11 01:47:41,483 INFO L78 Accepts]: Start accepts. Automaton has 2006 states and 2843 transitions. Word has length 72 [2022-01-11 01:47:41,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:41,483 INFO L470 AbstractCegarLoop]: Abstraction has 2006 states and 2843 transitions. [2022-01-11 01:47:41,483 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 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-11 01:47:41,483 INFO L276 IsEmpty]: Start isEmpty. Operand 2006 states and 2843 transitions. [2022-01-11 01:47:41,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-01-11 01:47:41,485 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:41,485 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:47:41,485 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-11 01:47:41,485 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:47:41,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:41,485 INFO L85 PathProgramCache]: Analyzing trace with hash 452143948, now seen corresponding path program 1 times [2022-01-11 01:47:41,485 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:41,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511889072] [2022-01-11 01:47:41,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:41,486 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:41,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:41,518 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-11 01:47:41,519 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:41,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511889072] [2022-01-11 01:47:41,519 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511889072] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:41,519 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:41,519 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:47:41,519 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52210609] [2022-01-11 01:47:41,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:41,519 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:41,520 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:41,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:41,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:41,520 INFO L87 Difference]: Start difference. First operand 2006 states and 2843 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:41,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:41,616 INFO L93 Difference]: Finished difference Result 2660 states and 3670 transitions. [2022-01-11 01:47:41,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:41,616 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2022-01-11 01:47:41,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:41,622 INFO L225 Difference]: With dead ends: 2660 [2022-01-11 01:47:41,622 INFO L226 Difference]: Without dead ends: 2024 [2022-01-11 01:47:41,623 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-11 01:47:41,624 INFO L933 BasicCegarLoop]: 2136 mSDtfsCounter, 2064 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2064 SdHoareTripleChecker+Valid, 2220 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-11 01:47:41,624 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2064 Valid, 2220 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:41,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2024 states. [2022-01-11 01:47:41,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2024 to 2006. [2022-01-11 01:47:41,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2006 states, 2004 states have (on average 1.408682634730539) internal successors, (2823), 2005 states have internal predecessors, (2823), 0 states have call successors, (0), 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-11 01:47:41,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2006 states to 2006 states and 2823 transitions. [2022-01-11 01:47:41,737 INFO L78 Accepts]: Start accepts. Automaton has 2006 states and 2823 transitions. Word has length 84 [2022-01-11 01:47:41,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:41,737 INFO L470 AbstractCegarLoop]: Abstraction has 2006 states and 2823 transitions. [2022-01-11 01:47:41,737 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:41,738 INFO L276 IsEmpty]: Start isEmpty. Operand 2006 states and 2823 transitions. [2022-01-11 01:47:41,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-01-11 01:47:41,739 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:41,739 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:47:41,739 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-11 01:47:41,739 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:47:41,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:41,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1394889902, now seen corresponding path program 1 times [2022-01-11 01:47:41,739 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:41,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772917430] [2022-01-11 01:47:41,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:41,740 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:41,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:41,775 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-11 01:47:41,775 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:41,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772917430] [2022-01-11 01:47:41,775 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772917430] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:41,775 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:41,776 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:47:41,776 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387388826] [2022-01-11 01:47:41,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:41,776 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:41,776 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:41,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:41,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:41,777 INFO L87 Difference]: Start difference. First operand 2006 states and 2823 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:41,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:41,851 INFO L93 Difference]: Finished difference Result 2270 states and 3141 transitions. [2022-01-11 01:47:41,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:41,852 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2022-01-11 01:47:41,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:41,855 INFO L225 Difference]: With dead ends: 2270 [2022-01-11 01:47:41,855 INFO L226 Difference]: Without dead ends: 1364 [2022-01-11 01:47:41,857 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-11 01:47:41,857 INFO L933 BasicCegarLoop]: 2162 mSDtfsCounter, 56 mSDsluCounter, 2094 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 4256 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:41,858 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 4256 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:41,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2022-01-11 01:47:41,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1364. [2022-01-11 01:47:41,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1364 states, 1363 states have (on average 1.4871606749816582) internal successors, (2027), 1363 states have internal predecessors, (2027), 0 states have call successors, (0), 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-11 01:47:41,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1364 states to 1364 states and 2027 transitions. [2022-01-11 01:47:41,904 INFO L78 Accepts]: Start accepts. Automaton has 1364 states and 2027 transitions. Word has length 85 [2022-01-11 01:47:41,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:41,904 INFO L470 AbstractCegarLoop]: Abstraction has 1364 states and 2027 transitions. [2022-01-11 01:47:41,904 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:41,905 INFO L276 IsEmpty]: Start isEmpty. Operand 1364 states and 2027 transitions. [2022-01-11 01:47:41,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-01-11 01:47:41,905 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:41,905 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 01:47:41,905 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-11 01:47:41,906 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:47:41,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:41,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1885340910, now seen corresponding path program 1 times [2022-01-11 01:47:41,906 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:41,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177619464] [2022-01-11 01:47:41,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:41,906 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:41,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:41,937 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-11 01:47:41,937 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:41,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177619464] [2022-01-11 01:47:41,937 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177619464] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:41,937 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:41,937 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:41,937 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926175180] [2022-01-11 01:47:41,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:41,938 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:41,938 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:41,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:41,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:41,938 INFO L87 Difference]: Start difference. First operand 1364 states and 2027 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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-11 01:47:42,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:42,023 INFO L93 Difference]: Finished difference Result 3855 states and 5710 transitions. [2022-01-11 01:47:42,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:42,024 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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 143 [2022-01-11 01:47:42,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:42,030 INFO L225 Difference]: With dead ends: 3855 [2022-01-11 01:47:42,031 INFO L226 Difference]: Without dead ends: 2509 [2022-01-11 01:47:42,032 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-11 01:47:42,033 INFO L933 BasicCegarLoop]: 2021 mSDtfsCounter, 1892 mSDsluCounter, 1792 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1892 SdHoareTripleChecker+Valid, 3813 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-11 01:47:42,033 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1892 Valid, 3813 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:42,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2509 states. [2022-01-11 01:47:42,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2509 to 2507. [2022-01-11 01:47:42,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2507 states, 2506 states have (on average 1.4796488427773344) internal successors, (3708), 2506 states have internal predecessors, (3708), 0 states have call successors, (0), 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-11 01:47:42,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2507 states to 2507 states and 3708 transitions. [2022-01-11 01:47:42,145 INFO L78 Accepts]: Start accepts. Automaton has 2507 states and 3708 transitions. Word has length 143 [2022-01-11 01:47:42,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:42,145 INFO L470 AbstractCegarLoop]: Abstraction has 2507 states and 3708 transitions. [2022-01-11 01:47:42,145 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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-11 01:47:42,145 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 3708 transitions. [2022-01-11 01:47:42,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-01-11 01:47:42,146 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:42,146 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 01:47:42,146 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-11 01:47:42,147 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:47:42,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:42,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1770404302, now seen corresponding path program 1 times [2022-01-11 01:47:42,147 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:42,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729518228] [2022-01-11 01:47:42,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:42,147 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:42,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:42,180 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-11 01:47:42,180 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:42,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729518228] [2022-01-11 01:47:42,180 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729518228] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:42,180 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:42,180 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:42,180 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351338073] [2022-01-11 01:47:42,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:42,181 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:42,181 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:42,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:42,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:42,182 INFO L87 Difference]: Start difference. First operand 2507 states and 3708 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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-11 01:47:42,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:42,282 INFO L93 Difference]: Finished difference Result 4995 states and 7385 transitions. [2022-01-11 01:47:42,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:42,283 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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 143 [2022-01-11 01:47:42,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:42,287 INFO L225 Difference]: With dead ends: 4995 [2022-01-11 01:47:42,287 INFO L226 Difference]: Without dead ends: 2507 [2022-01-11 01:47:42,290 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-11 01:47:42,290 INFO L933 BasicCegarLoop]: 2015 mSDtfsCounter, 2002 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2002 SdHoareTripleChecker+Valid, 2015 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-11 01:47:42,290 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2002 Valid, 2015 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:42,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2507 states. [2022-01-11 01:47:42,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2507 to 2507. [2022-01-11 01:47:42,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2507 states, 2506 states have (on average 1.4764565043894653) internal successors, (3700), 2506 states have internal predecessors, (3700), 0 states have call successors, (0), 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-11 01:47:42,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2507 states to 2507 states and 3700 transitions. [2022-01-11 01:47:42,364 INFO L78 Accepts]: Start accepts. Automaton has 2507 states and 3700 transitions. Word has length 143 [2022-01-11 01:47:42,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:42,364 INFO L470 AbstractCegarLoop]: Abstraction has 2507 states and 3700 transitions. [2022-01-11 01:47:42,364 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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-11 01:47:42,364 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 3700 transitions. [2022-01-11 01:47:42,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-01-11 01:47:42,365 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:42,365 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 01:47:42,365 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-11 01:47:42,366 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:47:42,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:42,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1974081298, now seen corresponding path program 1 times [2022-01-11 01:47:42,366 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:42,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013869639] [2022-01-11 01:47:42,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:42,366 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:42,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:42,396 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-11 01:47:42,396 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:42,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013869639] [2022-01-11 01:47:42,397 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013869639] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:42,397 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:42,397 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:42,397 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386220951] [2022-01-11 01:47:42,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:42,397 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:42,397 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:42,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:42,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:42,398 INFO L87 Difference]: Start difference. First operand 2507 states and 3700 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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-11 01:47:42,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:42,477 INFO L93 Difference]: Finished difference Result 4994 states and 7368 transitions. [2022-01-11 01:47:42,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:42,478 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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 143 [2022-01-11 01:47:42,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:42,481 INFO L225 Difference]: With dead ends: 4994 [2022-01-11 01:47:42,481 INFO L226 Difference]: Without dead ends: 2507 [2022-01-11 01:47:42,484 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-11 01:47:42,484 INFO L933 BasicCegarLoop]: 2010 mSDtfsCounter, 1996 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1996 SdHoareTripleChecker+Valid, 2010 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-11 01:47:42,484 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1996 Valid, 2010 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:42,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2507 states. [2022-01-11 01:47:42,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2507 to 2507. [2022-01-11 01:47:42,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2507 states, 2506 states have (on average 1.4732641660015962) internal successors, (3692), 2506 states have internal predecessors, (3692), 0 states have call successors, (0), 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-11 01:47:42,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2507 states to 2507 states and 3692 transitions. [2022-01-11 01:47:42,584 INFO L78 Accepts]: Start accepts. Automaton has 2507 states and 3692 transitions. Word has length 143 [2022-01-11 01:47:42,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:42,584 INFO L470 AbstractCegarLoop]: Abstraction has 2507 states and 3692 transitions. [2022-01-11 01:47:42,585 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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-11 01:47:42,585 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 3692 transitions. [2022-01-11 01:47:42,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-01-11 01:47:42,586 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:42,586 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 01:47:42,587 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-11 01:47:42,587 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:47:42,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:42,587 INFO L85 PathProgramCache]: Analyzing trace with hash -121886158, now seen corresponding path program 1 times [2022-01-11 01:47:42,587 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:42,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585535517] [2022-01-11 01:47:42,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:42,587 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:42,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:42,623 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-11 01:47:42,623 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:42,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585535517] [2022-01-11 01:47:42,623 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585535517] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:42,624 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:42,624 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:42,624 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69275672] [2022-01-11 01:47:42,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:42,624 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:42,624 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:42,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:42,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:42,625 INFO L87 Difference]: Start difference. First operand 2507 states and 3692 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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-11 01:47:42,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:42,716 INFO L93 Difference]: Finished difference Result 4993 states and 7351 transitions. [2022-01-11 01:47:42,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:42,716 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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 143 [2022-01-11 01:47:42,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:42,722 INFO L225 Difference]: With dead ends: 4993 [2022-01-11 01:47:42,722 INFO L226 Difference]: Without dead ends: 2507 [2022-01-11 01:47:42,726 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-11 01:47:42,727 INFO L933 BasicCegarLoop]: 2005 mSDtfsCounter, 1990 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1990 SdHoareTripleChecker+Valid, 2005 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-11 01:47:42,727 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1990 Valid, 2005 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:42,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2507 states. [2022-01-11 01:47:42,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2507 to 2507. [2022-01-11 01:47:42,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2507 states, 2506 states have (on average 1.470071827613727) internal successors, (3684), 2506 states have internal predecessors, (3684), 0 states have call successors, (0), 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-11 01:47:42,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2507 states to 2507 states and 3684 transitions. [2022-01-11 01:47:42,823 INFO L78 Accepts]: Start accepts. Automaton has 2507 states and 3684 transitions. Word has length 143 [2022-01-11 01:47:42,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:42,823 INFO L470 AbstractCegarLoop]: Abstraction has 2507 states and 3684 transitions. [2022-01-11 01:47:42,823 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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-11 01:47:42,823 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 3684 transitions. [2022-01-11 01:47:42,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-01-11 01:47:42,824 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:42,824 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 01:47:42,824 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-11 01:47:42,824 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:47:42,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:42,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1334522642, now seen corresponding path program 1 times [2022-01-11 01:47:42,825 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:42,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143323569] [2022-01-11 01:47:42,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:42,825 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:42,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:42,864 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-11 01:47:42,864 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:42,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143323569] [2022-01-11 01:47:42,864 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143323569] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:42,864 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:42,864 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:42,864 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297621892] [2022-01-11 01:47:42,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:42,865 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:42,865 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:42,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:42,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:42,866 INFO L87 Difference]: Start difference. First operand 2507 states and 3684 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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-11 01:47:42,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:42,970 INFO L93 Difference]: Finished difference Result 4992 states and 7334 transitions. [2022-01-11 01:47:42,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:42,970 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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 143 [2022-01-11 01:47:42,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:42,974 INFO L225 Difference]: With dead ends: 4992 [2022-01-11 01:47:42,974 INFO L226 Difference]: Without dead ends: 2507 [2022-01-11 01:47:42,977 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-11 01:47:42,977 INFO L933 BasicCegarLoop]: 2000 mSDtfsCounter, 1984 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1984 SdHoareTripleChecker+Valid, 2000 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-11 01:47:42,977 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1984 Valid, 2000 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:42,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2507 states. [2022-01-11 01:47:43,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2507 to 2507. [2022-01-11 01:47:43,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2507 states, 2506 states have (on average 1.4668794892258579) internal successors, (3676), 2506 states have internal predecessors, (3676), 0 states have call successors, (0), 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-11 01:47:43,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2507 states to 2507 states and 3676 transitions. [2022-01-11 01:47:43,063 INFO L78 Accepts]: Start accepts. Automaton has 2507 states and 3676 transitions. Word has length 143 [2022-01-11 01:47:43,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:43,063 INFO L470 AbstractCegarLoop]: Abstraction has 2507 states and 3676 transitions. [2022-01-11 01:47:43,063 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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-11 01:47:43,064 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 3676 transitions. [2022-01-11 01:47:43,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-01-11 01:47:43,064 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:43,064 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 01:47:43,065 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-11 01:47:43,065 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:47:43,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:43,066 INFO L85 PathProgramCache]: Analyzing trace with hash 273124914, now seen corresponding path program 1 times [2022-01-11 01:47:43,066 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:43,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744771064] [2022-01-11 01:47:43,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:43,066 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:43,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:43,105 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-11 01:47:43,105 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:43,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744771064] [2022-01-11 01:47:43,105 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744771064] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:43,105 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:43,105 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:43,106 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52079963] [2022-01-11 01:47:43,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:43,106 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:43,106 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:43,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:43,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:43,107 INFO L87 Difference]: Start difference. First operand 2507 states and 3676 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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-11 01:47:43,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:43,203 INFO L93 Difference]: Finished difference Result 4991 states and 7317 transitions. [2022-01-11 01:47:43,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:43,203 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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 143 [2022-01-11 01:47:43,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:43,208 INFO L225 Difference]: With dead ends: 4991 [2022-01-11 01:47:43,209 INFO L226 Difference]: Without dead ends: 2507 [2022-01-11 01:47:43,213 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-11 01:47:43,214 INFO L933 BasicCegarLoop]: 1995 mSDtfsCounter, 1978 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1978 SdHoareTripleChecker+Valid, 1995 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-11 01:47:43,214 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1978 Valid, 1995 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:43,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2507 states. [2022-01-11 01:47:43,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2507 to 2507. [2022-01-11 01:47:43,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2507 states, 2506 states have (on average 1.4636871508379887) internal successors, (3668), 2506 states have internal predecessors, (3668), 0 states have call successors, (0), 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-11 01:47:43,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2507 states to 2507 states and 3668 transitions. [2022-01-11 01:47:43,357 INFO L78 Accepts]: Start accepts. Automaton has 2507 states and 3668 transitions. Word has length 143 [2022-01-11 01:47:43,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:43,357 INFO L470 AbstractCegarLoop]: Abstraction has 2507 states and 3668 transitions. [2022-01-11 01:47:43,357 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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-11 01:47:43,357 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 3668 transitions. [2022-01-11 01:47:43,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-01-11 01:47:43,358 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:43,358 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 01:47:43,358 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-11 01:47:43,359 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:47:43,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:43,359 INFO L85 PathProgramCache]: Analyzing trace with hash 654528274, now seen corresponding path program 1 times [2022-01-11 01:47:43,359 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:43,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471282369] [2022-01-11 01:47:43,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:43,359 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:43,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:43,409 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-11 01:47:43,409 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:43,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471282369] [2022-01-11 01:47:43,410 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471282369] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:43,410 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:43,410 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:43,410 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234839086] [2022-01-11 01:47:43,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:43,411 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:43,411 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:43,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:43,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:43,411 INFO L87 Difference]: Start difference. First operand 2507 states and 3668 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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-11 01:47:43,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:43,519 INFO L93 Difference]: Finished difference Result 4990 states and 7300 transitions. [2022-01-11 01:47:43,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:43,519 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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 143 [2022-01-11 01:47:43,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:43,525 INFO L225 Difference]: With dead ends: 4990 [2022-01-11 01:47:43,525 INFO L226 Difference]: Without dead ends: 2507 [2022-01-11 01:47:43,531 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-11 01:47:43,531 INFO L933 BasicCegarLoop]: 1990 mSDtfsCounter, 1972 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1972 SdHoareTripleChecker+Valid, 1990 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-11 01:47:43,532 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1972 Valid, 1990 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:43,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2507 states. [2022-01-11 01:47:43,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2507 to 2507. [2022-01-11 01:47:43,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2507 states, 2506 states have (on average 1.4604948124501198) internal successors, (3660), 2506 states have internal predecessors, (3660), 0 states have call successors, (0), 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-11 01:47:43,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2507 states to 2507 states and 3660 transitions. [2022-01-11 01:47:43,665 INFO L78 Accepts]: Start accepts. Automaton has 2507 states and 3660 transitions. Word has length 143 [2022-01-11 01:47:43,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:43,666 INFO L470 AbstractCegarLoop]: Abstraction has 2507 states and 3660 transitions. [2022-01-11 01:47:43,666 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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-11 01:47:43,666 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 3660 transitions. [2022-01-11 01:47:43,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-01-11 01:47:43,667 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:43,667 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 01:47:43,667 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-11 01:47:43,668 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:47:43,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:43,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1688473038, now seen corresponding path program 1 times [2022-01-11 01:47:43,668 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:43,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724010945] [2022-01-11 01:47:43,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:43,669 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:43,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:43,726 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-11 01:47:43,726 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:43,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724010945] [2022-01-11 01:47:43,726 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724010945] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:43,726 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:43,726 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:43,726 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462717644] [2022-01-11 01:47:43,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:43,727 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:43,727 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:43,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:43,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:43,728 INFO L87 Difference]: Start difference. First operand 2507 states and 3660 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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-11 01:47:43,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:43,910 INFO L93 Difference]: Finished difference Result 4989 states and 7283 transitions. [2022-01-11 01:47:43,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:43,911 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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 143 [2022-01-11 01:47:43,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:43,915 INFO L225 Difference]: With dead ends: 4989 [2022-01-11 01:47:43,916 INFO L226 Difference]: Without dead ends: 2507 [2022-01-11 01:47:43,919 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-11 01:47:43,920 INFO L933 BasicCegarLoop]: 1985 mSDtfsCounter, 1966 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1966 SdHoareTripleChecker+Valid, 1985 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-11 01:47:43,920 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1966 Valid, 1985 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:43,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2507 states. [2022-01-11 01:47:44,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2507 to 2507. [2022-01-11 01:47:44,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2507 states, 2506 states have (on average 1.4573024740622507) internal successors, (3652), 2506 states have internal predecessors, (3652), 0 states have call successors, (0), 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-11 01:47:44,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2507 states to 2507 states and 3652 transitions. [2022-01-11 01:47:44,081 INFO L78 Accepts]: Start accepts. Automaton has 2507 states and 3652 transitions. Word has length 143 [2022-01-11 01:47:44,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:44,081 INFO L470 AbstractCegarLoop]: Abstraction has 2507 states and 3652 transitions. [2022-01-11 01:47:44,081 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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-11 01:47:44,081 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 3652 transitions. [2022-01-11 01:47:44,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-01-11 01:47:44,082 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:44,083 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 01:47:44,083 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-11 01:47:44,083 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:47:44,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:44,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1976724242, now seen corresponding path program 1 times [2022-01-11 01:47:44,084 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:44,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141031461] [2022-01-11 01:47:44,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:44,085 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:44,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:44,124 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-11 01:47:44,125 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:44,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141031461] [2022-01-11 01:47:44,125 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141031461] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:44,125 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:44,125 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:44,125 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072876645] [2022-01-11 01:47:44,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:44,127 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:44,127 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:44,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:44,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:44,127 INFO L87 Difference]: Start difference. First operand 2507 states and 3652 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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-11 01:47:44,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:44,288 INFO L93 Difference]: Finished difference Result 4988 states and 7266 transitions. [2022-01-11 01:47:44,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:44,289 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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 143 [2022-01-11 01:47:44,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:44,294 INFO L225 Difference]: With dead ends: 4988 [2022-01-11 01:47:44,294 INFO L226 Difference]: Without dead ends: 2507 [2022-01-11 01:47:44,298 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-11 01:47:44,298 INFO L933 BasicCegarLoop]: 1980 mSDtfsCounter, 1960 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1960 SdHoareTripleChecker+Valid, 1980 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-11 01:47:44,298 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1960 Valid, 1980 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:44,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2507 states. [2022-01-11 01:47:44,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2507 to 2507. [2022-01-11 01:47:44,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2507 states, 2506 states have (on average 1.4541101356743815) internal successors, (3644), 2506 states have internal predecessors, (3644), 0 states have call successors, (0), 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-11 01:47:44,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2507 states to 2507 states and 3644 transitions. [2022-01-11 01:47:44,430 INFO L78 Accepts]: Start accepts. Automaton has 2507 states and 3644 transitions. Word has length 143 [2022-01-11 01:47:44,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:44,430 INFO L470 AbstractCegarLoop]: Abstraction has 2507 states and 3644 transitions. [2022-01-11 01:47:44,430 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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-11 01:47:44,430 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 3644 transitions. [2022-01-11 01:47:44,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-01-11 01:47:44,431 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:44,432 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 01:47:44,432 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-11 01:47:44,432 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:47:44,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:44,432 INFO L85 PathProgramCache]: Analyzing trace with hash -398895566, now seen corresponding path program 1 times [2022-01-11 01:47:44,432 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:44,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326294981] [2022-01-11 01:47:44,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:44,433 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:44,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:44,483 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-11 01:47:44,483 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:44,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326294981] [2022-01-11 01:47:44,483 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326294981] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:44,484 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:44,484 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:44,484 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899864501] [2022-01-11 01:47:44,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:44,484 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:44,484 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:44,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:44,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:44,485 INFO L87 Difference]: Start difference. First operand 2507 states and 3644 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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-11 01:47:44,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:44,624 INFO L93 Difference]: Finished difference Result 4987 states and 7249 transitions. [2022-01-11 01:47:44,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:44,625 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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 143 [2022-01-11 01:47:44,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:44,630 INFO L225 Difference]: With dead ends: 4987 [2022-01-11 01:47:44,630 INFO L226 Difference]: Without dead ends: 2507 [2022-01-11 01:47:44,633 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-11 01:47:44,634 INFO L933 BasicCegarLoop]: 1975 mSDtfsCounter, 1954 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1954 SdHoareTripleChecker+Valid, 1975 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-11 01:47:44,634 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1954 Valid, 1975 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:44,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2507 states. [2022-01-11 01:47:44,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2507 to 2507. [2022-01-11 01:47:44,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2507 states, 2506 states have (on average 1.4509177972865124) internal successors, (3636), 2506 states have internal predecessors, (3636), 0 states have call successors, (0), 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-11 01:47:44,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2507 states to 2507 states and 3636 transitions. [2022-01-11 01:47:44,760 INFO L78 Accepts]: Start accepts. Automaton has 2507 states and 3636 transitions. Word has length 143 [2022-01-11 01:47:44,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:44,760 INFO L470 AbstractCegarLoop]: Abstraction has 2507 states and 3636 transitions. [2022-01-11 01:47:44,760 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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-11 01:47:44,760 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 3636 transitions. [2022-01-11 01:47:44,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-01-11 01:47:44,761 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:44,761 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 01:47:44,761 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-11 01:47:44,762 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:47:44,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:44,762 INFO L85 PathProgramCache]: Analyzing trace with hash 632850194, now seen corresponding path program 1 times [2022-01-11 01:47:44,762 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:44,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238077949] [2022-01-11 01:47:44,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:44,762 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:44,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:44,798 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-11 01:47:44,798 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:44,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238077949] [2022-01-11 01:47:44,799 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238077949] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:44,799 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:44,799 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:44,799 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445288774] [2022-01-11 01:47:44,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:44,799 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:44,800 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:44,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:44,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:44,800 INFO L87 Difference]: Start difference. First operand 2507 states and 3636 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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-11 01:47:44,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:44,939 INFO L93 Difference]: Finished difference Result 4986 states and 7232 transitions. [2022-01-11 01:47:44,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:44,940 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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 143 [2022-01-11 01:47:44,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:44,945 INFO L225 Difference]: With dead ends: 4986 [2022-01-11 01:47:44,945 INFO L226 Difference]: Without dead ends: 2507 [2022-01-11 01:47:44,948 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-11 01:47:44,949 INFO L933 BasicCegarLoop]: 1970 mSDtfsCounter, 1948 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1948 SdHoareTripleChecker+Valid, 1970 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-11 01:47:44,949 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1948 Valid, 1970 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:44,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2507 states. [2022-01-11 01:47:45,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2507 to 2507. [2022-01-11 01:47:45,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2507 states, 2506 states have (on average 1.4477254588986432) internal successors, (3628), 2506 states have internal predecessors, (3628), 0 states have call successors, (0), 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-11 01:47:45,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2507 states to 2507 states and 3628 transitions. [2022-01-11 01:47:45,071 INFO L78 Accepts]: Start accepts. Automaton has 2507 states and 3628 transitions. Word has length 143 [2022-01-11 01:47:45,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:45,071 INFO L470 AbstractCegarLoop]: Abstraction has 2507 states and 3628 transitions. [2022-01-11 01:47:45,071 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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-11 01:47:45,071 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 3628 transitions. [2022-01-11 01:47:45,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-01-11 01:47:45,072 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:45,072 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 01:47:45,072 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-11 01:47:45,072 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:47:45,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:45,073 INFO L85 PathProgramCache]: Analyzing trace with hash -719341006, now seen corresponding path program 1 times [2022-01-11 01:47:45,073 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:45,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962518514] [2022-01-11 01:47:45,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:45,073 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:45,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:45,116 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-11 01:47:45,116 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:45,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962518514] [2022-01-11 01:47:45,116 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962518514] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:45,116 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:45,116 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:45,116 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10838387] [2022-01-11 01:47:45,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:45,117 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:45,117 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:45,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:45,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:45,118 INFO L87 Difference]: Start difference. First operand 2507 states and 3628 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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-11 01:47:45,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:45,261 INFO L93 Difference]: Finished difference Result 4985 states and 7215 transitions. [2022-01-11 01:47:45,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:45,262 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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 143 [2022-01-11 01:47:45,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:45,266 INFO L225 Difference]: With dead ends: 4985 [2022-01-11 01:47:45,266 INFO L226 Difference]: Without dead ends: 2507 [2022-01-11 01:47:45,269 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-11 01:47:45,275 INFO L933 BasicCegarLoop]: 1939 mSDtfsCounter, 1817 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1817 SdHoareTripleChecker+Valid, 2047 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:45,276 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1817 Valid, 2047 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:45,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2507 states. [2022-01-11 01:47:45,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2507 to 2507. [2022-01-11 01:47:45,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2507 states, 2506 states have (on average 1.4349561053471669) internal successors, (3596), 2506 states have internal predecessors, (3596), 0 states have call successors, (0), 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-11 01:47:45,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2507 states to 2507 states and 3596 transitions. [2022-01-11 01:47:45,374 INFO L78 Accepts]: Start accepts. Automaton has 2507 states and 3596 transitions. Word has length 143 [2022-01-11 01:47:45,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:45,374 INFO L470 AbstractCegarLoop]: Abstraction has 2507 states and 3596 transitions. [2022-01-11 01:47:45,374 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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-11 01:47:45,374 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 3596 transitions. [2022-01-11 01:47:45,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-01-11 01:47:45,375 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:45,375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 01:47:45,375 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-11 01:47:45,375 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:47:45,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:45,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1687706513, now seen corresponding path program 1 times [2022-01-11 01:47:45,376 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:45,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005546133] [2022-01-11 01:47:45,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:45,376 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:45,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:45,405 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-11 01:47:45,406 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:45,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005546133] [2022-01-11 01:47:45,406 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005546133] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:45,406 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:45,406 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:45,406 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137576566] [2022-01-11 01:47:45,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:45,406 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:45,407 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:45,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:45,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:45,407 INFO L87 Difference]: Start difference. First operand 2507 states and 3596 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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-11 01:47:45,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:45,549 INFO L93 Difference]: Finished difference Result 4984 states and 7150 transitions. [2022-01-11 01:47:45,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:45,549 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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 143 [2022-01-11 01:47:45,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:45,553 INFO L225 Difference]: With dead ends: 4984 [2022-01-11 01:47:45,553 INFO L226 Difference]: Without dead ends: 2507 [2022-01-11 01:47:45,557 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-11 01:47:45,558 INFO L933 BasicCegarLoop]: 1921 mSDtfsCounter, 1799 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1799 SdHoareTripleChecker+Valid, 2028 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:45,558 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1799 Valid, 2028 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:45,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2507 states. [2022-01-11 01:47:45,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2507 to 2507. [2022-01-11 01:47:45,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2507 states, 2506 states have (on average 1.4221867517956903) internal successors, (3564), 2506 states have internal predecessors, (3564), 0 states have call successors, (0), 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-11 01:47:45,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2507 states to 2507 states and 3564 transitions. [2022-01-11 01:47:45,657 INFO L78 Accepts]: Start accepts. Automaton has 2507 states and 3564 transitions. Word has length 143 [2022-01-11 01:47:45,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:45,657 INFO L470 AbstractCegarLoop]: Abstraction has 2507 states and 3564 transitions. [2022-01-11 01:47:45,657 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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-11 01:47:45,657 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 3564 transitions. [2022-01-11 01:47:45,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-01-11 01:47:45,658 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:45,658 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 01:47:45,658 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-11 01:47:45,658 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:47:45,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:45,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1792238992, now seen corresponding path program 1 times [2022-01-11 01:47:45,659 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:45,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327725033] [2022-01-11 01:47:45,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:45,659 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:45,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:45,691 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-11 01:47:45,691 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:45,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327725033] [2022-01-11 01:47:45,691 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327725033] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:45,691 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:45,691 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:45,692 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341032836] [2022-01-11 01:47:45,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:45,692 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:45,692 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:45,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:45,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:45,693 INFO L87 Difference]: Start difference. First operand 2507 states and 3564 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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-11 01:47:45,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:45,815 INFO L93 Difference]: Finished difference Result 4983 states and 7085 transitions. [2022-01-11 01:47:45,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:45,816 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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 143 [2022-01-11 01:47:45,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:45,820 INFO L225 Difference]: With dead ends: 4983 [2022-01-11 01:47:45,820 INFO L226 Difference]: Without dead ends: 2507 [2022-01-11 01:47:45,823 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-11 01:47:45,823 INFO L933 BasicCegarLoop]: 1903 mSDtfsCounter, 1781 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1781 SdHoareTripleChecker+Valid, 2009 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:45,824 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1781 Valid, 2009 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:45,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2507 states. [2022-01-11 01:47:45,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2507 to 2507. [2022-01-11 01:47:45,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2507 states, 2506 states have (on average 1.409417398244214) internal successors, (3532), 2506 states have internal predecessors, (3532), 0 states have call successors, (0), 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-11 01:47:45,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2507 states to 2507 states and 3532 transitions. [2022-01-11 01:47:45,980 INFO L78 Accepts]: Start accepts. Automaton has 2507 states and 3532 transitions. Word has length 143 [2022-01-11 01:47:45,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:45,980 INFO L470 AbstractCegarLoop]: Abstraction has 2507 states and 3532 transitions. [2022-01-11 01:47:45,980 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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-11 01:47:45,980 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 3532 transitions. [2022-01-11 01:47:45,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-01-11 01:47:45,981 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:45,981 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 01:47:45,981 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-11 01:47:45,981 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:47:45,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:45,982 INFO L85 PathProgramCache]: Analyzing trace with hash 2058582607, now seen corresponding path program 1 times [2022-01-11 01:47:45,982 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:45,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473615068] [2022-01-11 01:47:45,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:45,982 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:45,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:46,013 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-11 01:47:46,013 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:46,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473615068] [2022-01-11 01:47:46,014 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473615068] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:46,014 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:46,014 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:46,014 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906936121] [2022-01-11 01:47:46,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:46,014 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:46,014 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:46,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:46,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:46,015 INFO L87 Difference]: Start difference. First operand 2507 states and 3532 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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-11 01:47:46,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:46,156 INFO L93 Difference]: Finished difference Result 4982 states and 7020 transitions. [2022-01-11 01:47:46,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:46,156 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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 143 [2022-01-11 01:47:46,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:46,160 INFO L225 Difference]: With dead ends: 4982 [2022-01-11 01:47:46,160 INFO L226 Difference]: Without dead ends: 2507 [2022-01-11 01:47:46,163 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-11 01:47:46,163 INFO L933 BasicCegarLoop]: 1885 mSDtfsCounter, 1763 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1763 SdHoareTripleChecker+Valid, 1990 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:46,164 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1763 Valid, 1990 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:46,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2507 states. [2022-01-11 01:47:46,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2507 to 2507. [2022-01-11 01:47:46,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2507 states, 2506 states have (on average 1.3966480446927374) internal successors, (3500), 2506 states have internal predecessors, (3500), 0 states have call successors, (0), 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-11 01:47:46,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2507 states to 2507 states and 3500 transitions. [2022-01-11 01:47:46,264 INFO L78 Accepts]: Start accepts. Automaton has 2507 states and 3500 transitions. Word has length 143 [2022-01-11 01:47:46,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:46,265 INFO L470 AbstractCegarLoop]: Abstraction has 2507 states and 3500 transitions. [2022-01-11 01:47:46,265 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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-11 01:47:46,265 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 3500 transitions. [2022-01-11 01:47:46,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-01-11 01:47:46,265 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:46,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 01:47:46,266 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-01-11 01:47:46,266 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:47:46,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:46,266 INFO L85 PathProgramCache]: Analyzing trace with hash 450652078, now seen corresponding path program 1 times [2022-01-11 01:47:46,266 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:46,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351505609] [2022-01-11 01:47:46,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:46,266 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:46,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:46,294 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-11 01:47:46,294 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:46,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351505609] [2022-01-11 01:47:46,294 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351505609] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:46,294 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:46,294 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:46,295 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319925520] [2022-01-11 01:47:46,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:46,295 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:46,295 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:46,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:46,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:46,295 INFO L87 Difference]: Start difference. First operand 2507 states and 3500 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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-11 01:47:46,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:46,435 INFO L93 Difference]: Finished difference Result 4981 states and 6955 transitions. [2022-01-11 01:47:46,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:46,435 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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 143 [2022-01-11 01:47:46,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:46,439 INFO L225 Difference]: With dead ends: 4981 [2022-01-11 01:47:46,439 INFO L226 Difference]: Without dead ends: 2507 [2022-01-11 01:47:46,441 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-11 01:47:46,441 INFO L933 BasicCegarLoop]: 1867 mSDtfsCounter, 1745 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1745 SdHoareTripleChecker+Valid, 1971 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:46,442 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1745 Valid, 1971 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:46,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2507 states. [2022-01-11 01:47:46,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2507 to 2507. [2022-01-11 01:47:46,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2507 states, 2506 states have (on average 1.383878691141261) internal successors, (3468), 2506 states have internal predecessors, (3468), 0 states have call successors, (0), 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-11 01:47:46,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2507 states to 2507 states and 3468 transitions. [2022-01-11 01:47:46,549 INFO L78 Accepts]: Start accepts. Automaton has 2507 states and 3468 transitions. Word has length 143 [2022-01-11 01:47:46,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:46,550 INFO L470 AbstractCegarLoop]: Abstraction has 2507 states and 3468 transitions. [2022-01-11 01:47:46,550 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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-11 01:47:46,550 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 3468 transitions. [2022-01-11 01:47:46,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-01-11 01:47:46,550 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:46,550 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 01:47:46,550 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-01-11 01:47:46,551 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:47:46,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:46,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1451932147, now seen corresponding path program 1 times [2022-01-11 01:47:46,551 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:46,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508770296] [2022-01-11 01:47:46,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:46,551 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:46,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:46,587 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-11 01:47:46,588 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:46,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508770296] [2022-01-11 01:47:46,588 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508770296] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:46,588 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:46,588 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:46,588 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450587828] [2022-01-11 01:47:46,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:46,588 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:46,588 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:46,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:46,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:46,589 INFO L87 Difference]: Start difference. First operand 2507 states and 3468 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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-11 01:47:46,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:46,729 INFO L93 Difference]: Finished difference Result 4980 states and 6890 transitions. [2022-01-11 01:47:46,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:46,729 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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 143 [2022-01-11 01:47:46,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:46,734 INFO L225 Difference]: With dead ends: 4980 [2022-01-11 01:47:46,734 INFO L226 Difference]: Without dead ends: 2507 [2022-01-11 01:47:46,737 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-11 01:47:46,738 INFO L933 BasicCegarLoop]: 1849 mSDtfsCounter, 1727 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1727 SdHoareTripleChecker+Valid, 1952 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:46,738 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1727 Valid, 1952 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:46,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2507 states. [2022-01-11 01:47:46,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2507 to 2507. [2022-01-11 01:47:46,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2507 states, 2506 states have (on average 1.3711093375897845) internal successors, (3436), 2506 states have internal predecessors, (3436), 0 states have call successors, (0), 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-11 01:47:46,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2507 states to 2507 states and 3436 transitions. [2022-01-11 01:47:46,897 INFO L78 Accepts]: Start accepts. Automaton has 2507 states and 3436 transitions. Word has length 143 [2022-01-11 01:47:46,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:46,897 INFO L470 AbstractCegarLoop]: Abstraction has 2507 states and 3436 transitions. [2022-01-11 01:47:46,897 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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-11 01:47:46,897 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 3436 transitions. [2022-01-11 01:47:46,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-01-11 01:47:46,898 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:46,898 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 01:47:46,898 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-01-11 01:47:46,898 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:47:46,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:46,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1037393428, now seen corresponding path program 1 times [2022-01-11 01:47:46,899 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:46,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35821887] [2022-01-11 01:47:46,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:46,899 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:46,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:46,940 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-11 01:47:46,940 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:46,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35821887] [2022-01-11 01:47:46,940 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35821887] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:46,940 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:46,941 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:46,941 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385359204] [2022-01-11 01:47:46,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:46,941 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:46,941 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:46,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:46,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:46,941 INFO L87 Difference]: Start difference. First operand 2507 states and 3436 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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-11 01:47:47,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:47,074 INFO L93 Difference]: Finished difference Result 4978 states and 6823 transitions. [2022-01-11 01:47:47,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:47,074 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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 143 [2022-01-11 01:47:47,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:47,078 INFO L225 Difference]: With dead ends: 4978 [2022-01-11 01:47:47,078 INFO L226 Difference]: Without dead ends: 2507 [2022-01-11 01:47:47,081 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-11 01:47:47,082 INFO L933 BasicCegarLoop]: 1831 mSDtfsCounter, 1708 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1708 SdHoareTripleChecker+Valid, 1933 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:47,082 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1708 Valid, 1933 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:47,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2507 states. [2022-01-11 01:47:47,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2507 to 2507. [2022-01-11 01:47:47,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2507 states, 2506 states have (on average 1.3583399840383081) internal successors, (3404), 2506 states have internal predecessors, (3404), 0 states have call successors, (0), 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-11 01:47:47,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2507 states to 2507 states and 3404 transitions. [2022-01-11 01:47:47,196 INFO L78 Accepts]: Start accepts. Automaton has 2507 states and 3404 transitions. Word has length 143 [2022-01-11 01:47:47,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:47,197 INFO L470 AbstractCegarLoop]: Abstraction has 2507 states and 3404 transitions. [2022-01-11 01:47:47,197 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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-11 01:47:47,197 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 3404 transitions. [2022-01-11 01:47:47,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-01-11 01:47:47,198 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:47,198 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 01:47:47,198 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-01-11 01:47:47,198 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:47:47,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:47,198 INFO L85 PathProgramCache]: Analyzing trace with hash 461646923, now seen corresponding path program 1 times [2022-01-11 01:47:47,199 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:47,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677264734] [2022-01-11 01:47:47,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:47,199 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:47,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:47,229 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-11 01:47:47,230 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:47,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677264734] [2022-01-11 01:47:47,230 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677264734] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:47,230 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:47,230 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:47,230 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612640748] [2022-01-11 01:47:47,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:47,231 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:47,231 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:47,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:47,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:47,231 INFO L87 Difference]: Start difference. First operand 2507 states and 3404 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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-11 01:47:47,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:47,365 INFO L93 Difference]: Finished difference Result 4977 states and 6758 transitions. [2022-01-11 01:47:47,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:47,388 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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 143 [2022-01-11 01:47:47,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:47,392 INFO L225 Difference]: With dead ends: 4977 [2022-01-11 01:47:47,392 INFO L226 Difference]: Without dead ends: 2507 [2022-01-11 01:47:47,394 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-11 01:47:47,394 INFO L933 BasicCegarLoop]: 1813 mSDtfsCounter, 1690 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1690 SdHoareTripleChecker+Valid, 1914 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:47,395 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1690 Valid, 1914 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:47,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2507 states. [2022-01-11 01:47:47,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2507 to 2507. [2022-01-11 01:47:47,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2507 states, 2506 states have (on average 1.3455706304868316) internal successors, (3372), 2506 states have internal predecessors, (3372), 0 states have call successors, (0), 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-11 01:47:47,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2507 states to 2507 states and 3372 transitions. [2022-01-11 01:47:47,507 INFO L78 Accepts]: Start accepts. Automaton has 2507 states and 3372 transitions. Word has length 143 [2022-01-11 01:47:47,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:47,507 INFO L470 AbstractCegarLoop]: Abstraction has 2507 states and 3372 transitions. [2022-01-11 01:47:47,507 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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-11 01:47:47,507 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 3372 transitions. [2022-01-11 01:47:47,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-01-11 01:47:47,507 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:47,508 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 01:47:47,508 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-01-11 01:47:47,508 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:47:47,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:47,508 INFO L85 PathProgramCache]: Analyzing trace with hash 2110539690, now seen corresponding path program 1 times [2022-01-11 01:47:47,509 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:47,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999120475] [2022-01-11 01:47:47,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:47,509 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:47,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:47,542 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-11 01:47:47,542 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:47,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999120475] [2022-01-11 01:47:47,542 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999120475] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:47,542 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:47,542 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:47,542 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555424633] [2022-01-11 01:47:47,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:47,543 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:47,543 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:47,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:47,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:47,543 INFO L87 Difference]: Start difference. First operand 2507 states and 3372 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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-11 01:47:47,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:47,698 INFO L93 Difference]: Finished difference Result 4976 states and 6693 transitions. [2022-01-11 01:47:47,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:47,698 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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 143 [2022-01-11 01:47:47,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:47,703 INFO L225 Difference]: With dead ends: 4976 [2022-01-11 01:47:47,703 INFO L226 Difference]: Without dead ends: 2507 [2022-01-11 01:47:47,707 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-11 01:47:47,708 INFO L933 BasicCegarLoop]: 1795 mSDtfsCounter, 1672 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1672 SdHoareTripleChecker+Valid, 1895 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:47,708 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1672 Valid, 1895 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:47,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2507 states. [2022-01-11 01:47:47,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2507 to 2507. [2022-01-11 01:47:47,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2507 states, 2506 states have (on average 1.3328012769353552) internal successors, (3340), 2506 states have internal predecessors, (3340), 0 states have call successors, (0), 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-11 01:47:47,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2507 states to 2507 states and 3340 transitions. [2022-01-11 01:47:47,832 INFO L78 Accepts]: Start accepts. Automaton has 2507 states and 3340 transitions. Word has length 143 [2022-01-11 01:47:47,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:47,832 INFO L470 AbstractCegarLoop]: Abstraction has 2507 states and 3340 transitions. [2022-01-11 01:47:47,833 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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-11 01:47:47,833 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 3340 transitions. [2022-01-11 01:47:47,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-01-11 01:47:47,833 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:47,833 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 01:47:47,833 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-01-11 01:47:47,833 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:47:47,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:47,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1358839671, now seen corresponding path program 1 times [2022-01-11 01:47:47,834 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:47,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277923082] [2022-01-11 01:47:47,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:47,834 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:47,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:47,904 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-11 01:47:47,905 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:47,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277923082] [2022-01-11 01:47:47,905 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277923082] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:47,905 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:47,905 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 01:47:47,905 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220436993] [2022-01-11 01:47:47,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:47,905 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 01:47:47,906 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:47,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 01:47:47,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 01:47:47,906 INFO L87 Difference]: Start difference. First operand 2507 states and 3340 transitions. Second operand has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 0 states have call successors, (0), 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-11 01:47:48,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:48,277 INFO L93 Difference]: Finished difference Result 5778 states and 7755 transitions. [2022-01-11 01:47:48,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 01:47:48,278 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 0 states have call successors, (0), 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 143 [2022-01-11 01:47:48,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:48,284 INFO L225 Difference]: With dead ends: 5778 [2022-01-11 01:47:48,284 INFO L226 Difference]: Without dead ends: 3317 [2022-01-11 01:47:48,287 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-11 01:47:48,287 INFO L933 BasicCegarLoop]: 1949 mSDtfsCounter, 5162 mSDsluCounter, 1673 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5162 SdHoareTripleChecker+Valid, 3622 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:48,287 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5162 Valid, 3622 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 01:47:48,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3317 states. [2022-01-11 01:47:48,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3317 to 2513. [2022-01-11 01:47:48,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2513 states, 2512 states have (on average 1.322452229299363) internal successors, (3322), 2512 states have internal predecessors, (3322), 0 states have call successors, (0), 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-11 01:47:48,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2513 states to 2513 states and 3322 transitions. [2022-01-11 01:47:48,444 INFO L78 Accepts]: Start accepts. Automaton has 2513 states and 3322 transitions. Word has length 143 [2022-01-11 01:47:48,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:48,444 INFO L470 AbstractCegarLoop]: Abstraction has 2513 states and 3322 transitions. [2022-01-11 01:47:48,444 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 0 states have call successors, (0), 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-11 01:47:48,444 INFO L276 IsEmpty]: Start isEmpty. Operand 2513 states and 3322 transitions. [2022-01-11 01:47:48,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-01-11 01:47:48,445 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:48,445 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 01:47:48,445 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-01-11 01:47:48,445 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:47:48,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:48,445 INFO L85 PathProgramCache]: Analyzing trace with hash -843319222, now seen corresponding path program 1 times [2022-01-11 01:47:48,446 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:48,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502573555] [2022-01-11 01:47:48,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:48,446 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:48,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:48,485 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-11 01:47:48,485 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:48,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502573555] [2022-01-11 01:47:48,485 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502573555] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:48,485 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:48,485 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 01:47:48,485 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703109164] [2022-01-11 01:47:48,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:48,486 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 01:47:48,486 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:48,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 01:47:48,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 01:47:48,486 INFO L87 Difference]: Start difference. First operand 2513 states and 3322 transitions. Second operand has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 0 states have call successors, (0), 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-11 01:47:48,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:48,830 INFO L93 Difference]: Finished difference Result 6062 states and 8050 transitions. [2022-01-11 01:47:48,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 01:47:48,831 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 0 states have call successors, (0), 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 143 [2022-01-11 01:47:48,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:48,836 INFO L225 Difference]: With dead ends: 6062 [2022-01-11 01:47:48,836 INFO L226 Difference]: Without dead ends: 3609 [2022-01-11 01:47:48,838 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-11 01:47:48,839 INFO L933 BasicCegarLoop]: 1900 mSDtfsCounter, 4848 mSDsluCounter, 2296 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4848 SdHoareTripleChecker+Valid, 4196 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:48,839 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4848 Valid, 4196 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 01:47:48,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3609 states. [2022-01-11 01:47:48,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3609 to 2519. [2022-01-11 01:47:48,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2519 states, 2518 states have (on average 1.312152501985703) internal successors, (3304), 2518 states have internal predecessors, (3304), 0 states have call successors, (0), 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-11 01:47:48,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2519 states to 2519 states and 3304 transitions. [2022-01-11 01:47:48,991 INFO L78 Accepts]: Start accepts. Automaton has 2519 states and 3304 transitions. Word has length 143 [2022-01-11 01:47:48,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:48,991 INFO L470 AbstractCegarLoop]: Abstraction has 2519 states and 3304 transitions. [2022-01-11 01:47:48,991 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 0 states have call successors, (0), 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-11 01:47:48,992 INFO L276 IsEmpty]: Start isEmpty. Operand 2519 states and 3304 transitions. [2022-01-11 01:47:48,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-01-11 01:47:48,992 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:48,992 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 01:47:48,992 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-01-11 01:47:48,992 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:47:48,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:48,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1011026315, now seen corresponding path program 1 times [2022-01-11 01:47:48,993 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:48,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358096590] [2022-01-11 01:47:48,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:48,993 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:49,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:49,040 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-11 01:47:49,040 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:49,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358096590] [2022-01-11 01:47:49,040 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358096590] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:49,040 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:49,040 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 01:47:49,040 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623189273] [2022-01-11 01:47:49,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:49,041 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 01:47:49,041 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:49,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 01:47:49,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 01:47:49,041 INFO L87 Difference]: Start difference. First operand 2519 states and 3304 transitions. Second operand has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 0 states have call successors, (0), 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-11 01:47:49,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:49,381 INFO L93 Difference]: Finished difference Result 6213 states and 8172 transitions. [2022-01-11 01:47:49,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 01:47:49,382 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 0 states have call successors, (0), 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 143 [2022-01-11 01:47:49,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:49,387 INFO L225 Difference]: With dead ends: 6213 [2022-01-11 01:47:49,387 INFO L226 Difference]: Without dead ends: 3761 [2022-01-11 01:47:49,393 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-11 01:47:49,393 INFO L933 BasicCegarLoop]: 1869 mSDtfsCounter, 4679 mSDsluCounter, 2577 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4679 SdHoareTripleChecker+Valid, 4446 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:49,393 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4679 Valid, 4446 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 01:47:49,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3761 states. [2022-01-11 01:47:49,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3761 to 2525. [2022-01-11 01:47:49,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2525 states, 2524 states have (on average 1.3019017432646594) internal successors, (3286), 2524 states have internal predecessors, (3286), 0 states have call successors, (0), 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-11 01:47:49,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2525 states to 2525 states and 3286 transitions. [2022-01-11 01:47:49,589 INFO L78 Accepts]: Start accepts. Automaton has 2525 states and 3286 transitions. Word has length 143 [2022-01-11 01:47:49,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:49,589 INFO L470 AbstractCegarLoop]: Abstraction has 2525 states and 3286 transitions. [2022-01-11 01:47:49,589 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 0 states have call successors, (0), 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-11 01:47:49,590 INFO L276 IsEmpty]: Start isEmpty. Operand 2525 states and 3286 transitions. [2022-01-11 01:47:49,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-01-11 01:47:49,590 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:49,590 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 01:47:49,590 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-01-11 01:47:49,590 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:47:49,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:49,591 INFO L85 PathProgramCache]: Analyzing trace with hash 482107276, now seen corresponding path program 1 times [2022-01-11 01:47:49,591 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:49,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063410732] [2022-01-11 01:47:49,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:49,591 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:49,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:49,624 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-11 01:47:49,624 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:49,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063410732] [2022-01-11 01:47:49,624 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063410732] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:49,624 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:49,624 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:49,625 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600947646] [2022-01-11 01:47:49,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:49,625 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:49,625 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:49,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:49,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:49,625 INFO L87 Difference]: Start difference. First operand 2525 states and 3286 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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-11 01:47:49,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:49,970 INFO L93 Difference]: Finished difference Result 7166 states and 9320 transitions. [2022-01-11 01:47:49,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:49,970 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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 143 [2022-01-11 01:47:49,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:49,978 INFO L225 Difference]: With dead ends: 7166 [2022-01-11 01:47:49,978 INFO L226 Difference]: Without dead ends: 4724 [2022-01-11 01:47:49,982 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-11 01:47:49,982 INFO L933 BasicCegarLoop]: 1757 mSDtfsCounter, 1553 mSDsluCounter, 1567 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1553 SdHoareTripleChecker+Valid, 3324 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:49,982 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1553 Valid, 3324 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:49,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4724 states. [2022-01-11 01:47:50,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4724 to 4718. [2022-01-11 01:47:50,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4718 states, 4717 states have (on average 1.2951028195887218) internal successors, (6109), 4717 states have internal predecessors, (6109), 0 states have call successors, (0), 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-11 01:47:50,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4718 states to 4718 states and 6109 transitions. [2022-01-11 01:47:50,329 INFO L78 Accepts]: Start accepts. Automaton has 4718 states and 6109 transitions. Word has length 143 [2022-01-11 01:47:50,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:50,329 INFO L470 AbstractCegarLoop]: Abstraction has 4718 states and 6109 transitions. [2022-01-11 01:47:50,329 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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-11 01:47:50,330 INFO L276 IsEmpty]: Start isEmpty. Operand 4718 states and 6109 transitions. [2022-01-11 01:47:50,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-01-11 01:47:50,330 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:50,330 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 01:47:50,330 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-01-11 01:47:50,330 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:47:50,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:50,331 INFO L85 PathProgramCache]: Analyzing trace with hash -857937013, now seen corresponding path program 1 times [2022-01-11 01:47:50,331 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:50,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924489598] [2022-01-11 01:47:50,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:50,331 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:50,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:50,379 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-11 01:47:50,379 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:50,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924489598] [2022-01-11 01:47:50,379 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924489598] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:50,380 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:50,380 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:50,380 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711705373] [2022-01-11 01:47:50,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:50,380 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:50,380 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:50,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:50,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:50,381 INFO L87 Difference]: Start difference. First operand 4718 states and 6109 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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-11 01:47:51,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:51,118 INFO L93 Difference]: Finished difference Result 13526 states and 17498 transitions. [2022-01-11 01:47:51,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:51,119 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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 143 [2022-01-11 01:47:51,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:51,129 INFO L225 Difference]: With dead ends: 13526 [2022-01-11 01:47:51,129 INFO L226 Difference]: Without dead ends: 8918 [2022-01-11 01:47:51,135 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-11 01:47:51,136 INFO L933 BasicCegarLoop]: 1754 mSDtfsCounter, 1525 mSDsluCounter, 1567 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1525 SdHoareTripleChecker+Valid, 3321 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:51,136 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1525 Valid, 3321 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:51,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8918 states. [2022-01-11 01:47:51,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8918 to 8908. [2022-01-11 01:47:51,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8908 states, 8907 states have (on average 1.2878634781632423) internal successors, (11471), 8907 states have internal predecessors, (11471), 0 states have call successors, (0), 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-11 01:47:51,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8908 states to 8908 states and 11471 transitions. [2022-01-11 01:47:51,806 INFO L78 Accepts]: Start accepts. Automaton has 8908 states and 11471 transitions. Word has length 143 [2022-01-11 01:47:51,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:51,807 INFO L470 AbstractCegarLoop]: Abstraction has 8908 states and 11471 transitions. [2022-01-11 01:47:51,807 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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-11 01:47:51,807 INFO L276 IsEmpty]: Start isEmpty. Operand 8908 states and 11471 transitions. [2022-01-11 01:47:51,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-01-11 01:47:51,809 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:51,809 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 01:47:51,809 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-01-11 01:47:51,809 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:47:51,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:51,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1058487158, now seen corresponding path program 1 times [2022-01-11 01:47:51,810 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:51,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521845295] [2022-01-11 01:47:51,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:51,810 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:51,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:51,872 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-11 01:47:51,872 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:51,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521845295] [2022-01-11 01:47:51,872 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521845295] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:51,872 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:51,872 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:51,872 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730170693] [2022-01-11 01:47:51,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:51,873 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:51,874 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:51,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:51,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:51,874 INFO L87 Difference]: Start difference. First operand 8908 states and 11471 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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-11 01:47:52,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:52,542 INFO L93 Difference]: Finished difference Result 17781 states and 22895 transitions. [2022-01-11 01:47:52,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:52,542 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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 143 [2022-01-11 01:47:52,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:52,553 INFO L225 Difference]: With dead ends: 17781 [2022-01-11 01:47:52,553 INFO L226 Difference]: Without dead ends: 8908 [2022-01-11 01:47:52,560 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-11 01:47:52,562 INFO L933 BasicCegarLoop]: 1734 mSDtfsCounter, 1528 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1528 SdHoareTripleChecker+Valid, 1830 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:52,562 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1528 Valid, 1830 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:52,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8908 states. [2022-01-11 01:47:53,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8908 to 8908. [2022-01-11 01:47:53,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8908 states, 8907 states have (on average 1.2800044908498933) internal successors, (11401), 8907 states have internal predecessors, (11401), 0 states have call successors, (0), 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-11 01:47:53,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8908 states to 8908 states and 11401 transitions. [2022-01-11 01:47:53,220 INFO L78 Accepts]: Start accepts. Automaton has 8908 states and 11401 transitions. Word has length 143 [2022-01-11 01:47:53,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:53,220 INFO L470 AbstractCegarLoop]: Abstraction has 8908 states and 11401 transitions. [2022-01-11 01:47:53,220 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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-11 01:47:53,220 INFO L276 IsEmpty]: Start isEmpty. Operand 8908 states and 11401 transitions. [2022-01-11 01:47:53,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-01-11 01:47:53,221 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:53,221 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 01:47:53,221 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-01-11 01:47:53,221 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:47:53,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:53,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1467311383, now seen corresponding path program 1 times [2022-01-11 01:47:53,222 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:53,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106470353] [2022-01-11 01:47:53,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:53,222 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:53,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:53,262 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-11 01:47:53,262 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:53,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106470353] [2022-01-11 01:47:53,262 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106470353] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:53,262 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:53,262 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:53,262 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197250067] [2022-01-11 01:47:53,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:53,263 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:53,263 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:53,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:53,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:53,263 INFO L87 Difference]: Start difference. First operand 8908 states and 11401 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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-11 01:47:54,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:54,076 INFO L93 Difference]: Finished difference Result 17777 states and 22751 transitions. [2022-01-11 01:47:54,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:54,078 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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 143 [2022-01-11 01:47:54,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:54,088 INFO L225 Difference]: With dead ends: 17777 [2022-01-11 01:47:54,089 INFO L226 Difference]: Without dead ends: 8908 [2022-01-11 01:47:54,096 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-11 01:47:54,097 INFO L933 BasicCegarLoop]: 1717 mSDtfsCounter, 1508 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1508 SdHoareTripleChecker+Valid, 1812 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:54,097 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1508 Valid, 1812 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:54,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8908 states. [2022-01-11 01:47:54,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8908 to 8908. [2022-01-11 01:47:54,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8908 states, 8907 states have (on average 1.2721455035365443) internal successors, (11331), 8907 states have internal predecessors, (11331), 0 states have call successors, (0), 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-11 01:47:54,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8908 states to 8908 states and 11331 transitions. [2022-01-11 01:47:54,764 INFO L78 Accepts]: Start accepts. Automaton has 8908 states and 11331 transitions. Word has length 143 [2022-01-11 01:47:54,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:54,764 INFO L470 AbstractCegarLoop]: Abstraction has 8908 states and 11331 transitions. [2022-01-11 01:47:54,764 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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-11 01:47:54,764 INFO L276 IsEmpty]: Start isEmpty. Operand 8908 states and 11331 transitions. [2022-01-11 01:47:54,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-01-11 01:47:54,765 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:54,765 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 01:47:54,765 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-01-11 01:47:54,765 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:47:54,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:54,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1977845560, now seen corresponding path program 1 times [2022-01-11 01:47:54,766 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:54,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264536925] [2022-01-11 01:47:54,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:54,766 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:54,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:54,804 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-11 01:47:54,804 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:54,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264536925] [2022-01-11 01:47:54,804 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264536925] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:54,804 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:54,804 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:54,804 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505967138] [2022-01-11 01:47:54,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:54,805 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:54,805 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:54,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:54,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:54,805 INFO L87 Difference]: Start difference. First operand 8908 states and 11331 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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-11 01:47:56,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:56,089 INFO L93 Difference]: Finished difference Result 26414 states and 33620 transitions. [2022-01-11 01:47:56,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:56,095 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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 143 [2022-01-11 01:47:56,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:56,118 INFO L225 Difference]: With dead ends: 26414 [2022-01-11 01:47:56,118 INFO L226 Difference]: Without dead ends: 17547 [2022-01-11 01:47:56,129 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-11 01:47:56,129 INFO L933 BasicCegarLoop]: 1717 mSDtfsCounter, 1557 mSDsluCounter, 1537 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1557 SdHoareTripleChecker+Valid, 3254 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:56,129 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1557 Valid, 3254 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:56,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17547 states. [2022-01-11 01:47:57,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17547 to 16947. [2022-01-11 01:47:57,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16947 states, 16946 states have (on average 1.2685589519650655) internal successors, (21497), 16946 states have internal predecessors, (21497), 0 states have call successors, (0), 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-11 01:47:57,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16947 states to 16947 states and 21497 transitions. [2022-01-11 01:47:57,563 INFO L78 Accepts]: Start accepts. Automaton has 16947 states and 21497 transitions. Word has length 143 [2022-01-11 01:47:57,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:57,564 INFO L470 AbstractCegarLoop]: Abstraction has 16947 states and 21497 transitions. [2022-01-11 01:47:57,564 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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-11 01:47:57,564 INFO L276 IsEmpty]: Start isEmpty. Operand 16947 states and 21497 transitions. [2022-01-11 01:47:57,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2022-01-11 01:47:57,571 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:57,572 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 01:47:57,572 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-01-11 01:47:57,572 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:47:57,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:57,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1821602912, now seen corresponding path program 1 times [2022-01-11 01:47:57,572 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:57,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870065103] [2022-01-11 01:47:57,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:57,573 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:57,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:57,623 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-11 01:47:57,623 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:57,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870065103] [2022-01-11 01:47:57,623 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870065103] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:57,623 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:57,624 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:47:57,624 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769927173] [2022-01-11 01:47:57,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:57,624 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:57,624 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:57,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:57,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:57,625 INFO L87 Difference]: Start difference. First operand 16947 states and 21497 transitions. Second operand has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 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-11 01:48:00,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:00,315 INFO L93 Difference]: Finished difference Result 50328 states and 63907 transitions. [2022-01-11 01:48:00,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:48:00,316 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 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 232 [2022-01-11 01:48:00,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:00,361 INFO L225 Difference]: With dead ends: 50328 [2022-01-11 01:48:00,361 INFO L226 Difference]: Without dead ends: 33428 [2022-01-11 01:48:00,378 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-11 01:48:00,378 INFO L933 BasicCegarLoop]: 1714 mSDtfsCounter, 1587 mSDsluCounter, 1537 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1587 SdHoareTripleChecker+Valid, 3251 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:48:00,379 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1587 Valid, 3251 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:48:00,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33428 states. [2022-01-11 01:48:03,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33428 to 32258. [2022-01-11 01:48:03,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32258 states, 32257 states have (on average 1.2659267755835943) internal successors, (40835), 32257 states have internal predecessors, (40835), 0 states have call successors, (0), 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-11 01:48:03,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32258 states to 32258 states and 40835 transitions. [2022-01-11 01:48:03,244 INFO L78 Accepts]: Start accepts. Automaton has 32258 states and 40835 transitions. Word has length 232 [2022-01-11 01:48:03,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:03,244 INFO L470 AbstractCegarLoop]: Abstraction has 32258 states and 40835 transitions. [2022-01-11 01:48:03,244 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 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-11 01:48:03,244 INFO L276 IsEmpty]: Start isEmpty. Operand 32258 states and 40835 transitions. [2022-01-11 01:48:03,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2022-01-11 01:48:03,321 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:03,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 01:48:03,321 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-01-11 01:48:03,322 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:48:03,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:03,322 INFO L85 PathProgramCache]: Analyzing trace with hash 711171457, now seen corresponding path program 1 times [2022-01-11 01:48:03,322 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:03,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104553756] [2022-01-11 01:48:03,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:03,322 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:03,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:03,380 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-11 01:48:03,380 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:03,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104553756] [2022-01-11 01:48:03,381 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104553756] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:03,381 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:03,381 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 01:48:03,381 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542068985] [2022-01-11 01:48:03,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:03,381 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 01:48:03,381 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:03,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 01:48:03,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 01:48:03,382 INFO L87 Difference]: Start difference. First operand 32258 states and 40835 transitions. Second operand has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 0 states have call successors, (0), 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-11 01:48:08,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:08,140 INFO L93 Difference]: Finished difference Result 90837 states and 115566 transitions. [2022-01-11 01:48:08,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 01:48:08,140 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 0 states have call successors, (0), 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 232 [2022-01-11 01:48:08,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:08,221 INFO L225 Difference]: With dead ends: 90837 [2022-01-11 01:48:08,221 INFO L226 Difference]: Without dead ends: 58678 [2022-01-11 01:48:08,255 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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-11 01:48:08,256 INFO L933 BasicCegarLoop]: 1718 mSDtfsCounter, 3820 mSDsluCounter, 4086 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3820 SdHoareTripleChecker+Valid, 5804 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 01:48:08,256 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3820 Valid, 5804 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 01:48:08,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58678 states. [2022-01-11 01:48:11,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58678 to 32354. [2022-01-11 01:48:11,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32354 states, 32353 states have (on average 1.2557104441628288) internal successors, (40626), 32353 states have internal predecessors, (40626), 0 states have call successors, (0), 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-11 01:48:11,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32354 states to 32354 states and 40626 transitions. [2022-01-11 01:48:11,516 INFO L78 Accepts]: Start accepts. Automaton has 32354 states and 40626 transitions. Word has length 232 [2022-01-11 01:48:11,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:11,516 INFO L470 AbstractCegarLoop]: Abstraction has 32354 states and 40626 transitions. [2022-01-11 01:48:11,516 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 0 states have call successors, (0), 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-11 01:48:11,517 INFO L276 IsEmpty]: Start isEmpty. Operand 32354 states and 40626 transitions. [2022-01-11 01:48:11,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2022-01-11 01:48:11,528 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:11,529 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 01:48:11,529 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-01-11 01:48:11,529 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:48:11,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:11,529 INFO L85 PathProgramCache]: Analyzing trace with hash 401796991, now seen corresponding path program 1 times [2022-01-11 01:48:11,529 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:11,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793784109] [2022-01-11 01:48:11,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:11,530 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:11,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:11,573 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-11 01:48:11,573 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:11,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793784109] [2022-01-11 01:48:11,574 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793784109] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:11,574 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:11,574 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:48:11,574 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946424734] [2022-01-11 01:48:11,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:11,574 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:48:11,574 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:11,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:48:11,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:11,575 INFO L87 Difference]: Start difference. First operand 32354 states and 40626 transitions. Second operand has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 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-11 01:48:17,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:17,037 INFO L93 Difference]: Finished difference Result 95727 states and 119532 transitions. [2022-01-11 01:48:17,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:48:17,038 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 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 232 [2022-01-11 01:48:17,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:17,128 INFO L225 Difference]: With dead ends: 95727 [2022-01-11 01:48:17,129 INFO L226 Difference]: Without dead ends: 63509 [2022-01-11 01:48:17,158 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-11 01:48:17,167 INFO L933 BasicCegarLoop]: 1984 mSDtfsCounter, 1562 mSDsluCounter, 1683 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1562 SdHoareTripleChecker+Valid, 3667 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:48:17,168 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1562 Valid, 3667 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:48:17,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63509 states. [2022-01-11 01:48:22,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63509 to 62403. [2022-01-11 01:48:22,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62403 states, 62402 states have (on average 1.2431973334188007) internal successors, (77578), 62402 states have internal predecessors, (77578), 0 states have call successors, (0), 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-11 01:48:22,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62403 states to 62403 states and 77578 transitions. [2022-01-11 01:48:22,988 INFO L78 Accepts]: Start accepts. Automaton has 62403 states and 77578 transitions. Word has length 232 [2022-01-11 01:48:22,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:22,989 INFO L470 AbstractCegarLoop]: Abstraction has 62403 states and 77578 transitions. [2022-01-11 01:48:22,989 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 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-11 01:48:22,989 INFO L276 IsEmpty]: Start isEmpty. Operand 62403 states and 77578 transitions. [2022-01-11 01:48:23,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2022-01-11 01:48:23,010 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:23,010 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 01:48:23,010 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-01-11 01:48:23,010 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:48:23,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:23,011 INFO L85 PathProgramCache]: Analyzing trace with hash -397983716, now seen corresponding path program 1 times [2022-01-11 01:48:23,011 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:23,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344645095] [2022-01-11 01:48:23,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:23,011 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:23,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:23,042 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-11 01:48:23,042 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:23,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344645095] [2022-01-11 01:48:23,042 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344645095] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:23,042 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:23,042 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:48:23,042 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148296288] [2022-01-11 01:48:23,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:23,043 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:48:23,043 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:23,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:48:23,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:23,044 INFO L87 Difference]: Start difference. First operand 62403 states and 77578 transitions. Second operand has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 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-11 01:48:28,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:28,945 INFO L93 Difference]: Finished difference Result 124626 states and 154941 transitions. [2022-01-11 01:48:28,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:48:28,946 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 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 232 [2022-01-11 01:48:28,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:29,060 INFO L225 Difference]: With dead ends: 124626 [2022-01-11 01:48:29,060 INFO L226 Difference]: Without dead ends: 62274 [2022-01-11 01:48:29,115 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-11 01:48:29,115 INFO L933 BasicCegarLoop]: 1715 mSDtfsCounter, 1710 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1710 SdHoareTripleChecker+Valid, 1716 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-11 01:48:29,115 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1710 Valid, 1716 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:48:29,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62274 states. [2022-01-11 01:48:34,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62274 to 62274. [2022-01-11 01:48:34,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62274 states, 62273 states have (on average 1.2433157227048641) internal successors, (77425), 62273 states have internal predecessors, (77425), 0 states have call successors, (0), 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-11 01:48:35,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62274 states to 62274 states and 77425 transitions. [2022-01-11 01:48:35,076 INFO L78 Accepts]: Start accepts. Automaton has 62274 states and 77425 transitions. Word has length 232 [2022-01-11 01:48:35,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:35,076 INFO L470 AbstractCegarLoop]: Abstraction has 62274 states and 77425 transitions. [2022-01-11 01:48:35,076 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 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-11 01:48:35,077 INFO L276 IsEmpty]: Start isEmpty. Operand 62274 states and 77425 transitions. [2022-01-11 01:48:35,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2022-01-11 01:48:35,098 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:35,099 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 01:48:35,099 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-01-11 01:48:35,099 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:48:35,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:35,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1546735398, now seen corresponding path program 1 times [2022-01-11 01:48:35,099 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:35,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210449612] [2022-01-11 01:48:35,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:35,100 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:35,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:35,158 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-11 01:48:35,158 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:35,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210449612] [2022-01-11 01:48:35,158 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210449612] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:35,158 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:35,158 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:48:35,159 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9620957] [2022-01-11 01:48:35,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:35,159 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:48:35,159 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:35,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:48:35,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:35,159 INFO L87 Difference]: Start difference. First operand 62274 states and 77425 transitions. Second operand has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)