/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.09.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-11 01:47:24,512 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-11 01:47:24,514 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-11 01:47:24,561 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-11 01:47:24,561 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-11 01:47:24,562 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-11 01:47:24,563 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-11 01:47:24,565 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-11 01:47:24,566 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-11 01:47:24,567 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-11 01:47:24,568 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-11 01:47:24,569 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-11 01:47:24,569 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-11 01:47:24,570 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-11 01:47:24,571 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-11 01:47:24,572 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-11 01:47:24,573 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-11 01:47:24,574 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-11 01:47:24,576 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-11 01:47:24,578 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-11 01:47:24,579 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-11 01:47:24,602 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-11 01:47:24,607 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-11 01:47:24,608 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-11 01:47:24,619 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-11 01:47:24,619 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-11 01:47:24,619 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-11 01:47:24,620 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-11 01:47:24,620 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-11 01:47:24,621 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-11 01:47:24,621 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-11 01:47:24,622 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-11 01:47:24,622 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-11 01:47:24,623 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-11 01:47:24,624 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-11 01:47:24,624 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-11 01:47:24,624 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-11 01:47:24,624 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-11 01:47:24,625 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-11 01:47:24,625 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-11 01:47:24,626 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-11 01:47:24,628 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:24,658 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-11 01:47:24,658 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-11 01:47:24,658 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-11 01:47:24,659 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-11 01:47:24,659 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-11 01:47:24,660 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-11 01:47:24,660 INFO L138 SettingsManager]: * Use SBE=true [2022-01-11 01:47:24,660 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-11 01:47:24,660 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-11 01:47:24,660 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-11 01:47:24,660 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-11 01:47:24,660 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-11 01:47:24,661 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-11 01:47:24,661 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-11 01:47:24,661 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-11 01:47:24,661 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-11 01:47:24,661 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-11 01:47:24,661 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-11 01:47:24,661 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-11 01:47:24,661 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-11 01:47:24,662 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-11 01:47:24,662 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 01:47:24,662 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-11 01:47:24,662 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-11 01:47:24,662 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-11 01:47:24,662 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-11 01:47:24,662 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-11 01:47:24,662 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-11 01:47:24,663 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-11 01:47:24,663 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-11 01:47:24,663 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-11 01:47:24,663 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-11 01:47:24,663 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-11 01:47:24,664 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:24,850 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-11 01:47:24,870 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-11 01:47:24,871 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-11 01:47:24,872 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-11 01:47:24,872 INFO L275 PluginConnector]: CDTParser initialized [2022-01-11 01:47:24,873 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.09.cil-2.c [2022-01-11 01:47:24,928 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8b98e37a/166d88ca41f940f583e2624aa35213df/FLAGc645bc5fe [2022-01-11 01:47:25,288 INFO L306 CDTParser]: Found 1 translation units. [2022-01-11 01:47:25,289 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_1.cil-2+token_ring.09.cil-2.c [2022-01-11 01:47:25,300 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8b98e37a/166d88ca41f940f583e2624aa35213df/FLAGc645bc5fe [2022-01-11 01:47:25,685 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8b98e37a/166d88ca41f940f583e2624aa35213df [2022-01-11 01:47:25,687 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-11 01:47:25,688 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-11 01:47:25,692 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-11 01:47:25,692 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-11 01:47:25,695 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-11 01:47:25,696 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 01:47:25" (1/1) ... [2022-01-11 01:47:25,697 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1faa0757 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:47:25, skipping insertion in model container [2022-01-11 01:47:25,697 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 01:47:25" (1/1) ... [2022-01-11 01:47:25,703 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-11 01:47:25,755 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-11 01:47:25,902 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.09.cil-2.c[913,926] [2022-01-11 01:47:25,947 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.09.cil-2.c[5977,5990] [2022-01-11 01:47:26,055 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 01:47:26,074 INFO L203 MainTranslator]: Completed pre-run [2022-01-11 01:47:26,084 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.09.cil-2.c[913,926] [2022-01-11 01:47:26,097 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.09.cil-2.c[5977,5990] [2022-01-11 01:47:26,132 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 01:47:26,151 INFO L208 MainTranslator]: Completed translation [2022-01-11 01:47:26,151 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:47:26 WrapperNode [2022-01-11 01:47:26,151 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-11 01:47:26,152 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-11 01:47:26,152 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-11 01:47:26,152 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-11 01:47:26,158 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:26" (1/1) ... [2022-01-11 01:47:26,171 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:26" (1/1) ... [2022-01-11 01:47:26,263 INFO L137 Inliner]: procedures = 67, calls = 76, calls flagged for inlining = 71, calls inlined = 202, statements flattened = 3022 [2022-01-11 01:47:26,263 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-11 01:47:26,264 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-11 01:47:26,264 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-11 01:47:26,264 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-11 01:47:26,270 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:26" (1/1) ... [2022-01-11 01:47:26,270 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:26" (1/1) ... [2022-01-11 01:47:26,279 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:26" (1/1) ... [2022-01-11 01:47:26,279 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:26" (1/1) ... [2022-01-11 01:47:26,315 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:26" (1/1) ... [2022-01-11 01:47:26,344 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:26" (1/1) ... [2022-01-11 01:47:26,350 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:26" (1/1) ... [2022-01-11 01:47:26,360 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-11 01:47:26,361 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-11 01:47:26,361 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-11 01:47:26,361 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-11 01:47:26,362 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:47:26" (1/1) ... [2022-01-11 01:47:26,368 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 01:47:26,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 01:47:26,400 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:26,422 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:26,441 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-11 01:47:26,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-11 01:47:26,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-11 01:47:26,442 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-11 01:47:26,538 INFO L234 CfgBuilder]: Building ICFG [2022-01-11 01:47:26,539 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-11 01:47:28,092 INFO L275 CfgBuilder]: Performing block encoding [2022-01-11 01:47:28,104 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-11 01:47:28,104 INFO L299 CfgBuilder]: Removed 16 assume(true) statements. [2022-01-11 01:47:28,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 01:47:28 BoogieIcfgContainer [2022-01-11 01:47:28,106 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-11 01:47:28,107 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-11 01:47:28,107 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-11 01:47:28,108 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-11 01:47:28,111 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 01:47:28" (1/1) ... [2022-01-11 01:47:28,483 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 01:47:28 BasicIcfg [2022-01-11 01:47:28,483 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-11 01:47:28,486 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-11 01:47:28,486 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-11 01:47:28,488 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-11 01:47:28,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 01:47:25" (1/4) ... [2022-01-11 01:47:28,489 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@663bbc74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 01:47:28, skipping insertion in model container [2022-01-11 01:47:28,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:47:26" (2/4) ... [2022-01-11 01:47:28,490 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@663bbc74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 01:47:28, skipping insertion in model container [2022-01-11 01:47:28,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 01:47:28" (3/4) ... [2022-01-11 01:47:28,490 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@663bbc74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 01:47:28, skipping insertion in model container [2022-01-11 01:47:28,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 01:47:28" (4/4) ... [2022-01-11 01:47:28,491 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.09.cil-2.cTransformedIcfg [2022-01-11 01:47:28,497 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-11 01:47:28,497 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-01-11 01:47:28,548 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-11 01:47:28,558 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:28,559 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-01-11 01:47:28,590 INFO L276 IsEmpty]: Start isEmpty. Operand has 1264 states, 1259 states have (on average 1.5162827640984908) internal successors, (1909), 1263 states have internal predecessors, (1909), 0 states have call successors, (0), 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:28,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-11 01:47:28,597 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:28,598 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:28,598 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:28,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:28,606 INFO L85 PathProgramCache]: Analyzing trace with hash -260266145, now seen corresponding path program 1 times [2022-01-11 01:47:28,615 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:28,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125487137] [2022-01-11 01:47:28,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:28,618 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:28,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:28,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:28,937 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:28,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125487137] [2022-01-11 01:47:28,938 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125487137] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:28,938 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:28,938 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:47:28,940 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571167676] [2022-01-11 01:47:28,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:28,944 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:28,944 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:28,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:28,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:29,002 INFO L87 Difference]: Start difference. First operand has 1264 states, 1259 states have (on average 1.5162827640984908) internal successors, (1909), 1263 states have internal predecessors, (1909), 0 states have call successors, (0), 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:29,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:29,200 INFO L93 Difference]: Finished difference Result 2462 states and 3703 transitions. [2022-01-11 01:47:29,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:29,203 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:29,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:29,225 INFO L225 Difference]: With dead ends: 2462 [2022-01-11 01:47:29,225 INFO L226 Difference]: Without dead ends: 1318 [2022-01-11 01:47:29,233 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:29,236 INFO L933 BasicCegarLoop]: 1879 mSDtfsCounter, 1840 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1840 SdHoareTripleChecker+Valid, 1973 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.1s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:29,237 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1840 Valid, 1973 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 01:47:29,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1318 states. [2022-01-11 01:47:29,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1318 to 1297. [2022-01-11 01:47:29,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1297 states, 1293 states have (on average 1.48569218870843) internal successors, (1921), 1296 states have internal predecessors, (1921), 0 states have call successors, (0), 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:29,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1297 states to 1297 states and 1921 transitions. [2022-01-11 01:47:29,352 INFO L78 Accepts]: Start accepts. Automaton has 1297 states and 1921 transitions. Word has length 36 [2022-01-11 01:47:29,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:29,352 INFO L470 AbstractCegarLoop]: Abstraction has 1297 states and 1921 transitions. [2022-01-11 01:47:29,353 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:29,353 INFO L276 IsEmpty]: Start isEmpty. Operand 1297 states and 1921 transitions. [2022-01-11 01:47:29,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-01-11 01:47:29,354 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:29,354 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:29,355 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-11 01:47:29,355 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:29,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:29,356 INFO L85 PathProgramCache]: Analyzing trace with hash -2014701239, now seen corresponding path program 1 times [2022-01-11 01:47:29,356 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:29,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296468247] [2022-01-11 01:47:29,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:29,356 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:29,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:29,463 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:29,463 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:29,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296468247] [2022-01-11 01:47:29,464 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296468247] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:29,464 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:29,464 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:47:29,465 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718954014] [2022-01-11 01:47:29,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:29,466 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:29,466 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:29,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:29,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:29,467 INFO L87 Difference]: Start difference. First operand 1297 states and 1921 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:29,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:29,521 INFO L93 Difference]: Finished difference Result 1466 states and 2156 transitions. [2022-01-11 01:47:29,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:29,522 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:29,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:29,529 INFO L225 Difference]: With dead ends: 1466 [2022-01-11 01:47:29,529 INFO L226 Difference]: Without dead ends: 1355 [2022-01-11 01:47:29,531 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:29,533 INFO L933 BasicCegarLoop]: 1859 mSDtfsCounter, 60 mSDsluCounter, 1820 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 3679 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:29,533 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 3679 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:29,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1355 states. [2022-01-11 01:47:29,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1355 to 1350. [2022-01-11 01:47:29,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1350 states, 1346 states have (on average 1.4814264487369986) internal successors, (1994), 1349 states have internal predecessors, (1994), 0 states have call successors, (0), 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:29,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1350 states to 1350 states and 1994 transitions. [2022-01-11 01:47:29,575 INFO L78 Accepts]: Start accepts. Automaton has 1350 states and 1994 transitions. Word has length 37 [2022-01-11 01:47:29,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:29,576 INFO L470 AbstractCegarLoop]: Abstraction has 1350 states and 1994 transitions. [2022-01-11 01:47:29,576 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:29,577 INFO L276 IsEmpty]: Start isEmpty. Operand 1350 states and 1994 transitions. [2022-01-11 01:47:29,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-01-11 01:47:29,585 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:29,585 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:29,589 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-11 01:47:29,589 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:29,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:29,590 INFO L85 PathProgramCache]: Analyzing trace with hash 2125969224, now seen corresponding path program 1 times [2022-01-11 01:47:29,590 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:29,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894556670] [2022-01-11 01:47:29,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:29,591 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:29,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:29,669 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:29,670 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:29,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894556670] [2022-01-11 01:47:29,672 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894556670] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:29,672 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:29,672 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:47:29,672 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210095919] [2022-01-11 01:47:29,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:29,673 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:29,673 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:29,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:29,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:29,674 INFO L87 Difference]: Start difference. First operand 1350 states and 1994 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:29,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:29,727 INFO L93 Difference]: Finished difference Result 1667 states and 2430 transitions. [2022-01-11 01:47:29,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:29,727 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:29,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:29,733 INFO L225 Difference]: With dead ends: 1667 [2022-01-11 01:47:29,733 INFO L226 Difference]: Without dead ends: 1503 [2022-01-11 01:47:29,737 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:29,740 INFO L933 BasicCegarLoop]: 1882 mSDtfsCounter, 1831 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1831 SdHoareTripleChecker+Valid, 1970 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:29,741 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1831 Valid, 1970 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:29,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1503 states. [2022-01-11 01:47:29,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1503 to 1481. [2022-01-11 01:47:29,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1481 states, 1477 states have (on average 1.4691943127962086) internal successors, (2170), 1480 states have internal predecessors, (2170), 0 states have call successors, (0), 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:29,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1481 states to 1481 states and 2170 transitions. [2022-01-11 01:47:29,781 INFO L78 Accepts]: Start accepts. Automaton has 1481 states and 2170 transitions. Word has length 37 [2022-01-11 01:47:29,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:29,781 INFO L470 AbstractCegarLoop]: Abstraction has 1481 states and 2170 transitions. [2022-01-11 01:47:29,782 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:29,782 INFO L276 IsEmpty]: Start isEmpty. Operand 1481 states and 2170 transitions. [2022-01-11 01:47:29,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-11 01:47:29,785 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:29,785 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:29,786 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-11 01:47:29,786 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:29,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:29,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1284966479, now seen corresponding path program 1 times [2022-01-11 01:47:29,787 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:29,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890328462] [2022-01-11 01:47:29,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:29,788 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:29,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:29,864 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:29,864 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:29,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890328462] [2022-01-11 01:47:29,864 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890328462] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:29,865 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:29,865 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:47:29,865 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787778023] [2022-01-11 01:47:29,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:29,865 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:29,866 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:29,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:29,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:29,868 INFO L87 Difference]: Start difference. First operand 1481 states and 2170 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:29,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:29,968 INFO L93 Difference]: Finished difference Result 1932 states and 2777 transitions. [2022-01-11 01:47:29,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:29,969 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:29,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:29,975 INFO L225 Difference]: With dead ends: 1932 [2022-01-11 01:47:29,975 INFO L226 Difference]: Without dead ends: 1637 [2022-01-11 01:47:29,978 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:29,983 INFO L933 BasicCegarLoop]: 1912 mSDtfsCounter, 48 mSDsluCounter, 1847 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 3759 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:29,984 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 3759 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:29,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1637 states. [2022-01-11 01:47:30,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1637 to 1637. [2022-01-11 01:47:30,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1637 states, 1633 states have (on average 1.443968156766687) internal successors, (2358), 1636 states have internal predecessors, (2358), 0 states have call successors, (0), 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:30,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1637 states to 1637 states and 2358 transitions. [2022-01-11 01:47:30,033 INFO L78 Accepts]: Start accepts. Automaton has 1637 states and 2358 transitions. Word has length 51 [2022-01-11 01:47:30,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:30,033 INFO L470 AbstractCegarLoop]: Abstraction has 1637 states and 2358 transitions. [2022-01-11 01:47:30,033 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:30,033 INFO L276 IsEmpty]: Start isEmpty. Operand 1637 states and 2358 transitions. [2022-01-11 01:47:30,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-11 01:47:30,034 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:30,035 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:30,035 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-11 01:47:30,035 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:30,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:30,037 INFO L85 PathProgramCache]: Analyzing trace with hash -879825757, now seen corresponding path program 1 times [2022-01-11 01:47:30,037 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:30,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859631936] [2022-01-11 01:47:30,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:30,038 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:30,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:30,101 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:30,101 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:30,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859631936] [2022-01-11 01:47:30,101 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859631936] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:30,101 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:30,101 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:47:30,102 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573344411] [2022-01-11 01:47:30,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:30,102 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:30,102 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:30,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:30,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:30,103 INFO L87 Difference]: Start difference. First operand 1637 states and 2358 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:30,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:30,181 INFO L93 Difference]: Finished difference Result 2110 states and 2974 transitions. [2022-01-11 01:47:30,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:30,181 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:30,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:30,189 INFO L225 Difference]: With dead ends: 2110 [2022-01-11 01:47:30,189 INFO L226 Difference]: Without dead ends: 1745 [2022-01-11 01:47:30,190 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:30,190 INFO L933 BasicCegarLoop]: 1859 mSDtfsCounter, 1805 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1805 SdHoareTripleChecker+Valid, 1947 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:30,190 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1805 Valid, 1947 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:30,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1745 states. [2022-01-11 01:47:30,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1745 to 1745. [2022-01-11 01:47:30,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1745 states, 1741 states have (on average 1.427914991384262) internal successors, (2486), 1744 states have internal predecessors, (2486), 0 states have call successors, (0), 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:30,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1745 states to 1745 states and 2486 transitions. [2022-01-11 01:47:30,245 INFO L78 Accepts]: Start accepts. Automaton has 1745 states and 2486 transitions. Word has length 55 [2022-01-11 01:47:30,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:30,248 INFO L470 AbstractCegarLoop]: Abstraction has 1745 states and 2486 transitions. [2022-01-11 01:47:30,248 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:30,249 INFO L276 IsEmpty]: Start isEmpty. Operand 1745 states and 2486 transitions. [2022-01-11 01:47:30,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-01-11 01:47:30,250 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:30,251 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:30,251 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-11 01:47:30,251 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:30,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:30,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1271876383, now seen corresponding path program 1 times [2022-01-11 01:47:30,252 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:30,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48161046] [2022-01-11 01:47:30,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:30,252 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:30,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:30,364 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:30,364 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:30,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48161046] [2022-01-11 01:47:30,364 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48161046] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:30,365 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:30,365 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 01:47:30,365 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884673608] [2022-01-11 01:47:30,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:30,366 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 01:47:30,366 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:30,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 01:47:30,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 01:47:30,367 INFO L87 Difference]: Start difference. First operand 1745 states and 2486 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:30,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:30,506 INFO L93 Difference]: Finished difference Result 2828 states and 3890 transitions. [2022-01-11 01:47:30,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 01:47:30,507 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:30,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:30,515 INFO L225 Difference]: With dead ends: 2828 [2022-01-11 01:47:30,516 INFO L226 Difference]: Without dead ends: 2405 [2022-01-11 01:47:30,517 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:30,518 INFO L933 BasicCegarLoop]: 1932 mSDtfsCounter, 302 mSDsluCounter, 5714 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 7646 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:30,518 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [302 Valid, 7646 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:30,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2405 states. [2022-01-11 01:47:30,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2405 to 1769. [2022-01-11 01:47:30,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1769 states, 1765 states have (on average 1.4198300283286118) internal successors, (2506), 1768 states have internal predecessors, (2506), 0 states have call successors, (0), 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:30,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1769 states to 1769 states and 2506 transitions. [2022-01-11 01:47:30,587 INFO L78 Accepts]: Start accepts. Automaton has 1769 states and 2506 transitions. Word has length 56 [2022-01-11 01:47:30,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:30,588 INFO L470 AbstractCegarLoop]: Abstraction has 1769 states and 2506 transitions. [2022-01-11 01:47:30,588 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:30,588 INFO L276 IsEmpty]: Start isEmpty. Operand 1769 states and 2506 transitions. [2022-01-11 01:47:30,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-01-11 01:47:30,589 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:30,589 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:30,590 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-11 01:47:30,590 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:30,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:30,590 INFO L85 PathProgramCache]: Analyzing trace with hash -921076446, now seen corresponding path program 1 times [2022-01-11 01:47:30,590 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:30,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804575719] [2022-01-11 01:47:30,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:30,591 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:30,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:30,679 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:30,679 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:30,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804575719] [2022-01-11 01:47:30,679 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804575719] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:30,679 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:30,679 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 01:47:30,680 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024382315] [2022-01-11 01:47:30,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:30,680 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 01:47:30,680 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:30,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 01:47:30,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 01:47:30,681 INFO L87 Difference]: Start difference. First operand 1769 states and 2506 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:30,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:30,845 INFO L93 Difference]: Finished difference Result 2558 states and 3516 transitions. [2022-01-11 01:47:30,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 01:47:30,846 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:30,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:30,854 INFO L225 Difference]: With dead ends: 2558 [2022-01-11 01:47:30,854 INFO L226 Difference]: Without dead ends: 2060 [2022-01-11 01:47:30,856 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:30,857 INFO L933 BasicCegarLoop]: 1909 mSDtfsCounter, 276 mSDsluCounter, 5683 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 7592 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:30,858 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [276 Valid, 7592 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:30,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2060 states. [2022-01-11 01:47:30,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2060 to 1667. [2022-01-11 01:47:30,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1667 states, 1663 states have (on average 1.428141912206855) internal successors, (2375), 1666 states have internal predecessors, (2375), 0 states have call successors, (0), 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:30,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1667 states to 1667 states and 2375 transitions. [2022-01-11 01:47:30,934 INFO L78 Accepts]: Start accepts. Automaton has 1667 states and 2375 transitions. Word has length 56 [2022-01-11 01:47:30,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:30,936 INFO L470 AbstractCegarLoop]: Abstraction has 1667 states and 2375 transitions. [2022-01-11 01:47:30,936 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:30,936 INFO L276 IsEmpty]: Start isEmpty. Operand 1667 states and 2375 transitions. [2022-01-11 01:47:30,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-01-11 01:47:30,937 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:30,937 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:30,937 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-11 01:47:30,937 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:30,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:30,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1296711298, now seen corresponding path program 1 times [2022-01-11 01:47:30,938 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:30,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458129890] [2022-01-11 01:47:30,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:30,938 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:30,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:31,046 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:31,046 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:31,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458129890] [2022-01-11 01:47:31,046 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458129890] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:31,046 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:31,047 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 01:47:31,047 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861905126] [2022-01-11 01:47:31,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:31,047 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 01:47:31,048 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:31,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 01:47:31,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 01:47:31,048 INFO L87 Difference]: Start difference. First operand 1667 states and 2375 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:31,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:31,164 INFO L93 Difference]: Finished difference Result 1717 states and 2435 transitions. [2022-01-11 01:47:31,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 01:47:31,164 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:31,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:31,171 INFO L225 Difference]: With dead ends: 1717 [2022-01-11 01:47:31,171 INFO L226 Difference]: Without dead ends: 1715 [2022-01-11 01:47:31,172 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:31,172 INFO L933 BasicCegarLoop]: 1859 mSDtfsCounter, 3686 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3686 SdHoareTripleChecker+Valid, 1928 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:31,173 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3686 Valid, 1928 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:31,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1715 states. [2022-01-11 01:47:31,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1715 to 1665. [2022-01-11 01:47:31,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1665 states, 1662 states have (on average 1.4271961492178098) internal successors, (2372), 1664 states have internal predecessors, (2372), 0 states have call successors, (0), 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:31,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1665 states to 1665 states and 2372 transitions. [2022-01-11 01:47:31,303 INFO L78 Accepts]: Start accepts. Automaton has 1665 states and 2372 transitions. Word has length 56 [2022-01-11 01:47:31,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:31,304 INFO L470 AbstractCegarLoop]: Abstraction has 1665 states and 2372 transitions. [2022-01-11 01:47:31,304 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:31,304 INFO L276 IsEmpty]: Start isEmpty. Operand 1665 states and 2372 transitions. [2022-01-11 01:47:31,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-01-11 01:47:31,305 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:31,305 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:31,306 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-11 01:47:31,306 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:31,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:31,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1543348451, now seen corresponding path program 1 times [2022-01-11 01:47:31,306 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:31,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754671325] [2022-01-11 01:47:31,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:31,307 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:31,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:31,519 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:31,519 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:31,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754671325] [2022-01-11 01:47:31,520 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754671325] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 01:47:31,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [166685200] [2022-01-11 01:47:31,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:31,520 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 01:47:31,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 01:47:31,529 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:31,551 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:31,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:31,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 631 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-11 01:47:31,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 01:47:31,981 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:31,982 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 01:47:32,271 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:32,271 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [166685200] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 01:47:32,271 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 01:47:32,272 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-01-11 01:47:32,272 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272947768] [2022-01-11 01:47:32,272 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 01:47:32,272 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-11 01:47:32,272 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:32,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-11 01:47:32,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-01-11 01:47:32,273 INFO L87 Difference]: Start difference. First operand 1665 states and 2372 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:32,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:32,583 INFO L93 Difference]: Finished difference Result 2551 states and 3500 transitions. [2022-01-11 01:47:32,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-11 01:47:32,584 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:32,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:32,593 INFO L225 Difference]: With dead ends: 2551 [2022-01-11 01:47:32,593 INFO L226 Difference]: Without dead ends: 2549 [2022-01-11 01:47:32,593 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:32,594 INFO L933 BasicCegarLoop]: 1934 mSDtfsCounter, 3886 mSDsluCounter, 6137 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3886 SdHoareTripleChecker+Valid, 8071 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:32,594 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3886 Valid, 8071 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:32,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2549 states. [2022-01-11 01:47:32,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2549 to 1937. [2022-01-11 01:47:32,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1937 states, 1934 states have (on average 1.40899689762151) internal successors, (2725), 1936 states have internal predecessors, (2725), 0 states have call successors, (0), 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:32,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1937 states to 1937 states and 2725 transitions. [2022-01-11 01:47:32,731 INFO L78 Accepts]: Start accepts. Automaton has 1937 states and 2725 transitions. Word has length 57 [2022-01-11 01:47:32,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:32,731 INFO L470 AbstractCegarLoop]: Abstraction has 1937 states and 2725 transitions. [2022-01-11 01:47:32,731 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:32,731 INFO L276 IsEmpty]: Start isEmpty. Operand 1937 states and 2725 transitions. [2022-01-11 01:47:32,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-01-11 01:47:32,733 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:32,733 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:32,766 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:32,947 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:32,948 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:32,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:32,948 INFO L85 PathProgramCache]: Analyzing trace with hash -410148906, now seen corresponding path program 2 times [2022-01-11 01:47:32,948 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:32,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201962342] [2022-01-11 01:47:32,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:32,949 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:32,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:33,004 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:33,004 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:33,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201962342] [2022-01-11 01:47:33,004 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201962342] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:33,006 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:33,006 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:47:33,006 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415847002] [2022-01-11 01:47:33,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:33,007 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:33,007 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:33,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:33,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:33,008 INFO L87 Difference]: Start difference. First operand 1937 states and 2725 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:33,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:33,135 INFO L93 Difference]: Finished difference Result 2444 states and 3385 transitions. [2022-01-11 01:47:33,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:33,136 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:33,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:33,143 INFO L225 Difference]: With dead ends: 2444 [2022-01-11 01:47:33,143 INFO L226 Difference]: Without dead ends: 1848 [2022-01-11 01:47:33,144 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:33,145 INFO L933 BasicCegarLoop]: 1893 mSDtfsCounter, 1809 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1809 SdHoareTripleChecker+Valid, 1962 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:33,146 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1809 Valid, 1962 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:33,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1848 states. [2022-01-11 01:47:33,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1848 to 1822. [2022-01-11 01:47:33,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1822 states, 1819 states have (on average 1.4145134689389776) internal successors, (2573), 1821 states have internal predecessors, (2573), 0 states have call successors, (0), 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:33,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1822 states to 1822 states and 2573 transitions. [2022-01-11 01:47:33,299 INFO L78 Accepts]: Start accepts. Automaton has 1822 states and 2573 transitions. Word has length 72 [2022-01-11 01:47:33,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:33,299 INFO L470 AbstractCegarLoop]: Abstraction has 1822 states and 2573 transitions. [2022-01-11 01:47:33,299 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:33,300 INFO L276 IsEmpty]: Start isEmpty. Operand 1822 states and 2573 transitions. [2022-01-11 01:47:33,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-01-11 01:47:33,305 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:33,305 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:33,305 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-11 01:47:33,306 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:33,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:33,306 INFO L85 PathProgramCache]: Analyzing trace with hash -411874258, now seen corresponding path program 1 times [2022-01-11 01:47:33,306 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:33,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600381245] [2022-01-11 01:47:33,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:33,307 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:33,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:33,366 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:33,367 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:33,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600381245] [2022-01-11 01:47:33,367 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600381245] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:33,367 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:33,367 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:47:33,368 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199975496] [2022-01-11 01:47:33,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:33,368 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:33,368 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:33,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:33,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:33,369 INFO L87 Difference]: Start difference. First operand 1822 states and 2573 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:33,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:33,491 INFO L93 Difference]: Finished difference Result 2476 states and 3400 transitions. [2022-01-11 01:47:33,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:33,492 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:33,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:33,498 INFO L225 Difference]: With dead ends: 2476 [2022-01-11 01:47:33,498 INFO L226 Difference]: Without dead ends: 1840 [2022-01-11 01:47:33,500 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:33,500 INFO L933 BasicCegarLoop]: 1866 mSDtfsCounter, 1794 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1794 SdHoareTripleChecker+Valid, 1950 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:33,500 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1794 Valid, 1950 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:33,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1840 states. [2022-01-11 01:47:33,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1840 to 1822. [2022-01-11 01:47:33,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1822 states, 1819 states have (on average 1.4035184167124795) internal successors, (2553), 1821 states have internal predecessors, (2553), 0 states have call successors, (0), 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:33,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1822 states to 1822 states and 2553 transitions. [2022-01-11 01:47:33,609 INFO L78 Accepts]: Start accepts. Automaton has 1822 states and 2553 transitions. Word has length 84 [2022-01-11 01:47:33,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:33,609 INFO L470 AbstractCegarLoop]: Abstraction has 1822 states and 2553 transitions. [2022-01-11 01:47:33,609 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:33,609 INFO L276 IsEmpty]: Start isEmpty. Operand 1822 states and 2553 transitions. [2022-01-11 01:47:33,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-01-11 01:47:33,611 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:33,611 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:33,611 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-11 01:47:33,611 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:33,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:33,612 INFO L85 PathProgramCache]: Analyzing trace with hash -971551542, now seen corresponding path program 1 times [2022-01-11 01:47:33,612 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:33,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675996423] [2022-01-11 01:47:33,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:33,612 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:33,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:33,650 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:33,651 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:33,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675996423] [2022-01-11 01:47:33,651 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675996423] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:33,651 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:33,651 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:47:33,651 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873330595] [2022-01-11 01:47:33,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:33,652 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:33,652 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:33,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:33,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:33,652 INFO L87 Difference]: Start difference. First operand 1822 states and 2553 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:33,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:33,744 INFO L93 Difference]: Finished difference Result 2086 states and 2871 transitions. [2022-01-11 01:47:33,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:33,745 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:33,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:33,749 INFO L225 Difference]: With dead ends: 2086 [2022-01-11 01:47:33,749 INFO L226 Difference]: Without dead ends: 1180 [2022-01-11 01:47:33,751 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:33,751 INFO L933 BasicCegarLoop]: 1892 mSDtfsCounter, 56 mSDsluCounter, 1824 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 3716 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:33,751 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 3716 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:33,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2022-01-11 01:47:33,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 1180. [2022-01-11 01:47:33,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1180 states, 1178 states have (on average 1.4915110356536503) internal successors, (1757), 1179 states have internal predecessors, (1757), 0 states have call successors, (0), 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:33,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1180 states to 1180 states and 1757 transitions. [2022-01-11 01:47:33,814 INFO L78 Accepts]: Start accepts. Automaton has 1180 states and 1757 transitions. Word has length 85 [2022-01-11 01:47:33,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:33,814 INFO L470 AbstractCegarLoop]: Abstraction has 1180 states and 1757 transitions. [2022-01-11 01:47:33,814 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:33,814 INFO L276 IsEmpty]: Start isEmpty. Operand 1180 states and 1757 transitions. [2022-01-11 01:47:33,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-01-11 01:47:33,816 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:33,816 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] [2022-01-11 01:47:33,816 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-11 01:47:33,816 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:33,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:33,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1484531064, now seen corresponding path program 1 times [2022-01-11 01:47:33,817 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:33,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10975932] [2022-01-11 01:47:33,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:33,817 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:33,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:33,855 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:33,855 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:33,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10975932] [2022-01-11 01:47:33,855 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10975932] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:33,855 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:33,856 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:47:33,856 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012619312] [2022-01-11 01:47:33,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:33,856 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:33,856 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:33,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:33,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:33,857 INFO L87 Difference]: Start difference. First operand 1180 states and 1757 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 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:33,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:33,913 INFO L93 Difference]: Finished difference Result 2347 states and 3493 transitions. [2022-01-11 01:47:33,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:33,914 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 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 132 [2022-01-11 01:47:33,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:33,918 INFO L225 Difference]: With dead ends: 2347 [2022-01-11 01:47:33,918 INFO L226 Difference]: Without dead ends: 1180 [2022-01-11 01:47:33,920 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:33,920 INFO L933 BasicCegarLoop]: 1755 mSDtfsCounter, 1744 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1744 SdHoareTripleChecker+Valid, 1756 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:47:33,921 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1744 Valid, 1756 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:33,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2022-01-11 01:47:33,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 1180. [2022-01-11 01:47:33,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1180 states, 1178 states have (on average 1.4906621392190154) internal successors, (1756), 1179 states have internal predecessors, (1756), 0 states have call successors, (0), 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:33,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1180 states to 1180 states and 1756 transitions. [2022-01-11 01:47:33,974 INFO L78 Accepts]: Start accepts. Automaton has 1180 states and 1756 transitions. Word has length 132 [2022-01-11 01:47:33,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:33,974 INFO L470 AbstractCegarLoop]: Abstraction has 1180 states and 1756 transitions. [2022-01-11 01:47:33,974 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 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:33,974 INFO L276 IsEmpty]: Start isEmpty. Operand 1180 states and 1756 transitions. [2022-01-11 01:47:33,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-01-11 01:47:33,975 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:33,975 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] [2022-01-11 01:47:33,976 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-11 01:47:33,976 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:33,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:33,977 INFO L85 PathProgramCache]: Analyzing trace with hash -116634983, now seen corresponding path program 1 times [2022-01-11 01:47:33,977 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:33,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420769226] [2022-01-11 01:47:33,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:33,977 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:33,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:34,027 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:34,027 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:34,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420769226] [2022-01-11 01:47:34,027 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420769226] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:34,027 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:34,028 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:34,028 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393409959] [2022-01-11 01:47:34,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:34,029 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:34,029 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:34,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:34,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:34,029 INFO L87 Difference]: Start difference. First operand 1180 states and 1756 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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:34,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:34,138 INFO L93 Difference]: Finished difference Result 3323 states and 4931 transitions. [2022-01-11 01:47:34,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:34,139 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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 132 [2022-01-11 01:47:34,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:34,145 INFO L225 Difference]: With dead ends: 3323 [2022-01-11 01:47:34,146 INFO L226 Difference]: Without dead ends: 2160 [2022-01-11 01:47:34,147 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:34,148 INFO L933 BasicCegarLoop]: 1750 mSDtfsCounter, 1632 mSDsluCounter, 1542 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1632 SdHoareTripleChecker+Valid, 3292 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:34,148 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1632 Valid, 3292 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:34,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2160 states. [2022-01-11 01:47:34,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2160 to 2156. [2022-01-11 01:47:34,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2156 states, 2154 states have (on average 1.4837511606313836) internal successors, (3196), 2155 states have internal predecessors, (3196), 0 states have call successors, (0), 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:34,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2156 states to 2156 states and 3196 transitions. [2022-01-11 01:47:34,253 INFO L78 Accepts]: Start accepts. Automaton has 2156 states and 3196 transitions. Word has length 132 [2022-01-11 01:47:34,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:34,254 INFO L470 AbstractCegarLoop]: Abstraction has 2156 states and 3196 transitions. [2022-01-11 01:47:34,254 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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:34,254 INFO L276 IsEmpty]: Start isEmpty. Operand 2156 states and 3196 transitions. [2022-01-11 01:47:34,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-01-11 01:47:34,255 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:34,255 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] [2022-01-11 01:47:34,256 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-11 01:47:34,256 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:34,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:34,256 INFO L85 PathProgramCache]: Analyzing trace with hash -704959303, now seen corresponding path program 1 times [2022-01-11 01:47:34,256 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:34,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910215261] [2022-01-11 01:47:34,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:34,257 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:34,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:34,299 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:34,300 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:34,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910215261] [2022-01-11 01:47:34,300 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910215261] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:34,300 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:34,300 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:34,300 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088530647] [2022-01-11 01:47:34,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:34,301 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:34,301 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:34,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:34,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:34,301 INFO L87 Difference]: Start difference. First operand 2156 states and 3196 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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:34,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:34,446 INFO L93 Difference]: Finished difference Result 4294 states and 6364 transitions. [2022-01-11 01:47:34,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:34,446 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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 132 [2022-01-11 01:47:34,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:34,454 INFO L225 Difference]: With dead ends: 4294 [2022-01-11 01:47:34,454 INFO L226 Difference]: Without dead ends: 2156 [2022-01-11 01:47:34,457 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:34,457 INFO L933 BasicCegarLoop]: 1744 mSDtfsCounter, 1732 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1732 SdHoareTripleChecker+Valid, 1744 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:34,458 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1732 Valid, 1744 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:34,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2156 states. [2022-01-11 01:47:34,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2156 to 2156. [2022-01-11 01:47:34,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2156 states, 2154 states have (on average 1.4800371402042711) internal successors, (3188), 2155 states have internal predecessors, (3188), 0 states have call successors, (0), 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:34,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2156 states to 2156 states and 3188 transitions. [2022-01-11 01:47:34,572 INFO L78 Accepts]: Start accepts. Automaton has 2156 states and 3188 transitions. Word has length 132 [2022-01-11 01:47:34,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:34,572 INFO L470 AbstractCegarLoop]: Abstraction has 2156 states and 3188 transitions. [2022-01-11 01:47:34,572 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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:34,572 INFO L276 IsEmpty]: Start isEmpty. Operand 2156 states and 3188 transitions. [2022-01-11 01:47:34,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-01-11 01:47:34,573 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:34,573 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] [2022-01-11 01:47:34,573 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-11 01:47:34,574 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:34,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:34,574 INFO L85 PathProgramCache]: Analyzing trace with hash -862484839, now seen corresponding path program 1 times [2022-01-11 01:47:34,574 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:34,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729637732] [2022-01-11 01:47:34,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:34,575 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:34,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:34,615 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:34,615 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:34,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729637732] [2022-01-11 01:47:34,615 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729637732] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:34,615 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:34,615 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:34,616 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199281151] [2022-01-11 01:47:34,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:34,616 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:34,616 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:34,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:34,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:34,617 INFO L87 Difference]: Start difference. First operand 2156 states and 3188 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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:34,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:34,729 INFO L93 Difference]: Finished difference Result 4293 states and 6347 transitions. [2022-01-11 01:47:34,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:34,730 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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 132 [2022-01-11 01:47:34,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:34,735 INFO L225 Difference]: With dead ends: 4293 [2022-01-11 01:47:34,735 INFO L226 Difference]: Without dead ends: 2156 [2022-01-11 01:47:34,738 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:34,738 INFO L933 BasicCegarLoop]: 1739 mSDtfsCounter, 1726 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1726 SdHoareTripleChecker+Valid, 1739 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:34,739 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1726 Valid, 1739 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:34,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2156 states. [2022-01-11 01:47:34,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2156 to 2156. [2022-01-11 01:47:34,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2156 states, 2154 states have (on average 1.4763231197771587) internal successors, (3180), 2155 states have internal predecessors, (3180), 0 states have call successors, (0), 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:34,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2156 states to 2156 states and 3180 transitions. [2022-01-11 01:47:34,854 INFO L78 Accepts]: Start accepts. Automaton has 2156 states and 3180 transitions. Word has length 132 [2022-01-11 01:47:34,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:34,854 INFO L470 AbstractCegarLoop]: Abstraction has 2156 states and 3180 transitions. [2022-01-11 01:47:34,855 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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:34,855 INFO L276 IsEmpty]: Start isEmpty. Operand 2156 states and 3180 transitions. [2022-01-11 01:47:34,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-01-11 01:47:34,856 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:34,856 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] [2022-01-11 01:47:34,856 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-11 01:47:34,856 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:34,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:34,857 INFO L85 PathProgramCache]: Analyzing trace with hash 102265017, now seen corresponding path program 1 times [2022-01-11 01:47:34,857 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:34,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9671764] [2022-01-11 01:47:34,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:34,857 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:34,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:34,901 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:34,902 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:34,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9671764] [2022-01-11 01:47:34,902 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9671764] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:34,902 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:34,902 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:34,902 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410692604] [2022-01-11 01:47:34,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:34,903 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:34,903 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:34,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:34,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:34,903 INFO L87 Difference]: Start difference. First operand 2156 states and 3180 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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:35,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:35,026 INFO L93 Difference]: Finished difference Result 4292 states and 6330 transitions. [2022-01-11 01:47:35,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:35,026 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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 132 [2022-01-11 01:47:35,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:35,042 INFO L225 Difference]: With dead ends: 4292 [2022-01-11 01:47:35,042 INFO L226 Difference]: Without dead ends: 2156 [2022-01-11 01:47:35,045 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:35,045 INFO L933 BasicCegarLoop]: 1734 mSDtfsCounter, 1720 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1720 SdHoareTripleChecker+Valid, 1734 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:35,046 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1720 Valid, 1734 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:35,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2156 states. [2022-01-11 01:47:35,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2156 to 2156. [2022-01-11 01:47:35,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2156 states, 2154 states have (on average 1.4726090993500465) internal successors, (3172), 2155 states have internal predecessors, (3172), 0 states have call successors, (0), 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:35,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2156 states to 2156 states and 3172 transitions. [2022-01-11 01:47:35,144 INFO L78 Accepts]: Start accepts. Automaton has 2156 states and 3172 transitions. Word has length 132 [2022-01-11 01:47:35,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:35,144 INFO L470 AbstractCegarLoop]: Abstraction has 2156 states and 3172 transitions. [2022-01-11 01:47:35,144 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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:35,144 INFO L276 IsEmpty]: Start isEmpty. Operand 2156 states and 3172 transitions. [2022-01-11 01:47:35,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-01-11 01:47:35,145 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:35,145 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] [2022-01-11 01:47:35,146 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-11 01:47:35,146 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:35,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:35,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1103217305, now seen corresponding path program 1 times [2022-01-11 01:47:35,146 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:35,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939970254] [2022-01-11 01:47:35,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:35,147 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:35,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:35,190 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:35,191 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:35,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939970254] [2022-01-11 01:47:35,191 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939970254] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:35,191 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:35,191 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:35,191 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120216659] [2022-01-11 01:47:35,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:35,192 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:35,192 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:35,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:35,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:35,192 INFO L87 Difference]: Start difference. First operand 2156 states and 3172 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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:35,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:35,302 INFO L93 Difference]: Finished difference Result 4291 states and 6313 transitions. [2022-01-11 01:47:35,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:35,303 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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 132 [2022-01-11 01:47:35,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:35,307 INFO L225 Difference]: With dead ends: 4291 [2022-01-11 01:47:35,307 INFO L226 Difference]: Without dead ends: 2156 [2022-01-11 01:47:35,310 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:35,311 INFO L933 BasicCegarLoop]: 1729 mSDtfsCounter, 1714 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1714 SdHoareTripleChecker+Valid, 1729 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:35,311 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1714 Valid, 1729 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:35,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2156 states. [2022-01-11 01:47:35,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2156 to 2156. [2022-01-11 01:47:35,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2156 states, 2154 states have (on average 1.468895078922934) internal successors, (3164), 2155 states have internal predecessors, (3164), 0 states have call successors, (0), 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:35,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2156 states to 2156 states and 3164 transitions. [2022-01-11 01:47:35,443 INFO L78 Accepts]: Start accepts. Automaton has 2156 states and 3164 transitions. Word has length 132 [2022-01-11 01:47:35,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:35,443 INFO L470 AbstractCegarLoop]: Abstraction has 2156 states and 3164 transitions. [2022-01-11 01:47:35,443 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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:35,443 INFO L276 IsEmpty]: Start isEmpty. Operand 2156 states and 3164 transitions. [2022-01-11 01:47:35,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-01-11 01:47:35,444 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:35,444 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] [2022-01-11 01:47:35,444 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-11 01:47:35,444 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:35,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:35,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1689695417, now seen corresponding path program 1 times [2022-01-11 01:47:35,445 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:35,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859163841] [2022-01-11 01:47:35,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:35,445 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:35,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:35,484 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:35,484 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:35,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859163841] [2022-01-11 01:47:35,484 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859163841] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:35,484 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:35,484 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:35,484 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063055665] [2022-01-11 01:47:35,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:35,485 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:35,485 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:35,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:35,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:35,486 INFO L87 Difference]: Start difference. First operand 2156 states and 3164 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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:35,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:35,605 INFO L93 Difference]: Finished difference Result 4290 states and 6296 transitions. [2022-01-11 01:47:35,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:35,606 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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 132 [2022-01-11 01:47:35,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:35,610 INFO L225 Difference]: With dead ends: 4290 [2022-01-11 01:47:35,610 INFO L226 Difference]: Without dead ends: 2156 [2022-01-11 01:47:35,613 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:35,614 INFO L933 BasicCegarLoop]: 1724 mSDtfsCounter, 1708 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1708 SdHoareTripleChecker+Valid, 1724 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:35,614 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1708 Valid, 1724 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:35,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2156 states. [2022-01-11 01:47:35,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2156 to 2156. [2022-01-11 01:47:35,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2156 states, 2154 states have (on average 1.4651810584958218) internal successors, (3156), 2155 states have internal predecessors, (3156), 0 states have call successors, (0), 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:35,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2156 states to 2156 states and 3156 transitions. [2022-01-11 01:47:35,727 INFO L78 Accepts]: Start accepts. Automaton has 2156 states and 3156 transitions. Word has length 132 [2022-01-11 01:47:35,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:35,727 INFO L470 AbstractCegarLoop]: Abstraction has 2156 states and 3156 transitions. [2022-01-11 01:47:35,727 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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:35,728 INFO L276 IsEmpty]: Start isEmpty. Operand 2156 states and 3156 transitions. [2022-01-11 01:47:35,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-01-11 01:47:35,729 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:35,729 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] [2022-01-11 01:47:35,729 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-11 01:47:35,729 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:35,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:35,729 INFO L85 PathProgramCache]: Analyzing trace with hash 877330073, now seen corresponding path program 1 times [2022-01-11 01:47:35,730 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:35,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936231166] [2022-01-11 01:47:35,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:35,730 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:35,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:35,770 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:35,770 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:35,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936231166] [2022-01-11 01:47:35,770 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936231166] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:35,770 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:35,770 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:35,770 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472380258] [2022-01-11 01:47:35,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:35,771 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:35,771 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:35,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:35,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:35,772 INFO L87 Difference]: Start difference. First operand 2156 states and 3156 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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:35,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:35,891 INFO L93 Difference]: Finished difference Result 4289 states and 6279 transitions. [2022-01-11 01:47:35,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:35,892 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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 132 [2022-01-11 01:47:35,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:35,895 INFO L225 Difference]: With dead ends: 4289 [2022-01-11 01:47:35,896 INFO L226 Difference]: Without dead ends: 2156 [2022-01-11 01:47:35,898 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:35,899 INFO L933 BasicCegarLoop]: 1719 mSDtfsCounter, 1702 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1702 SdHoareTripleChecker+Valid, 1719 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:35,899 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1702 Valid, 1719 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:35,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2156 states. [2022-01-11 01:47:36,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2156 to 2156. [2022-01-11 01:47:36,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2156 states, 2154 states have (on average 1.4614670380687094) internal successors, (3148), 2155 states have internal predecessors, (3148), 0 states have call successors, (0), 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:36,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2156 states to 2156 states and 3148 transitions. [2022-01-11 01:47:36,026 INFO L78 Accepts]: Start accepts. Automaton has 2156 states and 3148 transitions. Word has length 132 [2022-01-11 01:47:36,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:36,027 INFO L470 AbstractCegarLoop]: Abstraction has 2156 states and 3148 transitions. [2022-01-11 01:47:36,027 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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:36,027 INFO L276 IsEmpty]: Start isEmpty. Operand 2156 states and 3148 transitions. [2022-01-11 01:47:36,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-01-11 01:47:36,028 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:36,028 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] [2022-01-11 01:47:36,028 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-11 01:47:36,028 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:36,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:36,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1642727239, now seen corresponding path program 1 times [2022-01-11 01:47:36,029 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:36,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463463456] [2022-01-11 01:47:36,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:36,029 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:36,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:36,065 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:36,065 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:36,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463463456] [2022-01-11 01:47:36,066 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463463456] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:36,066 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:36,066 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:36,066 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300799119] [2022-01-11 01:47:36,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:36,066 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:36,066 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:36,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:36,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:36,067 INFO L87 Difference]: Start difference. First operand 2156 states and 3148 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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:36,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:36,188 INFO L93 Difference]: Finished difference Result 4288 states and 6262 transitions. [2022-01-11 01:47:36,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:36,189 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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 132 [2022-01-11 01:47:36,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:36,193 INFO L225 Difference]: With dead ends: 4288 [2022-01-11 01:47:36,193 INFO L226 Difference]: Without dead ends: 2156 [2022-01-11 01:47:36,196 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:36,196 INFO L933 BasicCegarLoop]: 1714 mSDtfsCounter, 1696 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1696 SdHoareTripleChecker+Valid, 1714 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:36,196 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1696 Valid, 1714 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:36,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2156 states. [2022-01-11 01:47:36,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2156 to 2156. [2022-01-11 01:47:36,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2156 states, 2154 states have (on average 1.457753017641597) internal successors, (3140), 2155 states have internal predecessors, (3140), 0 states have call successors, (0), 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:36,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2156 states to 2156 states and 3140 transitions. [2022-01-11 01:47:36,326 INFO L78 Accepts]: Start accepts. Automaton has 2156 states and 3140 transitions. Word has length 132 [2022-01-11 01:47:36,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:36,326 INFO L470 AbstractCegarLoop]: Abstraction has 2156 states and 3140 transitions. [2022-01-11 01:47:36,326 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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:36,326 INFO L276 IsEmpty]: Start isEmpty. Operand 2156 states and 3140 transitions. [2022-01-11 01:47:36,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-01-11 01:47:36,327 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:36,328 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] [2022-01-11 01:47:36,328 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-11 01:47:36,328 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:36,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:36,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1878211225, now seen corresponding path program 1 times [2022-01-11 01:47:36,328 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:36,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113991655] [2022-01-11 01:47:36,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:36,329 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:36,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:36,365 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:36,366 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:36,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113991655] [2022-01-11 01:47:36,366 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113991655] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:36,366 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:36,366 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:36,366 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110266927] [2022-01-11 01:47:36,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:36,367 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:36,367 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:36,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:36,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:36,367 INFO L87 Difference]: Start difference. First operand 2156 states and 3140 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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:36,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:36,551 INFO L93 Difference]: Finished difference Result 4287 states and 6245 transitions. [2022-01-11 01:47:36,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:36,552 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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 132 [2022-01-11 01:47:36,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:36,556 INFO L225 Difference]: With dead ends: 4287 [2022-01-11 01:47:36,556 INFO L226 Difference]: Without dead ends: 2156 [2022-01-11 01:47:36,559 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:36,559 INFO L933 BasicCegarLoop]: 1709 mSDtfsCounter, 1690 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1690 SdHoareTripleChecker+Valid, 1709 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:36,560 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1690 Valid, 1709 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:36,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2156 states. [2022-01-11 01:47:36,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2156 to 2156. [2022-01-11 01:47:36,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2156 states, 2154 states have (on average 1.4540389972144847) internal successors, (3132), 2155 states have internal predecessors, (3132), 0 states have call successors, (0), 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:36,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2156 states to 2156 states and 3132 transitions. [2022-01-11 01:47:36,687 INFO L78 Accepts]: Start accepts. Automaton has 2156 states and 3132 transitions. Word has length 132 [2022-01-11 01:47:36,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:36,687 INFO L470 AbstractCegarLoop]: Abstraction has 2156 states and 3132 transitions. [2022-01-11 01:47:36,687 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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:36,687 INFO L276 IsEmpty]: Start isEmpty. Operand 2156 states and 3132 transitions. [2022-01-11 01:47:36,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-01-11 01:47:36,688 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:36,688 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] [2022-01-11 01:47:36,688 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-11 01:47:36,688 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:36,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:36,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1853242553, now seen corresponding path program 1 times [2022-01-11 01:47:36,689 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:36,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271215487] [2022-01-11 01:47:36,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:36,689 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:36,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:36,725 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:36,725 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:36,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271215487] [2022-01-11 01:47:36,725 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271215487] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:36,725 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:36,725 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:36,725 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776025849] [2022-01-11 01:47:36,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:36,726 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:36,726 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:36,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:36,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:36,726 INFO L87 Difference]: Start difference. First operand 2156 states and 3132 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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:36,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:36,852 INFO L93 Difference]: Finished difference Result 4286 states and 6228 transitions. [2022-01-11 01:47:36,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:36,852 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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 132 [2022-01-11 01:47:36,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:36,856 INFO L225 Difference]: With dead ends: 4286 [2022-01-11 01:47:36,856 INFO L226 Difference]: Without dead ends: 2156 [2022-01-11 01:47:36,858 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:36,859 INFO L933 BasicCegarLoop]: 1704 mSDtfsCounter, 1684 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1684 SdHoareTripleChecker+Valid, 1704 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:36,859 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1684 Valid, 1704 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:36,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2156 states. [2022-01-11 01:47:36,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2156 to 2156. [2022-01-11 01:47:36,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2156 states, 2154 states have (on average 1.4503249767873723) internal successors, (3124), 2155 states have internal predecessors, (3124), 0 states have call successors, (0), 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:36,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2156 states to 2156 states and 3124 transitions. [2022-01-11 01:47:36,994 INFO L78 Accepts]: Start accepts. Automaton has 2156 states and 3124 transitions. Word has length 132 [2022-01-11 01:47:36,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:36,994 INFO L470 AbstractCegarLoop]: Abstraction has 2156 states and 3124 transitions. [2022-01-11 01:47:36,994 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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:36,994 INFO L276 IsEmpty]: Start isEmpty. Operand 2156 states and 3124 transitions. [2022-01-11 01:47:36,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-01-11 01:47:36,995 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:36,995 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] [2022-01-11 01:47:36,996 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-11 01:47:36,996 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:36,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:36,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1334151527, now seen corresponding path program 1 times [2022-01-11 01:47:36,996 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:36,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891497976] [2022-01-11 01:47:36,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:36,997 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:37,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:37,045 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,046 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:37,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891497976] [2022-01-11 01:47:37,046 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891497976] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:37,046 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:37,046 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:37,046 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368643631] [2022-01-11 01:47:37,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:37,047 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:37,047 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:37,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:37,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:37,047 INFO L87 Difference]: Start difference. First operand 2156 states and 3124 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:37,198 INFO L93 Difference]: Finished difference Result 4285 states and 6211 transitions. [2022-01-11 01:47:37,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:37,199 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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 132 [2022-01-11 01:47:37,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:37,203 INFO L225 Difference]: With dead ends: 4285 [2022-01-11 01:47:37,203 INFO L226 Difference]: Without dead ends: 2156 [2022-01-11 01:47:37,206 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:37,207 INFO L933 BasicCegarLoop]: 1675 mSDtfsCounter, 1564 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1564 SdHoareTripleChecker+Valid, 1773 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:37,208 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1564 Valid, 1773 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:37,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2156 states. [2022-01-11 01:47:37,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2156 to 2156. [2022-01-11 01:47:37,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2156 states, 2154 states have (on average 1.436397400185701) internal successors, (3094), 2155 states have internal predecessors, (3094), 0 states have call successors, (0), 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,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2156 states to 2156 states and 3094 transitions. [2022-01-11 01:47:37,329 INFO L78 Accepts]: Start accepts. Automaton has 2156 states and 3094 transitions. Word has length 132 [2022-01-11 01:47:37,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:37,329 INFO L470 AbstractCegarLoop]: Abstraction has 2156 states and 3094 transitions. [2022-01-11 01:47:37,329 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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,329 INFO L276 IsEmpty]: Start isEmpty. Operand 2156 states and 3094 transitions. [2022-01-11 01:47:37,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-01-11 01:47:37,330 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:37,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] [2022-01-11 01:47:37,330 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-11 01:47:37,331 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:37,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:37,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1776166968, now seen corresponding path program 1 times [2022-01-11 01:47:37,331 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:37,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413765073] [2022-01-11 01:47:37,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:37,331 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:37,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:37,370 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,371 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:37,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413765073] [2022-01-11 01:47:37,371 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413765073] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:37,371 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:37,371 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:37,371 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720045147] [2022-01-11 01:47:37,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:37,371 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:37,371 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:37,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:37,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:37,372 INFO L87 Difference]: Start difference. First operand 2156 states and 3094 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:37,555 INFO L93 Difference]: Finished difference Result 4284 states and 6150 transitions. [2022-01-11 01:47:37,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:37,555 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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 132 [2022-01-11 01:47:37,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:37,559 INFO L225 Difference]: With dead ends: 4284 [2022-01-11 01:47:37,559 INFO L226 Difference]: Without dead ends: 2156 [2022-01-11 01:47:37,561 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:37,562 INFO L933 BasicCegarLoop]: 1658 mSDtfsCounter, 1547 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1547 SdHoareTripleChecker+Valid, 1755 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:37,562 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1547 Valid, 1755 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:37,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2156 states. [2022-01-11 01:47:37,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2156 to 2156. [2022-01-11 01:47:37,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2156 states, 2154 states have (on average 1.4224698235840296) internal successors, (3064), 2155 states have internal predecessors, (3064), 0 states have call successors, (0), 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,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2156 states to 2156 states and 3064 transitions. [2022-01-11 01:47:37,684 INFO L78 Accepts]: Start accepts. Automaton has 2156 states and 3064 transitions. Word has length 132 [2022-01-11 01:47:37,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:37,684 INFO L470 AbstractCegarLoop]: Abstraction has 2156 states and 3064 transitions. [2022-01-11 01:47:37,684 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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,684 INFO L276 IsEmpty]: Start isEmpty. Operand 2156 states and 3064 transitions. [2022-01-11 01:47:37,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-01-11 01:47:37,685 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:37,686 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] [2022-01-11 01:47:37,686 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-11 01:47:37,686 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:37,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:37,686 INFO L85 PathProgramCache]: Analyzing trace with hash 388320471, now seen corresponding path program 1 times [2022-01-11 01:47:37,687 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:37,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706797971] [2022-01-11 01:47:37,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:37,687 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:37,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:37,725 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,725 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:37,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706797971] [2022-01-11 01:47:37,725 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706797971] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:37,725 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:37,726 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:37,726 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991344331] [2022-01-11 01:47:37,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:37,726 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:37,726 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:37,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:37,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:37,727 INFO L87 Difference]: Start difference. First operand 2156 states and 3064 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:37,884 INFO L93 Difference]: Finished difference Result 4283 states and 6089 transitions. [2022-01-11 01:47:37,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:37,884 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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 132 [2022-01-11 01:47:37,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:37,888 INFO L225 Difference]: With dead ends: 4283 [2022-01-11 01:47:37,888 INFO L226 Difference]: Without dead ends: 2156 [2022-01-11 01:47:37,891 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:37,891 INFO L933 BasicCegarLoop]: 1641 mSDtfsCounter, 1530 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1530 SdHoareTripleChecker+Valid, 1737 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:37,892 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1530 Valid, 1737 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:37,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2156 states. [2022-01-11 01:47:38,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2156 to 2156. [2022-01-11 01:47:38,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2156 states, 2154 states have (on average 1.4085422469823583) internal successors, (3034), 2155 states have internal predecessors, (3034), 0 states have call successors, (0), 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,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2156 states to 2156 states and 3034 transitions. [2022-01-11 01:47:38,038 INFO L78 Accepts]: Start accepts. Automaton has 2156 states and 3034 transitions. Word has length 132 [2022-01-11 01:47:38,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:38,038 INFO L470 AbstractCegarLoop]: Abstraction has 2156 states and 3034 transitions. [2022-01-11 01:47:38,039 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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,039 INFO L276 IsEmpty]: Start isEmpty. Operand 2156 states and 3034 transitions. [2022-01-11 01:47:38,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-01-11 01:47:38,040 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:38,040 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,040 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-11 01:47:38,040 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:38,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:38,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1885532938, now seen corresponding path program 1 times [2022-01-11 01:47:38,041 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:38,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249704272] [2022-01-11 01:47:38,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:38,041 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:38,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:38,083 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,084 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:38,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249704272] [2022-01-11 01:47:38,084 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249704272] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:38,084 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:38,084 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:38,084 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521347885] [2022-01-11 01:47:38,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:38,084 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:38,085 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:38,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:38,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:38,085 INFO L87 Difference]: Start difference. First operand 2156 states and 3034 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:38,247 INFO L93 Difference]: Finished difference Result 4282 states and 6028 transitions. [2022-01-11 01:47:38,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:38,248 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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 132 [2022-01-11 01:47:38,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:38,252 INFO L225 Difference]: With dead ends: 4282 [2022-01-11 01:47:38,252 INFO L226 Difference]: Without dead ends: 2156 [2022-01-11 01:47:38,254 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:38,255 INFO L933 BasicCegarLoop]: 1624 mSDtfsCounter, 1513 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1513 SdHoareTripleChecker+Valid, 1719 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:38,255 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1513 Valid, 1719 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:38,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2156 states. [2022-01-11 01:47:38,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2156 to 2156. [2022-01-11 01:47:38,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2156 states, 2154 states have (on average 1.3946146703806872) internal successors, (3004), 2155 states have internal predecessors, (3004), 0 states have call successors, (0), 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,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2156 states to 2156 states and 3004 transitions. [2022-01-11 01:47:38,379 INFO L78 Accepts]: Start accepts. Automaton has 2156 states and 3004 transitions. Word has length 132 [2022-01-11 01:47:38,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:38,379 INFO L470 AbstractCegarLoop]: Abstraction has 2156 states and 3004 transitions. [2022-01-11 01:47:38,379 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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,379 INFO L276 IsEmpty]: Start isEmpty. Operand 2156 states and 3004 transitions. [2022-01-11 01:47:38,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-01-11 01:47:38,380 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:38,380 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,381 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-01-11 01:47:38,381 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:38,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:38,381 INFO L85 PathProgramCache]: Analyzing trace with hash -561639403, now seen corresponding path program 1 times [2022-01-11 01:47:38,381 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:38,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951913927] [2022-01-11 01:47:38,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:38,381 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:38,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:38,414 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,414 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:38,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951913927] [2022-01-11 01:47:38,414 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951913927] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:38,414 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:38,414 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:38,414 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955743538] [2022-01-11 01:47:38,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:38,415 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:38,415 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:38,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:38,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:38,415 INFO L87 Difference]: Start difference. First operand 2156 states and 3004 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:38,631 INFO L93 Difference]: Finished difference Result 4281 states and 5967 transitions. [2022-01-11 01:47:38,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:38,632 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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 132 [2022-01-11 01:47:38,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:38,636 INFO L225 Difference]: With dead ends: 4281 [2022-01-11 01:47:38,636 INFO L226 Difference]: Without dead ends: 2156 [2022-01-11 01:47:38,638 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:38,639 INFO L933 BasicCegarLoop]: 1607 mSDtfsCounter, 1496 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1496 SdHoareTripleChecker+Valid, 1701 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:38,639 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1496 Valid, 1701 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:38,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2156 states. [2022-01-11 01:47:38,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2156 to 2156. [2022-01-11 01:47:38,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2156 states, 2154 states have (on average 1.3806870937790159) internal successors, (2974), 2155 states have internal predecessors, (2974), 0 states have call successors, (0), 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,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2156 states to 2156 states and 2974 transitions. [2022-01-11 01:47:38,806 INFO L78 Accepts]: Start accepts. Automaton has 2156 states and 2974 transitions. Word has length 132 [2022-01-11 01:47:38,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:38,806 INFO L470 AbstractCegarLoop]: Abstraction has 2156 states and 2974 transitions. [2022-01-11 01:47:38,806 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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,806 INFO L276 IsEmpty]: Start isEmpty. Operand 2156 states and 2974 transitions. [2022-01-11 01:47:38,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-01-11 01:47:38,807 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:38,807 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] [2022-01-11 01:47:38,807 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-01-11 01:47:38,808 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:38,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:38,808 INFO L85 PathProgramCache]: Analyzing trace with hash 141139636, now seen corresponding path program 1 times [2022-01-11 01:47:38,808 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:38,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722005711] [2022-01-11 01:47:38,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:38,808 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:38,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:38,854 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,855 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:38,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722005711] [2022-01-11 01:47:38,856 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722005711] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:38,856 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:38,856 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:38,856 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180606991] [2022-01-11 01:47:38,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:38,856 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:38,856 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:38,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:38,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:38,857 INFO L87 Difference]: Start difference. First operand 2156 states and 2974 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:39,033 INFO L93 Difference]: Finished difference Result 4280 states and 5906 transitions. [2022-01-11 01:47:39,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:39,033 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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 132 [2022-01-11 01:47:39,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:39,038 INFO L225 Difference]: With dead ends: 4280 [2022-01-11 01:47:39,038 INFO L226 Difference]: Without dead ends: 2156 [2022-01-11 01:47:39,041 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:39,044 INFO L933 BasicCegarLoop]: 1590 mSDtfsCounter, 1479 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1479 SdHoareTripleChecker+Valid, 1683 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:39,044 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1479 Valid, 1683 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:39,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2156 states. [2022-01-11 01:47:39,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2156 to 2156. [2022-01-11 01:47:39,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2156 states, 2154 states have (on average 1.3667595171773446) internal successors, (2944), 2155 states have internal predecessors, (2944), 0 states have call successors, (0), 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,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2156 states to 2156 states and 2944 transitions. [2022-01-11 01:47:39,184 INFO L78 Accepts]: Start accepts. Automaton has 2156 states and 2944 transitions. Word has length 132 [2022-01-11 01:47:39,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:39,184 INFO L470 AbstractCegarLoop]: Abstraction has 2156 states and 2944 transitions. [2022-01-11 01:47:39,184 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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,184 INFO L276 IsEmpty]: Start isEmpty. Operand 2156 states and 2944 transitions. [2022-01-11 01:47:39,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-01-11 01:47:39,185 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:39,185 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] [2022-01-11 01:47:39,185 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-01-11 01:47:39,186 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:39,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:39,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1818738605, now seen corresponding path program 1 times [2022-01-11 01:47:39,186 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:39,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832461091] [2022-01-11 01:47:39,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:39,187 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:39,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:39,256 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:39,256 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:39,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832461091] [2022-01-11 01:47:39,257 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832461091] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:39,257 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:39,257 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:39,257 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495547140] [2022-01-11 01:47:39,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:39,257 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:39,257 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:39,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:39,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:39,258 INFO L87 Difference]: Start difference. First operand 2156 states and 2944 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:39,429 INFO L93 Difference]: Finished difference Result 4279 states and 5845 transitions. [2022-01-11 01:47:39,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:39,429 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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 132 [2022-01-11 01:47:39,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:39,433 INFO L225 Difference]: With dead ends: 4279 [2022-01-11 01:47:39,433 INFO L226 Difference]: Without dead ends: 2156 [2022-01-11 01:47:39,436 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:39,436 INFO L933 BasicCegarLoop]: 1573 mSDtfsCounter, 1462 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1462 SdHoareTripleChecker+Valid, 1665 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:39,436 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1462 Valid, 1665 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:39,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2156 states. [2022-01-11 01:47:39,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2156 to 2156. [2022-01-11 01:47:39,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2156 states, 2154 states have (on average 1.3528319405756732) internal successors, (2914), 2155 states have internal predecessors, (2914), 0 states have call successors, (0), 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,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2156 states to 2156 states and 2914 transitions. [2022-01-11 01:47:39,565 INFO L78 Accepts]: Start accepts. Automaton has 2156 states and 2914 transitions. Word has length 132 [2022-01-11 01:47:39,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:39,565 INFO L470 AbstractCegarLoop]: Abstraction has 2156 states and 2914 transitions. [2022-01-11 01:47:39,565 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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,566 INFO L276 IsEmpty]: Start isEmpty. Operand 2156 states and 2914 transitions. [2022-01-11 01:47:39,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-01-11 01:47:39,566 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:39,566 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] [2022-01-11 01:47:39,566 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-01-11 01:47:39,567 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:39,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:39,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1147100530, now seen corresponding path program 1 times [2022-01-11 01:47:39,567 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:39,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137714] [2022-01-11 01:47:39,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:39,567 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:39,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:39,611 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:39,611 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:39,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137714] [2022-01-11 01:47:39,611 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137714] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:39,612 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:39,612 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:39,612 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068469089] [2022-01-11 01:47:39,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:39,612 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:39,612 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:39,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:39,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:39,613 INFO L87 Difference]: Start difference. First operand 2156 states and 2914 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:39,783 INFO L93 Difference]: Finished difference Result 4278 states and 5784 transitions. [2022-01-11 01:47:39,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:39,784 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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 132 [2022-01-11 01:47:39,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:39,787 INFO L225 Difference]: With dead ends: 4278 [2022-01-11 01:47:39,787 INFO L226 Difference]: Without dead ends: 2156 [2022-01-11 01:47:39,790 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:39,790 INFO L933 BasicCegarLoop]: 1556 mSDtfsCounter, 1445 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1445 SdHoareTripleChecker+Valid, 1647 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:39,791 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1445 Valid, 1647 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:39,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2156 states. [2022-01-11 01:47:39,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2156 to 2156. [2022-01-11 01:47:39,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2156 states, 2154 states have (on average 1.338904363974002) internal successors, (2884), 2155 states have internal predecessors, (2884), 0 states have call successors, (0), 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,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2156 states to 2156 states and 2884 transitions. [2022-01-11 01:47:39,950 INFO L78 Accepts]: Start accepts. Automaton has 2156 states and 2884 transitions. Word has length 132 [2022-01-11 01:47:39,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:39,950 INFO L470 AbstractCegarLoop]: Abstraction has 2156 states and 2884 transitions. [2022-01-11 01:47:39,950 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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,950 INFO L276 IsEmpty]: Start isEmpty. Operand 2156 states and 2884 transitions. [2022-01-11 01:47:39,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-01-11 01:47:39,951 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:39,951 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] [2022-01-11 01:47:39,951 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-01-11 01:47:39,952 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:39,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:39,952 INFO L85 PathProgramCache]: Analyzing trace with hash 278355345, now seen corresponding path program 1 times [2022-01-11 01:47:39,952 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:39,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545588714] [2022-01-11 01:47:39,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:39,953 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:39,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:39,988 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:39,988 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:39,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545588714] [2022-01-11 01:47:39,988 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545588714] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:39,988 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:39,988 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:39,988 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138026397] [2022-01-11 01:47:39,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:39,989 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:39,989 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:39,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:39,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:39,990 INFO L87 Difference]: Start difference. First operand 2156 states and 2884 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:40,164 INFO L93 Difference]: Finished difference Result 4277 states and 5723 transitions. [2022-01-11 01:47:40,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:40,165 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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 132 [2022-01-11 01:47:40,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:40,173 INFO L225 Difference]: With dead ends: 4277 [2022-01-11 01:47:40,173 INFO L226 Difference]: Without dead ends: 2156 [2022-01-11 01:47:40,177 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:40,177 INFO L933 BasicCegarLoop]: 1539 mSDtfsCounter, 1428 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1428 SdHoareTripleChecker+Valid, 1629 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:40,177 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1428 Valid, 1629 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:40,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2156 states. [2022-01-11 01:47:40,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2156 to 2156. [2022-01-11 01:47:40,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2156 states, 2154 states have (on average 1.3249767873723306) internal successors, (2854), 2155 states have internal predecessors, (2854), 0 states have call successors, (0), 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,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2156 states to 2156 states and 2854 transitions. [2022-01-11 01:47:40,304 INFO L78 Accepts]: Start accepts. Automaton has 2156 states and 2854 transitions. Word has length 132 [2022-01-11 01:47:40,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:40,304 INFO L470 AbstractCegarLoop]: Abstraction has 2156 states and 2854 transitions. [2022-01-11 01:47:40,304 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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,304 INFO L276 IsEmpty]: Start isEmpty. Operand 2156 states and 2854 transitions. [2022-01-11 01:47:40,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-01-11 01:47:40,305 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:40,305 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] [2022-01-11 01:47:40,305 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-01-11 01:47:40,305 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:40,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:40,306 INFO L85 PathProgramCache]: Analyzing trace with hash 282708272, now seen corresponding path program 1 times [2022-01-11 01:47:40,306 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:40,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490471528] [2022-01-11 01:47:40,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:40,306 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:40,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:40,342 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:40,342 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:40,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490471528] [2022-01-11 01:47:40,342 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490471528] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:40,342 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:40,343 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:40,343 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768467926] [2022-01-11 01:47:40,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:40,343 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:40,343 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:40,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:40,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:40,344 INFO L87 Difference]: Start difference. First operand 2156 states and 2854 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:40,527 INFO L93 Difference]: Finished difference Result 4276 states and 5662 transitions. [2022-01-11 01:47:40,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:40,527 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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 132 [2022-01-11 01:47:40,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:40,530 INFO L225 Difference]: With dead ends: 4276 [2022-01-11 01:47:40,530 INFO L226 Difference]: Without dead ends: 2156 [2022-01-11 01:47:40,532 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:40,532 INFO L933 BasicCegarLoop]: 1522 mSDtfsCounter, 1411 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1411 SdHoareTripleChecker+Valid, 1611 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:40,533 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1411 Valid, 1611 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:40,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2156 states. [2022-01-11 01:47:40,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2156 to 2156. [2022-01-11 01:47:40,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2156 states, 2154 states have (on average 1.3110492107706593) internal successors, (2824), 2155 states have internal predecessors, (2824), 0 states have call successors, (0), 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,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2156 states to 2156 states and 2824 transitions. [2022-01-11 01:47:40,679 INFO L78 Accepts]: Start accepts. Automaton has 2156 states and 2824 transitions. Word has length 132 [2022-01-11 01:47:40,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:40,680 INFO L470 AbstractCegarLoop]: Abstraction has 2156 states and 2824 transitions. [2022-01-11 01:47:40,680 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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,680 INFO L276 IsEmpty]: Start isEmpty. Operand 2156 states and 2824 transitions. [2022-01-11 01:47:40,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-01-11 01:47:40,681 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:40,681 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] [2022-01-11 01:47:40,681 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-01-11 01:47:40,681 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:40,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:40,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1560209359, now seen corresponding path program 1 times [2022-01-11 01:47:40,682 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:40,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851267039] [2022-01-11 01:47:40,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:40,682 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:40,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:40,735 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:40,735 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:40,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851267039] [2022-01-11 01:47:40,735 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851267039] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:40,735 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:40,735 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 01:47:40,735 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122960096] [2022-01-11 01:47:40,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:40,736 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 01:47:40,736 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:40,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 01:47:40,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 01:47:40,736 INFO L87 Difference]: Start difference. First operand 2156 states and 2824 transitions. Second operand has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 0 states have call successors, (0), 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,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:41,098 INFO L93 Difference]: Finished difference Result 5031 states and 6656 transitions. [2022-01-11 01:47:41,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 01:47:41,099 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 0 states have call successors, (0), 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 132 [2022-01-11 01:47:41,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:41,104 INFO L225 Difference]: With dead ends: 5031 [2022-01-11 01:47:41,104 INFO L226 Difference]: Without dead ends: 2918 [2022-01-11 01:47:41,107 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:41,107 INFO L933 BasicCegarLoop]: 1657 mSDtfsCounter, 4376 mSDsluCounter, 1556 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4376 SdHoareTripleChecker+Valid, 3213 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:41,107 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4376 Valid, 3213 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 01:47:41,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2918 states. [2022-01-11 01:47:41,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2918 to 2162. [2022-01-11 01:47:41,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2162 states, 2160 states have (on average 1.3) internal successors, (2808), 2161 states have internal predecessors, (2808), 0 states have call successors, (0), 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,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2162 states to 2162 states and 2808 transitions. [2022-01-11 01:47:41,402 INFO L78 Accepts]: Start accepts. Automaton has 2162 states and 2808 transitions. Word has length 132 [2022-01-11 01:47:41,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:41,403 INFO L470 AbstractCegarLoop]: Abstraction has 2162 states and 2808 transitions. [2022-01-11 01:47:41,403 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 0 states have call successors, (0), 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,403 INFO L276 IsEmpty]: Start isEmpty. Operand 2162 states and 2808 transitions. [2022-01-11 01:47:41,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-01-11 01:47:41,403 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:41,404 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] [2022-01-11 01:47:41,404 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-01-11 01:47:41,404 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:41,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:41,404 INFO L85 PathProgramCache]: Analyzing trace with hash 589918352, now seen corresponding path program 1 times [2022-01-11 01:47:41,405 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:41,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368096657] [2022-01-11 01:47:41,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:41,405 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:41,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:41,463 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,463 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:41,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368096657] [2022-01-11 01:47:41,464 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368096657] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:41,464 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:41,464 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 01:47:41,464 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338791886] [2022-01-11 01:47:41,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:41,464 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 01:47:41,465 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:41,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 01:47:41,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 01:47:41,465 INFO L87 Difference]: Start difference. First operand 2162 states and 2808 transitions. Second operand has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 0 states have call successors, (0), 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,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:41,910 INFO L93 Difference]: Finished difference Result 5287 states and 6921 transitions. [2022-01-11 01:47:41,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 01:47:41,911 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 0 states have call successors, (0), 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 132 [2022-01-11 01:47:41,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:41,915 INFO L225 Difference]: With dead ends: 5287 [2022-01-11 01:47:41,915 INFO L226 Difference]: Without dead ends: 3182 [2022-01-11 01:47:41,918 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:41,918 INFO L933 BasicCegarLoop]: 1609 mSDtfsCounter, 4082 mSDsluCounter, 2126 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4082 SdHoareTripleChecker+Valid, 3735 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:41,918 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4082 Valid, 3735 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 01:47:41,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3182 states. [2022-01-11 01:47:42,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3182 to 2168. [2022-01-11 01:47:42,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2168 states, 2166 states have (on average 1.289012003693444) internal successors, (2792), 2167 states have internal predecessors, (2792), 0 states have call successors, (0), 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,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2168 states to 2168 states and 2792 transitions. [2022-01-11 01:47:42,120 INFO L78 Accepts]: Start accepts. Automaton has 2168 states and 2792 transitions. Word has length 132 [2022-01-11 01:47:42,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:42,120 INFO L470 AbstractCegarLoop]: Abstraction has 2168 states and 2792 transitions. [2022-01-11 01:47:42,120 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 0 states have call successors, (0), 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,120 INFO L276 IsEmpty]: Start isEmpty. Operand 2168 states and 2792 transitions. [2022-01-11 01:47:42,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-01-11 01:47:42,121 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:42,121 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] [2022-01-11 01:47:42,121 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-01-11 01:47:42,121 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:42,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:42,122 INFO L85 PathProgramCache]: Analyzing trace with hash 710038225, now seen corresponding path program 1 times [2022-01-11 01:47:42,122 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:42,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553075948] [2022-01-11 01:47:42,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:42,122 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:42,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:42,173 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,173 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:42,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553075948] [2022-01-11 01:47:42,173 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553075948] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:42,174 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:42,174 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 01:47:42,174 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410723186] [2022-01-11 01:47:42,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:42,174 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 01:47:42,174 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:42,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 01:47:42,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 01:47:42,175 INFO L87 Difference]: Start difference. First operand 2168 states and 2792 transitions. Second operand has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 0 states have call successors, (0), 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,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:42,672 INFO L93 Difference]: Finished difference Result 6138 states and 7961 transitions. [2022-01-11 01:47:42,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 01:47:42,673 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 0 states have call successors, (0), 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 132 [2022-01-11 01:47:42,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:42,679 INFO L225 Difference]: With dead ends: 6138 [2022-01-11 01:47:42,679 INFO L226 Difference]: Without dead ends: 4076 [2022-01-11 01:47:42,682 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:42,683 INFO L933 BasicCegarLoop]: 1464 mSDtfsCounter, 3111 mSDsluCounter, 4128 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3111 SdHoareTripleChecker+Valid, 5592 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:42,683 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3111 Valid, 5592 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 01:47:42,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4076 states. [2022-01-11 01:47:42,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4076 to 2174. [2022-01-11 01:47:42,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2174 states, 2172 states have (on average 1.278084714548803) internal successors, (2776), 2173 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:42,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2174 states to 2174 states and 2776 transitions. [2022-01-11 01:47:42,891 INFO L78 Accepts]: Start accepts. Automaton has 2174 states and 2776 transitions. Word has length 132 [2022-01-11 01:47:42,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:42,892 INFO L470 AbstractCegarLoop]: Abstraction has 2174 states and 2776 transitions. [2022-01-11 01:47:42,892 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 0 states have call successors, (0), 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,892 INFO L276 IsEmpty]: Start isEmpty. Operand 2174 states and 2776 transitions. [2022-01-11 01:47:42,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-01-11 01:47:42,892 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:42,893 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] [2022-01-11 01:47:42,893 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-01-11 01:47:42,893 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:42,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:42,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1039803986, now seen corresponding path program 1 times [2022-01-11 01:47:42,893 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:42,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518582123] [2022-01-11 01:47:42,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:42,893 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:42,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:42,945 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,946 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:42,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518582123] [2022-01-11 01:47:42,946 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518582123] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:42,946 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:42,946 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:42,946 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381147493] [2022-01-11 01:47:42,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:42,946 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:42,946 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:42,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:42,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:42,947 INFO L87 Difference]: Start difference. First operand 2174 states and 2776 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:43,371 INFO L93 Difference]: Finished difference Result 6306 states and 8060 transitions. [2022-01-11 01:47:43,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:43,371 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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 132 [2022-01-11 01:47:43,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:43,375 INFO L225 Difference]: With dead ends: 6306 [2022-01-11 01:47:43,375 INFO L226 Difference]: Without dead ends: 4170 [2022-01-11 01:47:43,378 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,378 INFO L933 BasicCegarLoop]: 1487 mSDtfsCounter, 1328 mSDsluCounter, 1320 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1328 SdHoareTripleChecker+Valid, 2807 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:43,378 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1328 Valid, 2807 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:43,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4170 states. [2022-01-11 01:47:43,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4170 to 4032. [2022-01-11 01:47:43,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4032 states, 4030 states have (on average 1.2739454094292804) internal successors, (5134), 4031 states have internal predecessors, (5134), 0 states have call successors, (0), 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,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4032 states to 4032 states and 5134 transitions. [2022-01-11 01:47:43,784 INFO L78 Accepts]: Start accepts. Automaton has 4032 states and 5134 transitions. Word has length 132 [2022-01-11 01:47:43,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:43,784 INFO L470 AbstractCegarLoop]: Abstraction has 4032 states and 5134 transitions. [2022-01-11 01:47:43,785 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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,785 INFO L276 IsEmpty]: Start isEmpty. Operand 4032 states and 5134 transitions. [2022-01-11 01:47:43,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2022-01-11 01:47:43,787 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:43,788 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] [2022-01-11 01:47:43,788 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-01-11 01:47:43,788 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:43,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:43,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1465323241, now seen corresponding path program 1 times [2022-01-11 01:47:43,789 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:43,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60044089] [2022-01-11 01:47:43,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:43,789 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:43,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:43,850 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:43,851 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:43,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60044089] [2022-01-11 01:47:43,851 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60044089] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:43,851 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:43,851 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:47:43,851 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999714435] [2022-01-11 01:47:43,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:43,853 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:43,853 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:43,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:43,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:43,853 INFO L87 Difference]: Start difference. First operand 4032 states and 5134 transitions. Second operand has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 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,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:44,504 INFO L93 Difference]: Finished difference Result 11842 states and 15105 transitions. [2022-01-11 01:47:44,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:44,505 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 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 214 [2022-01-11 01:47:44,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:44,513 INFO L225 Difference]: With dead ends: 11842 [2022-01-11 01:47:44,513 INFO L226 Difference]: Without dead ends: 7854 [2022-01-11 01:47:44,517 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:44,517 INFO L933 BasicCegarLoop]: 1484 mSDtfsCounter, 1366 mSDsluCounter, 1320 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1366 SdHoareTripleChecker+Valid, 2804 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:44,517 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1366 Valid, 2804 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:44,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7854 states. [2022-01-11 01:47:45,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7854 to 7582. [2022-01-11 01:47:45,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7582 states, 7580 states have (on average 1.2720316622691292) internal successors, (9642), 7581 states have internal predecessors, (9642), 0 states have call successors, (0), 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,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7582 states to 7582 states and 9642 transitions. [2022-01-11 01:47:45,223 INFO L78 Accepts]: Start accepts. Automaton has 7582 states and 9642 transitions. Word has length 214 [2022-01-11 01:47:45,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:45,223 INFO L470 AbstractCegarLoop]: Abstraction has 7582 states and 9642 transitions. [2022-01-11 01:47:45,223 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 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,223 INFO L276 IsEmpty]: Start isEmpty. Operand 7582 states and 9642 transitions. [2022-01-11 01:47:45,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2022-01-11 01:47:45,227 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:45,227 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] [2022-01-11 01:47:45,227 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-01-11 01:47:45,227 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:45,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:45,228 INFO L85 PathProgramCache]: Analyzing trace with hash 765839958, now seen corresponding path program 1 times [2022-01-11 01:47:45,228 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:45,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064174896] [2022-01-11 01:47:45,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:45,228 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:45,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:45,284 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:45,285 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:45,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064174896] [2022-01-11 01:47:45,285 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064174896] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:45,285 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:45,285 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:47:45,285 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637269762] [2022-01-11 01:47:45,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:45,286 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:45,286 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:45,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:45,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:45,286 INFO L87 Difference]: Start difference. First operand 7582 states and 9642 transitions. Second operand has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 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,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:46,413 INFO L93 Difference]: Finished difference Result 22339 states and 28271 transitions. [2022-01-11 01:47:46,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:46,413 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 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 214 [2022-01-11 01:47:46,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:46,428 INFO L225 Difference]: With dead ends: 22339 [2022-01-11 01:47:46,428 INFO L226 Difference]: Without dead ends: 14883 [2022-01-11 01:47:46,434 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:46,434 INFO L933 BasicCegarLoop]: 1823 mSDtfsCounter, 1357 mSDsluCounter, 1466 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1357 SdHoareTripleChecker+Valid, 3289 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:46,435 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1357 Valid, 3289 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:46,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14883 states. [2022-01-11 01:47:47,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14883 to 14627. [2022-01-11 01:47:47,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14627 states, 14625 states have (on average 1.260102564102564) internal successors, (18429), 14626 states have internal predecessors, (18429), 0 states have call successors, (0), 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,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14627 states to 14627 states and 18429 transitions. [2022-01-11 01:47:47,647 INFO L78 Accepts]: Start accepts. Automaton has 14627 states and 18429 transitions. Word has length 214 [2022-01-11 01:47:47,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:47,647 INFO L470 AbstractCegarLoop]: Abstraction has 14627 states and 18429 transitions. [2022-01-11 01:47:47,647 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 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,647 INFO L276 IsEmpty]: Start isEmpty. Operand 14627 states and 18429 transitions. [2022-01-11 01:47:47,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2022-01-11 01:47:47,655 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:47,655 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] [2022-01-11 01:47:47,655 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-01-11 01:47:47,656 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:47,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:47,656 INFO L85 PathProgramCache]: Analyzing trace with hash 817106551, now seen corresponding path program 1 times [2022-01-11 01:47:47,656 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:47,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521475731] [2022-01-11 01:47:47,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:47,657 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:47,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:47,697 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:47:47,697 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:47,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521475731] [2022-01-11 01:47:47,697 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521475731] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:47,697 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:47,698 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:47:47,698 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132453516] [2022-01-11 01:47:47,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:47,699 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:47,699 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:47,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:47,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:47,700 INFO L87 Difference]: Start difference. First operand 14627 states and 18429 transitions. Second operand has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 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,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:48,926 INFO L93 Difference]: Finished difference Result 29087 states and 36659 transitions. [2022-01-11 01:47:48,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:48,926 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 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 214 [2022-01-11 01:47:48,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:48,941 INFO L225 Difference]: With dead ends: 29087 [2022-01-11 01:47:48,942 INFO L226 Difference]: Without dead ends: 14508 [2022-01-11 01:47:48,953 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:48,954 INFO L933 BasicCegarLoop]: 1497 mSDtfsCounter, 1492 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1492 SdHoareTripleChecker+Valid, 1498 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:47:48,954 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1492 Valid, 1498 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:48,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14508 states. [2022-01-11 01:47:50,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14508 to 14508. [2022-01-11 01:47:50,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14508 states, 14506 states have (on average 1.2606507652006067) internal successors, (18287), 14507 states have internal predecessors, (18287), 0 states have call successors, (0), 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,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14508 states to 14508 states and 18287 transitions. [2022-01-11 01:47:50,137 INFO L78 Accepts]: Start accepts. Automaton has 14508 states and 18287 transitions. Word has length 214 [2022-01-11 01:47:50,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:50,137 INFO L470 AbstractCegarLoop]: Abstraction has 14508 states and 18287 transitions. [2022-01-11 01:47:50,138 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 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,138 INFO L276 IsEmpty]: Start isEmpty. Operand 14508 states and 18287 transitions. [2022-01-11 01:47:50,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2022-01-11 01:47:50,145 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:50,145 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] [2022-01-11 01:47:50,145 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-01-11 01:47:50,146 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:50,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:50,146 INFO L85 PathProgramCache]: Analyzing trace with hash -768479001, now seen corresponding path program 1 times [2022-01-11 01:47:50,146 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:50,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196469578] [2022-01-11 01:47:50,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:50,146 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:50,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:50,210 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:50,210 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:50,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196469578] [2022-01-11 01:47:50,210 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196469578] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:50,210 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:50,210 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:47:50,211 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295268451] [2022-01-11 01:47:50,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:50,211 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:50,211 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:50,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:50,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:50,213 INFO L87 Difference]: Start difference. First operand 14508 states and 18287 transitions. Second operand has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 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,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:52,617 INFO L93 Difference]: Finished difference Result 41990 states and 52814 transitions. [2022-01-11 01:47:52,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:52,617 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 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 215 [2022-01-11 01:47:52,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:52,652 INFO L225 Difference]: With dead ends: 41990 [2022-01-11 01:47:52,653 INFO L226 Difference]: Without dead ends: 27608 [2022-01-11 01:47:52,667 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:52,667 INFO L933 BasicCegarLoop]: 2268 mSDtfsCounter, 1160 mSDsluCounter, 1476 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1160 SdHoareTripleChecker+Valid, 3744 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:52,667 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1160 Valid, 3744 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:52,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27608 states. [2022-01-11 01:47:54,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27608 to 27604. [2022-01-11 01:47:54,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27604 states, 27602 states have (on average 1.2547641475255416) internal successors, (34634), 27603 states have internal predecessors, (34634), 0 states have call successors, (0), 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,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27604 states to 27604 states and 34634 transitions. [2022-01-11 01:47:54,962 INFO L78 Accepts]: Start accepts. Automaton has 27604 states and 34634 transitions. Word has length 215 [2022-01-11 01:47:54,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:54,963 INFO L470 AbstractCegarLoop]: Abstraction has 27604 states and 34634 transitions. [2022-01-11 01:47:54,963 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 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,963 INFO L276 IsEmpty]: Start isEmpty. Operand 27604 states and 34634 transitions. [2022-01-11 01:47:54,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2022-01-11 01:47:54,978 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:54,978 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] [2022-01-11 01:47:54,978 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-01-11 01:47:54,979 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:54,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:54,979 INFO L85 PathProgramCache]: Analyzing trace with hash 942171846, now seen corresponding path program 1 times [2022-01-11 01:47:54,979 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:54,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894394258] [2022-01-11 01:47:54,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:54,980 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:54,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:55,017 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:47:55,017 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:55,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894394258] [2022-01-11 01:47:55,017 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894394258] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:55,017 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:55,017 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:47:55,017 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632538003] [2022-01-11 01:47:55,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:55,018 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:55,018 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:55,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:55,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:55,018 INFO L87 Difference]: Start difference. First operand 27604 states and 34634 transitions. Second operand has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 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,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:57,393 INFO L93 Difference]: Finished difference Result 54964 states and 68980 transitions. [2022-01-11 01:47:57,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:57,393 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 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 215 [2022-01-11 01:47:57,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:57,423 INFO L225 Difference]: With dead ends: 54964 [2022-01-11 01:47:57,423 INFO L226 Difference]: Without dead ends: 27486 [2022-01-11 01:47:57,446 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:57,446 INFO L933 BasicCegarLoop]: 1496 mSDtfsCounter, 1490 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1490 SdHoareTripleChecker+Valid, 1497 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:47:57,446 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1490 Valid, 1497 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:57,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27486 states. [2022-01-11 01:47:59,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27486 to 27486. [2022-01-11 01:47:59,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27486 states, 27484 states have (on average 1.255057487993014) internal successors, (34494), 27485 states have internal predecessors, (34494), 0 states have call successors, (0), 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:59,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27486 states to 27486 states and 34494 transitions. [2022-01-11 01:47:59,810 INFO L78 Accepts]: Start accepts. Automaton has 27486 states and 34494 transitions. Word has length 215 [2022-01-11 01:47:59,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:59,810 INFO L470 AbstractCegarLoop]: Abstraction has 27486 states and 34494 transitions. [2022-01-11 01:47:59,810 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 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:59,810 INFO L276 IsEmpty]: Start isEmpty. Operand 27486 states and 34494 transitions. [2022-01-11 01:47:59,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2022-01-11 01:47:59,822 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:59,822 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] [2022-01-11 01:47:59,822 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-01-11 01:47:59,823 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:59,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:59,823 INFO L85 PathProgramCache]: Analyzing trace with hash 360787817, now seen corresponding path program 1 times [2022-01-11 01:47:59,823 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:59,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285479294] [2022-01-11 01:47:59,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:59,824 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:59,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:59,883 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:59,883 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:59,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285479294] [2022-01-11 01:47:59,883 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285479294] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:59,883 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:59,883 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:47:59,883 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133886691] [2022-01-11 01:47:59,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:59,884 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:59,884 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:59,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:59,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:59,885 INFO L87 Difference]: Start difference. First operand 27486 states and 34494 transitions. Second operand has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 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:04,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:04,424 INFO L93 Difference]: Finished difference Result 81187 states and 101787 transitions. [2022-01-11 01:48:04,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:48:04,424 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 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 216 [2022-01-11 01:48:04,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:04,506 INFO L225 Difference]: With dead ends: 81187 [2022-01-11 01:48:04,506 INFO L226 Difference]: Without dead ends: 53827 [2022-01-11 01:48:04,545 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:04,546 INFO L933 BasicCegarLoop]: 1836 mSDtfsCounter, 1357 mSDsluCounter, 1462 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1357 SdHoareTripleChecker+Valid, 3298 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:04,546 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1357 Valid, 3298 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:04,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53827 states. [2022-01-11 01:48:08,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53827 to 52351. [2022-01-11 01:48:08,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52351 states, 52349 states have (on average 1.2517335574700568) internal successors, (65527), 52350 states have internal predecessors, (65527), 0 states have call successors, (0), 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:09,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52351 states to 52351 states and 65527 transitions. [2022-01-11 01:48:09,056 INFO L78 Accepts]: Start accepts. Automaton has 52351 states and 65527 transitions. Word has length 216 [2022-01-11 01:48:09,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:09,056 INFO L470 AbstractCegarLoop]: Abstraction has 52351 states and 65527 transitions. [2022-01-11 01:48:09,057 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 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:09,057 INFO L276 IsEmpty]: Start isEmpty. Operand 52351 states and 65527 transitions. [2022-01-11 01:48:09,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2022-01-11 01:48:09,075 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:09,075 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] [2022-01-11 01:48:09,075 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-01-11 01:48:09,076 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:48:09,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:09,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1862740361, now seen corresponding path program 1 times [2022-01-11 01:48:09,076 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:09,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391606391] [2022-01-11 01:48:09,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:09,076 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:09,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:09,112 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:09,113 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:09,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391606391] [2022-01-11 01:48:09,113 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391606391] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:09,113 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:09,113 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:48:09,113 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549289931] [2022-01-11 01:48:09,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:09,114 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:48:09,114 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:09,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:48:09,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:09,114 INFO L87 Difference]: Start difference. First operand 52351 states and 65527 transitions. Second operand has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 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:13,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:13,670 INFO L93 Difference]: Finished difference Result 104523 states and 130844 transitions. [2022-01-11 01:48:13,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:48:13,671 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 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 216 [2022-01-11 01:48:13,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:13,753 INFO L225 Difference]: With dead ends: 104523 [2022-01-11 01:48:13,753 INFO L226 Difference]: Without dead ends: 52234 [2022-01-11 01:48:13,789 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:13,789 INFO L933 BasicCegarLoop]: 1495 mSDtfsCounter, 1488 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1488 SdHoareTripleChecker+Valid, 1496 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:13,790 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1488 Valid, 1496 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:13,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52234 states. [2022-01-11 01:48:18,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52234 to 52234. [2022-01-11 01:48:18,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52234 states, 52232 states have (on average 1.2518953897993568) internal successors, (65389), 52233 states have internal predecessors, (65389), 0 states have call successors, (0), 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:18,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52234 states to 52234 states and 65389 transitions. [2022-01-11 01:48:18,469 INFO L78 Accepts]: Start accepts. Automaton has 52234 states and 65389 transitions. Word has length 216 [2022-01-11 01:48:18,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:18,469 INFO L470 AbstractCegarLoop]: Abstraction has 52234 states and 65389 transitions. [2022-01-11 01:48:18,469 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 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:18,469 INFO L276 IsEmpty]: Start isEmpty. Operand 52234 states and 65389 transitions. [2022-01-11 01:48:18,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2022-01-11 01:48:18,586 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:18,587 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] [2022-01-11 01:48:18,587 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-01-11 01:48:18,587 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:48:18,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:18,587 INFO L85 PathProgramCache]: Analyzing trace with hash -660272424, now seen corresponding path program 1 times [2022-01-11 01:48:18,587 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:18,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028801669] [2022-01-11 01:48:18,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:18,588 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:18,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:18,660 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:18,661 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:18,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028801669] [2022-01-11 01:48:18,661 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028801669] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:18,661 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:18,661 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:48:18,661 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570284020] [2022-01-11 01:48:18,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:18,661 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:48:18,662 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:18,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:48:18,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:18,662 INFO L87 Difference]: Start difference. First operand 52234 states and 65389 transitions. Second operand has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 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:26,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:26,973 INFO L93 Difference]: Finished difference Result 154014 states and 192696 transitions. [2022-01-11 01:48:26,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:48:26,974 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 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 217 [2022-01-11 01:48:26,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:27,127 INFO L225 Difference]: With dead ends: 154014 [2022-01-11 01:48:27,127 INFO L226 Difference]: Without dead ends: 101906 [2022-01-11 01:48:27,180 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:27,180 INFO L933 BasicCegarLoop]: 1940 mSDtfsCounter, 1357 mSDsluCounter, 1460 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1357 SdHoareTripleChecker+Valid, 3400 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:48:27,181 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1357 Valid, 3400 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:48:27,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101906 states.