/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_LAZY.epf -i ../../../trunk/examples/svcomp/combinations/pc_sfifo_1.cil-2+token_ring.12.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 20:01:32,201 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 20:01:32,204 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 20:01:32,263 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 20:01:32,264 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 20:01:32,267 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 20:01:32,268 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 20:01:32,270 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 20:01:32,271 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 20:01:32,275 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 20:01:32,276 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 20:01:32,276 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 20:01:32,277 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 20:01:32,278 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 20:01:32,279 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 20:01:32,281 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 20:01:32,281 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 20:01:32,282 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 20:01:32,283 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 20:01:32,287 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 20:01:32,288 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 20:01:32,289 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 20:01:32,290 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 20:01:32,290 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 20:01:32,292 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 20:01:32,292 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 20:01:32,293 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 20:01:32,294 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 20:01:32,294 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 20:01:32,295 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 20:01:32,295 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 20:01:32,295 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 20:01:32,296 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 20:01:32,296 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 20:01:32,297 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 20:01:32,297 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 20:01:32,297 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 20:01:32,297 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 20:01:32,297 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 20:01:32,298 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 20:01:32,298 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 20:01:32,299 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_LAZY.epf [2022-01-10 20:01:32,310 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 20:01:32,310 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 20:01:32,311 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 20:01:32,311 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 20:01:32,311 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 20:01:32,312 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 20:01:32,312 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 20:01:32,312 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 20:01:32,312 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 20:01:32,312 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 20:01:32,312 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 20:01:32,312 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 20:01:32,312 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 20:01:32,312 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 20:01:32,312 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 20:01:32,313 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 20:01:32,313 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 20:01:32,313 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 20:01:32,313 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 20:01:32,313 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 20:01:32,313 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 20:01:32,319 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 20:01:32,319 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 20:01:32,319 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 20:01:32,319 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 20:01:32,319 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 20:01:32,319 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 20:01:32,320 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 20:01:32,320 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 20:01:32,320 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 20:01:32,320 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 20:01:32,320 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 20:01:32,320 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 20:01:32,321 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_LAZY WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 20:01:32,539 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 20:01:32,556 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 20:01:32,558 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 20:01:32,559 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 20:01:32,559 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 20:01:32,560 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.12.cil-2.c [2022-01-10 20:01:32,607 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75b0aa7fb/f68ee78eda314c2f9e0a1999096525f4/FLAG2f7acc075 [2022-01-10 20:01:32,925 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 20:01:32,925 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_1.cil-2+token_ring.12.cil-2.c [2022-01-10 20:01:32,935 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75b0aa7fb/f68ee78eda314c2f9e0a1999096525f4/FLAG2f7acc075 [2022-01-10 20:01:33,331 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75b0aa7fb/f68ee78eda314c2f9e0a1999096525f4 [2022-01-10 20:01:33,333 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 20:01:33,334 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 20:01:33,347 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 20:01:33,347 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 20:01:33,351 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 20:01:33,352 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 08:01:33" (1/1) ... [2022-01-10 20:01:33,353 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@331ee33e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:01:33, skipping insertion in model container [2022-01-10 20:01:33,353 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 08:01:33" (1/1) ... [2022-01-10 20:01:33,361 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 20:01:33,463 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 20:01:33,601 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.12.cil-2.c[913,926] [2022-01-10 20:01:33,634 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.12.cil-2.c[5977,5990] [2022-01-10 20:01:33,741 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 20:01:33,761 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 20:01:33,768 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.12.cil-2.c[913,926] [2022-01-10 20:01:33,786 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.12.cil-2.c[5977,5990] [2022-01-10 20:01:33,831 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 20:01:33,848 INFO L208 MainTranslator]: Completed translation [2022-01-10 20:01:33,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:01:33 WrapperNode [2022-01-10 20:01:33,848 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 20:01:33,849 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 20:01:33,849 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 20:01:33,849 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 20:01:33,855 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:01:33" (1/1) ... [2022-01-10 20:01:33,867 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:01:33" (1/1) ... [2022-01-10 20:01:33,932 INFO L137 Inliner]: procedures = 73, calls = 84, calls flagged for inlining = 79, calls inlined = 288, statements flattened = 4387 [2022-01-10 20:01:33,932 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 20:01:33,933 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 20:01:33,933 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 20:01:33,933 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 20:01:33,938 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:01:33" (1/1) ... [2022-01-10 20:01:33,939 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:01:33" (1/1) ... [2022-01-10 20:01:33,951 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:01:33" (1/1) ... [2022-01-10 20:01:33,952 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:01:33" (1/1) ... [2022-01-10 20:01:33,981 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:01:33" (1/1) ... [2022-01-10 20:01:34,026 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:01:33" (1/1) ... [2022-01-10 20:01:34,037 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:01:33" (1/1) ... [2022-01-10 20:01:34,048 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 20:01:34,049 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 20:01:34,049 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 20:01:34,049 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 20:01:34,050 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:01:33" (1/1) ... [2022-01-10 20:01:34,055 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 20:01:34,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 20:01:34,089 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 20:01:34,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 20:01:34,153 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 20:01:34,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 20:01:34,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 20:01:34,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 20:01:34,264 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 20:01:34,265 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 20:01:36,044 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 20:01:36,059 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 20:01:36,060 INFO L299 CfgBuilder]: Removed 19 assume(true) statements. [2022-01-10 20:01:36,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 08:01:36 BoogieIcfgContainer [2022-01-10 20:01:36,062 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 20:01:36,063 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 20:01:36,063 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 20:01:36,064 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 20:01:36,066 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 08:01:36" (1/1) ... [2022-01-10 20:01:36,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 08:01:36 BasicIcfg [2022-01-10 20:01:36,328 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 20:01:36,329 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 20:01:36,330 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 20:01:36,332 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 20:01:36,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 08:01:33" (1/4) ... [2022-01-10 20:01:36,332 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@163d1b37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 08:01:36, skipping insertion in model container [2022-01-10 20:01:36,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:01:33" (2/4) ... [2022-01-10 20:01:36,332 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@163d1b37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 08:01:36, skipping insertion in model container [2022-01-10 20:01:36,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 08:01:36" (3/4) ... [2022-01-10 20:01:36,333 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@163d1b37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 08:01:36, skipping insertion in model container [2022-01-10 20:01:36,333 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 08:01:36" (4/4) ... [2022-01-10 20:01:36,333 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.12.cil-2.cTransformedIcfg [2022-01-10 20:01:36,337 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 20:01:36,337 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-01-10 20:01:36,368 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 20:01:36,372 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 20:01:36,372 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-01-10 20:01:36,396 INFO L276 IsEmpty]: Start isEmpty. Operand has 1871 states, 1867 states have (on average 1.502410283877879) internal successors, (2805), 1870 states have internal predecessors, (2805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:36,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-10 20:01:36,401 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:01:36,401 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-10 20:01:36,402 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:01:36,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:01:36,405 INFO L85 PathProgramCache]: Analyzing trace with hash -550117730, now seen corresponding path program 1 times [2022-01-10 20:01:36,410 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:01:36,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846329858] [2022-01-10 20:01:36,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:01:36,411 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:01:36,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:01:36,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:01:36,729 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:01:36,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846329858] [2022-01-10 20:01:36,729 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846329858] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:01:36,730 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:01:36,730 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:01:36,731 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17417851] [2022-01-10 20:01:36,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:01:36,734 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:01:36,734 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:01:36,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:01:36,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:36,770 INFO L87 Difference]: Start difference. First operand has 1871 states, 1867 states have (on average 1.502410283877879) internal successors, (2805), 1870 states have internal predecessors, (2805), 0 states have call successors, (0), 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-10 20:01:36,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:01:36,940 INFO L93 Difference]: Finished difference Result 3641 states and 5436 transitions. [2022-01-10 20:01:36,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:01:36,943 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-10 20:01:36,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:01:36,961 INFO L225 Difference]: With dead ends: 3641 [2022-01-10 20:01:36,961 INFO L226 Difference]: Without dead ends: 1926 [2022-01-10 20:01:36,968 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:36,972 INFO L933 BasicCegarLoop]: 2782 mSDtfsCounter, 2732 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2732 SdHoareTripleChecker+Valid, 2876 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:01:36,973 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2732 Valid, 2876 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:01:36,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1926 states. [2022-01-10 20:01:37,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1926 to 1905. [2022-01-10 20:01:37,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1905 states, 1902 states have (on average 1.4789695057833858) internal successors, (2813), 1904 states have internal predecessors, (2813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:37,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1905 states to 1905 states and 2813 transitions. [2022-01-10 20:01:37,077 INFO L78 Accepts]: Start accepts. Automaton has 1905 states and 2813 transitions. Word has length 36 [2022-01-10 20:01:37,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:01:37,078 INFO L470 AbstractCegarLoop]: Abstraction has 1905 states and 2813 transitions. [2022-01-10 20:01:37,078 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-10 20:01:37,078 INFO L276 IsEmpty]: Start isEmpty. Operand 1905 states and 2813 transitions. [2022-01-10 20:01:37,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-01-10 20:01:37,083 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:01:37,083 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:01:37,083 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 20:01:37,084 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:01:37,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:01:37,085 INFO L85 PathProgramCache]: Analyzing trace with hash 887731293, now seen corresponding path program 1 times [2022-01-10 20:01:37,085 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:01:37,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899665839] [2022-01-10 20:01:37,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:01:37,086 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:01:37,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:01:37,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:01:37,191 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:01:37,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899665839] [2022-01-10 20:01:37,192 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899665839] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:01:37,192 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:01:37,192 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:01:37,193 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850519941] [2022-01-10 20:01:37,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:01:37,194 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:01:37,195 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:01:37,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:01:37,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:37,199 INFO L87 Difference]: Start difference. First operand 1905 states and 2813 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-10 20:01:37,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:01:37,256 INFO L93 Difference]: Finished difference Result 2074 states and 3048 transitions. [2022-01-10 20:01:37,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:01:37,256 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-10 20:01:37,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:01:37,263 INFO L225 Difference]: With dead ends: 2074 [2022-01-10 20:01:37,263 INFO L226 Difference]: Without dead ends: 1963 [2022-01-10 20:01:37,264 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:37,265 INFO L933 BasicCegarLoop]: 2751 mSDtfsCounter, 60 mSDsluCounter, 2712 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 5463 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-10 20:01:37,266 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 5463 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:01:37,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1963 states. [2022-01-10 20:01:37,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1963 to 1958. [2022-01-10 20:01:37,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1958 states, 1955 states have (on average 1.4762148337595908) internal successors, (2886), 1957 states have internal predecessors, (2886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:37,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1958 states to 1958 states and 2886 transitions. [2022-01-10 20:01:37,301 INFO L78 Accepts]: Start accepts. Automaton has 1958 states and 2886 transitions. Word has length 37 [2022-01-10 20:01:37,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:01:37,302 INFO L470 AbstractCegarLoop]: Abstraction has 1958 states and 2886 transitions. [2022-01-10 20:01:37,302 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-10 20:01:37,303 INFO L276 IsEmpty]: Start isEmpty. Operand 1958 states and 2886 transitions. [2022-01-10 20:01:37,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-01-10 20:01:37,307 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:01:37,308 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-10 20:01:37,310 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 20:01:37,310 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:01:37,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:01:37,311 INFO L85 PathProgramCache]: Analyzing trace with hash 733434460, now seen corresponding path program 1 times [2022-01-10 20:01:37,311 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:01:37,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632026456] [2022-01-10 20:01:37,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:01:37,311 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:01:37,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:01:37,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:01:37,387 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:01:37,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632026456] [2022-01-10 20:01:37,387 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632026456] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:01:37,387 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:01:37,388 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:01:37,388 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408542322] [2022-01-10 20:01:37,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:01:37,388 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:01:37,388 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:01:37,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:01:37,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:37,389 INFO L87 Difference]: Start difference. First operand 1958 states and 2886 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-10 20:01:37,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:01:37,488 INFO L93 Difference]: Finished difference Result 2275 states and 3322 transitions. [2022-01-10 20:01:37,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:01:37,489 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-10 20:01:37,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:01:37,494 INFO L225 Difference]: With dead ends: 2275 [2022-01-10 20:01:37,494 INFO L226 Difference]: Without dead ends: 2111 [2022-01-10 20:01:37,497 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:37,500 INFO L933 BasicCegarLoop]: 2774 mSDtfsCounter, 2723 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2723 SdHoareTripleChecker+Valid, 2862 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-10 20:01:37,501 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2723 Valid, 2862 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:01:37,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2111 states. [2022-01-10 20:01:37,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2111 to 2089. [2022-01-10 20:01:37,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2089 states, 2086 states have (on average 1.4678811121764141) internal successors, (3062), 2088 states have internal predecessors, (3062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:37,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2089 states to 2089 states and 3062 transitions. [2022-01-10 20:01:37,539 INFO L78 Accepts]: Start accepts. Automaton has 2089 states and 3062 transitions. Word has length 37 [2022-01-10 20:01:37,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:01:37,539 INFO L470 AbstractCegarLoop]: Abstraction has 2089 states and 3062 transitions. [2022-01-10 20:01:37,539 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-10 20:01:37,539 INFO L276 IsEmpty]: Start isEmpty. Operand 2089 states and 3062 transitions. [2022-01-10 20:01:37,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-10 20:01:37,541 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:01:37,541 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-10 20:01:37,541 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 20:01:37,542 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:01:37,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:01:37,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1212213667, now seen corresponding path program 1 times [2022-01-10 20:01:37,543 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:01:37,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010801386] [2022-01-10 20:01:37,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:01:37,543 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:01:37,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:01:37,606 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:01:37,606 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:01:37,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010801386] [2022-01-10 20:01:37,606 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010801386] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:01:37,606 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:01:37,606 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:01:37,606 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078184950] [2022-01-10 20:01:37,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:01:37,607 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:01:37,607 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:01:37,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:01:37,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:37,609 INFO L87 Difference]: Start difference. First operand 2089 states and 3062 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-10 20:01:37,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:01:37,666 INFO L93 Difference]: Finished difference Result 2540 states and 3669 transitions. [2022-01-10 20:01:37,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:01:37,666 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-10 20:01:37,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:01:37,672 INFO L225 Difference]: With dead ends: 2540 [2022-01-10 20:01:37,673 INFO L226 Difference]: Without dead ends: 2245 [2022-01-10 20:01:37,673 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:37,679 INFO L933 BasicCegarLoop]: 2804 mSDtfsCounter, 48 mSDsluCounter, 2739 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 5543 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-10 20:01:37,680 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 5543 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:01:37,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2245 states. [2022-01-10 20:01:37,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2245 to 2245. [2022-01-10 20:01:37,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2245 states, 2242 states have (on average 1.449598572702944) internal successors, (3250), 2244 states have internal predecessors, (3250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:37,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2245 states to 2245 states and 3250 transitions. [2022-01-10 20:01:37,727 INFO L78 Accepts]: Start accepts. Automaton has 2245 states and 3250 transitions. Word has length 51 [2022-01-10 20:01:37,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:01:37,727 INFO L470 AbstractCegarLoop]: Abstraction has 2245 states and 3250 transitions. [2022-01-10 20:01:37,728 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-10 20:01:37,728 INFO L276 IsEmpty]: Start isEmpty. Operand 2245 states and 3250 transitions. [2022-01-10 20:01:37,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-10 20:01:37,728 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:01:37,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] [2022-01-10 20:01:37,729 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 20:01:37,729 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:01:37,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:01:37,729 INFO L85 PathProgramCache]: Analyzing trace with hash -840312422, now seen corresponding path program 1 times [2022-01-10 20:01:37,730 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:01:37,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240165773] [2022-01-10 20:01:37,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:01:37,730 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:01:37,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:01:37,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:01:37,808 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:01:37,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240165773] [2022-01-10 20:01:37,809 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240165773] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:01:37,809 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:01:37,809 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:01:37,809 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48236574] [2022-01-10 20:01:37,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:01:37,809 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:01:37,809 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:01:37,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:01:37,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:37,810 INFO L87 Difference]: Start difference. First operand 2245 states and 3250 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-10 20:01:37,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:01:37,870 INFO L93 Difference]: Finished difference Result 2718 states and 3866 transitions. [2022-01-10 20:01:37,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:01:37,871 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-10 20:01:37,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:01:37,878 INFO L225 Difference]: With dead ends: 2718 [2022-01-10 20:01:37,878 INFO L226 Difference]: Without dead ends: 2353 [2022-01-10 20:01:37,879 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:37,880 INFO L933 BasicCegarLoop]: 2751 mSDtfsCounter, 2697 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2697 SdHoareTripleChecker+Valid, 2839 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:01:37,881 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2697 Valid, 2839 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:01:37,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2353 states. [2022-01-10 20:01:37,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2353 to 2353. [2022-01-10 20:01:37,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2353 states, 2350 states have (on average 1.4374468085106382) internal successors, (3378), 2352 states have internal predecessors, (3378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:37,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2353 states to 2353 states and 3378 transitions. [2022-01-10 20:01:37,962 INFO L78 Accepts]: Start accepts. Automaton has 2353 states and 3378 transitions. Word has length 55 [2022-01-10 20:01:37,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:01:37,965 INFO L470 AbstractCegarLoop]: Abstraction has 2353 states and 3378 transitions. [2022-01-10 20:01:37,966 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-10 20:01:37,967 INFO L276 IsEmpty]: Start isEmpty. Operand 2353 states and 3378 transitions. [2022-01-10 20:01:37,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-01-10 20:01:37,968 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:01:37,968 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-10 20:01:37,969 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 20:01:37,969 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:01:37,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:01:37,969 INFO L85 PathProgramCache]: Analyzing trace with hash 309061730, now seen corresponding path program 1 times [2022-01-10 20:01:37,969 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:01:37,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756865313] [2022-01-10 20:01:37,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:01:37,970 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:01:38,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:01:38,073 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 20:01:38,073 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:01:38,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756865313] [2022-01-10 20:01:38,073 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756865313] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:01:38,073 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:01:38,073 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 20:01:38,073 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465532913] [2022-01-10 20:01:38,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:01:38,074 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 20:01:38,074 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:01:38,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 20:01:38,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 20:01:38,075 INFO L87 Difference]: Start difference. First operand 2353 states and 3378 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 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-10 20:01:38,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:01:38,202 INFO L93 Difference]: Finished difference Result 3103 states and 4356 transitions. [2022-01-10 20:01:38,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 20:01:38,202 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 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 56 [2022-01-10 20:01:38,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:01:38,209 INFO L225 Difference]: With dead ends: 3103 [2022-01-10 20:01:38,209 INFO L226 Difference]: Without dead ends: 2629 [2022-01-10 20:01:38,211 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-10 20:01:38,212 INFO L933 BasicCegarLoop]: 2802 mSDtfsCounter, 276 mSDsluCounter, 8348 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 11150 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-10 20:01:38,213 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [276 Valid, 11150 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:01:38,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2629 states. [2022-01-10 20:01:38,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2629 to 2254. [2022-01-10 20:01:38,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2254 states, 2251 states have (on average 1.4433585073300754) internal successors, (3249), 2253 states have internal predecessors, (3249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:38,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2254 states to 2254 states and 3249 transitions. [2022-01-10 20:01:38,270 INFO L78 Accepts]: Start accepts. Automaton has 2254 states and 3249 transitions. Word has length 56 [2022-01-10 20:01:38,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:01:38,272 INFO L470 AbstractCegarLoop]: Abstraction has 2254 states and 3249 transitions. [2022-01-10 20:01:38,272 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 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-10 20:01:38,272 INFO L276 IsEmpty]: Start isEmpty. Operand 2254 states and 3249 transitions. [2022-01-10 20:01:38,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-01-10 20:01:38,273 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:01:38,273 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-10 20:01:38,273 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 20:01:38,273 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:01:38,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:01:38,273 INFO L85 PathProgramCache]: Analyzing trace with hash 309091521, now seen corresponding path program 1 times [2022-01-10 20:01:38,274 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:01:38,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569230555] [2022-01-10 20:01:38,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:01:38,274 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:01:38,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:01:38,360 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-10 20:01:38,360 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:01:38,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569230555] [2022-01-10 20:01:38,360 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569230555] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:01:38,360 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:01:38,360 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 20:01:38,360 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13511348] [2022-01-10 20:01:38,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:01:38,361 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 20:01:38,361 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:01:38,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 20:01:38,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 20:01:38,361 INFO L87 Difference]: Start difference. First operand 2254 states and 3249 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-10 20:01:38,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:01:38,472 INFO L93 Difference]: Finished difference Result 2304 states and 3309 transitions. [2022-01-10 20:01:38,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 20:01:38,473 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-10 20:01:38,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:01:38,479 INFO L225 Difference]: With dead ends: 2304 [2022-01-10 20:01:38,479 INFO L226 Difference]: Without dead ends: 2302 [2022-01-10 20:01:38,480 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-10 20:01:38,480 INFO L933 BasicCegarLoop]: 2751 mSDtfsCounter, 5470 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5470 SdHoareTripleChecker+Valid, 2820 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-10 20:01:38,481 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5470 Valid, 2820 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:01:38,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2302 states. [2022-01-10 20:01:38,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2302 to 2252. [2022-01-10 20:01:38,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2252 states, 2250 states have (on average 1.4426666666666668) internal successors, (3246), 2251 states have internal predecessors, (3246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:38,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2252 states to 2252 states and 3246 transitions. [2022-01-10 20:01:38,565 INFO L78 Accepts]: Start accepts. Automaton has 2252 states and 3246 transitions. Word has length 56 [2022-01-10 20:01:38,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:01:38,566 INFO L470 AbstractCegarLoop]: Abstraction has 2252 states and 3246 transitions. [2022-01-10 20:01:38,566 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-10 20:01:38,566 INFO L276 IsEmpty]: Start isEmpty. Operand 2252 states and 3246 transitions. [2022-01-10 20:01:38,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-01-10 20:01:38,567 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:01:38,567 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-10 20:01:38,567 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 20:01:38,567 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:01:38,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:01:38,567 INFO L85 PathProgramCache]: Analyzing trace with hash 991908568, now seen corresponding path program 1 times [2022-01-10 20:01:38,568 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:01:38,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043461351] [2022-01-10 20:01:38,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:01:38,568 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:01:38,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:01:38,737 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-10 20:01:38,737 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:01:38,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043461351] [2022-01-10 20:01:38,737 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043461351] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 20:01:38,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1681490887] [2022-01-10 20:01:38,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:01:38,738 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 20:01:38,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 20:01:38,739 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-10 20:01:38,795 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-10 20:01:38,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:01:38,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 691 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-10 20:01:38,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 20:01:39,210 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-10 20:01:39,210 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 20:01:39,461 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-10 20:01:39,461 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1681490887] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 20:01:39,461 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 20:01:39,461 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-01-10 20:01:39,461 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125361370] [2022-01-10 20:01:39,462 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 20:01:39,462 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-10 20:01:39,462 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:01:39,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-10 20:01:39,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-01-10 20:01:39,463 INFO L87 Difference]: Start difference. First operand 2252 states and 3246 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-10 20:01:39,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:01:39,673 INFO L93 Difference]: Finished difference Result 3108 states and 4348 transitions. [2022-01-10 20:01:39,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 20:01:39,673 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-10 20:01:39,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:01:39,681 INFO L225 Difference]: With dead ends: 3108 [2022-01-10 20:01:39,682 INFO L226 Difference]: Without dead ends: 3106 [2022-01-10 20:01:39,683 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-10 20:01:39,683 INFO L933 BasicCegarLoop]: 2825 mSDtfsCounter, 5812 mSDsluCounter, 5936 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5812 SdHoareTripleChecker+Valid, 8761 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:01:39,683 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5812 Valid, 8761 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:01:39,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3106 states. [2022-01-10 20:01:39,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3106 to 2509. [2022-01-10 20:01:39,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2509 states, 2507 states have (on average 1.4303948942959712) internal successors, (3586), 2508 states have internal predecessors, (3586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:39,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2509 states to 2509 states and 3586 transitions. [2022-01-10 20:01:39,828 INFO L78 Accepts]: Start accepts. Automaton has 2509 states and 3586 transitions. Word has length 57 [2022-01-10 20:01:39,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:01:39,828 INFO L470 AbstractCegarLoop]: Abstraction has 2509 states and 3586 transitions. [2022-01-10 20:01:39,828 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-10 20:01:39,828 INFO L276 IsEmpty]: Start isEmpty. Operand 2509 states and 3586 transitions. [2022-01-10 20:01:39,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-01-10 20:01:39,829 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:01:39,830 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-10 20:01:39,856 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-10 20:01:40,044 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 20:01:40,044 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:01:40,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:01:40,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1907936170, now seen corresponding path program 2 times [2022-01-10 20:01:40,044 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:01:40,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183688290] [2022-01-10 20:01:40,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:01:40,045 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:01:40,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:01:40,078 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-10 20:01:40,078 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:01:40,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183688290] [2022-01-10 20:01:40,078 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183688290] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:01:40,078 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:01:40,078 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:01:40,078 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756674414] [2022-01-10 20:01:40,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:01:40,079 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:01:40,079 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:01:40,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:01:40,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:40,079 INFO L87 Difference]: Start difference. First operand 2509 states and 3586 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-10 20:01:40,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:01:40,183 INFO L93 Difference]: Finished difference Result 2980 states and 4211 transitions. [2022-01-10 20:01:40,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:01:40,184 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-10 20:01:40,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:01:40,190 INFO L225 Difference]: With dead ends: 2980 [2022-01-10 20:01:40,190 INFO L226 Difference]: Without dead ends: 2420 [2022-01-10 20:01:40,191 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:40,192 INFO L933 BasicCegarLoop]: 2785 mSDtfsCounter, 2701 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2701 SdHoareTripleChecker+Valid, 2854 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-10 20:01:40,192 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2701 Valid, 2854 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:01:40,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2420 states. [2022-01-10 20:01:40,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2420 to 2394. [2022-01-10 20:01:40,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2394 states, 2392 states have (on average 1.4339464882943145) internal successors, (3430), 2393 states have internal predecessors, (3430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:40,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2394 states to 2394 states and 3430 transitions. [2022-01-10 20:01:40,291 INFO L78 Accepts]: Start accepts. Automaton has 2394 states and 3430 transitions. Word has length 72 [2022-01-10 20:01:40,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:01:40,291 INFO L470 AbstractCegarLoop]: Abstraction has 2394 states and 3430 transitions. [2022-01-10 20:01:40,291 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-10 20:01:40,291 INFO L276 IsEmpty]: Start isEmpty. Operand 2394 states and 3430 transitions. [2022-01-10 20:01:40,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-01-10 20:01:40,292 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:01:40,292 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] [2022-01-10 20:01:40,292 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-10 20:01:40,293 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:01:40,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:01:40,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1640637995, now seen corresponding path program 1 times [2022-01-10 20:01:40,293 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:01:40,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852202621] [2022-01-10 20:01:40,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:01:40,293 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:01:40,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:01:40,331 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-10 20:01:40,332 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:01:40,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852202621] [2022-01-10 20:01:40,332 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852202621] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:01:40,332 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:01:40,332 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:01:40,332 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745663488] [2022-01-10 20:01:40,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:01:40,332 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:01:40,332 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:01:40,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:01:40,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:40,333 INFO L87 Difference]: Start difference. First operand 2394 states and 3430 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-10 20:01:40,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:01:40,470 INFO L93 Difference]: Finished difference Result 3012 states and 4222 transitions. [2022-01-10 20:01:40,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:01:40,470 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-10 20:01:40,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:01:40,476 INFO L225 Difference]: With dead ends: 3012 [2022-01-10 20:01:40,476 INFO L226 Difference]: Without dead ends: 2412 [2022-01-10 20:01:40,477 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:40,477 INFO L933 BasicCegarLoop]: 2758 mSDtfsCounter, 2686 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2686 SdHoareTripleChecker+Valid, 2842 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:01:40,478 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2686 Valid, 2842 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:01:40,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2412 states. [2022-01-10 20:01:40,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2412 to 2394. [2022-01-10 20:01:40,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2394 states, 2392 states have (on average 1.4255852842809364) internal successors, (3410), 2393 states have internal predecessors, (3410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:40,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2394 states to 2394 states and 3410 transitions. [2022-01-10 20:01:40,571 INFO L78 Accepts]: Start accepts. Automaton has 2394 states and 3410 transitions. Word has length 84 [2022-01-10 20:01:40,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:01:40,571 INFO L470 AbstractCegarLoop]: Abstraction has 2394 states and 3410 transitions. [2022-01-10 20:01:40,572 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-10 20:01:40,572 INFO L276 IsEmpty]: Start isEmpty. Operand 2394 states and 3410 transitions. [2022-01-10 20:01:40,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-01-10 20:01:40,573 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:01:40,573 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, 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] [2022-01-10 20:01:40,573 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-10 20:01:40,573 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:01:40,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:01:40,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1852259100, now seen corresponding path program 1 times [2022-01-10 20:01:40,574 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:01:40,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259707984] [2022-01-10 20:01:40,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:01:40,574 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:01:40,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:01:40,606 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-10 20:01:40,606 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:01:40,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259707984] [2022-01-10 20:01:40,607 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259707984] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:01:40,607 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:01:40,607 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:01:40,607 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110761054] [2022-01-10 20:01:40,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:01:40,607 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:01:40,607 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:01:40,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:01:40,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:40,608 INFO L87 Difference]: Start difference. First operand 2394 states and 3410 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-10 20:01:40,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:01:40,695 INFO L93 Difference]: Finished difference Result 2649 states and 3720 transitions. [2022-01-10 20:01:40,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:01:40,696 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-10 20:01:40,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:01:40,701 INFO L225 Difference]: With dead ends: 2649 [2022-01-10 20:01:40,701 INFO L226 Difference]: Without dead ends: 1788 [2022-01-10 20:01:40,702 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:40,703 INFO L933 BasicCegarLoop]: 2784 mSDtfsCounter, 56 mSDsluCounter, 2716 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 5500 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-10 20:01:40,703 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 5500 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:01:40,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1788 states. [2022-01-10 20:01:40,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1788 to 1788. [2022-01-10 20:01:40,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1788 states, 1787 states have (on average 1.4823726916620033) internal successors, (2649), 1787 states have internal predecessors, (2649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:40,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1788 states to 1788 states and 2649 transitions. [2022-01-10 20:01:40,758 INFO L78 Accepts]: Start accepts. Automaton has 1788 states and 2649 transitions. Word has length 85 [2022-01-10 20:01:40,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:01:40,758 INFO L470 AbstractCegarLoop]: Abstraction has 1788 states and 2649 transitions. [2022-01-10 20:01:40,758 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-10 20:01:40,759 INFO L276 IsEmpty]: Start isEmpty. Operand 1788 states and 2649 transitions. [2022-01-10 20:01:40,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 20:01:40,759 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:01:40,759 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:01:40,759 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-10 20:01:40,760 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:01:40,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:01:40,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1923355851, now seen corresponding path program 1 times [2022-01-10 20:01:40,760 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:01:40,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956829499] [2022-01-10 20:01:40,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:01:40,760 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:01:40,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:01:40,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:01:40,795 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:01:40,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956829499] [2022-01-10 20:01:40,795 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956829499] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:01:40,796 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:01:40,796 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:01:40,796 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990348056] [2022-01-10 20:01:40,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:01:40,796 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:01:40,796 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:01:40,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:01:40,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:40,797 INFO L87 Difference]: Start difference. First operand 1788 states and 2649 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:40,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:01:40,863 INFO L93 Difference]: Finished difference Result 3566 states and 5283 transitions. [2022-01-10 20:01:40,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:01:40,864 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 165 [2022-01-10 20:01:40,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:01:40,869 INFO L225 Difference]: With dead ends: 3566 [2022-01-10 20:01:40,869 INFO L226 Difference]: Without dead ends: 1788 [2022-01-10 20:01:40,871 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:40,872 INFO L933 BasicCegarLoop]: 2647 mSDtfsCounter, 2639 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2639 SdHoareTripleChecker+Valid, 2648 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:01:40,872 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2639 Valid, 2648 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:01:40,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1788 states. [2022-01-10 20:01:41,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1788 to 1788. [2022-01-10 20:01:41,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1788 states, 1787 states have (on average 1.4818130945719081) internal successors, (2648), 1787 states have internal predecessors, (2648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:41,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1788 states to 1788 states and 2648 transitions. [2022-01-10 20:01:41,056 INFO L78 Accepts]: Start accepts. Automaton has 1788 states and 2648 transitions. Word has length 165 [2022-01-10 20:01:41,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:01:41,056 INFO L470 AbstractCegarLoop]: Abstraction has 1788 states and 2648 transitions. [2022-01-10 20:01:41,056 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:41,056 INFO L276 IsEmpty]: Start isEmpty. Operand 1788 states and 2648 transitions. [2022-01-10 20:01:41,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 20:01:41,059 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:01:41,060 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:01:41,060 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-10 20:01:41,060 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:01:41,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:01:41,061 INFO L85 PathProgramCache]: Analyzing trace with hash -266349610, now seen corresponding path program 1 times [2022-01-10 20:01:41,061 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:01:41,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105859459] [2022-01-10 20:01:41,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:01:41,061 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:01:41,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:01:41,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:01:41,124 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:01:41,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105859459] [2022-01-10 20:01:41,124 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105859459] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:01:41,124 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:01:41,124 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:01:41,124 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787777448] [2022-01-10 20:01:41,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:01:41,125 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:01:41,125 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:01:41,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:01:41,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:41,126 INFO L87 Difference]: Start difference. First operand 1788 states and 2648 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:41,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:01:41,268 INFO L93 Difference]: Finished difference Result 5087 states and 7511 transitions. [2022-01-10 20:01:41,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:01:41,268 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 165 [2022-01-10 20:01:41,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:01:41,281 INFO L225 Difference]: With dead ends: 5087 [2022-01-10 20:01:41,281 INFO L226 Difference]: Without dead ends: 3319 [2022-01-10 20:01:41,284 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:41,284 INFO L933 BasicCegarLoop]: 2642 mSDtfsCounter, 2491 mSDsluCounter, 2374 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2491 SdHoareTripleChecker+Valid, 5016 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:01:41,285 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2491 Valid, 5016 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:01:41,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3319 states. [2022-01-10 20:01:41,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3319 to 3317. [2022-01-10 20:01:41,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3317 states, 3316 states have (on average 1.4749698431845597) internal successors, (4891), 3316 states have internal predecessors, (4891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:41,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3317 states to 3317 states and 4891 transitions. [2022-01-10 20:01:41,401 INFO L78 Accepts]: Start accepts. Automaton has 3317 states and 4891 transitions. Word has length 165 [2022-01-10 20:01:41,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:01:41,401 INFO L470 AbstractCegarLoop]: Abstraction has 3317 states and 4891 transitions. [2022-01-10 20:01:41,401 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:41,401 INFO L276 IsEmpty]: Start isEmpty. Operand 3317 states and 4891 transitions. [2022-01-10 20:01:41,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 20:01:41,402 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:01:41,402 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:01:41,403 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-10 20:01:41,403 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:01:41,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:01:41,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1431367926, now seen corresponding path program 1 times [2022-01-10 20:01:41,403 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:01:41,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680033414] [2022-01-10 20:01:41,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:01:41,404 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:01:41,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:01:41,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:01:41,442 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:01:41,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680033414] [2022-01-10 20:01:41,442 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680033414] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:01:41,442 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:01:41,442 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:01:41,442 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124486762] [2022-01-10 20:01:41,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:01:41,443 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:01:41,443 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:01:41,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:01:41,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:41,444 INFO L87 Difference]: Start difference. First operand 3317 states and 4891 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:41,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:01:41,590 INFO L93 Difference]: Finished difference Result 6613 states and 9748 transitions. [2022-01-10 20:01:41,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:01:41,591 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 165 [2022-01-10 20:01:41,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:01:41,596 INFO L225 Difference]: With dead ends: 6613 [2022-01-10 20:01:41,596 INFO L226 Difference]: Without dead ends: 3317 [2022-01-10 20:01:41,600 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:41,601 INFO L933 BasicCegarLoop]: 2636 mSDtfsCounter, 2621 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2621 SdHoareTripleChecker+Valid, 2636 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:01:41,601 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2621 Valid, 2636 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:01:41,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3317 states. [2022-01-10 20:01:41,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3317 to 3317. [2022-01-10 20:01:41,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3317 states, 3316 states have (on average 1.4725572979493367) internal successors, (4883), 3316 states have internal predecessors, (4883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:41,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3317 states to 3317 states and 4883 transitions. [2022-01-10 20:01:41,719 INFO L78 Accepts]: Start accepts. Automaton has 3317 states and 4883 transitions. Word has length 165 [2022-01-10 20:01:41,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:01:41,719 INFO L470 AbstractCegarLoop]: Abstraction has 3317 states and 4883 transitions. [2022-01-10 20:01:41,719 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:41,719 INFO L276 IsEmpty]: Start isEmpty. Operand 3317 states and 4883 transitions. [2022-01-10 20:01:41,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 20:01:41,720 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:01:41,720 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:01:41,720 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-10 20:01:41,720 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:01:41,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:01:41,721 INFO L85 PathProgramCache]: Analyzing trace with hash -453529642, now seen corresponding path program 1 times [2022-01-10 20:01:41,721 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:01:41,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719633212] [2022-01-10 20:01:41,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:01:41,721 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:01:41,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:01:41,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:01:41,758 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:01:41,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719633212] [2022-01-10 20:01:41,758 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719633212] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:01:41,758 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:01:41,758 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:01:41,758 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405938903] [2022-01-10 20:01:41,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:01:41,758 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:01:41,759 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:01:41,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:01:41,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:41,759 INFO L87 Difference]: Start difference. First operand 3317 states and 4883 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:41,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:01:41,885 INFO L93 Difference]: Finished difference Result 6612 states and 9731 transitions. [2022-01-10 20:01:41,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:01:41,886 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 165 [2022-01-10 20:01:41,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:01:41,892 INFO L225 Difference]: With dead ends: 6612 [2022-01-10 20:01:41,893 INFO L226 Difference]: Without dead ends: 3317 [2022-01-10 20:01:41,897 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:41,898 INFO L933 BasicCegarLoop]: 2631 mSDtfsCounter, 2615 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2615 SdHoareTripleChecker+Valid, 2631 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:01:41,898 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2615 Valid, 2631 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:01:41,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3317 states. [2022-01-10 20:01:42,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3317 to 3317. [2022-01-10 20:01:42,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3317 states, 3316 states have (on average 1.4701447527141134) internal successors, (4875), 3316 states have internal predecessors, (4875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:42,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3317 states to 3317 states and 4875 transitions. [2022-01-10 20:01:42,079 INFO L78 Accepts]: Start accepts. Automaton has 3317 states and 4875 transitions. Word has length 165 [2022-01-10 20:01:42,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:01:42,079 INFO L470 AbstractCegarLoop]: Abstraction has 3317 states and 4875 transitions. [2022-01-10 20:01:42,079 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:42,080 INFO L276 IsEmpty]: Start isEmpty. Operand 3317 states and 4875 transitions. [2022-01-10 20:01:42,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 20:01:42,080 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:01:42,080 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:01:42,081 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-10 20:01:42,081 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:01:42,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:01:42,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1207069450, now seen corresponding path program 1 times [2022-01-10 20:01:42,081 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:01:42,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717695804] [2022-01-10 20:01:42,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:01:42,081 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:01:42,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:01:42,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:01:42,118 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:01:42,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717695804] [2022-01-10 20:01:42,119 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717695804] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:01:42,119 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:01:42,119 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:01:42,119 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692158639] [2022-01-10 20:01:42,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:01:42,119 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:01:42,119 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:01:42,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:01:42,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:42,120 INFO L87 Difference]: Start difference. First operand 3317 states and 4875 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:42,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:01:42,239 INFO L93 Difference]: Finished difference Result 6611 states and 9714 transitions. [2022-01-10 20:01:42,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:01:42,240 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 165 [2022-01-10 20:01:42,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:01:42,245 INFO L225 Difference]: With dead ends: 6611 [2022-01-10 20:01:42,245 INFO L226 Difference]: Without dead ends: 3317 [2022-01-10 20:01:42,248 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:42,249 INFO L933 BasicCegarLoop]: 2626 mSDtfsCounter, 2609 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2609 SdHoareTripleChecker+Valid, 2626 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:01:42,249 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2609 Valid, 2626 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:01:42,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3317 states. [2022-01-10 20:01:42,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3317 to 3317. [2022-01-10 20:01:42,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3317 states, 3316 states have (on average 1.4677322074788903) internal successors, (4867), 3316 states have internal predecessors, (4867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:42,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3317 states to 3317 states and 4867 transitions. [2022-01-10 20:01:42,368 INFO L78 Accepts]: Start accepts. Automaton has 3317 states and 4867 transitions. Word has length 165 [2022-01-10 20:01:42,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:01:42,369 INFO L470 AbstractCegarLoop]: Abstraction has 3317 states and 4867 transitions. [2022-01-10 20:01:42,369 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:42,369 INFO L276 IsEmpty]: Start isEmpty. Operand 3317 states and 4867 transitions. [2022-01-10 20:01:42,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 20:01:42,370 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:01:42,370 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:01:42,370 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-10 20:01:42,370 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:01:42,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:01:42,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1508471850, now seen corresponding path program 1 times [2022-01-10 20:01:42,370 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:01:42,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552096164] [2022-01-10 20:01:42,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:01:42,371 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:01:42,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:01:42,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:01:42,406 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:01:42,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552096164] [2022-01-10 20:01:42,406 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552096164] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:01:42,406 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:01:42,406 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:01:42,406 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121391083] [2022-01-10 20:01:42,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:01:42,406 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:01:42,407 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:01:42,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:01:42,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:42,407 INFO L87 Difference]: Start difference. First operand 3317 states and 4867 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:42,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:01:42,564 INFO L93 Difference]: Finished difference Result 6610 states and 9697 transitions. [2022-01-10 20:01:42,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:01:42,564 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 165 [2022-01-10 20:01:42,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:01:42,569 INFO L225 Difference]: With dead ends: 6610 [2022-01-10 20:01:42,570 INFO L226 Difference]: Without dead ends: 3317 [2022-01-10 20:01:42,573 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:42,574 INFO L933 BasicCegarLoop]: 2621 mSDtfsCounter, 2603 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2603 SdHoareTripleChecker+Valid, 2621 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:01:42,574 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2603 Valid, 2621 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:01:42,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3317 states. [2022-01-10 20:01:42,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3317 to 3317. [2022-01-10 20:01:42,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3317 states, 3316 states have (on average 1.465319662243667) internal successors, (4859), 3316 states have internal predecessors, (4859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:42,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3317 states to 3317 states and 4859 transitions. [2022-01-10 20:01:42,694 INFO L78 Accepts]: Start accepts. Automaton has 3317 states and 4859 transitions. Word has length 165 [2022-01-10 20:01:42,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:01:42,694 INFO L470 AbstractCegarLoop]: Abstraction has 3317 states and 4859 transitions. [2022-01-10 20:01:42,694 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:42,694 INFO L276 IsEmpty]: Start isEmpty. Operand 3317 states and 4859 transitions. [2022-01-10 20:01:42,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 20:01:42,695 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:01:42,695 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:01:42,695 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-10 20:01:42,695 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:01:42,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:01:42,696 INFO L85 PathProgramCache]: Analyzing trace with hash 698562806, now seen corresponding path program 1 times [2022-01-10 20:01:42,696 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:01:42,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298711033] [2022-01-10 20:01:42,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:01:42,696 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:01:42,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:01:42,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:01:42,730 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:01:42,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298711033] [2022-01-10 20:01:42,730 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298711033] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:01:42,730 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:01:42,730 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:01:42,730 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443139693] [2022-01-10 20:01:42,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:01:42,730 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:01:42,730 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:01:42,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:01:42,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:42,731 INFO L87 Difference]: Start difference. First operand 3317 states and 4859 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:42,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:01:42,865 INFO L93 Difference]: Finished difference Result 6609 states and 9680 transitions. [2022-01-10 20:01:42,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:01:42,865 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 165 [2022-01-10 20:01:42,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:01:42,871 INFO L225 Difference]: With dead ends: 6609 [2022-01-10 20:01:42,871 INFO L226 Difference]: Without dead ends: 3317 [2022-01-10 20:01:42,875 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:42,875 INFO L933 BasicCegarLoop]: 2616 mSDtfsCounter, 2597 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2597 SdHoareTripleChecker+Valid, 2616 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:01:42,875 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2597 Valid, 2616 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:01:42,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3317 states. [2022-01-10 20:01:43,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3317 to 3317. [2022-01-10 20:01:43,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3317 states, 3316 states have (on average 1.462907117008444) internal successors, (4851), 3316 states have internal predecessors, (4851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:43,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3317 states to 3317 states and 4851 transitions. [2022-01-10 20:01:43,064 INFO L78 Accepts]: Start accepts. Automaton has 3317 states and 4851 transitions. Word has length 165 [2022-01-10 20:01:43,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:01:43,064 INFO L470 AbstractCegarLoop]: Abstraction has 3317 states and 4851 transitions. [2022-01-10 20:01:43,064 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:43,064 INFO L276 IsEmpty]: Start isEmpty. Operand 3317 states and 4851 transitions. [2022-01-10 20:01:43,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 20:01:43,065 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:01:43,065 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:01:43,065 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-10 20:01:43,066 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:01:43,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:01:43,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1724094506, now seen corresponding path program 1 times [2022-01-10 20:01:43,066 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:01:43,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368239209] [2022-01-10 20:01:43,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:01:43,066 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:01:43,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:01:43,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:01:43,108 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:01:43,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368239209] [2022-01-10 20:01:43,108 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368239209] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:01:43,108 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:01:43,108 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:01:43,108 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646667370] [2022-01-10 20:01:43,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:01:43,109 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:01:43,109 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:01:43,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:01:43,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:43,109 INFO L87 Difference]: Start difference. First operand 3317 states and 4851 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:43,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:01:43,276 INFO L93 Difference]: Finished difference Result 6608 states and 9663 transitions. [2022-01-10 20:01:43,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:01:43,277 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 165 [2022-01-10 20:01:43,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:01:43,282 INFO L225 Difference]: With dead ends: 6608 [2022-01-10 20:01:43,282 INFO L226 Difference]: Without dead ends: 3317 [2022-01-10 20:01:43,287 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:43,287 INFO L933 BasicCegarLoop]: 2611 mSDtfsCounter, 2591 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2591 SdHoareTripleChecker+Valid, 2611 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:01:43,287 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2591 Valid, 2611 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:01:43,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3317 states. [2022-01-10 20:01:43,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3317 to 3317. [2022-01-10 20:01:43,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3317 states, 3316 states have (on average 1.4604945717732207) internal successors, (4843), 3316 states have internal predecessors, (4843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:43,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3317 states to 3317 states and 4843 transitions. [2022-01-10 20:01:43,423 INFO L78 Accepts]: Start accepts. Automaton has 3317 states and 4843 transitions. Word has length 165 [2022-01-10 20:01:43,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:01:43,423 INFO L470 AbstractCegarLoop]: Abstraction has 3317 states and 4843 transitions. [2022-01-10 20:01:43,423 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:43,423 INFO L276 IsEmpty]: Start isEmpty. Operand 3317 states and 4843 transitions. [2022-01-10 20:01:43,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 20:01:43,426 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:01:43,426 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:01:43,426 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-10 20:01:43,426 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:01:43,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:01:43,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1940792074, now seen corresponding path program 1 times [2022-01-10 20:01:43,426 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:01:43,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080685961] [2022-01-10 20:01:43,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:01:43,427 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:01:43,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:01:43,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:01:43,474 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:01:43,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080685961] [2022-01-10 20:01:43,474 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080685961] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:01:43,474 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:01:43,474 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:01:43,474 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257704844] [2022-01-10 20:01:43,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:01:43,475 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:01:43,475 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:01:43,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:01:43,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:43,475 INFO L87 Difference]: Start difference. First operand 3317 states and 4843 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:43,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:01:43,641 INFO L93 Difference]: Finished difference Result 6607 states and 9646 transitions. [2022-01-10 20:01:43,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:01:43,641 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 165 [2022-01-10 20:01:43,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:01:43,647 INFO L225 Difference]: With dead ends: 6607 [2022-01-10 20:01:43,647 INFO L226 Difference]: Without dead ends: 3317 [2022-01-10 20:01:43,651 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:43,652 INFO L933 BasicCegarLoop]: 2606 mSDtfsCounter, 2585 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2585 SdHoareTripleChecker+Valid, 2606 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:01:43,652 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2585 Valid, 2606 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:01:43,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3317 states. [2022-01-10 20:01:43,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3317 to 3317. [2022-01-10 20:01:43,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3317 states, 3316 states have (on average 1.4580820265379977) internal successors, (4835), 3316 states have internal predecessors, (4835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:43,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3317 states to 3317 states and 4835 transitions. [2022-01-10 20:01:43,796 INFO L78 Accepts]: Start accepts. Automaton has 3317 states and 4835 transitions. Word has length 165 [2022-01-10 20:01:43,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:01:43,796 INFO L470 AbstractCegarLoop]: Abstraction has 3317 states and 4835 transitions. [2022-01-10 20:01:43,796 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:43,796 INFO L276 IsEmpty]: Start isEmpty. Operand 3317 states and 4835 transitions. [2022-01-10 20:01:43,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 20:01:43,797 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:01:43,797 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:01:43,797 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-10 20:01:43,797 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:01:43,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:01:43,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1809234986, now seen corresponding path program 1 times [2022-01-10 20:01:43,798 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:01:43,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414555045] [2022-01-10 20:01:43,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:01:43,799 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:01:43,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:01:43,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:01:43,846 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:01:43,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414555045] [2022-01-10 20:01:43,846 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414555045] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:01:43,846 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:01:43,846 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:01:43,846 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372920984] [2022-01-10 20:01:43,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:01:43,848 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:01:43,848 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:01:43,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:01:43,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:43,848 INFO L87 Difference]: Start difference. First operand 3317 states and 4835 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:43,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:01:43,989 INFO L93 Difference]: Finished difference Result 6606 states and 9629 transitions. [2022-01-10 20:01:43,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:01:43,990 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 165 [2022-01-10 20:01:43,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:01:43,994 INFO L225 Difference]: With dead ends: 6606 [2022-01-10 20:01:43,994 INFO L226 Difference]: Without dead ends: 3317 [2022-01-10 20:01:43,997 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:43,998 INFO L933 BasicCegarLoop]: 2601 mSDtfsCounter, 2579 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2579 SdHoareTripleChecker+Valid, 2601 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:01:43,998 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2579 Valid, 2601 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:01:44,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3317 states. [2022-01-10 20:01:44,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3317 to 3317. [2022-01-10 20:01:44,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3317 states, 3316 states have (on average 1.4556694813027744) internal successors, (4827), 3316 states have internal predecessors, (4827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:44,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3317 states to 3317 states and 4827 transitions. [2022-01-10 20:01:44,159 INFO L78 Accepts]: Start accepts. Automaton has 3317 states and 4827 transitions. Word has length 165 [2022-01-10 20:01:44,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:01:44,159 INFO L470 AbstractCegarLoop]: Abstraction has 3317 states and 4827 transitions. [2022-01-10 20:01:44,159 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:44,159 INFO L276 IsEmpty]: Start isEmpty. Operand 3317 states and 4827 transitions. [2022-01-10 20:01:44,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 20:01:44,160 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:01:44,160 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:01:44,160 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-10 20:01:44,161 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:01:44,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:01:44,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1381597430, now seen corresponding path program 1 times [2022-01-10 20:01:44,161 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:01:44,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631236923] [2022-01-10 20:01:44,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:01:44,161 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:01:44,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:01:44,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:01:44,199 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:01:44,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631236923] [2022-01-10 20:01:44,199 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631236923] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:01:44,199 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:01:44,199 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:01:44,199 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473854360] [2022-01-10 20:01:44,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:01:44,199 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:01:44,200 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:01:44,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:01:44,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:44,200 INFO L87 Difference]: Start difference. First operand 3317 states and 4827 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:44,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:01:44,345 INFO L93 Difference]: Finished difference Result 6605 states and 9612 transitions. [2022-01-10 20:01:44,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:01:44,346 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 165 [2022-01-10 20:01:44,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:01:44,352 INFO L225 Difference]: With dead ends: 6605 [2022-01-10 20:01:44,352 INFO L226 Difference]: Without dead ends: 3317 [2022-01-10 20:01:44,355 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:44,356 INFO L933 BasicCegarLoop]: 2596 mSDtfsCounter, 2573 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2573 SdHoareTripleChecker+Valid, 2596 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:01:44,356 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2573 Valid, 2596 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:01:44,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3317 states. [2022-01-10 20:01:44,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3317 to 3317. [2022-01-10 20:01:44,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3317 states, 3316 states have (on average 1.4532569360675514) internal successors, (4819), 3316 states have internal predecessors, (4819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:44,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3317 states to 3317 states and 4819 transitions. [2022-01-10 20:01:44,502 INFO L78 Accepts]: Start accepts. Automaton has 3317 states and 4819 transitions. Word has length 165 [2022-01-10 20:01:44,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:01:44,502 INFO L470 AbstractCegarLoop]: Abstraction has 3317 states and 4819 transitions. [2022-01-10 20:01:44,503 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:44,503 INFO L276 IsEmpty]: Start isEmpty. Operand 3317 states and 4819 transitions. [2022-01-10 20:01:44,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 20:01:44,504 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:01:44,504 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:01:44,504 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-10 20:01:44,504 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:01:44,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:01:44,505 INFO L85 PathProgramCache]: Analyzing trace with hash -593682474, now seen corresponding path program 1 times [2022-01-10 20:01:44,505 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:01:44,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060429094] [2022-01-10 20:01:44,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:01:44,505 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:01:44,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:01:44,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:01:44,542 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:01:44,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060429094] [2022-01-10 20:01:44,542 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060429094] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:01:44,542 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:01:44,542 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:01:44,542 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154473622] [2022-01-10 20:01:44,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:01:44,543 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:01:44,543 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:01:44,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:01:44,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:44,544 INFO L87 Difference]: Start difference. First operand 3317 states and 4819 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:44,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:01:44,721 INFO L93 Difference]: Finished difference Result 6604 states and 9595 transitions. [2022-01-10 20:01:44,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:01:44,722 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 165 [2022-01-10 20:01:44,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:01:44,728 INFO L225 Difference]: With dead ends: 6604 [2022-01-10 20:01:44,728 INFO L226 Difference]: Without dead ends: 3317 [2022-01-10 20:01:44,731 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:44,732 INFO L933 BasicCegarLoop]: 2591 mSDtfsCounter, 2567 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2567 SdHoareTripleChecker+Valid, 2591 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:01:44,732 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2567 Valid, 2591 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:01:44,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3317 states. [2022-01-10 20:01:44,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3317 to 3317. [2022-01-10 20:01:44,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3317 states, 3316 states have (on average 1.450844390832328) internal successors, (4811), 3316 states have internal predecessors, (4811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:44,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3317 states to 3317 states and 4811 transitions. [2022-01-10 20:01:44,863 INFO L78 Accepts]: Start accepts. Automaton has 3317 states and 4811 transitions. Word has length 165 [2022-01-10 20:01:44,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:01:44,863 INFO L470 AbstractCegarLoop]: Abstraction has 3317 states and 4811 transitions. [2022-01-10 20:01:44,864 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:44,864 INFO L276 IsEmpty]: Start isEmpty. Operand 3317 states and 4811 transitions. [2022-01-10 20:01:44,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 20:01:44,865 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:01:44,865 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:01:44,865 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-10 20:01:44,865 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:01:44,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:01:44,865 INFO L85 PathProgramCache]: Analyzing trace with hash 2113545462, now seen corresponding path program 1 times [2022-01-10 20:01:44,866 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:01:44,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000344911] [2022-01-10 20:01:44,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:01:44,866 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:01:44,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:01:44,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:01:44,897 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:01:44,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000344911] [2022-01-10 20:01:44,897 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000344911] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:01:44,897 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:01:44,897 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:01:44,897 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313756646] [2022-01-10 20:01:44,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:01:44,898 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:01:44,898 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:01:44,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:01:44,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:44,898 INFO L87 Difference]: Start difference. First operand 3317 states and 4811 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:45,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:01:45,052 INFO L93 Difference]: Finished difference Result 6603 states and 9578 transitions. [2022-01-10 20:01:45,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:01:45,052 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 165 [2022-01-10 20:01:45,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:01:45,062 INFO L225 Difference]: With dead ends: 6603 [2022-01-10 20:01:45,062 INFO L226 Difference]: Without dead ends: 3317 [2022-01-10 20:01:45,068 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:45,069 INFO L933 BasicCegarLoop]: 2586 mSDtfsCounter, 2561 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2561 SdHoareTripleChecker+Valid, 2586 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:01:45,069 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2561 Valid, 2586 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:01:45,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3317 states. [2022-01-10 20:01:45,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3317 to 3317. [2022-01-10 20:01:45,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3317 states, 3316 states have (on average 1.448431845597105) internal successors, (4803), 3316 states have internal predecessors, (4803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:45,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3317 states to 3317 states and 4803 transitions. [2022-01-10 20:01:45,280 INFO L78 Accepts]: Start accepts. Automaton has 3317 states and 4803 transitions. Word has length 165 [2022-01-10 20:01:45,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:01:45,280 INFO L470 AbstractCegarLoop]: Abstraction has 3317 states and 4803 transitions. [2022-01-10 20:01:45,281 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:45,281 INFO L276 IsEmpty]: Start isEmpty. Operand 3317 states and 4803 transitions. [2022-01-10 20:01:45,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 20:01:45,282 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:01:45,282 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:01:45,282 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-10 20:01:45,282 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:01:45,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:01:45,282 INFO L85 PathProgramCache]: Analyzing trace with hash 676854742, now seen corresponding path program 1 times [2022-01-10 20:01:45,283 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:01:45,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832338865] [2022-01-10 20:01:45,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:01:45,283 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:01:45,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:01:45,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:01:45,323 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:01:45,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832338865] [2022-01-10 20:01:45,323 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832338865] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:01:45,323 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:01:45,323 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:01:45,323 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667217494] [2022-01-10 20:01:45,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:01:45,324 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:01:45,324 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:01:45,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:01:45,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:45,324 INFO L87 Difference]: Start difference. First operand 3317 states and 4803 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:45,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:01:45,533 INFO L93 Difference]: Finished difference Result 6602 states and 9561 transitions. [2022-01-10 20:01:45,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:01:45,533 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 165 [2022-01-10 20:01:45,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:01:45,538 INFO L225 Difference]: With dead ends: 6602 [2022-01-10 20:01:45,538 INFO L226 Difference]: Without dead ends: 3317 [2022-01-10 20:01:45,542 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:45,542 INFO L933 BasicCegarLoop]: 2581 mSDtfsCounter, 2555 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2555 SdHoareTripleChecker+Valid, 2581 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:01:45,542 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2555 Valid, 2581 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:01:45,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3317 states. [2022-01-10 20:01:45,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3317 to 3317. [2022-01-10 20:01:45,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3317 states, 3316 states have (on average 1.4460193003618818) internal successors, (4795), 3316 states have internal predecessors, (4795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:45,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3317 states to 3317 states and 4795 transitions. [2022-01-10 20:01:45,677 INFO L78 Accepts]: Start accepts. Automaton has 3317 states and 4795 transitions. Word has length 165 [2022-01-10 20:01:45,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:01:45,678 INFO L470 AbstractCegarLoop]: Abstraction has 3317 states and 4795 transitions. [2022-01-10 20:01:45,678 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:45,678 INFO L276 IsEmpty]: Start isEmpty. Operand 3317 states and 4795 transitions. [2022-01-10 20:01:45,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 20:01:45,678 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:01:45,679 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:01:45,679 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-10 20:01:45,680 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:01:45,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:01:45,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1586247434, now seen corresponding path program 1 times [2022-01-10 20:01:45,681 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:01:45,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526304185] [2022-01-10 20:01:45,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:01:45,681 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:01:45,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:01:45,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:01:45,717 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:01:45,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526304185] [2022-01-10 20:01:45,717 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526304185] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:01:45,717 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:01:45,717 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:01:45,718 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919263292] [2022-01-10 20:01:45,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:01:45,718 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:01:45,718 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:01:45,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:01:45,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:45,719 INFO L87 Difference]: Start difference. First operand 3317 states and 4795 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:45,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:01:45,934 INFO L93 Difference]: Finished difference Result 6601 states and 9544 transitions. [2022-01-10 20:01:45,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:01:45,934 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 165 [2022-01-10 20:01:45,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:01:45,940 INFO L225 Difference]: With dead ends: 6601 [2022-01-10 20:01:45,941 INFO L226 Difference]: Without dead ends: 3317 [2022-01-10 20:01:45,945 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:45,945 INFO L933 BasicCegarLoop]: 2546 mSDtfsCounter, 2402 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2402 SdHoareTripleChecker+Valid, 2674 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:01:45,946 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2402 Valid, 2674 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:01:45,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3317 states. [2022-01-10 20:01:46,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3317 to 3317. [2022-01-10 20:01:46,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3317 states, 3316 states have (on average 1.4351628468033775) internal successors, (4759), 3316 states have internal predecessors, (4759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:46,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3317 states to 3317 states and 4759 transitions. [2022-01-10 20:01:46,083 INFO L78 Accepts]: Start accepts. Automaton has 3317 states and 4759 transitions. Word has length 165 [2022-01-10 20:01:46,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:01:46,084 INFO L470 AbstractCegarLoop]: Abstraction has 3317 states and 4759 transitions. [2022-01-10 20:01:46,084 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:46,084 INFO L276 IsEmpty]: Start isEmpty. Operand 3317 states and 4759 transitions. [2022-01-10 20:01:46,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 20:01:46,084 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:01:46,084 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:01:46,085 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-10 20:01:46,085 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:01:46,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:01:46,085 INFO L85 PathProgramCache]: Analyzing trace with hash 152154709, now seen corresponding path program 1 times [2022-01-10 20:01:46,085 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:01:46,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858081503] [2022-01-10 20:01:46,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:01:46,085 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:01:46,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:01:46,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:01:46,116 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:01:46,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858081503] [2022-01-10 20:01:46,116 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858081503] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:01:46,116 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:01:46,116 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:01:46,116 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248623866] [2022-01-10 20:01:46,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:01:46,117 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:01:46,117 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:01:46,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:01:46,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:46,117 INFO L87 Difference]: Start difference. First operand 3317 states and 4759 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:46,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:01:46,290 INFO L93 Difference]: Finished difference Result 6600 states and 9471 transitions. [2022-01-10 20:01:46,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:01:46,291 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 165 [2022-01-10 20:01:46,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:01:46,295 INFO L225 Difference]: With dead ends: 6600 [2022-01-10 20:01:46,295 INFO L226 Difference]: Without dead ends: 3317 [2022-01-10 20:01:46,298 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:46,298 INFO L933 BasicCegarLoop]: 2526 mSDtfsCounter, 2382 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2382 SdHoareTripleChecker+Valid, 2653 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:01:46,299 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2382 Valid, 2653 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:01:46,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3317 states. [2022-01-10 20:01:46,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3317 to 3317. [2022-01-10 20:01:46,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3317 states, 3316 states have (on average 1.4243063932448734) internal successors, (4723), 3316 states have internal predecessors, (4723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:46,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3317 states to 3317 states and 4723 transitions. [2022-01-10 20:01:46,430 INFO L78 Accepts]: Start accepts. Automaton has 3317 states and 4723 transitions. Word has length 165 [2022-01-10 20:01:46,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:01:46,430 INFO L470 AbstractCegarLoop]: Abstraction has 3317 states and 4723 transitions. [2022-01-10 20:01:46,430 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:46,430 INFO L276 IsEmpty]: Start isEmpty. Operand 3317 states and 4723 transitions. [2022-01-10 20:01:46,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 20:01:46,431 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:01:46,431 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:01:46,431 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-01-10 20:01:46,431 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:01:46,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:01:46,432 INFO L85 PathProgramCache]: Analyzing trace with hash 445623604, now seen corresponding path program 1 times [2022-01-10 20:01:46,432 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:01:46,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566517612] [2022-01-10 20:01:46,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:01:46,432 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:01:46,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:01:46,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:01:46,510 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:01:46,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566517612] [2022-01-10 20:01:46,510 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566517612] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:01:46,510 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:01:46,510 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:01:46,510 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277978832] [2022-01-10 20:01:46,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:01:46,510 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:01:46,511 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:01:46,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:01:46,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:46,511 INFO L87 Difference]: Start difference. First operand 3317 states and 4723 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:46,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:01:46,694 INFO L93 Difference]: Finished difference Result 6599 states and 9398 transitions. [2022-01-10 20:01:46,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:01:46,694 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 165 [2022-01-10 20:01:46,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:01:46,700 INFO L225 Difference]: With dead ends: 6599 [2022-01-10 20:01:46,700 INFO L226 Difference]: Without dead ends: 3317 [2022-01-10 20:01:46,703 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:46,704 INFO L933 BasicCegarLoop]: 2506 mSDtfsCounter, 2362 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2362 SdHoareTripleChecker+Valid, 2632 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:01:46,704 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2362 Valid, 2632 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:01:46,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3317 states. [2022-01-10 20:01:46,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3317 to 3317. [2022-01-10 20:01:46,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3317 states, 3316 states have (on average 1.4134499396863691) internal successors, (4687), 3316 states have internal predecessors, (4687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:46,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3317 states to 3317 states and 4687 transitions. [2022-01-10 20:01:46,850 INFO L78 Accepts]: Start accepts. Automaton has 3317 states and 4687 transitions. Word has length 165 [2022-01-10 20:01:46,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:01:46,850 INFO L470 AbstractCegarLoop]: Abstraction has 3317 states and 4687 transitions. [2022-01-10 20:01:46,851 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:46,851 INFO L276 IsEmpty]: Start isEmpty. Operand 3317 states and 4687 transitions. [2022-01-10 20:01:46,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 20:01:46,851 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:01:46,851 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:01:46,852 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-01-10 20:01:46,852 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:01:46,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:01:46,852 INFO L85 PathProgramCache]: Analyzing trace with hash 657478931, now seen corresponding path program 1 times [2022-01-10 20:01:46,853 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:01:46,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786943923] [2022-01-10 20:01:46,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:01:46,853 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:01:46,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:01:46,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:01:46,887 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:01:46,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786943923] [2022-01-10 20:01:46,888 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786943923] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:01:46,888 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:01:46,888 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:01:46,888 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361132378] [2022-01-10 20:01:46,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:01:46,888 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:01:46,888 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:01:46,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:01:46,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:46,889 INFO L87 Difference]: Start difference. First operand 3317 states and 4687 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:47,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:01:47,070 INFO L93 Difference]: Finished difference Result 6598 states and 9325 transitions. [2022-01-10 20:01:47,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:01:47,071 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 165 [2022-01-10 20:01:47,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:01:47,076 INFO L225 Difference]: With dead ends: 6598 [2022-01-10 20:01:47,076 INFO L226 Difference]: Without dead ends: 3317 [2022-01-10 20:01:47,082 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:47,082 INFO L933 BasicCegarLoop]: 2486 mSDtfsCounter, 2342 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2342 SdHoareTripleChecker+Valid, 2611 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:01:47,083 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2342 Valid, 2611 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:01:47,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3317 states. [2022-01-10 20:01:47,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3317 to 3317. [2022-01-10 20:01:47,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3317 states, 3316 states have (on average 1.4025934861278648) internal successors, (4651), 3316 states have internal predecessors, (4651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:47,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3317 states to 3317 states and 4651 transitions. [2022-01-10 20:01:47,271 INFO L78 Accepts]: Start accepts. Automaton has 3317 states and 4651 transitions. Word has length 165 [2022-01-10 20:01:47,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:01:47,272 INFO L470 AbstractCegarLoop]: Abstraction has 3317 states and 4651 transitions. [2022-01-10 20:01:47,272 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:47,272 INFO L276 IsEmpty]: Start isEmpty. Operand 3317 states and 4651 transitions. [2022-01-10 20:01:47,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 20:01:47,272 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:01:47,273 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:01:47,273 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-01-10 20:01:47,273 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:01:47,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:01:47,273 INFO L85 PathProgramCache]: Analyzing trace with hash 161775218, now seen corresponding path program 1 times [2022-01-10 20:01:47,273 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:01:47,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656398875] [2022-01-10 20:01:47,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:01:47,274 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:01:47,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:01:47,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:01:47,310 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:01:47,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656398875] [2022-01-10 20:01:47,310 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656398875] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:01:47,310 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:01:47,310 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:01:47,310 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947741333] [2022-01-10 20:01:47,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:01:47,311 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:01:47,311 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:01:47,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:01:47,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:47,311 INFO L87 Difference]: Start difference. First operand 3317 states and 4651 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:47,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:01:47,488 INFO L93 Difference]: Finished difference Result 6597 states and 9252 transitions. [2022-01-10 20:01:47,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:01:47,489 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 165 [2022-01-10 20:01:47,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:01:47,493 INFO L225 Difference]: With dead ends: 6597 [2022-01-10 20:01:47,493 INFO L226 Difference]: Without dead ends: 3317 [2022-01-10 20:01:47,495 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:47,497 INFO L933 BasicCegarLoop]: 2466 mSDtfsCounter, 2322 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2322 SdHoareTripleChecker+Valid, 2590 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:01:47,497 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2322 Valid, 2590 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:01:47,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3317 states. [2022-01-10 20:01:47,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3317 to 3317. [2022-01-10 20:01:47,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3317 states, 3316 states have (on average 1.3917370325693608) internal successors, (4615), 3316 states have internal predecessors, (4615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:47,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3317 states to 3317 states and 4615 transitions. [2022-01-10 20:01:47,645 INFO L78 Accepts]: Start accepts. Automaton has 3317 states and 4615 transitions. Word has length 165 [2022-01-10 20:01:47,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:01:47,645 INFO L470 AbstractCegarLoop]: Abstraction has 3317 states and 4615 transitions. [2022-01-10 20:01:47,645 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:47,646 INFO L276 IsEmpty]: Start isEmpty. Operand 3317 states and 4615 transitions. [2022-01-10 20:01:47,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 20:01:47,646 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:01:47,647 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:01:47,647 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-01-10 20:01:47,647 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:01:47,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:01:47,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1322539823, now seen corresponding path program 1 times [2022-01-10 20:01:47,648 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:01:47,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782571285] [2022-01-10 20:01:47,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:01:47,648 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:01:47,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:01:47,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:01:47,694 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:01:47,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782571285] [2022-01-10 20:01:47,694 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782571285] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:01:47,694 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:01:47,694 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:01:47,695 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310258437] [2022-01-10 20:01:47,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:01:47,695 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:01:47,695 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:01:47,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:01:47,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:47,696 INFO L87 Difference]: Start difference. First operand 3317 states and 4615 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:47,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:01:47,965 INFO L93 Difference]: Finished difference Result 6595 states and 9177 transitions. [2022-01-10 20:01:47,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:01:47,966 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 165 [2022-01-10 20:01:47,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:01:47,970 INFO L225 Difference]: With dead ends: 6595 [2022-01-10 20:01:47,970 INFO L226 Difference]: Without dead ends: 3317 [2022-01-10 20:01:47,974 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:47,974 INFO L933 BasicCegarLoop]: 2446 mSDtfsCounter, 2301 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2301 SdHoareTripleChecker+Valid, 2569 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:01:47,976 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2301 Valid, 2569 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:01:47,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3317 states. [2022-01-10 20:01:48,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3317 to 3317. [2022-01-10 20:01:48,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3317 states, 3316 states have (on average 1.3808805790108565) internal successors, (4579), 3316 states have internal predecessors, (4579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:48,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3317 states to 3317 states and 4579 transitions. [2022-01-10 20:01:48,198 INFO L78 Accepts]: Start accepts. Automaton has 3317 states and 4579 transitions. Word has length 165 [2022-01-10 20:01:48,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:01:48,198 INFO L470 AbstractCegarLoop]: Abstraction has 3317 states and 4579 transitions. [2022-01-10 20:01:48,198 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:48,198 INFO L276 IsEmpty]: Start isEmpty. Operand 3317 states and 4579 transitions. [2022-01-10 20:01:48,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 20:01:48,199 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:01:48,199 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:01:48,200 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-01-10 20:01:48,200 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:01:48,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:01:48,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1348662864, now seen corresponding path program 1 times [2022-01-10 20:01:48,201 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:01:48,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373465735] [2022-01-10 20:01:48,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:01:48,201 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:01:48,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:01:48,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:01:48,237 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:01:48,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373465735] [2022-01-10 20:01:48,237 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373465735] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:01:48,237 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:01:48,237 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:01:48,237 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768627663] [2022-01-10 20:01:48,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:01:48,238 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:01:48,238 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:01:48,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:01:48,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:48,239 INFO L87 Difference]: Start difference. First operand 3317 states and 4579 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:48,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:01:48,492 INFO L93 Difference]: Finished difference Result 6594 states and 9104 transitions. [2022-01-10 20:01:48,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:01:48,493 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 165 [2022-01-10 20:01:48,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:01:48,496 INFO L225 Difference]: With dead ends: 6594 [2022-01-10 20:01:48,496 INFO L226 Difference]: Without dead ends: 3317 [2022-01-10 20:01:48,499 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:48,500 INFO L933 BasicCegarLoop]: 2426 mSDtfsCounter, 2281 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2281 SdHoareTripleChecker+Valid, 2548 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:01:48,500 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2281 Valid, 2548 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:01:48,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3317 states. [2022-01-10 20:01:48,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3317 to 3317. [2022-01-10 20:01:48,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3317 states, 3316 states have (on average 1.3700241254523522) internal successors, (4543), 3316 states have internal predecessors, (4543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:48,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3317 states to 3317 states and 4543 transitions. [2022-01-10 20:01:48,660 INFO L78 Accepts]: Start accepts. Automaton has 3317 states and 4543 transitions. Word has length 165 [2022-01-10 20:01:48,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:01:48,660 INFO L470 AbstractCegarLoop]: Abstraction has 3317 states and 4543 transitions. [2022-01-10 20:01:48,660 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:48,660 INFO L276 IsEmpty]: Start isEmpty. Operand 3317 states and 4543 transitions. [2022-01-10 20:01:48,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 20:01:48,661 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:01:48,661 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:01:48,661 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-01-10 20:01:48,661 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:01:48,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:01:48,661 INFO L85 PathProgramCache]: Analyzing trace with hash 879022095, now seen corresponding path program 1 times [2022-01-10 20:01:48,661 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:01:48,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598651909] [2022-01-10 20:01:48,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:01:48,662 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:01:48,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:01:48,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:01:48,707 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:01:48,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598651909] [2022-01-10 20:01:48,707 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598651909] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:01:48,707 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:01:48,707 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:01:48,708 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310184779] [2022-01-10 20:01:48,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:01:48,708 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:01:48,708 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:01:48,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:01:48,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:48,709 INFO L87 Difference]: Start difference. First operand 3317 states and 4543 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:48,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:01:48,942 INFO L93 Difference]: Finished difference Result 6593 states and 9031 transitions. [2022-01-10 20:01:48,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:01:48,942 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 165 [2022-01-10 20:01:48,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:01:48,945 INFO L225 Difference]: With dead ends: 6593 [2022-01-10 20:01:48,946 INFO L226 Difference]: Without dead ends: 3317 [2022-01-10 20:01:48,950 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:48,950 INFO L933 BasicCegarLoop]: 2406 mSDtfsCounter, 2261 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2261 SdHoareTripleChecker+Valid, 2527 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:01:48,950 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2261 Valid, 2527 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:01:48,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3317 states. [2022-01-10 20:01:49,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3317 to 3317. [2022-01-10 20:01:49,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3317 states, 3316 states have (on average 1.359167671893848) internal successors, (4507), 3316 states have internal predecessors, (4507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:49,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3317 states to 3317 states and 4507 transitions. [2022-01-10 20:01:49,112 INFO L78 Accepts]: Start accepts. Automaton has 3317 states and 4507 transitions. Word has length 165 [2022-01-10 20:01:49,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:01:49,113 INFO L470 AbstractCegarLoop]: Abstraction has 3317 states and 4507 transitions. [2022-01-10 20:01:49,113 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:49,113 INFO L276 IsEmpty]: Start isEmpty. Operand 3317 states and 4507 transitions. [2022-01-10 20:01:49,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 20:01:49,113 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:01:49,114 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:01:49,114 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-01-10 20:01:49,114 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:01:49,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:01:49,114 INFO L85 PathProgramCache]: Analyzing trace with hash -605801618, now seen corresponding path program 1 times [2022-01-10 20:01:49,114 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:01:49,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893860783] [2022-01-10 20:01:49,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:01:49,115 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:01:49,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:01:49,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:01:49,150 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:01:49,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893860783] [2022-01-10 20:01:49,151 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893860783] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:01:49,151 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:01:49,151 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:01:49,151 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195550647] [2022-01-10 20:01:49,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:01:49,151 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:01:49,151 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:01:49,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:01:49,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:49,152 INFO L87 Difference]: Start difference. First operand 3317 states and 4507 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:49,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:01:49,437 INFO L93 Difference]: Finished difference Result 6592 states and 8958 transitions. [2022-01-10 20:01:49,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:01:49,438 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 165 [2022-01-10 20:01:49,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:01:49,441 INFO L225 Difference]: With dead ends: 6592 [2022-01-10 20:01:49,441 INFO L226 Difference]: Without dead ends: 3317 [2022-01-10 20:01:49,444 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:49,444 INFO L933 BasicCegarLoop]: 2386 mSDtfsCounter, 2241 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2241 SdHoareTripleChecker+Valid, 2506 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 20:01:49,444 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2241 Valid, 2506 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 20:01:49,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3317 states. [2022-01-10 20:01:49,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3317 to 3317. [2022-01-10 20:01:49,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3317 states, 3316 states have (on average 1.3483112183353438) internal successors, (4471), 3316 states have internal predecessors, (4471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:49,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3317 states to 3317 states and 4471 transitions. [2022-01-10 20:01:49,613 INFO L78 Accepts]: Start accepts. Automaton has 3317 states and 4471 transitions. Word has length 165 [2022-01-10 20:01:49,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:01:49,613 INFO L470 AbstractCegarLoop]: Abstraction has 3317 states and 4471 transitions. [2022-01-10 20:01:49,613 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:49,613 INFO L276 IsEmpty]: Start isEmpty. Operand 3317 states and 4471 transitions. [2022-01-10 20:01:49,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 20:01:49,614 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:01:49,614 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:01:49,614 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-01-10 20:01:49,614 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:01:49,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:01:49,614 INFO L85 PathProgramCache]: Analyzing trace with hash 273246285, now seen corresponding path program 1 times [2022-01-10 20:01:49,614 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:01:49,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388852807] [2022-01-10 20:01:49,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:01:49,615 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:01:49,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:01:49,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:01:49,648 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:01:49,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388852807] [2022-01-10 20:01:49,648 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388852807] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:01:49,648 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:01:49,648 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:01:49,648 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509894912] [2022-01-10 20:01:49,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:01:49,648 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:01:49,648 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:01:49,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:01:49,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:49,649 INFO L87 Difference]: Start difference. First operand 3317 states and 4471 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:49,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:01:49,869 INFO L93 Difference]: Finished difference Result 6591 states and 8885 transitions. [2022-01-10 20:01:49,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:01:49,870 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 165 [2022-01-10 20:01:49,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:01:49,873 INFO L225 Difference]: With dead ends: 6591 [2022-01-10 20:01:49,873 INFO L226 Difference]: Without dead ends: 3317 [2022-01-10 20:01:49,874 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:49,875 INFO L933 BasicCegarLoop]: 2366 mSDtfsCounter, 2221 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2221 SdHoareTripleChecker+Valid, 2485 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:01:49,875 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2221 Valid, 2485 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:01:49,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3317 states. [2022-01-10 20:01:50,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3317 to 3317. [2022-01-10 20:01:50,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3317 states, 3316 states have (on average 1.3374547647768396) internal successors, (4435), 3316 states have internal predecessors, (4435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:50,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3317 states to 3317 states and 4435 transitions. [2022-01-10 20:01:50,042 INFO L78 Accepts]: Start accepts. Automaton has 3317 states and 4435 transitions. Word has length 165 [2022-01-10 20:01:50,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:01:50,042 INFO L470 AbstractCegarLoop]: Abstraction has 3317 states and 4435 transitions. [2022-01-10 20:01:50,042 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:50,042 INFO L276 IsEmpty]: Start isEmpty. Operand 3317 states and 4435 transitions. [2022-01-10 20:01:50,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 20:01:50,042 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:01:50,043 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:01:50,043 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-01-10 20:01:50,043 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:01:50,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:01:50,043 INFO L85 PathProgramCache]: Analyzing trace with hash 421169708, now seen corresponding path program 1 times [2022-01-10 20:01:50,043 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:01:50,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292310752] [2022-01-10 20:01:50,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:01:50,043 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:01:50,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:01:50,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:01:50,072 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:01:50,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292310752] [2022-01-10 20:01:50,072 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292310752] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:01:50,073 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:01:50,073 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:01:50,073 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333350970] [2022-01-10 20:01:50,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:01:50,073 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:01:50,073 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:01:50,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:01:50,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:50,073 INFO L87 Difference]: Start difference. First operand 3317 states and 4435 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:50,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:01:50,283 INFO L93 Difference]: Finished difference Result 6590 states and 8812 transitions. [2022-01-10 20:01:50,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:01:50,284 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 165 [2022-01-10 20:01:50,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:01:50,287 INFO L225 Difference]: With dead ends: 6590 [2022-01-10 20:01:50,287 INFO L226 Difference]: Without dead ends: 3317 [2022-01-10 20:01:50,290 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:50,291 INFO L933 BasicCegarLoop]: 2346 mSDtfsCounter, 2201 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2201 SdHoareTripleChecker+Valid, 2464 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:01:50,291 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2201 Valid, 2464 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:01:50,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3317 states. [2022-01-10 20:01:50,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3317 to 3317. [2022-01-10 20:01:50,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3317 states, 3316 states have (on average 1.3265983112183353) internal successors, (4399), 3316 states have internal predecessors, (4399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:50,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3317 states to 3317 states and 4399 transitions. [2022-01-10 20:01:50,465 INFO L78 Accepts]: Start accepts. Automaton has 3317 states and 4399 transitions. Word has length 165 [2022-01-10 20:01:50,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:01:50,465 INFO L470 AbstractCegarLoop]: Abstraction has 3317 states and 4399 transitions. [2022-01-10 20:01:50,465 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:50,465 INFO L276 IsEmpty]: Start isEmpty. Operand 3317 states and 4399 transitions. [2022-01-10 20:01:50,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 20:01:50,466 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:01:50,466 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:01:50,466 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-01-10 20:01:50,466 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:01:50,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:01:50,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1785401973, now seen corresponding path program 1 times [2022-01-10 20:01:50,467 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:01:50,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716546094] [2022-01-10 20:01:50,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:01:50,467 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:01:50,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:01:50,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:01:50,497 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:01:50,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716546094] [2022-01-10 20:01:50,497 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716546094] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:01:50,497 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:01:50,497 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:01:50,497 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31145760] [2022-01-10 20:01:50,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:01:50,498 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:01:50,498 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:01:50,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:01:50,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:50,498 INFO L87 Difference]: Start difference. First operand 3317 states and 4399 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:50,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:01:50,755 INFO L93 Difference]: Finished difference Result 6589 states and 8739 transitions. [2022-01-10 20:01:50,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:01:50,755 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 165 [2022-01-10 20:01:50,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:01:50,758 INFO L225 Difference]: With dead ends: 6589 [2022-01-10 20:01:50,758 INFO L226 Difference]: Without dead ends: 3317 [2022-01-10 20:01:50,760 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:50,760 INFO L933 BasicCegarLoop]: 2326 mSDtfsCounter, 2181 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2181 SdHoareTripleChecker+Valid, 2443 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:01:50,760 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2181 Valid, 2443 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:01:50,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3317 states. [2022-01-10 20:01:50,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3317 to 3317. [2022-01-10 20:01:50,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3317 states, 3316 states have (on average 1.3157418576598312) internal successors, (4363), 3316 states have internal predecessors, (4363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:50,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3317 states to 3317 states and 4363 transitions. [2022-01-10 20:01:50,963 INFO L78 Accepts]: Start accepts. Automaton has 3317 states and 4363 transitions. Word has length 165 [2022-01-10 20:01:50,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:01:50,963 INFO L470 AbstractCegarLoop]: Abstraction has 3317 states and 4363 transitions. [2022-01-10 20:01:50,963 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:50,963 INFO L276 IsEmpty]: Start isEmpty. Operand 3317 states and 4363 transitions. [2022-01-10 20:01:50,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 20:01:50,964 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:01:50,964 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:01:50,964 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-01-10 20:01:50,964 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:01:50,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:01:50,965 INFO L85 PathProgramCache]: Analyzing trace with hash -300184086, now seen corresponding path program 1 times [2022-01-10 20:01:50,965 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:01:50,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658891252] [2022-01-10 20:01:50,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:01:50,965 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:01:50,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:01:51,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:01:51,018 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:01:51,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658891252] [2022-01-10 20:01:51,018 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658891252] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:01:51,018 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:01:51,018 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 20:01:51,018 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700345562] [2022-01-10 20:01:51,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:01:51,019 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 20:01:51,019 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:01:51,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 20:01:51,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 20:01:51,020 INFO L87 Difference]: Start difference. First operand 3317 states and 4363 transitions. Second operand has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:51,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:01:51,427 INFO L93 Difference]: Finished difference Result 7536 states and 9987 transitions. [2022-01-10 20:01:51,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 20:01:51,427 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 165 [2022-01-10 20:01:51,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:01:51,432 INFO L225 Difference]: With dead ends: 7536 [2022-01-10 20:01:51,432 INFO L226 Difference]: Without dead ends: 4271 [2022-01-10 20:01:51,435 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 20:01:51,435 INFO L933 BasicCegarLoop]: 2508 mSDtfsCounter, 6730 mSDsluCounter, 1943 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6730 SdHoareTripleChecker+Valid, 4451 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 20:01:51,435 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6730 Valid, 4451 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 20:01:51,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4271 states. [2022-01-10 20:01:51,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4271 to 3323. [2022-01-10 20:01:51,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3323 states, 3322 states have (on average 1.306742925948224) internal successors, (4341), 3322 states have internal predecessors, (4341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:51,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3323 states to 3323 states and 4341 transitions. [2022-01-10 20:01:51,663 INFO L78 Accepts]: Start accepts. Automaton has 3323 states and 4341 transitions. Word has length 165 [2022-01-10 20:01:51,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:01:51,664 INFO L470 AbstractCegarLoop]: Abstraction has 3323 states and 4341 transitions. [2022-01-10 20:01:51,664 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:51,664 INFO L276 IsEmpty]: Start isEmpty. Operand 3323 states and 4341 transitions. [2022-01-10 20:01:51,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 20:01:51,664 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:01:51,665 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:01:51,665 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-01-10 20:01:51,665 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:01:51,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:01:51,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1483201621, now seen corresponding path program 1 times [2022-01-10 20:01:51,665 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:01:51,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051506139] [2022-01-10 20:01:51,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:01:51,665 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:01:51,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:01:51,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:01:51,706 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:01:51,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051506139] [2022-01-10 20:01:51,706 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051506139] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:01:51,706 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:01:51,706 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 20:01:51,706 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480094957] [2022-01-10 20:01:51,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:01:51,707 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 20:01:51,707 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:01:51,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 20:01:51,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 20:01:51,707 INFO L87 Difference]: Start difference. First operand 3323 states and 4341 transitions. Second operand has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:52,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:01:52,164 INFO L93 Difference]: Finished difference Result 7876 states and 10342 transitions. [2022-01-10 20:01:52,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 20:01:52,164 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 165 [2022-01-10 20:01:52,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:01:52,169 INFO L225 Difference]: With dead ends: 7876 [2022-01-10 20:01:52,169 INFO L226 Difference]: Without dead ends: 4619 [2022-01-10 20:01:52,172 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 20:01:52,172 INFO L933 BasicCegarLoop]: 2457 mSDtfsCounter, 6376 mSDsluCounter, 2672 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6376 SdHoareTripleChecker+Valid, 5129 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 20:01:52,173 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6376 Valid, 5129 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 20:01:52,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4619 states. [2022-01-10 20:01:52,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4619 to 3329. [2022-01-10 20:01:52,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3329 states, 3328 states have (on average 1.2977764423076923) internal successors, (4319), 3328 states have internal predecessors, (4319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:52,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3329 states to 3329 states and 4319 transitions. [2022-01-10 20:01:52,399 INFO L78 Accepts]: Start accepts. Automaton has 3329 states and 4319 transitions. Word has length 165 [2022-01-10 20:01:52,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:01:52,399 INFO L470 AbstractCegarLoop]: Abstraction has 3329 states and 4319 transitions. [2022-01-10 20:01:52,399 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:52,399 INFO L276 IsEmpty]: Start isEmpty. Operand 3329 states and 4319 transitions. [2022-01-10 20:01:52,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 20:01:52,400 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:01:52,400 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:01:52,400 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-01-10 20:01:52,400 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:01:52,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:01:52,400 INFO L85 PathProgramCache]: Analyzing trace with hash -352414996, now seen corresponding path program 1 times [2022-01-10 20:01:52,401 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:01:52,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16810578] [2022-01-10 20:01:52,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:01:52,401 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:01:52,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:01:52,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:01:52,443 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:01:52,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16810578] [2022-01-10 20:01:52,443 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16810578] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:01:52,443 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:01:52,443 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 20:01:52,444 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771813091] [2022-01-10 20:01:52,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:01:52,444 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 20:01:52,444 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:01:52,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 20:01:52,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 20:01:52,445 INFO L87 Difference]: Start difference. First operand 3329 states and 4319 transitions. Second operand has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:52,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:01:52,975 INFO L93 Difference]: Finished difference Result 8055 states and 10488 transitions. [2022-01-10 20:01:52,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 20:01:52,976 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 165 [2022-01-10 20:01:52,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:01:52,980 INFO L225 Difference]: With dead ends: 8055 [2022-01-10 20:01:52,981 INFO L226 Difference]: Without dead ends: 4799 [2022-01-10 20:01:52,983 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 20:01:52,983 INFO L933 BasicCegarLoop]: 2424 mSDtfsCounter, 6185 mSDsluCounter, 3001 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6185 SdHoareTripleChecker+Valid, 5425 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 20:01:52,984 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6185 Valid, 5425 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 20:01:52,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4799 states. [2022-01-10 20:01:53,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4799 to 3335. [2022-01-10 20:01:53,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3335 states, 3334 states have (on average 1.2888422315536892) internal successors, (4297), 3334 states have internal predecessors, (4297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:53,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3335 states to 3335 states and 4297 transitions. [2022-01-10 20:01:53,243 INFO L78 Accepts]: Start accepts. Automaton has 3335 states and 4297 transitions. Word has length 165 [2022-01-10 20:01:53,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:01:53,243 INFO L470 AbstractCegarLoop]: Abstraction has 3335 states and 4297 transitions. [2022-01-10 20:01:53,243 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:53,243 INFO L276 IsEmpty]: Start isEmpty. Operand 3335 states and 4297 transitions. [2022-01-10 20:01:53,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 20:01:53,244 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:01:53,244 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:01:53,244 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-01-10 20:01:53,244 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:01:53,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:01:53,245 INFO L85 PathProgramCache]: Analyzing trace with hash 448120557, now seen corresponding path program 1 times [2022-01-10 20:01:53,245 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:01:53,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247553138] [2022-01-10 20:01:53,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:01:53,246 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:01:53,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:01:53,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:01:53,290 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:01:53,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247553138] [2022-01-10 20:01:53,290 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247553138] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:01:53,290 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:01:53,290 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:01:53,290 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410243044] [2022-01-10 20:01:53,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:01:53,291 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:01:53,291 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:01:53,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:01:53,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:53,292 INFO L87 Difference]: Start difference. First operand 3335 states and 4297 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:53,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:01:53,809 INFO L93 Difference]: Finished difference Result 9541 states and 12288 transitions. [2022-01-10 20:01:53,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:01:53,810 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 165 [2022-01-10 20:01:53,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:01:53,817 INFO L225 Difference]: With dead ends: 9541 [2022-01-10 20:01:53,817 INFO L226 Difference]: Without dead ends: 6288 [2022-01-10 20:01:53,821 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:53,821 INFO L933 BasicCegarLoop]: 2282 mSDtfsCounter, 2057 mSDsluCounter, 2064 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2057 SdHoareTripleChecker+Valid, 4346 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:01:53,821 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2057 Valid, 4346 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:01:53,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6288 states. [2022-01-10 20:01:54,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6288 to 6282. [2022-01-10 20:01:54,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6282 states, 6281 states have (on average 1.2830759433211272) internal successors, (8059), 6281 states have internal predecessors, (8059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:54,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6282 states to 6282 states and 8059 transitions. [2022-01-10 20:01:54,466 INFO L78 Accepts]: Start accepts. Automaton has 6282 states and 8059 transitions. Word has length 165 [2022-01-10 20:01:54,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:01:54,466 INFO L470 AbstractCegarLoop]: Abstraction has 6282 states and 8059 transitions. [2022-01-10 20:01:54,466 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:54,467 INFO L276 IsEmpty]: Start isEmpty. Operand 6282 states and 8059 transitions. [2022-01-10 20:01:54,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 20:01:54,468 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:01:54,468 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:01:54,468 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-01-10 20:01:54,468 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:01:54,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:01:54,468 INFO L85 PathProgramCache]: Analyzing trace with hash -931939924, now seen corresponding path program 1 times [2022-01-10 20:01:54,468 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:01:54,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982448282] [2022-01-10 20:01:54,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:01:54,469 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:01:54,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:01:54,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:01:54,538 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:01:54,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982448282] [2022-01-10 20:01:54,538 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982448282] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:01:54,539 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:01:54,539 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:01:54,539 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319486166] [2022-01-10 20:01:54,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:01:54,539 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:01:54,539 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:01:54,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:01:54,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:54,540 INFO L87 Difference]: Start difference. First operand 6282 states and 8059 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:55,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:01:55,100 INFO L93 Difference]: Finished difference Result 12526 states and 16067 transitions. [2022-01-10 20:01:55,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:01:55,100 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 165 [2022-01-10 20:01:55,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:01:55,105 INFO L225 Difference]: With dead ends: 12526 [2022-01-10 20:01:55,106 INFO L226 Difference]: Without dead ends: 6282 [2022-01-10 20:01:55,108 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:55,109 INFO L933 BasicCegarLoop]: 2260 mSDtfsCounter, 2020 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2020 SdHoareTripleChecker+Valid, 2373 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:01:55,109 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2020 Valid, 2373 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:01:55,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6282 states. [2022-01-10 20:01:55,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6282 to 6282. [2022-01-10 20:01:55,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6282 states, 6281 states have (on average 1.2765483203311574) internal successors, (8018), 6281 states have internal predecessors, (8018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:55,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6282 states to 6282 states and 8018 transitions. [2022-01-10 20:01:55,608 INFO L78 Accepts]: Start accepts. Automaton has 6282 states and 8018 transitions. Word has length 165 [2022-01-10 20:01:55,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:01:55,608 INFO L470 AbstractCegarLoop]: Abstraction has 6282 states and 8018 transitions. [2022-01-10 20:01:55,609 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:55,609 INFO L276 IsEmpty]: Start isEmpty. Operand 6282 states and 8018 transitions. [2022-01-10 20:01:55,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 20:01:55,609 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:01:55,609 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:01:55,609 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-01-10 20:01:55,609 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:01:55,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:01:55,610 INFO L85 PathProgramCache]: Analyzing trace with hash 312824557, now seen corresponding path program 1 times [2022-01-10 20:01:55,610 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:01:55,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358888353] [2022-01-10 20:01:55,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:01:55,610 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:01:55,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:01:55,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:01:55,657 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:01:55,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358888353] [2022-01-10 20:01:55,658 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358888353] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:01:55,658 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:01:55,658 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:01:55,658 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186754329] [2022-01-10 20:01:55,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:01:55,658 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:01:55,658 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:01:55,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:01:55,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:55,659 INFO L87 Difference]: Start difference. First operand 6282 states and 8018 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:56,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:01:56,720 INFO L93 Difference]: Finished difference Result 18553 states and 23699 transitions. [2022-01-10 20:01:56,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:01:56,720 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 165 [2022-01-10 20:01:56,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:01:56,734 INFO L225 Difference]: With dead ends: 18553 [2022-01-10 20:01:56,734 INFO L226 Difference]: Without dead ends: 12318 [2022-01-10 20:01:56,741 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:56,749 INFO L933 BasicCegarLoop]: 2260 mSDtfsCounter, 2076 mSDsluCounter, 2047 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2076 SdHoareTripleChecker+Valid, 4307 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:01:56,749 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2076 Valid, 4307 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:01:56,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12318 states. [2022-01-10 20:01:57,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12318 to 11960. [2022-01-10 20:01:57,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11960 states, 11959 states have (on average 1.2736850907266495) internal successors, (15232), 11959 states have internal predecessors, (15232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:57,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11960 states to 11960 states and 15232 transitions. [2022-01-10 20:01:57,740 INFO L78 Accepts]: Start accepts. Automaton has 11960 states and 15232 transitions. Word has length 165 [2022-01-10 20:01:57,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:01:57,741 INFO L470 AbstractCegarLoop]: Abstraction has 11960 states and 15232 transitions. [2022-01-10 20:01:57,741 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:57,741 INFO L276 IsEmpty]: Start isEmpty. Operand 11960 states and 15232 transitions. [2022-01-10 20:01:57,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2022-01-10 20:01:57,746 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:01:57,746 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:01:57,747 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-01-10 20:01:57,747 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:01:57,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:01:57,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1258792768, now seen corresponding path program 1 times [2022-01-10 20:01:57,747 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:01:57,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054868777] [2022-01-10 20:01:57,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:01:57,747 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:01:57,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:01:57,801 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:01:57,801 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:01:57,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054868777] [2022-01-10 20:01:57,801 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054868777] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:01:57,801 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:01:57,801 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:01:57,801 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960734601] [2022-01-10 20:01:57,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:01:57,802 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:01:57,802 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:01:57,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:01:57,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:57,802 INFO L87 Difference]: Start difference. First operand 11960 states and 15232 transitions. Second operand has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:01:59,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:01:59,858 INFO L93 Difference]: Finished difference Result 35480 states and 45234 transitions. [2022-01-10 20:01:59,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:01:59,858 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 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 268 [2022-01-10 20:01:59,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:01:59,883 INFO L225 Difference]: With dead ends: 35480 [2022-01-10 20:01:59,884 INFO L226 Difference]: Without dead ends: 23573 [2022-01-10 20:01:59,894 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:01:59,895 INFO L933 BasicCegarLoop]: 2257 mSDtfsCounter, 2112 mSDsluCounter, 2047 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2112 SdHoareTripleChecker+Valid, 4304 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 20:01:59,895 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2112 Valid, 4304 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 20:01:59,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23573 states. [2022-01-10 20:02:01,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23573 to 22871. [2022-01-10 20:02:01,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22871 states, 22870 states have (on average 1.2714473108876256) internal successors, (29078), 22870 states have internal predecessors, (29078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:01,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22871 states to 22871 states and 29078 transitions. [2022-01-10 20:02:01,988 INFO L78 Accepts]: Start accepts. Automaton has 22871 states and 29078 transitions. Word has length 268 [2022-01-10 20:02:01,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:02:01,988 INFO L470 AbstractCegarLoop]: Abstraction has 22871 states and 29078 transitions. [2022-01-10 20:02:01,988 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:01,988 INFO L276 IsEmpty]: Start isEmpty. Operand 22871 states and 29078 transitions. [2022-01-10 20:02:01,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2022-01-10 20:02:01,998 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:02:01,998 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:02:01,998 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-01-10 20:02:01,998 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:02:01,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:02:01,998 INFO L85 PathProgramCache]: Analyzing trace with hash -610923295, now seen corresponding path program 1 times [2022-01-10 20:02:01,999 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:02:01,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409056438] [2022-01-10 20:02:01,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:02:01,999 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:02:02,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:02:02,068 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:02:02,068 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:02:02,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409056438] [2022-01-10 20:02:02,068 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409056438] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:02:02,068 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:02:02,068 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 20:02:02,068 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717785011] [2022-01-10 20:02:02,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:02:02,069 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 20:02:02,069 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:02:02,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 20:02:02,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 20:02:02,069 INFO L87 Difference]: Start difference. First operand 22871 states and 29078 transitions. Second operand has 5 states, 5 states have (on average 53.6) internal successors, (268), 5 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:06,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:02:06,058 INFO L93 Difference]: Finished difference Result 62289 states and 79441 transitions. [2022-01-10 20:02:06,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 20:02:06,058 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 53.6) internal successors, (268), 5 states have internal predecessors, (268), 0 states have call successors, (0), 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 268 [2022-01-10 20:02:06,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:02:06,134 INFO L225 Difference]: With dead ends: 62289 [2022-01-10 20:02:06,134 INFO L226 Difference]: Without dead ends: 39523 [2022-01-10 20:02:06,155 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-10 20:02:06,155 INFO L933 BasicCegarLoop]: 2291 mSDtfsCounter, 5284 mSDsluCounter, 4787 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5284 SdHoareTripleChecker+Valid, 7078 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 20:02:06,155 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5284 Valid, 7078 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 20:02:06,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39523 states. [2022-01-10 20:02:08,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39523 to 22919. [2022-01-10 20:02:08,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22919 states, 22918 states have (on average 1.2624574570206823) internal successors, (28933), 22918 states have internal predecessors, (28933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:08,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22919 states to 22919 states and 28933 transitions. [2022-01-10 20:02:08,636 INFO L78 Accepts]: Start accepts. Automaton has 22919 states and 28933 transitions. Word has length 268 [2022-01-10 20:02:08,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:02:08,637 INFO L470 AbstractCegarLoop]: Abstraction has 22919 states and 28933 transitions. [2022-01-10 20:02:08,637 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 53.6) internal successors, (268), 5 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:08,637 INFO L276 IsEmpty]: Start isEmpty. Operand 22919 states and 28933 transitions. [2022-01-10 20:02:08,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2022-01-10 20:02:08,660 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:02:08,661 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:02:08,661 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-01-10 20:02:08,661 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:02:08,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:02:08,661 INFO L85 PathProgramCache]: Analyzing trace with hash -593302433, now seen corresponding path program 1 times [2022-01-10 20:02:08,661 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:02:08,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615540063] [2022-01-10 20:02:08,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:02:08,662 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:02:08,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:02:08,718 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:02:08,719 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:02:08,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615540063] [2022-01-10 20:02:08,719 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615540063] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:02:08,719 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:02:08,719 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:02:08,719 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945603387] [2022-01-10 20:02:08,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:02:08,719 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:02:08,719 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:02:08,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:02:08,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:08,720 INFO L87 Difference]: Start difference. First operand 22919 states and 28933 transitions. Second operand has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:13,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:02:13,164 INFO L93 Difference]: Finished difference Result 67897 states and 85318 transitions. [2022-01-10 20:02:13,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:02:13,164 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 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 268 [2022-01-10 20:02:13,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:02:13,228 INFO L225 Difference]: With dead ends: 67897 [2022-01-10 20:02:13,228 INFO L226 Difference]: Without dead ends: 45139 [2022-01-10 20:02:13,251 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:13,252 INFO L933 BasicCegarLoop]: 2781 mSDtfsCounter, 2079 mSDsluCounter, 2224 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2079 SdHoareTripleChecker+Valid, 5005 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:02:13,252 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2079 Valid, 5005 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:02:13,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45139 states. [2022-01-10 20:02:18,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45139 to 44469. [2022-01-10 20:02:18,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44469 states, 44468 states have (on average 1.2521363677251056) internal successors, (55680), 44468 states have internal predecessors, (55680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:18,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44469 states to 44469 states and 55680 transitions. [2022-01-10 20:02:18,117 INFO L78 Accepts]: Start accepts. Automaton has 44469 states and 55680 transitions. Word has length 268 [2022-01-10 20:02:18,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:02:18,117 INFO L470 AbstractCegarLoop]: Abstraction has 44469 states and 55680 transitions. [2022-01-10 20:02:18,118 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:18,118 INFO L276 IsEmpty]: Start isEmpty. Operand 44469 states and 55680 transitions. [2022-01-10 20:02:18,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2022-01-10 20:02:18,133 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:02:18,133 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:02:18,133 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-01-10 20:02:18,134 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:02:18,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:02:18,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1052735748, now seen corresponding path program 1 times [2022-01-10 20:02:18,134 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:02:18,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041795505] [2022-01-10 20:02:18,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:02:18,134 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:02:18,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:02:18,165 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-10 20:02:18,165 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:02:18,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041795505] [2022-01-10 20:02:18,166 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041795505] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:02:18,166 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:02:18,166 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:02:18,166 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957832093] [2022-01-10 20:02:18,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:02:18,166 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:02:18,166 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:02:18,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:02:18,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:18,167 INFO L87 Difference]: Start difference. First operand 44469 states and 55680 transitions. Second operand has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:23,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:02:23,005 INFO L93 Difference]: Finished difference Result 88727 states and 111107 transitions. [2022-01-10 20:02:23,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:02:23,005 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 0 states have call successors, (0), 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 268 [2022-01-10 20:02:23,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:02:23,067 INFO L225 Difference]: With dead ends: 88727 [2022-01-10 20:02:23,067 INFO L226 Difference]: Without dead ends: 44315 [2022-01-10 20:02:23,101 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:23,101 INFO L933 BasicCegarLoop]: 2258 mSDtfsCounter, 2253 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2253 SdHoareTripleChecker+Valid, 2259 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:02:23,101 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2253 Valid, 2259 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:02:23,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44315 states. [2022-01-10 20:02:27,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44315 to 44315. [2022-01-10 20:02:27,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44315 states, 44314 states have (on average 1.252335605000677) internal successors, (55496), 44314 states have internal predecessors, (55496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:27,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44315 states to 44315 states and 55496 transitions. [2022-01-10 20:02:27,893 INFO L78 Accepts]: Start accepts. Automaton has 44315 states and 55496 transitions. Word has length 268 [2022-01-10 20:02:27,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:02:27,893 INFO L470 AbstractCegarLoop]: Abstraction has 44315 states and 55496 transitions. [2022-01-10 20:02:27,893 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:27,893 INFO L276 IsEmpty]: Start isEmpty. Operand 44315 states and 55496 transitions. [2022-01-10 20:02:27,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2022-01-10 20:02:27,907 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:02:27,908 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:02:27,908 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-01-10 20:02:27,908 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:02:27,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:02:27,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1639501910, now seen corresponding path program 1 times [2022-01-10 20:02:27,908 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:02:27,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143896013] [2022-01-10 20:02:27,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:02:27,908 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:02:27,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:02:27,970 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:02:27,970 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:02:27,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143896013] [2022-01-10 20:02:27,971 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143896013] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:02:27,971 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:02:27,971 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:02:27,971 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948810855] [2022-01-10 20:02:27,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:02:27,971 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:02:27,971 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:02:27,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:02:27,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:27,972 INFO L87 Difference]: Start difference. First operand 44315 states and 55496 transitions. Second operand has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:36,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:02:36,649 INFO L93 Difference]: Finished difference Result 129080 states and 161295 transitions. [2022-01-10 20:02:36,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:02:36,649 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 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 269 [2022-01-10 20:02:36,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:02:36,781 INFO L225 Difference]: With dead ends: 129080 [2022-01-10 20:02:36,781 INFO L226 Difference]: Without dead ends: 84926 [2022-01-10 20:02:36,811 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:36,811 INFO L933 BasicCegarLoop]: 3587 mSDtfsCounter, 1825 mSDsluCounter, 2237 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1825 SdHoareTripleChecker+Valid, 5824 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:02:36,811 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1825 Valid, 5824 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:02:36,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84926 states.