/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_NONE.epf -i ../../../trunk/examples/svcomp/combinations/pc_sfifo_1.cil-2+token_ring.11.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-11 01:47:39,067 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-11 01:47:39,068 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-11 01:47:39,101 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-11 01:47:39,101 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-11 01:47:39,102 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-11 01:47:39,103 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-11 01:47:39,104 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-11 01:47:39,121 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-11 01:47:39,121 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-11 01:47:39,122 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-11 01:47:39,123 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-11 01:47:39,123 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-11 01:47:39,124 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-11 01:47:39,124 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-11 01:47:39,125 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-11 01:47:39,125 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-11 01:47:39,126 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-11 01:47:39,127 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-11 01:47:39,128 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-11 01:47:39,129 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-11 01:47:39,142 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-11 01:47:39,143 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-11 01:47:39,143 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-11 01:47:39,147 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-11 01:47:39,147 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-11 01:47:39,148 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-11 01:47:39,148 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-11 01:47:39,148 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-11 01:47:39,149 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-11 01:47:39,149 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-11 01:47:39,149 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-11 01:47:39,150 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-11 01:47:39,150 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-11 01:47:39,151 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-11 01:47:39,151 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-11 01:47:39,151 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-11 01:47:39,152 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-11 01:47:39,152 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-11 01:47:39,152 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-11 01:47:39,153 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-11 01:47:39,155 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_NONE.epf [2022-01-11 01:47:39,173 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-11 01:47:39,173 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-11 01:47:39,173 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-11 01:47:39,173 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-11 01:47:39,174 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-11 01:47:39,174 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-11 01:47:39,174 INFO L138 SettingsManager]: * Use SBE=true [2022-01-11 01:47:39,175 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-11 01:47:39,175 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-11 01:47:39,175 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-11 01:47:39,175 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-11 01:47:39,175 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-11 01:47:39,175 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-11 01:47:39,175 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-11 01:47:39,175 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-11 01:47:39,175 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-11 01:47:39,175 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-11 01:47:39,176 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-11 01:47:39,176 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-11 01:47:39,176 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-11 01:47:39,176 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-11 01:47:39,176 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 01:47:39,176 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-11 01:47:39,176 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-11 01:47:39,176 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-11 01:47:39,176 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-11 01:47:39,177 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-11 01:47:39,177 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-11 01:47:39,177 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-11 01:47:39,177 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-11 01:47:39,177 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-11 01:47:39,177 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-11 01:47:39,177 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-11 01:47:39,178 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_NONE WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-11 01:47:39,375 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-11 01:47:39,389 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-11 01:47:39,390 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-11 01:47:39,391 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-11 01:47:39,391 INFO L275 PluginConnector]: CDTParser initialized [2022-01-11 01:47:39,392 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.11.cil-2.c [2022-01-11 01:47:39,439 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9545f55fe/f0dfc4af2cbf4b5b8055466d5bf607e7/FLAG777e3a998 [2022-01-11 01:47:39,851 INFO L306 CDTParser]: Found 1 translation units. [2022-01-11 01:47:39,852 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_1.cil-2+token_ring.11.cil-2.c [2022-01-11 01:47:39,872 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9545f55fe/f0dfc4af2cbf4b5b8055466d5bf607e7/FLAG777e3a998 [2022-01-11 01:47:39,887 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9545f55fe/f0dfc4af2cbf4b5b8055466d5bf607e7 [2022-01-11 01:47:39,889 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-11 01:47:39,890 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-11 01:47:39,893 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-11 01:47:39,893 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-11 01:47:39,896 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-11 01:47:39,896 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 01:47:39" (1/1) ... [2022-01-11 01:47:39,897 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@518836d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:47:39, skipping insertion in model container [2022-01-11 01:47:39,897 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 01:47:39" (1/1) ... [2022-01-11 01:47:39,901 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-11 01:47:39,961 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-11 01:47:40,082 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.11.cil-2.c[913,926] [2022-01-11 01:47:40,108 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.11.cil-2.c[5977,5990] [2022-01-11 01:47:40,186 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 01:47:40,199 INFO L203 MainTranslator]: Completed pre-run [2022-01-11 01:47:40,206 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.11.cil-2.c[913,926] [2022-01-11 01:47:40,215 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.11.cil-2.c[5977,5990] [2022-01-11 01:47:40,264 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 01:47:40,293 INFO L208 MainTranslator]: Completed translation [2022-01-11 01:47:40,294 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:47:40 WrapperNode [2022-01-11 01:47:40,294 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-11 01:47:40,295 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-11 01:47:40,295 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-11 01:47:40,295 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-11 01:47:40,300 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:47:40" (1/1) ... [2022-01-11 01:47:40,312 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:47:40" (1/1) ... [2022-01-11 01:47:40,402 INFO L137 Inliner]: procedures = 71, calls = 81, calls flagged for inlining = 76, calls inlined = 257, statements flattened = 3898 [2022-01-11 01:47:40,403 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-11 01:47:40,403 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-11 01:47:40,403 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-11 01:47:40,404 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-11 01:47:40,412 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:47:40" (1/1) ... [2022-01-11 01:47:40,412 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:47:40" (1/1) ... [2022-01-11 01:47:40,434 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:47:40" (1/1) ... [2022-01-11 01:47:40,435 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:47:40" (1/1) ... [2022-01-11 01:47:40,460 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:47:40" (1/1) ... [2022-01-11 01:47:40,501 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:47:40" (1/1) ... [2022-01-11 01:47:40,506 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:47:40" (1/1) ... [2022-01-11 01:47:40,529 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-11 01:47:40,530 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-11 01:47:40,530 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-11 01:47:40,531 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-11 01:47:40,532 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:47:40" (1/1) ... [2022-01-11 01:47:40,540 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 01:47:40,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 01:47:40,568 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-11 01:47:40,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-11 01:47:40,596 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-11 01:47:40,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-11 01:47:40,597 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-11 01:47:40,597 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-11 01:47:40,761 INFO L234 CfgBuilder]: Building ICFG [2022-01-11 01:47:40,762 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-11 01:47:42,262 INFO L275 CfgBuilder]: Performing block encoding [2022-01-11 01:47:42,281 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-11 01:47:42,281 INFO L299 CfgBuilder]: Removed 18 assume(true) statements. [2022-01-11 01:47:42,284 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 01:47:42 BoogieIcfgContainer [2022-01-11 01:47:42,285 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-11 01:47:42,285 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-11 01:47:42,285 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-11 01:47:42,286 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-11 01:47:42,288 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 01:47:42" (1/1) ... [2022-01-11 01:47:42,580 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 01:47:42 BasicIcfg [2022-01-11 01:47:42,581 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-11 01:47:42,582 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-11 01:47:42,582 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-11 01:47:42,584 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-11 01:47:42,584 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 01:47:39" (1/4) ... [2022-01-11 01:47:42,585 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@321d3c5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 01:47:42, skipping insertion in model container [2022-01-11 01:47:42,585 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:47:40" (2/4) ... [2022-01-11 01:47:42,585 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@321d3c5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 01:47:42, skipping insertion in model container [2022-01-11 01:47:42,585 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 01:47:42" (3/4) ... [2022-01-11 01:47:42,586 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@321d3c5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 01:47:42, skipping insertion in model container [2022-01-11 01:47:42,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 01:47:42" (4/4) ... [2022-01-11 01:47:42,589 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.11.cil-2.cTransformedIcfg [2022-01-11 01:47:42,593 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-11 01:47:42,593 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-01-11 01:47:42,641 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-11 01:47:42,645 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-11 01:47:42,645 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-01-11 01:47:42,683 INFO L276 IsEmpty]: Start isEmpty. Operand has 1652 states, 1648 states have (on average 1.5060679611650485) internal successors, (2482), 1651 states have internal predecessors, (2482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:42,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-11 01:47:42,688 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:42,688 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:47:42,689 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:47:42,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:42,692 INFO L85 PathProgramCache]: Analyzing trace with hash 594885759, now seen corresponding path program 1 times [2022-01-11 01:47:42,698 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:42,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408228141] [2022-01-11 01:47:42,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:42,699 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:42,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:42,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:42,972 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:42,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408228141] [2022-01-11 01:47:42,973 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408228141] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:42,973 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:42,973 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:47:42,974 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521841271] [2022-01-11 01:47:42,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:42,979 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:42,980 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:43,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:43,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:43,008 INFO L87 Difference]: Start difference. First operand has 1652 states, 1648 states have (on average 1.5060679611650485) internal successors, (2482), 1651 states have internal predecessors, (2482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:43,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:43,188 INFO L93 Difference]: Finished difference Result 3215 states and 4810 transitions. [2022-01-11 01:47:43,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:43,190 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-01-11 01:47:43,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:43,211 INFO L225 Difference]: With dead ends: 3215 [2022-01-11 01:47:43,212 INFO L226 Difference]: Without dead ends: 1707 [2022-01-11 01:47:43,220 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:43,223 INFO L933 BasicCegarLoop]: 2461 mSDtfsCounter, 2411 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2411 SdHoareTripleChecker+Valid, 2555 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:43,225 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2411 Valid, 2555 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 01:47:43,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2022-01-11 01:47:43,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1686. [2022-01-11 01:47:43,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1686 states, 1683 states have (on average 1.4806892453951277) internal successors, (2492), 1685 states have internal predecessors, (2492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:43,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1686 states to 1686 states and 2492 transitions. [2022-01-11 01:47:43,314 INFO L78 Accepts]: Start accepts. Automaton has 1686 states and 2492 transitions. Word has length 36 [2022-01-11 01:47:43,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:43,315 INFO L470 AbstractCegarLoop]: Abstraction has 1686 states and 2492 transitions. [2022-01-11 01:47:43,315 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:43,315 INFO L276 IsEmpty]: Start isEmpty. Operand 1686 states and 2492 transitions. [2022-01-11 01:47:43,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-01-11 01:47:43,319 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:43,319 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:47:43,320 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-11 01:47:43,320 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:47:43,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:43,322 INFO L85 PathProgramCache]: Analyzing trace with hash -2119266498, now seen corresponding path program 1 times [2022-01-11 01:47:43,322 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:43,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563031765] [2022-01-11 01:47:43,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:43,323 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:43,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:43,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-11 01:47:43,444 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:43,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563031765] [2022-01-11 01:47:43,444 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563031765] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:43,444 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:43,444 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:47:43,444 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901662004] [2022-01-11 01:47:43,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:43,445 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:43,445 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:43,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:43,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:43,446 INFO L87 Difference]: Start difference. First operand 1686 states and 2492 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:43,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:43,488 INFO L93 Difference]: Finished difference Result 1855 states and 2727 transitions. [2022-01-11 01:47:43,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:43,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-11 01:47:43,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:43,495 INFO L225 Difference]: With dead ends: 1855 [2022-01-11 01:47:43,495 INFO L226 Difference]: Without dead ends: 1744 [2022-01-11 01:47:43,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-11 01:47:43,498 INFO L933 BasicCegarLoop]: 2430 mSDtfsCounter, 60 mSDsluCounter, 2391 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 4821 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:43,499 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 4821 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:43,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1744 states. [2022-01-11 01:47:43,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1744 to 1739. [2022-01-11 01:47:43,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1739 states, 1736 states have (on average 1.4775345622119815) internal successors, (2565), 1738 states have internal predecessors, (2565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:43,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1739 states to 1739 states and 2565 transitions. [2022-01-11 01:47:43,527 INFO L78 Accepts]: Start accepts. Automaton has 1739 states and 2565 transitions. Word has length 37 [2022-01-11 01:47:43,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:43,527 INFO L470 AbstractCegarLoop]: Abstraction has 1739 states and 2565 transitions. [2022-01-11 01:47:43,527 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:43,527 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 2565 transitions. [2022-01-11 01:47:43,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-01-11 01:47:43,528 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:43,528 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:47:43,528 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-11 01:47:43,528 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:47:43,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:43,529 INFO L85 PathProgramCache]: Analyzing trace with hash 2021403965, now seen corresponding path program 1 times [2022-01-11 01:47:43,529 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:43,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668316500] [2022-01-11 01:47:43,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:43,529 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:43,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:43,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:43,608 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:43,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668316500] [2022-01-11 01:47:43,608 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668316500] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:43,609 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:43,609 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:47:43,609 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453905250] [2022-01-11 01:47:43,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:43,609 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:43,609 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:43,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:43,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:43,610 INFO L87 Difference]: Start difference. First operand 1739 states and 2565 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:43,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:43,658 INFO L93 Difference]: Finished difference Result 2056 states and 3001 transitions. [2022-01-11 01:47:43,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:43,658 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-01-11 01:47:43,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:43,664 INFO L225 Difference]: With dead ends: 2056 [2022-01-11 01:47:43,664 INFO L226 Difference]: Without dead ends: 1892 [2022-01-11 01:47:43,667 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:43,670 INFO L933 BasicCegarLoop]: 2453 mSDtfsCounter, 2402 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2402 SdHoareTripleChecker+Valid, 2541 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:43,671 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2402 Valid, 2541 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:43,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1892 states. [2022-01-11 01:47:43,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1892 to 1870. [2022-01-11 01:47:43,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1870 states, 1867 states have (on average 1.468130690948045) internal successors, (2741), 1869 states have internal predecessors, (2741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:43,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1870 states to 1870 states and 2741 transitions. [2022-01-11 01:47:43,712 INFO L78 Accepts]: Start accepts. Automaton has 1870 states and 2741 transitions. Word has length 37 [2022-01-11 01:47:43,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:43,712 INFO L470 AbstractCegarLoop]: Abstraction has 1870 states and 2741 transitions. [2022-01-11 01:47:43,712 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:43,712 INFO L276 IsEmpty]: Start isEmpty. Operand 1870 states and 2741 transitions. [2022-01-11 01:47:43,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-11 01:47:43,716 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:43,716 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:47:43,716 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-11 01:47:43,717 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:47:43,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:43,717 INFO L85 PathProgramCache]: Analyzing trace with hash -868473691, now seen corresponding path program 1 times [2022-01-11 01:47:43,717 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:43,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366934804] [2022-01-11 01:47:43,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:43,718 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:43,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:43,782 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:43,782 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:43,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366934804] [2022-01-11 01:47:43,782 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366934804] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:43,782 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:43,782 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:47:43,783 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711794326] [2022-01-11 01:47:43,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:43,783 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:43,783 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:43,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:43,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:43,784 INFO L87 Difference]: Start difference. First operand 1870 states and 2741 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:43,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:43,834 INFO L93 Difference]: Finished difference Result 2321 states and 3348 transitions. [2022-01-11 01:47:43,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:43,835 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-01-11 01:47:43,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:43,841 INFO L225 Difference]: With dead ends: 2321 [2022-01-11 01:47:43,841 INFO L226 Difference]: Without dead ends: 2026 [2022-01-11 01:47:43,847 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:43,847 INFO L933 BasicCegarLoop]: 2483 mSDtfsCounter, 48 mSDsluCounter, 2418 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 4901 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:43,848 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 4901 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:43,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2026 states. [2022-01-11 01:47:43,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2026 to 2026. [2022-01-11 01:47:43,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2026 states, 2023 states have (on average 1.4478497281265448) internal successors, (2929), 2025 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:43,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2026 states to 2026 states and 2929 transitions. [2022-01-11 01:47:43,888 INFO L78 Accepts]: Start accepts. Automaton has 2026 states and 2929 transitions. Word has length 51 [2022-01-11 01:47:43,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:43,889 INFO L470 AbstractCegarLoop]: Abstraction has 2026 states and 2929 transitions. [2022-01-11 01:47:43,889 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:43,889 INFO L276 IsEmpty]: Start isEmpty. Operand 2026 states and 2929 transitions. [2022-01-11 01:47:43,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-11 01:47:43,890 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:43,890 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:47:43,890 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-11 01:47:43,890 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:47:43,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:43,891 INFO L85 PathProgramCache]: Analyzing trace with hash -220420167, now seen corresponding path program 1 times [2022-01-11 01:47:43,891 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:43,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412440362] [2022-01-11 01:47:43,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:43,891 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:43,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:43,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:43,954 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:43,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412440362] [2022-01-11 01:47:43,955 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412440362] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:43,955 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:43,955 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:47:43,955 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064201603] [2022-01-11 01:47:43,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:43,956 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:43,956 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:43,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:43,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:43,957 INFO L87 Difference]: Start difference. First operand 2026 states and 2929 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:44,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:44,017 INFO L93 Difference]: Finished difference Result 2499 states and 3545 transitions. [2022-01-11 01:47:44,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:44,018 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2022-01-11 01:47:44,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:44,025 INFO L225 Difference]: With dead ends: 2499 [2022-01-11 01:47:44,025 INFO L226 Difference]: Without dead ends: 2134 [2022-01-11 01:47:44,026 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:44,026 INFO L933 BasicCegarLoop]: 2430 mSDtfsCounter, 2376 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2376 SdHoareTripleChecker+Valid, 2518 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:44,027 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2376 Valid, 2518 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:44,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2134 states. [2022-01-11 01:47:44,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2134 to 2134. [2022-01-11 01:47:44,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2134 states, 2131 states have (on average 1.4345377756921633) internal successors, (3057), 2133 states have internal predecessors, (3057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:44,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2134 states to 2134 states and 3057 transitions. [2022-01-11 01:47:44,077 INFO L78 Accepts]: Start accepts. Automaton has 2134 states and 3057 transitions. Word has length 55 [2022-01-11 01:47:44,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:44,079 INFO L470 AbstractCegarLoop]: Abstraction has 2134 states and 3057 transitions. [2022-01-11 01:47:44,080 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:44,084 INFO L276 IsEmpty]: Start isEmpty. Operand 2134 states and 3057 transitions. [2022-01-11 01:47:44,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-01-11 01:47:44,086 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:44,086 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:47:44,086 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-11 01:47:44,086 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:47:44,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:44,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1186680931, now seen corresponding path program 1 times [2022-01-11 01:47:44,086 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:44,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887910034] [2022-01-11 01:47:44,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:44,087 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:44,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:44,160 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-11 01:47:44,161 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:44,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887910034] [2022-01-11 01:47:44,161 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887910034] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:44,161 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:44,161 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 01:47:44,161 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798233712] [2022-01-11 01:47:44,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:44,162 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 01:47:44,162 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:44,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 01:47:44,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 01:47:44,163 INFO L87 Difference]: Start difference. First operand 2134 states and 3057 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-11 01:47:44,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:44,260 INFO L93 Difference]: Finished difference Result 2884 states and 4035 transitions. [2022-01-11 01:47:44,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 01:47:44,261 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-11 01:47:44,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:44,267 INFO L225 Difference]: With dead ends: 2884 [2022-01-11 01:47:44,267 INFO L226 Difference]: Without dead ends: 2410 [2022-01-11 01:47:44,270 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-11 01:47:44,272 INFO L933 BasicCegarLoop]: 2481 mSDtfsCounter, 276 mSDsluCounter, 7385 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 9866 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:44,272 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [276 Valid, 9866 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:44,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2410 states. [2022-01-11 01:47:44,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2410 to 2035. [2022-01-11 01:47:44,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2035 states, 2032 states have (on average 1.4409448818897639) internal successors, (2928), 2034 states have internal predecessors, (2928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:44,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2035 states to 2035 states and 2928 transitions. [2022-01-11 01:47:44,323 INFO L78 Accepts]: Start accepts. Automaton has 2035 states and 2928 transitions. Word has length 56 [2022-01-11 01:47:44,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:44,324 INFO L470 AbstractCegarLoop]: Abstraction has 2035 states and 2928 transitions. [2022-01-11 01:47:44,324 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-11 01:47:44,324 INFO L276 IsEmpty]: Start isEmpty. Operand 2035 states and 2928 transitions. [2022-01-11 01:47:44,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-01-11 01:47:44,325 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:44,325 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:47:44,325 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-11 01:47:44,325 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:47:44,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:44,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1186710722, now seen corresponding path program 1 times [2022-01-11 01:47:44,326 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:44,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734893083] [2022-01-11 01:47:44,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:44,326 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:44,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:44,388 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:44,388 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:44,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734893083] [2022-01-11 01:47:44,388 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734893083] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:44,388 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:44,389 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 01:47:44,389 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709148631] [2022-01-11 01:47:44,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:44,389 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 01:47:44,389 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:44,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 01:47:44,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 01:47:44,390 INFO L87 Difference]: Start difference. First operand 2035 states and 2928 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:44,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:44,512 INFO L93 Difference]: Finished difference Result 2085 states and 2988 transitions. [2022-01-11 01:47:44,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 01:47:44,512 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2022-01-11 01:47:44,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:44,518 INFO L225 Difference]: With dead ends: 2085 [2022-01-11 01:47:44,518 INFO L226 Difference]: Without dead ends: 2083 [2022-01-11 01:47:44,519 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 01:47:44,521 INFO L933 BasicCegarLoop]: 2430 mSDtfsCounter, 4828 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4828 SdHoareTripleChecker+Valid, 2499 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:44,521 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4828 Valid, 2499 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:44,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2083 states. [2022-01-11 01:47:44,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2083 to 2033. [2022-01-11 01:47:44,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2033 states, 2031 states have (on average 1.4401772525849335) internal successors, (2925), 2032 states have internal predecessors, (2925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:44,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2033 states to 2033 states and 2925 transitions. [2022-01-11 01:47:44,613 INFO L78 Accepts]: Start accepts. Automaton has 2033 states and 2925 transitions. Word has length 56 [2022-01-11 01:47:44,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:44,613 INFO L470 AbstractCegarLoop]: Abstraction has 2033 states and 2925 transitions. [2022-01-11 01:47:44,613 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:44,614 INFO L276 IsEmpty]: Start isEmpty. Operand 2033 states and 2925 transitions. [2022-01-11 01:47:44,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-01-11 01:47:44,614 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:44,614 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:47:44,615 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-11 01:47:44,615 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:47:44,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:44,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1866668041, now seen corresponding path program 1 times [2022-01-11 01:47:44,615 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:44,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853474176] [2022-01-11 01:47:44,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:44,616 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:44,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:44,763 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:44,764 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:44,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853474176] [2022-01-11 01:47:44,764 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853474176] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 01:47:44,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [98915509] [2022-01-11 01:47:44,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:44,764 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 01:47:44,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 01:47:44,766 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-11 01:47:44,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-11 01:47:44,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:44,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 671 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-11 01:47:44,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 01:47:45,172 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:45,172 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 01:47:45,432 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:45,432 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [98915509] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 01:47:45,432 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 01:47:45,432 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-01-11 01:47:45,433 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497164354] [2022-01-11 01:47:45,433 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 01:47:45,433 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-11 01:47:45,433 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:45,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-11 01:47:45,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-01-11 01:47:45,436 INFO L87 Difference]: Start difference. First operand 2033 states and 2925 transitions. Second operand has 10 states, 10 states have (on average 15.1) internal successors, (151), 10 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:45,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:45,646 INFO L93 Difference]: Finished difference Result 2889 states and 4027 transitions. [2022-01-11 01:47:45,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-11 01:47:45,647 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 15.1) internal successors, (151), 10 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2022-01-11 01:47:45,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:45,656 INFO L225 Difference]: With dead ends: 2889 [2022-01-11 01:47:45,657 INFO L226 Difference]: Without dead ends: 2887 [2022-01-11 01:47:45,658 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-01-11 01:47:45,658 INFO L933 BasicCegarLoop]: 2504 mSDtfsCounter, 5183 mSDsluCounter, 7635 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5183 SdHoareTripleChecker+Valid, 10139 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:45,658 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5183 Valid, 10139 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:45,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2887 states. [2022-01-11 01:47:45,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2887 to 2290. [2022-01-11 01:47:45,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2290 states, 2288 states have (on average 1.4270104895104896) internal successors, (3265), 2289 states have internal predecessors, (3265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:45,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2290 states to 2290 states and 3265 transitions. [2022-01-11 01:47:45,778 INFO L78 Accepts]: Start accepts. Automaton has 2290 states and 3265 transitions. Word has length 57 [2022-01-11 01:47:45,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:45,779 INFO L470 AbstractCegarLoop]: Abstraction has 2290 states and 3265 transitions. [2022-01-11 01:47:45,779 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.1) internal successors, (151), 10 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:45,779 INFO L276 IsEmpty]: Start isEmpty. Operand 2290 states and 3265 transitions. [2022-01-11 01:47:45,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-01-11 01:47:45,780 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:45,780 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:47:45,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-11 01:47:45,995 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-11 01:47:45,996 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:47:45,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:45,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1820242474, now seen corresponding path program 2 times [2022-01-11 01:47:45,996 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:45,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67284078] [2022-01-11 01:47:45,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:45,996 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:46,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:46,032 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:46,032 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:46,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67284078] [2022-01-11 01:47:46,032 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67284078] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:46,032 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:46,032 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:47:46,032 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980968467] [2022-01-11 01:47:46,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:46,033 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:46,033 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:46,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:46,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:46,033 INFO L87 Difference]: Start difference. First operand 2290 states and 3265 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:46,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:46,124 INFO L93 Difference]: Finished difference Result 2761 states and 3890 transitions. [2022-01-11 01:47:46,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:46,126 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2022-01-11 01:47:46,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:46,131 INFO L225 Difference]: With dead ends: 2761 [2022-01-11 01:47:46,132 INFO L226 Difference]: Without dead ends: 2201 [2022-01-11 01:47:46,133 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:46,133 INFO L933 BasicCegarLoop]: 2464 mSDtfsCounter, 2380 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2380 SdHoareTripleChecker+Valid, 2533 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:46,133 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2380 Valid, 2533 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:46,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2201 states. [2022-01-11 01:47:46,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2201 to 2175. [2022-01-11 01:47:46,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2175 states, 2173 states have (on average 1.4307409111826968) internal successors, (3109), 2174 states have internal predecessors, (3109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:46,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2175 states to 2175 states and 3109 transitions. [2022-01-11 01:47:46,226 INFO L78 Accepts]: Start accepts. Automaton has 2175 states and 3109 transitions. Word has length 72 [2022-01-11 01:47:46,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:46,227 INFO L470 AbstractCegarLoop]: Abstraction has 2175 states and 3109 transitions. [2022-01-11 01:47:46,227 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:46,227 INFO L276 IsEmpty]: Start isEmpty. Operand 2175 states and 3109 transitions. [2022-01-11 01:47:46,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-01-11 01:47:46,228 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:46,228 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-11 01:47:46,228 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-11 01:47:46,228 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:47:46,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:46,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1103547636, now seen corresponding path program 1 times [2022-01-11 01:47:46,228 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:46,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542125369] [2022-01-11 01:47:46,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:46,229 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:46,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:46,287 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-11 01:47:46,288 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:46,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542125369] [2022-01-11 01:47:46,288 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542125369] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:46,288 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:46,288 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:47:46,288 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27308758] [2022-01-11 01:47:46,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:46,288 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:46,288 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:46,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:46,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:46,289 INFO L87 Difference]: Start difference. First operand 2175 states and 3109 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:46,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:46,379 INFO L93 Difference]: Finished difference Result 2793 states and 3901 transitions. [2022-01-11 01:47:46,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:46,379 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2022-01-11 01:47:46,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:46,385 INFO L225 Difference]: With dead ends: 2793 [2022-01-11 01:47:46,385 INFO L226 Difference]: Without dead ends: 2193 [2022-01-11 01:47:46,386 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:46,386 INFO L933 BasicCegarLoop]: 2437 mSDtfsCounter, 2365 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2365 SdHoareTripleChecker+Valid, 2521 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:46,387 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2365 Valid, 2521 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:46,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2193 states. [2022-01-11 01:47:46,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2193 to 2175. [2022-01-11 01:47:46,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2175 states, 2173 states have (on average 1.4215370455591347) internal successors, (3089), 2174 states have internal predecessors, (3089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:46,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2175 states to 2175 states and 3089 transitions. [2022-01-11 01:47:46,467 INFO L78 Accepts]: Start accepts. Automaton has 2175 states and 3089 transitions. Word has length 84 [2022-01-11 01:47:46,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:46,468 INFO L470 AbstractCegarLoop]: Abstraction has 2175 states and 3089 transitions. [2022-01-11 01:47:46,468 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:46,468 INFO L276 IsEmpty]: Start isEmpty. Operand 2175 states and 3089 transitions. [2022-01-11 01:47:46,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-01-11 01:47:46,469 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:46,469 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-11 01:47:46,469 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-11 01:47:46,469 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:47:46,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:46,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1448192835, now seen corresponding path program 1 times [2022-01-11 01:47:46,470 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:46,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101420307] [2022-01-11 01:47:46,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:46,470 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:46,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:46,501 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-11 01:47:46,501 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:46,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101420307] [2022-01-11 01:47:46,502 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101420307] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:46,502 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:46,502 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:47:46,502 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439375307] [2022-01-11 01:47:46,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:46,502 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:46,502 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:46,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:46,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:46,503 INFO L87 Difference]: Start difference. First operand 2175 states and 3089 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:46,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:46,588 INFO L93 Difference]: Finished difference Result 2430 states and 3399 transitions. [2022-01-11 01:47:46,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:46,589 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2022-01-11 01:47:46,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:46,593 INFO L225 Difference]: With dead ends: 2430 [2022-01-11 01:47:46,593 INFO L226 Difference]: Without dead ends: 1569 [2022-01-11 01:47:46,594 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:46,594 INFO L933 BasicCegarLoop]: 2463 mSDtfsCounter, 56 mSDsluCounter, 2395 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 4858 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:46,594 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 4858 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:46,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1569 states. [2022-01-11 01:47:46,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1569 to 1569. [2022-01-11 01:47:46,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1569 states, 1568 states have (on average 1.4846938775510203) internal successors, (2328), 1568 states have internal predecessors, (2328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:46,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 2328 transitions. [2022-01-11 01:47:46,644 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 2328 transitions. Word has length 85 [2022-01-11 01:47:46,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:46,644 INFO L470 AbstractCegarLoop]: Abstraction has 1569 states and 2328 transitions. [2022-01-11 01:47:46,645 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:46,645 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 2328 transitions. [2022-01-11 01:47:46,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-01-11 01:47:46,645 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:46,646 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] [2022-01-11 01:47:46,646 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-11 01:47:46,646 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:47:46,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:46,646 INFO L85 PathProgramCache]: Analyzing trace with hash 2032522032, now seen corresponding path program 1 times [2022-01-11 01:47:46,647 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:46,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999984314] [2022-01-11 01:47:46,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:46,647 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:46,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:46,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:46,688 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:46,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999984314] [2022-01-11 01:47:46,689 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999984314] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:46,689 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:46,689 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:47:46,689 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216634635] [2022-01-11 01:47:46,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:46,689 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:46,689 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:46,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:46,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:46,690 INFO L87 Difference]: Start difference. First operand 1569 states and 2328 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:46,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:46,755 INFO L93 Difference]: Finished difference Result 3128 states and 4641 transitions. [2022-01-11 01:47:46,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:46,756 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 154 [2022-01-11 01:47:46,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:46,760 INFO L225 Difference]: With dead ends: 3128 [2022-01-11 01:47:46,760 INFO L226 Difference]: Without dead ends: 1569 [2022-01-11 01:47:46,762 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:46,762 INFO L933 BasicCegarLoop]: 2326 mSDtfsCounter, 2318 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2318 SdHoareTripleChecker+Valid, 2327 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:46,762 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2318 Valid, 2327 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:46,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1569 states. [2022-01-11 01:47:46,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1569 to 1569. [2022-01-11 01:47:46,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1569 states, 1568 states have (on average 1.4840561224489797) internal successors, (2327), 1568 states have internal predecessors, (2327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:46,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 2327 transitions. [2022-01-11 01:47:46,810 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 2327 transitions. Word has length 154 [2022-01-11 01:47:46,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:46,810 INFO L470 AbstractCegarLoop]: Abstraction has 1569 states and 2327 transitions. [2022-01-11 01:47:46,810 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:46,810 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 2327 transitions. [2022-01-11 01:47:46,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-01-11 01:47:46,811 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:46,811 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] [2022-01-11 01:47:46,811 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-11 01:47:46,811 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:47:46,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:46,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1084032303, now seen corresponding path program 1 times [2022-01-11 01:47:46,812 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:46,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991650940] [2022-01-11 01:47:46,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:46,812 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:46,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:46,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:46,853 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:46,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991650940] [2022-01-11 01:47:46,853 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991650940] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:46,854 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:46,854 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:46,854 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370361688] [2022-01-11 01:47:46,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:46,854 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:46,854 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:46,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:46,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:46,855 INFO L87 Difference]: Start difference. First operand 1569 states and 2327 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:46,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:46,963 INFO L93 Difference]: Finished difference Result 4450 states and 6580 transitions. [2022-01-11 01:47:46,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:46,963 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 154 [2022-01-11 01:47:46,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:46,997 INFO L225 Difference]: With dead ends: 4450 [2022-01-11 01:47:46,997 INFO L226 Difference]: Without dead ends: 2900 [2022-01-11 01:47:46,999 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:47,000 INFO L933 BasicCegarLoop]: 2321 mSDtfsCounter, 2181 mSDsluCounter, 2073 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2181 SdHoareTripleChecker+Valid, 4394 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:47,000 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2181 Valid, 4394 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:47,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2900 states. [2022-01-11 01:47:47,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2900 to 2898. [2022-01-11 01:47:47,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2898 states, 2897 states have (on average 1.4770452191922678) internal successors, (4279), 2897 states have internal predecessors, (4279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:47,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2898 states to 2898 states and 4279 transitions. [2022-01-11 01:47:47,125 INFO L78 Accepts]: Start accepts. Automaton has 2898 states and 4279 transitions. Word has length 154 [2022-01-11 01:47:47,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:47,126 INFO L470 AbstractCegarLoop]: Abstraction has 2898 states and 4279 transitions. [2022-01-11 01:47:47,126 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:47,126 INFO L276 IsEmpty]: Start isEmpty. Operand 2898 states and 4279 transitions. [2022-01-11 01:47:47,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-01-11 01:47:47,127 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:47,127 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] [2022-01-11 01:47:47,127 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-11 01:47:47,127 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:47:47,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:47,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1777190577, now seen corresponding path program 1 times [2022-01-11 01:47:47,128 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:47,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727265179] [2022-01-11 01:47:47,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:47,128 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:47,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:47,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:47,169 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:47,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727265179] [2022-01-11 01:47:47,169 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727265179] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:47,169 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:47,169 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:47,169 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716557283] [2022-01-11 01:47:47,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:47,170 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:47,170 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:47,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:47,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:47,171 INFO L87 Difference]: Start difference. First operand 2898 states and 4279 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:47,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:47,267 INFO L93 Difference]: Finished difference Result 5776 states and 8526 transitions. [2022-01-11 01:47:47,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:47,267 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 154 [2022-01-11 01:47:47,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:47,272 INFO L225 Difference]: With dead ends: 5776 [2022-01-11 01:47:47,272 INFO L226 Difference]: Without dead ends: 2898 [2022-01-11 01:47:47,275 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:47,275 INFO L933 BasicCegarLoop]: 2315 mSDtfsCounter, 2301 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2301 SdHoareTripleChecker+Valid, 2315 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:47,275 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2301 Valid, 2315 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:47,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2898 states. [2022-01-11 01:47:47,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2898 to 2898. [2022-01-11 01:47:47,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2898 states, 2897 states have (on average 1.474283741801864) internal successors, (4271), 2897 states have internal predecessors, (4271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:47,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2898 states to 2898 states and 4271 transitions. [2022-01-11 01:47:47,367 INFO L78 Accepts]: Start accepts. Automaton has 2898 states and 4271 transitions. Word has length 154 [2022-01-11 01:47:47,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:47,367 INFO L470 AbstractCegarLoop]: Abstraction has 2898 states and 4271 transitions. [2022-01-11 01:47:47,367 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:47,368 INFO L276 IsEmpty]: Start isEmpty. Operand 2898 states and 4271 transitions. [2022-01-11 01:47:47,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-01-11 01:47:47,368 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:47,368 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] [2022-01-11 01:47:47,369 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-11 01:47:47,369 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:47:47,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:47,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1592393425, now seen corresponding path program 1 times [2022-01-11 01:47:47,370 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:47,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192306232] [2022-01-11 01:47:47,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:47,370 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:47,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:47,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:47,407 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:47,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192306232] [2022-01-11 01:47:47,407 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192306232] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:47,407 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:47,407 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:47,409 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594866718] [2022-01-11 01:47:47,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:47,409 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:47,409 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:47,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:47,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:47,409 INFO L87 Difference]: Start difference. First operand 2898 states and 4271 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:47,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:47,528 INFO L93 Difference]: Finished difference Result 5775 states and 8509 transitions. [2022-01-11 01:47:47,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:47,529 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 154 [2022-01-11 01:47:47,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:47,534 INFO L225 Difference]: With dead ends: 5775 [2022-01-11 01:47:47,534 INFO L226 Difference]: Without dead ends: 2898 [2022-01-11 01:47:47,538 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:47,539 INFO L933 BasicCegarLoop]: 2310 mSDtfsCounter, 2295 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2295 SdHoareTripleChecker+Valid, 2310 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:47,539 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2295 Valid, 2310 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:47,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2898 states. [2022-01-11 01:47:47,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2898 to 2898. [2022-01-11 01:47:47,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2898 states, 2897 states have (on average 1.47152226441146) internal successors, (4263), 2897 states have internal predecessors, (4263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:47,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2898 states to 2898 states and 4263 transitions. [2022-01-11 01:47:47,636 INFO L78 Accepts]: Start accepts. Automaton has 2898 states and 4263 transitions. Word has length 154 [2022-01-11 01:47:47,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:47,636 INFO L470 AbstractCegarLoop]: Abstraction has 2898 states and 4263 transitions. [2022-01-11 01:47:47,636 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:47,636 INFO L276 IsEmpty]: Start isEmpty. Operand 2898 states and 4263 transitions. [2022-01-11 01:47:47,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-01-11 01:47:47,637 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:47,637 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] [2022-01-11 01:47:47,637 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-11 01:47:47,637 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:47:47,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:47,638 INFO L85 PathProgramCache]: Analyzing trace with hash 76135759, now seen corresponding path program 1 times [2022-01-11 01:47:47,638 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:47,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240396052] [2022-01-11 01:47:47,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:47,638 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:47,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:47,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:47,674 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:47,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240396052] [2022-01-11 01:47:47,674 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240396052] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:47,674 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:47,674 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:47,674 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422356911] [2022-01-11 01:47:47,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:47,675 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:47,675 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:47,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:47,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:47,675 INFO L87 Difference]: Start difference. First operand 2898 states and 4263 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:47,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:47,776 INFO L93 Difference]: Finished difference Result 5774 states and 8492 transitions. [2022-01-11 01:47:47,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:47,776 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 154 [2022-01-11 01:47:47,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:47,781 INFO L225 Difference]: With dead ends: 5774 [2022-01-11 01:47:47,781 INFO L226 Difference]: Without dead ends: 2898 [2022-01-11 01:47:47,784 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:47,784 INFO L933 BasicCegarLoop]: 2305 mSDtfsCounter, 2289 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2289 SdHoareTripleChecker+Valid, 2305 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:47,784 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2289 Valid, 2305 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:47,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2898 states. [2022-01-11 01:47:47,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2898 to 2898. [2022-01-11 01:47:47,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2898 states, 2897 states have (on average 1.4687607870210562) internal successors, (4255), 2897 states have internal predecessors, (4255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:47,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2898 states to 2898 states and 4255 transitions. [2022-01-11 01:47:47,914 INFO L78 Accepts]: Start accepts. Automaton has 2898 states and 4255 transitions. Word has length 154 [2022-01-11 01:47:47,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:47,914 INFO L470 AbstractCegarLoop]: Abstraction has 2898 states and 4255 transitions. [2022-01-11 01:47:47,914 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:47,914 INFO L276 IsEmpty]: Start isEmpty. Operand 2898 states and 4255 transitions. [2022-01-11 01:47:47,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-01-11 01:47:47,915 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:47,915 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] [2022-01-11 01:47:47,915 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-11 01:47:47,915 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:47:47,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:47,916 INFO L85 PathProgramCache]: Analyzing trace with hash -2086798033, now seen corresponding path program 1 times [2022-01-11 01:47:47,916 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:47,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315310700] [2022-01-11 01:47:47,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:47,916 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:47,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:47,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:47,955 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:47,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315310700] [2022-01-11 01:47:47,955 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315310700] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:47,955 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:47,955 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:47,955 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223640947] [2022-01-11 01:47:47,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:47,956 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:47,956 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:47,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:47,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:47,956 INFO L87 Difference]: Start difference. First operand 2898 states and 4255 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:48,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:48,065 INFO L93 Difference]: Finished difference Result 5773 states and 8475 transitions. [2022-01-11 01:47:48,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:48,066 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 154 [2022-01-11 01:47:48,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:48,071 INFO L225 Difference]: With dead ends: 5773 [2022-01-11 01:47:48,071 INFO L226 Difference]: Without dead ends: 2898 [2022-01-11 01:47:48,075 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:48,075 INFO L933 BasicCegarLoop]: 2300 mSDtfsCounter, 2283 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2283 SdHoareTripleChecker+Valid, 2300 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:48,076 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2283 Valid, 2300 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:48,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2898 states. [2022-01-11 01:47:48,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2898 to 2898. [2022-01-11 01:47:48,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2898 states, 2897 states have (on average 1.4659993096306525) internal successors, (4247), 2897 states have internal predecessors, (4247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:48,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2898 states to 2898 states and 4247 transitions. [2022-01-11 01:47:48,206 INFO L78 Accepts]: Start accepts. Automaton has 2898 states and 4247 transitions. Word has length 154 [2022-01-11 01:47:48,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:48,206 INFO L470 AbstractCegarLoop]: Abstraction has 2898 states and 4247 transitions. [2022-01-11 01:47:48,206 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:48,207 INFO L276 IsEmpty]: Start isEmpty. Operand 2898 states and 4247 transitions. [2022-01-11 01:47:48,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-01-11 01:47:48,207 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:48,207 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] [2022-01-11 01:47:48,208 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-11 01:47:48,208 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:47:48,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:48,209 INFO L85 PathProgramCache]: Analyzing trace with hash -216907441, now seen corresponding path program 1 times [2022-01-11 01:47:48,209 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:48,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421484284] [2022-01-11 01:47:48,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:48,209 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:48,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:48,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:48,246 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:48,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421484284] [2022-01-11 01:47:48,246 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421484284] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:48,246 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:48,246 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:48,246 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169276731] [2022-01-11 01:47:48,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:48,247 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:48,247 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:48,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:48,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:48,247 INFO L87 Difference]: Start difference. First operand 2898 states and 4247 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:48,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:48,356 INFO L93 Difference]: Finished difference Result 5772 states and 8458 transitions. [2022-01-11 01:47:48,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:48,357 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 154 [2022-01-11 01:47:48,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:48,361 INFO L225 Difference]: With dead ends: 5772 [2022-01-11 01:47:48,361 INFO L226 Difference]: Without dead ends: 2898 [2022-01-11 01:47:48,365 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:48,365 INFO L933 BasicCegarLoop]: 2295 mSDtfsCounter, 2277 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2277 SdHoareTripleChecker+Valid, 2295 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:48,366 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2277 Valid, 2295 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:48,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2898 states. [2022-01-11 01:47:48,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2898 to 2898. [2022-01-11 01:47:48,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2898 states, 2897 states have (on average 1.4632378322402486) internal successors, (4239), 2897 states have internal predecessors, (4239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:48,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2898 states to 2898 states and 4239 transitions. [2022-01-11 01:47:48,474 INFO L78 Accepts]: Start accepts. Automaton has 2898 states and 4239 transitions. Word has length 154 [2022-01-11 01:47:48,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:48,474 INFO L470 AbstractCegarLoop]: Abstraction has 2898 states and 4239 transitions. [2022-01-11 01:47:48,475 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:48,475 INFO L276 IsEmpty]: Start isEmpty. Operand 2898 states and 4239 transitions. [2022-01-11 01:47:48,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-01-11 01:47:48,475 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:48,476 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] [2022-01-11 01:47:48,476 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-11 01:47:48,476 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:47:48,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:48,476 INFO L85 PathProgramCache]: Analyzing trace with hash 536148271, now seen corresponding path program 1 times [2022-01-11 01:47:48,476 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:48,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358163090] [2022-01-11 01:47:48,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:48,478 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:48,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:48,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:48,512 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:48,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358163090] [2022-01-11 01:47:48,512 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358163090] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:48,512 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:48,512 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:48,512 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349340163] [2022-01-11 01:47:48,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:48,513 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:48,513 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:48,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:48,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:48,513 INFO L87 Difference]: Start difference. First operand 2898 states and 4239 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:48,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:48,692 INFO L93 Difference]: Finished difference Result 5771 states and 8441 transitions. [2022-01-11 01:47:48,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:48,694 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 154 [2022-01-11 01:47:48,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:48,720 INFO L225 Difference]: With dead ends: 5771 [2022-01-11 01:47:48,720 INFO L226 Difference]: Without dead ends: 2898 [2022-01-11 01:47:48,724 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:48,724 INFO L933 BasicCegarLoop]: 2290 mSDtfsCounter, 2271 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2271 SdHoareTripleChecker+Valid, 2290 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:48,725 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2271 Valid, 2290 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:48,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2898 states. [2022-01-11 01:47:48,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2898 to 2898. [2022-01-11 01:47:48,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2898 states, 2897 states have (on average 1.4604763548498447) internal successors, (4231), 2897 states have internal predecessors, (4231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:48,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2898 states to 2898 states and 4231 transitions. [2022-01-11 01:47:48,860 INFO L78 Accepts]: Start accepts. Automaton has 2898 states and 4231 transitions. Word has length 154 [2022-01-11 01:47:48,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:48,860 INFO L470 AbstractCegarLoop]: Abstraction has 2898 states and 4231 transitions. [2022-01-11 01:47:48,860 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:48,860 INFO L276 IsEmpty]: Start isEmpty. Operand 2898 states and 4231 transitions. [2022-01-11 01:47:48,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-01-11 01:47:48,861 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:48,861 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] [2022-01-11 01:47:48,861 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-11 01:47:48,861 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:47:48,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:48,861 INFO L85 PathProgramCache]: Analyzing trace with hash 837535055, now seen corresponding path program 1 times [2022-01-11 01:47:48,862 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:48,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035841086] [2022-01-11 01:47:48,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:48,862 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:48,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:48,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:48,904 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:48,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035841086] [2022-01-11 01:47:48,904 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035841086] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:48,904 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:48,904 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:48,904 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094630639] [2022-01-11 01:47:48,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:48,904 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:48,905 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:48,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:48,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:48,905 INFO L87 Difference]: Start difference. First operand 2898 states and 4231 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:49,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:49,039 INFO L93 Difference]: Finished difference Result 5770 states and 8424 transitions. [2022-01-11 01:47:49,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:49,040 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 154 [2022-01-11 01:47:49,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:49,045 INFO L225 Difference]: With dead ends: 5770 [2022-01-11 01:47:49,045 INFO L226 Difference]: Without dead ends: 2898 [2022-01-11 01:47:49,048 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:49,049 INFO L933 BasicCegarLoop]: 2285 mSDtfsCounter, 2265 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2265 SdHoareTripleChecker+Valid, 2285 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:49,049 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2265 Valid, 2285 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:49,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2898 states. [2022-01-11 01:47:49,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2898 to 2898. [2022-01-11 01:47:49,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2898 states, 2897 states have (on average 1.4577148774594408) internal successors, (4223), 2897 states have internal predecessors, (4223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:49,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2898 states to 2898 states and 4223 transitions. [2022-01-11 01:47:49,186 INFO L78 Accepts]: Start accepts. Automaton has 2898 states and 4223 transitions. Word has length 154 [2022-01-11 01:47:49,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:49,186 INFO L470 AbstractCegarLoop]: Abstraction has 2898 states and 4223 transitions. [2022-01-11 01:47:49,186 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:49,186 INFO L276 IsEmpty]: Start isEmpty. Operand 2898 states and 4223 transitions. [2022-01-11 01:47:49,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-01-11 01:47:49,187 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:49,187 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] [2022-01-11 01:47:49,187 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-11 01:47:49,187 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:47:49,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:49,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1646594769, now seen corresponding path program 1 times [2022-01-11 01:47:49,188 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:49,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144287279] [2022-01-11 01:47:49,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:49,188 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:49,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:49,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:49,220 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:49,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144287279] [2022-01-11 01:47:49,221 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144287279] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:49,221 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:49,221 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:49,221 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052423354] [2022-01-11 01:47:49,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:49,222 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:49,222 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:49,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:49,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:49,223 INFO L87 Difference]: Start difference. First operand 2898 states and 4223 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:49,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:49,336 INFO L93 Difference]: Finished difference Result 5769 states and 8407 transitions. [2022-01-11 01:47:49,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:49,337 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 154 [2022-01-11 01:47:49,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:49,341 INFO L225 Difference]: With dead ends: 5769 [2022-01-11 01:47:49,341 INFO L226 Difference]: Without dead ends: 2898 [2022-01-11 01:47:49,345 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:49,345 INFO L933 BasicCegarLoop]: 2280 mSDtfsCounter, 2259 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2259 SdHoareTripleChecker+Valid, 2280 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:49,345 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2259 Valid, 2280 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:49,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2898 states. [2022-01-11 01:47:49,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2898 to 2898. [2022-01-11 01:47:49,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2898 states, 2897 states have (on average 1.454953400069037) internal successors, (4215), 2897 states have internal predecessors, (4215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:49,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2898 states to 2898 states and 4215 transitions. [2022-01-11 01:47:49,452 INFO L78 Accepts]: Start accepts. Automaton has 2898 states and 4215 transitions. Word has length 154 [2022-01-11 01:47:49,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:49,452 INFO L470 AbstractCegarLoop]: Abstraction has 2898 states and 4215 transitions. [2022-01-11 01:47:49,452 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:49,452 INFO L276 IsEmpty]: Start isEmpty. Operand 2898 states and 4215 transitions. [2022-01-11 01:47:49,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-01-11 01:47:49,453 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:49,453 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] [2022-01-11 01:47:49,453 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-11 01:47:49,453 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:47:49,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:49,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1588180657, now seen corresponding path program 1 times [2022-01-11 01:47:49,454 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:49,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85112971] [2022-01-11 01:47:49,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:49,454 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:49,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:49,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:49,487 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:49,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85112971] [2022-01-11 01:47:49,487 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85112971] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:49,487 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:49,487 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:49,488 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065126019] [2022-01-11 01:47:49,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:49,488 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:49,488 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:49,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:49,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:49,489 INFO L87 Difference]: Start difference. First operand 2898 states and 4215 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:49,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:49,623 INFO L93 Difference]: Finished difference Result 5768 states and 8390 transitions. [2022-01-11 01:47:49,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:49,625 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 154 [2022-01-11 01:47:49,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:49,630 INFO L225 Difference]: With dead ends: 5768 [2022-01-11 01:47:49,630 INFO L226 Difference]: Without dead ends: 2898 [2022-01-11 01:47:49,633 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:49,633 INFO L933 BasicCegarLoop]: 2275 mSDtfsCounter, 2253 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2253 SdHoareTripleChecker+Valid, 2275 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:49,633 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2253 Valid, 2275 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:49,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2898 states. [2022-01-11 01:47:49,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2898 to 2898. [2022-01-11 01:47:49,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2898 states, 2897 states have (on average 1.452191922678633) internal successors, (4207), 2897 states have internal predecessors, (4207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:49,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2898 states to 2898 states and 4207 transitions. [2022-01-11 01:47:49,740 INFO L78 Accepts]: Start accepts. Automaton has 2898 states and 4207 transitions. Word has length 154 [2022-01-11 01:47:49,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:49,740 INFO L470 AbstractCegarLoop]: Abstraction has 2898 states and 4207 transitions. [2022-01-11 01:47:49,741 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:49,741 INFO L276 IsEmpty]: Start isEmpty. Operand 2898 states and 4207 transitions. [2022-01-11 01:47:49,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-01-11 01:47:49,741 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:49,742 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] [2022-01-11 01:47:49,742 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-11 01:47:49,742 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:47:49,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:49,742 INFO L85 PathProgramCache]: Analyzing trace with hash 353366319, now seen corresponding path program 1 times [2022-01-11 01:47:49,742 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:49,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446037383] [2022-01-11 01:47:49,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:49,742 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:49,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:49,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:49,770 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:49,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446037383] [2022-01-11 01:47:49,770 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446037383] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:49,770 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:49,770 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:49,771 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742079310] [2022-01-11 01:47:49,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:49,771 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:49,771 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:49,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:49,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:49,771 INFO L87 Difference]: Start difference. First operand 2898 states and 4207 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:49,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:49,901 INFO L93 Difference]: Finished difference Result 5767 states and 8373 transitions. [2022-01-11 01:47:49,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:49,902 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 154 [2022-01-11 01:47:49,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:49,905 INFO L225 Difference]: With dead ends: 5767 [2022-01-11 01:47:49,905 INFO L226 Difference]: Without dead ends: 2898 [2022-01-11 01:47:49,908 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:49,908 INFO L933 BasicCegarLoop]: 2270 mSDtfsCounter, 2247 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2247 SdHoareTripleChecker+Valid, 2270 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:49,908 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2247 Valid, 2270 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:49,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2898 states. [2022-01-11 01:47:50,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2898 to 2898. [2022-01-11 01:47:50,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2898 states, 2897 states have (on average 1.4494304452882292) internal successors, (4199), 2897 states have internal predecessors, (4199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:50,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2898 states to 2898 states and 4199 transitions. [2022-01-11 01:47:50,016 INFO L78 Accepts]: Start accepts. Automaton has 2898 states and 4199 transitions. Word has length 154 [2022-01-11 01:47:50,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:50,016 INFO L470 AbstractCegarLoop]: Abstraction has 2898 states and 4199 transitions. [2022-01-11 01:47:50,016 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:50,016 INFO L276 IsEmpty]: Start isEmpty. Operand 2898 states and 4199 transitions. [2022-01-11 01:47:50,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-01-11 01:47:50,017 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:50,017 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] [2022-01-11 01:47:50,017 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-11 01:47:50,017 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:47:50,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:50,018 INFO L85 PathProgramCache]: Analyzing trace with hash 831638863, now seen corresponding path program 1 times [2022-01-11 01:47:50,018 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:50,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556956869] [2022-01-11 01:47:50,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:50,018 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:50,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:50,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:50,047 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:50,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556956869] [2022-01-11 01:47:50,047 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556956869] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:50,047 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:50,047 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:50,047 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289521774] [2022-01-11 01:47:50,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:50,047 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:50,048 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:50,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:50,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:50,048 INFO L87 Difference]: Start difference. First operand 2898 states and 4199 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:50,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:50,186 INFO L93 Difference]: Finished difference Result 5766 states and 8356 transitions. [2022-01-11 01:47:50,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:50,186 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 154 [2022-01-11 01:47:50,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:50,191 INFO L225 Difference]: With dead ends: 5766 [2022-01-11 01:47:50,191 INFO L226 Difference]: Without dead ends: 2898 [2022-01-11 01:47:50,195 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:50,195 INFO L933 BasicCegarLoop]: 2265 mSDtfsCounter, 2241 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2241 SdHoareTripleChecker+Valid, 2265 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:50,195 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2241 Valid, 2265 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:50,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2898 states. [2022-01-11 01:47:50,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2898 to 2898. [2022-01-11 01:47:50,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2898 states, 2897 states have (on average 1.4466689678978253) internal successors, (4191), 2897 states have internal predecessors, (4191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:50,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2898 states to 2898 states and 4191 transitions. [2022-01-11 01:47:50,355 INFO L78 Accepts]: Start accepts. Automaton has 2898 states and 4191 transitions. Word has length 154 [2022-01-11 01:47:50,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:50,356 INFO L470 AbstractCegarLoop]: Abstraction has 2898 states and 4191 transitions. [2022-01-11 01:47:50,356 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:50,356 INFO L276 IsEmpty]: Start isEmpty. Operand 2898 states and 4191 transitions. [2022-01-11 01:47:50,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-01-11 01:47:50,357 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:50,357 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] [2022-01-11 01:47:50,357 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-11 01:47:50,357 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:47:50,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:50,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1923879633, now seen corresponding path program 1 times [2022-01-11 01:47:50,358 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:50,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830628637] [2022-01-11 01:47:50,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:50,358 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:50,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:50,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:50,391 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:50,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830628637] [2022-01-11 01:47:50,391 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830628637] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:50,391 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:50,391 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:50,391 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410129435] [2022-01-11 01:47:50,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:50,391 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:50,392 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:50,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:50,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:50,392 INFO L87 Difference]: Start difference. First operand 2898 states and 4191 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:50,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:50,561 INFO L93 Difference]: Finished difference Result 5765 states and 8339 transitions. [2022-01-11 01:47:50,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:50,562 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 154 [2022-01-11 01:47:50,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:50,566 INFO L225 Difference]: With dead ends: 5765 [2022-01-11 01:47:50,567 INFO L226 Difference]: Without dead ends: 2898 [2022-01-11 01:47:50,570 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:50,570 INFO L933 BasicCegarLoop]: 2232 mSDtfsCounter, 2099 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2099 SdHoareTripleChecker+Valid, 2350 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-11 01:47:50,570 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2099 Valid, 2350 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:50,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2898 states. [2022-01-11 01:47:50,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2898 to 2898. [2022-01-11 01:47:50,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2898 states, 2897 states have (on average 1.434932688988609) internal successors, (4157), 2897 states have internal predecessors, (4157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:50,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2898 states to 2898 states and 4157 transitions. [2022-01-11 01:47:50,683 INFO L78 Accepts]: Start accepts. Automaton has 2898 states and 4157 transitions. Word has length 154 [2022-01-11 01:47:50,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:50,684 INFO L470 AbstractCegarLoop]: Abstraction has 2898 states and 4157 transitions. [2022-01-11 01:47:50,684 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:50,684 INFO L276 IsEmpty]: Start isEmpty. Operand 2898 states and 4157 transitions. [2022-01-11 01:47:50,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-01-11 01:47:50,684 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:50,685 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] [2022-01-11 01:47:50,685 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-11 01:47:50,685 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:47:50,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:50,685 INFO L85 PathProgramCache]: Analyzing trace with hash 851188430, now seen corresponding path program 1 times [2022-01-11 01:47:50,685 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:50,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023319886] [2022-01-11 01:47:50,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:50,686 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:50,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:50,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:50,715 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:50,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023319886] [2022-01-11 01:47:50,715 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023319886] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:50,715 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:50,715 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:50,715 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138865590] [2022-01-11 01:47:50,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:50,715 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:50,716 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:50,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:50,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:50,716 INFO L87 Difference]: Start difference. First operand 2898 states and 4157 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:50,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:50,874 INFO L93 Difference]: Finished difference Result 5764 states and 8270 transitions. [2022-01-11 01:47:50,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:50,875 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 154 [2022-01-11 01:47:50,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:50,879 INFO L225 Difference]: With dead ends: 5764 [2022-01-11 01:47:50,879 INFO L226 Difference]: Without dead ends: 2898 [2022-01-11 01:47:50,882 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:50,882 INFO L933 BasicCegarLoop]: 2213 mSDtfsCounter, 2080 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2080 SdHoareTripleChecker+Valid, 2330 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-11 01:47:50,883 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2080 Valid, 2330 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:50,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2898 states. [2022-01-11 01:47:51,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2898 to 2898. [2022-01-11 01:47:51,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2898 states, 2897 states have (on average 1.4231964100793926) internal successors, (4123), 2897 states have internal predecessors, (4123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:51,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2898 states to 2898 states and 4123 transitions. [2022-01-11 01:47:51,010 INFO L78 Accepts]: Start accepts. Automaton has 2898 states and 4123 transitions. Word has length 154 [2022-01-11 01:47:51,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:51,010 INFO L470 AbstractCegarLoop]: Abstraction has 2898 states and 4123 transitions. [2022-01-11 01:47:51,010 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:51,010 INFO L276 IsEmpty]: Start isEmpty. Operand 2898 states and 4123 transitions. [2022-01-11 01:47:51,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-01-11 01:47:51,011 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:51,011 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] [2022-01-11 01:47:51,011 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-11 01:47:51,011 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:47:51,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:51,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1533327507, now seen corresponding path program 1 times [2022-01-11 01:47:51,012 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:51,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948980815] [2022-01-11 01:47:51,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:51,012 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:51,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:51,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:51,048 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:51,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948980815] [2022-01-11 01:47:51,048 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948980815] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:51,048 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:51,048 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:51,048 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936066112] [2022-01-11 01:47:51,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:51,048 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:51,049 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:51,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:51,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:51,049 INFO L87 Difference]: Start difference. First operand 2898 states and 4123 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:51,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:51,196 INFO L93 Difference]: Finished difference Result 5763 states and 8201 transitions. [2022-01-11 01:47:51,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:51,197 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 154 [2022-01-11 01:47:51,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:51,202 INFO L225 Difference]: With dead ends: 5763 [2022-01-11 01:47:51,202 INFO L226 Difference]: Without dead ends: 2898 [2022-01-11 01:47:51,206 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:51,206 INFO L933 BasicCegarLoop]: 2194 mSDtfsCounter, 2061 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2061 SdHoareTripleChecker+Valid, 2310 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-11 01:47:51,207 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2061 Valid, 2310 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:51,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2898 states. [2022-01-11 01:47:51,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2898 to 2898. [2022-01-11 01:47:51,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2898 states, 2897 states have (on average 1.411460131170176) internal successors, (4089), 2897 states have internal predecessors, (4089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:51,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2898 states to 2898 states and 4089 transitions. [2022-01-11 01:47:51,363 INFO L78 Accepts]: Start accepts. Automaton has 2898 states and 4089 transitions. Word has length 154 [2022-01-11 01:47:51,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:51,364 INFO L470 AbstractCegarLoop]: Abstraction has 2898 states and 4089 transitions. [2022-01-11 01:47:51,364 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:51,364 INFO L276 IsEmpty]: Start isEmpty. Operand 2898 states and 4089 transitions. [2022-01-11 01:47:51,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-01-11 01:47:51,364 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:51,364 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] [2022-01-11 01:47:51,364 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-01-11 01:47:51,364 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:47:51,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:51,365 INFO L85 PathProgramCache]: Analyzing trace with hash 415826828, now seen corresponding path program 1 times [2022-01-11 01:47:51,365 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:51,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494784719] [2022-01-11 01:47:51,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:51,365 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:51,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:51,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:51,395 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:51,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494784719] [2022-01-11 01:47:51,395 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494784719] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:51,395 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:51,395 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:51,395 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938581807] [2022-01-11 01:47:51,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:51,395 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:51,395 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:51,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:51,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:51,396 INFO L87 Difference]: Start difference. First operand 2898 states and 4089 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:51,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:51,547 INFO L93 Difference]: Finished difference Result 5762 states and 8132 transitions. [2022-01-11 01:47:51,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:51,548 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 154 [2022-01-11 01:47:51,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:51,554 INFO L225 Difference]: With dead ends: 5762 [2022-01-11 01:47:51,555 INFO L226 Difference]: Without dead ends: 2898 [2022-01-11 01:47:51,560 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:51,560 INFO L933 BasicCegarLoop]: 2175 mSDtfsCounter, 2042 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2042 SdHoareTripleChecker+Valid, 2290 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-11 01:47:51,560 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2042 Valid, 2290 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:51,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2898 states. [2022-01-11 01:47:51,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2898 to 2898. [2022-01-11 01:47:51,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2898 states, 2897 states have (on average 1.3997238522609596) internal successors, (4055), 2897 states have internal predecessors, (4055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:51,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2898 states to 2898 states and 4055 transitions. [2022-01-11 01:47:51,689 INFO L78 Accepts]: Start accepts. Automaton has 2898 states and 4055 transitions. Word has length 154 [2022-01-11 01:47:51,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:51,689 INFO L470 AbstractCegarLoop]: Abstraction has 2898 states and 4055 transitions. [2022-01-11 01:47:51,689 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:51,689 INFO L276 IsEmpty]: Start isEmpty. Operand 2898 states and 4055 transitions. [2022-01-11 01:47:51,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-01-11 01:47:51,690 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:51,690 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] [2022-01-11 01:47:51,690 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-01-11 01:47:51,690 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:47:51,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:51,690 INFO L85 PathProgramCache]: Analyzing trace with hash -2024894805, now seen corresponding path program 1 times [2022-01-11 01:47:51,690 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:51,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312480670] [2022-01-11 01:47:51,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:51,691 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:51,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:51,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:51,719 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:51,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312480670] [2022-01-11 01:47:51,720 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312480670] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:51,720 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:51,720 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:51,720 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799269126] [2022-01-11 01:47:51,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:51,720 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:51,720 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:51,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:51,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:51,721 INFO L87 Difference]: Start difference. First operand 2898 states and 4055 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:51,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:51,879 INFO L93 Difference]: Finished difference Result 5761 states and 8063 transitions. [2022-01-11 01:47:51,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:51,880 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 154 [2022-01-11 01:47:51,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:51,883 INFO L225 Difference]: With dead ends: 5761 [2022-01-11 01:47:51,883 INFO L226 Difference]: Without dead ends: 2898 [2022-01-11 01:47:51,886 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:51,886 INFO L933 BasicCegarLoop]: 2156 mSDtfsCounter, 2023 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2023 SdHoareTripleChecker+Valid, 2270 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-11 01:47:51,886 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2023 Valid, 2270 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:51,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2898 states. [2022-01-11 01:47:52,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2898 to 2898. [2022-01-11 01:47:52,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2898 states, 2897 states have (on average 1.3879875733517433) internal successors, (4021), 2897 states have internal predecessors, (4021), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:52,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2898 states to 2898 states and 4021 transitions. [2022-01-11 01:47:52,011 INFO L78 Accepts]: Start accepts. Automaton has 2898 states and 4021 transitions. Word has length 154 [2022-01-11 01:47:52,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:52,011 INFO L470 AbstractCegarLoop]: Abstraction has 2898 states and 4021 transitions. [2022-01-11 01:47:52,011 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:52,011 INFO L276 IsEmpty]: Start isEmpty. Operand 2898 states and 4021 transitions. [2022-01-11 01:47:52,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-01-11 01:47:52,012 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:52,012 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] [2022-01-11 01:47:52,012 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-01-11 01:47:52,013 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:47:52,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:52,013 INFO L85 PathProgramCache]: Analyzing trace with hash 716806474, now seen corresponding path program 1 times [2022-01-11 01:47:52,013 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:52,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152248423] [2022-01-11 01:47:52,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:52,013 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:52,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:52,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:52,050 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:52,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152248423] [2022-01-11 01:47:52,050 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152248423] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:52,050 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:52,050 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:52,050 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77146750] [2022-01-11 01:47:52,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:52,051 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:52,051 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:52,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:52,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:52,051 INFO L87 Difference]: Start difference. First operand 2898 states and 4021 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:52,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:52,241 INFO L93 Difference]: Finished difference Result 5760 states and 7994 transitions. [2022-01-11 01:47:52,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:52,241 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 154 [2022-01-11 01:47:52,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:52,245 INFO L225 Difference]: With dead ends: 5760 [2022-01-11 01:47:52,245 INFO L226 Difference]: Without dead ends: 2898 [2022-01-11 01:47:52,247 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:52,248 INFO L933 BasicCegarLoop]: 2137 mSDtfsCounter, 2004 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2004 SdHoareTripleChecker+Valid, 2250 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-11 01:47:52,248 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2004 Valid, 2250 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:52,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2898 states. [2022-01-11 01:47:52,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2898 to 2898. [2022-01-11 01:47:52,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2898 states, 2897 states have (on average 1.3762512944425267) internal successors, (3987), 2897 states have internal predecessors, (3987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:52,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2898 states to 2898 states and 3987 transitions. [2022-01-11 01:47:52,437 INFO L78 Accepts]: Start accepts. Automaton has 2898 states and 3987 transitions. Word has length 154 [2022-01-11 01:47:52,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:52,437 INFO L470 AbstractCegarLoop]: Abstraction has 2898 states and 3987 transitions. [2022-01-11 01:47:52,438 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:52,438 INFO L276 IsEmpty]: Start isEmpty. Operand 2898 states and 3987 transitions. [2022-01-11 01:47:52,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-01-11 01:47:52,438 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:52,438 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] [2022-01-11 01:47:52,439 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-01-11 01:47:52,439 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:47:52,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:52,439 INFO L85 PathProgramCache]: Analyzing trace with hash 661209833, now seen corresponding path program 1 times [2022-01-11 01:47:52,439 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:52,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383732596] [2022-01-11 01:47:52,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:52,440 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:52,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:52,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:52,473 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:52,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383732596] [2022-01-11 01:47:52,473 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383732596] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:52,473 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:52,473 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:52,473 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787277559] [2022-01-11 01:47:52,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:52,473 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:52,474 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:52,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:52,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:52,474 INFO L87 Difference]: Start difference. First operand 2898 states and 3987 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:52,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:52,654 INFO L93 Difference]: Finished difference Result 5759 states and 7925 transitions. [2022-01-11 01:47:52,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:52,655 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 154 [2022-01-11 01:47:52,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:52,658 INFO L225 Difference]: With dead ends: 5759 [2022-01-11 01:47:52,658 INFO L226 Difference]: Without dead ends: 2898 [2022-01-11 01:47:52,661 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:52,661 INFO L933 BasicCegarLoop]: 2118 mSDtfsCounter, 1985 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1985 SdHoareTripleChecker+Valid, 2230 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-11 01:47:52,661 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1985 Valid, 2230 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:52,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2898 states. [2022-01-11 01:47:52,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2898 to 2898. [2022-01-11 01:47:52,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2898 states, 2897 states have (on average 1.3645150155333103) internal successors, (3953), 2897 states have internal predecessors, (3953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:52,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2898 states to 2898 states and 3953 transitions. [2022-01-11 01:47:52,796 INFO L78 Accepts]: Start accepts. Automaton has 2898 states and 3953 transitions. Word has length 154 [2022-01-11 01:47:52,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:52,796 INFO L470 AbstractCegarLoop]: Abstraction has 2898 states and 3953 transitions. [2022-01-11 01:47:52,796 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:52,796 INFO L276 IsEmpty]: Start isEmpty. Operand 2898 states and 3953 transitions. [2022-01-11 01:47:52,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-01-11 01:47:52,797 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:52,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] [2022-01-11 01:47:52,797 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-01-11 01:47:52,797 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:47:52,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:52,797 INFO L85 PathProgramCache]: Analyzing trace with hash -441885688, now seen corresponding path program 1 times [2022-01-11 01:47:52,797 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:52,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677542545] [2022-01-11 01:47:52,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:52,798 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:52,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:52,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:52,826 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:52,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677542545] [2022-01-11 01:47:52,827 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677542545] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:52,827 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:52,827 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:52,827 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871005330] [2022-01-11 01:47:52,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:52,827 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:52,827 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:52,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:52,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:52,828 INFO L87 Difference]: Start difference. First operand 2898 states and 3953 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:53,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:53,021 INFO L93 Difference]: Finished difference Result 5757 states and 7854 transitions. [2022-01-11 01:47:53,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:53,021 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 154 [2022-01-11 01:47:53,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:53,025 INFO L225 Difference]: With dead ends: 5757 [2022-01-11 01:47:53,025 INFO L226 Difference]: Without dead ends: 2898 [2022-01-11 01:47:53,028 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:53,028 INFO L933 BasicCegarLoop]: 2099 mSDtfsCounter, 1965 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1965 SdHoareTripleChecker+Valid, 2210 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-11 01:47:53,028 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1965 Valid, 2210 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:53,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2898 states. [2022-01-11 01:47:53,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2898 to 2898. [2022-01-11 01:47:53,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2898 states, 2897 states have (on average 1.352778736624094) internal successors, (3919), 2897 states have internal predecessors, (3919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:53,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2898 states to 2898 states and 3919 transitions. [2022-01-11 01:47:53,171 INFO L78 Accepts]: Start accepts. Automaton has 2898 states and 3919 transitions. Word has length 154 [2022-01-11 01:47:53,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:53,171 INFO L470 AbstractCegarLoop]: Abstraction has 2898 states and 3919 transitions. [2022-01-11 01:47:53,171 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:53,171 INFO L276 IsEmpty]: Start isEmpty. Operand 2898 states and 3919 transitions. [2022-01-11 01:47:53,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-01-11 01:47:53,172 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:53,172 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] [2022-01-11 01:47:53,172 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-01-11 01:47:53,172 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:47:53,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:53,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1165378471, now seen corresponding path program 1 times [2022-01-11 01:47:53,173 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:53,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330442133] [2022-01-11 01:47:53,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:53,173 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:53,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:53,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:53,211 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:53,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330442133] [2022-01-11 01:47:53,211 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330442133] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:53,211 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:53,211 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:53,211 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807052362] [2022-01-11 01:47:53,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:53,212 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:53,212 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:53,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:53,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:53,212 INFO L87 Difference]: Start difference. First operand 2898 states and 3919 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:53,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:53,373 INFO L93 Difference]: Finished difference Result 5756 states and 7785 transitions. [2022-01-11 01:47:53,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:53,373 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 154 [2022-01-11 01:47:53,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:53,378 INFO L225 Difference]: With dead ends: 5756 [2022-01-11 01:47:53,378 INFO L226 Difference]: Without dead ends: 2898 [2022-01-11 01:47:53,382 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:53,382 INFO L933 BasicCegarLoop]: 2080 mSDtfsCounter, 1946 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1946 SdHoareTripleChecker+Valid, 2190 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-11 01:47:53,383 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1946 Valid, 2190 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:53,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2898 states. [2022-01-11 01:47:53,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2898 to 2898. [2022-01-11 01:47:53,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2898 states, 2897 states have (on average 1.3410424577148774) internal successors, (3885), 2897 states have internal predecessors, (3885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:53,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2898 states to 2898 states and 3885 transitions. [2022-01-11 01:47:53,560 INFO L78 Accepts]: Start accepts. Automaton has 2898 states and 3885 transitions. Word has length 154 [2022-01-11 01:47:53,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:53,560 INFO L470 AbstractCegarLoop]: Abstraction has 2898 states and 3885 transitions. [2022-01-11 01:47:53,560 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:53,560 INFO L276 IsEmpty]: Start isEmpty. Operand 2898 states and 3885 transitions. [2022-01-11 01:47:53,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-01-11 01:47:53,561 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:53,561 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] [2022-01-11 01:47:53,561 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-01-11 01:47:53,561 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:47:53,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:53,561 INFO L85 PathProgramCache]: Analyzing trace with hash -343578042, now seen corresponding path program 1 times [2022-01-11 01:47:53,561 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:53,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724103405] [2022-01-11 01:47:53,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:53,562 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:53,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:53,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:53,600 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:53,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724103405] [2022-01-11 01:47:53,601 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724103405] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:53,601 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:53,601 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:53,601 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835445349] [2022-01-11 01:47:53,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:53,601 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:53,601 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:53,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:53,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:53,602 INFO L87 Difference]: Start difference. First operand 2898 states and 3885 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:53,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:53,784 INFO L93 Difference]: Finished difference Result 5755 states and 7716 transitions. [2022-01-11 01:47:53,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:53,785 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 154 [2022-01-11 01:47:53,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:53,788 INFO L225 Difference]: With dead ends: 5755 [2022-01-11 01:47:53,788 INFO L226 Difference]: Without dead ends: 2898 [2022-01-11 01:47:53,791 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:53,791 INFO L933 BasicCegarLoop]: 2061 mSDtfsCounter, 1927 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1927 SdHoareTripleChecker+Valid, 2170 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-11 01:47:53,791 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1927 Valid, 2170 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:53,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2898 states. [2022-01-11 01:47:53,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2898 to 2898. [2022-01-11 01:47:53,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2898 states, 2897 states have (on average 1.329306178805661) internal successors, (3851), 2897 states have internal predecessors, (3851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:53,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2898 states to 2898 states and 3851 transitions. [2022-01-11 01:47:53,941 INFO L78 Accepts]: Start accepts. Automaton has 2898 states and 3851 transitions. Word has length 154 [2022-01-11 01:47:53,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:53,941 INFO L470 AbstractCegarLoop]: Abstraction has 2898 states and 3851 transitions. [2022-01-11 01:47:53,941 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:53,941 INFO L276 IsEmpty]: Start isEmpty. Operand 2898 states and 3851 transitions. [2022-01-11 01:47:53,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-01-11 01:47:53,942 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:53,942 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] [2022-01-11 01:47:53,942 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-01-11 01:47:53,943 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:47:53,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:53,943 INFO L85 PathProgramCache]: Analyzing trace with hash 515301477, now seen corresponding path program 1 times [2022-01-11 01:47:53,943 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:53,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214691218] [2022-01-11 01:47:53,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:53,944 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:53,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:53,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:53,981 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:53,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214691218] [2022-01-11 01:47:53,981 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214691218] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:53,981 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:53,981 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:53,981 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86030437] [2022-01-11 01:47:53,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:53,981 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:53,981 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:53,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:53,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:53,982 INFO L87 Difference]: Start difference. First operand 2898 states and 3851 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:54,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:54,185 INFO L93 Difference]: Finished difference Result 5754 states and 7647 transitions. [2022-01-11 01:47:54,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:54,185 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 154 [2022-01-11 01:47:54,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:54,188 INFO L225 Difference]: With dead ends: 5754 [2022-01-11 01:47:54,188 INFO L226 Difference]: Without dead ends: 2898 [2022-01-11 01:47:54,191 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:54,191 INFO L933 BasicCegarLoop]: 2042 mSDtfsCounter, 1908 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1908 SdHoareTripleChecker+Valid, 2150 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-11 01:47:54,191 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1908 Valid, 2150 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:54,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2898 states. [2022-01-11 01:47:54,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2898 to 2898. [2022-01-11 01:47:54,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2898 states, 2897 states have (on average 1.3175698998964447) internal successors, (3817), 2897 states have internal predecessors, (3817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:54,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2898 states to 2898 states and 3817 transitions. [2022-01-11 01:47:54,334 INFO L78 Accepts]: Start accepts. Automaton has 2898 states and 3817 transitions. Word has length 154 [2022-01-11 01:47:54,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:54,334 INFO L470 AbstractCegarLoop]: Abstraction has 2898 states and 3817 transitions. [2022-01-11 01:47:54,334 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:54,334 INFO L276 IsEmpty]: Start isEmpty. Operand 2898 states and 3817 transitions. [2022-01-11 01:47:54,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-01-11 01:47:54,335 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:54,335 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] [2022-01-11 01:47:54,335 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-01-11 01:47:54,335 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:47:54,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:54,335 INFO L85 PathProgramCache]: Analyzing trace with hash -734304892, now seen corresponding path program 1 times [2022-01-11 01:47:54,335 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:54,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649845565] [2022-01-11 01:47:54,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:54,336 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:54,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:54,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:54,380 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:54,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649845565] [2022-01-11 01:47:54,380 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649845565] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:54,380 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:54,380 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 01:47:54,380 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586992477] [2022-01-11 01:47:54,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:54,381 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 01:47:54,381 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:54,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 01:47:54,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 01:47:54,381 INFO L87 Difference]: Start difference. First operand 2898 states and 3817 transitions. Second operand has 5 states, 5 states have (on average 30.8) internal successors, (154), 5 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:54,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:54,720 INFO L93 Difference]: Finished difference Result 6629 states and 8799 transitions. [2022-01-11 01:47:54,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 01:47:54,720 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.8) internal successors, (154), 5 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 154 [2022-01-11 01:47:54,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:54,726 INFO L225 Difference]: With dead ends: 6629 [2022-01-11 01:47:54,726 INFO L226 Difference]: Without dead ends: 3780 [2022-01-11 01:47:54,730 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-11 01:47:54,731 INFO L933 BasicCegarLoop]: 2107 mSDtfsCounter, 5893 mSDsluCounter, 1214 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5893 SdHoareTripleChecker+Valid, 3321 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:54,731 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5893 Valid, 3321 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 01:47:54,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3780 states. [2022-01-11 01:47:54,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3780 to 2904. [2022-01-11 01:47:54,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2904 states, 2903 states have (on average 1.3079572855666552) internal successors, (3797), 2903 states have internal predecessors, (3797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:54,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2904 states to 2904 states and 3797 transitions. [2022-01-11 01:47:54,980 INFO L78 Accepts]: Start accepts. Automaton has 2904 states and 3797 transitions. Word has length 154 [2022-01-11 01:47:54,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:54,980 INFO L470 AbstractCegarLoop]: Abstraction has 2904 states and 3797 transitions. [2022-01-11 01:47:54,980 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.8) internal successors, (154), 5 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:54,980 INFO L276 IsEmpty]: Start isEmpty. Operand 2904 states and 3797 transitions. [2022-01-11 01:47:54,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-01-11 01:47:54,981 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:54,981 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:47:54,981 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-01-11 01:47:54,981 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:47:54,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:54,982 INFO L85 PathProgramCache]: Analyzing trace with hash 342248517, now seen corresponding path program 1 times [2022-01-11 01:47:54,982 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:54,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756235566] [2022-01-11 01:47:54,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:54,982 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:54,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:55,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:55,025 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:55,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756235566] [2022-01-11 01:47:55,025 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756235566] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:55,025 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:55,025 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 01:47:55,025 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862538687] [2022-01-11 01:47:55,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:55,026 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 01:47:55,026 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:55,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 01:47:55,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 01:47:55,026 INFO L87 Difference]: Start difference. First operand 2904 states and 3797 transitions. Second operand has 5 states, 5 states have (on average 30.8) internal successors, (154), 5 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:55,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:55,496 INFO L93 Difference]: Finished difference Result 6941 states and 9124 transitions. [2022-01-11 01:47:55,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 01:47:55,496 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.8) internal successors, (154), 5 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 154 [2022-01-11 01:47:55,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:55,502 INFO L225 Difference]: With dead ends: 6941 [2022-01-11 01:47:55,502 INFO L226 Difference]: Without dead ends: 4100 [2022-01-11 01:47:55,504 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-11 01:47:55,505 INFO L933 BasicCegarLoop]: 2159 mSDtfsCounter, 5559 mSDsluCounter, 2476 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5559 SdHoareTripleChecker+Valid, 4635 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:55,505 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5559 Valid, 4635 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 01:47:55,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4100 states. [2022-01-11 01:47:55,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4100 to 2910. [2022-01-11 01:47:55,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2910 states, 2909 states have (on average 1.298384324510141) internal successors, (3777), 2909 states have internal predecessors, (3777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:55,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2910 states to 2910 states and 3777 transitions. [2022-01-11 01:47:55,706 INFO L78 Accepts]: Start accepts. Automaton has 2910 states and 3777 transitions. Word has length 154 [2022-01-11 01:47:55,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:55,706 INFO L470 AbstractCegarLoop]: Abstraction has 2910 states and 3777 transitions. [2022-01-11 01:47:55,707 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.8) internal successors, (154), 5 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:55,707 INFO L276 IsEmpty]: Start isEmpty. Operand 2910 states and 3777 transitions. [2022-01-11 01:47:55,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-01-11 01:47:55,707 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:55,707 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] [2022-01-11 01:47:55,707 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-01-11 01:47:55,708 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:47:55,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:55,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1017941126, now seen corresponding path program 1 times [2022-01-11 01:47:55,708 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:55,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609640175] [2022-01-11 01:47:55,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:55,708 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:55,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:55,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:55,749 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:55,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609640175] [2022-01-11 01:47:55,749 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609640175] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:55,749 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:55,749 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:55,749 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801014137] [2022-01-11 01:47:55,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:55,750 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:55,750 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:55,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:55,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:55,751 INFO L87 Difference]: Start difference. First operand 2910 states and 3777 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:56,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:56,182 INFO L93 Difference]: Finished difference Result 8283 states and 10747 transitions. [2022-01-11 01:47:56,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:56,182 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 154 [2022-01-11 01:47:56,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:56,188 INFO L225 Difference]: With dead ends: 8283 [2022-01-11 01:47:56,188 INFO L226 Difference]: Without dead ends: 5466 [2022-01-11 01:47:56,190 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:56,190 INFO L933 BasicCegarLoop]: 2015 mSDtfsCounter, 1791 mSDsluCounter, 1812 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1791 SdHoareTripleChecker+Valid, 3827 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:56,191 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1791 Valid, 3827 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 01:47:56,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5466 states. [2022-01-11 01:47:56,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5466 to 5460. [2022-01-11 01:47:56,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5460 states, 5459 states have (on average 1.292361238322037) internal successors, (7055), 5459 states have internal predecessors, (7055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:56,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5460 states to 5460 states and 7055 transitions. [2022-01-11 01:47:56,560 INFO L78 Accepts]: Start accepts. Automaton has 5460 states and 7055 transitions. Word has length 154 [2022-01-11 01:47:56,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:56,560 INFO L470 AbstractCegarLoop]: Abstraction has 5460 states and 7055 transitions. [2022-01-11 01:47:56,561 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:56,561 INFO L276 IsEmpty]: Start isEmpty. Operand 5460 states and 7055 transitions. [2022-01-11 01:47:56,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-01-11 01:47:56,561 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:56,561 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] [2022-01-11 01:47:56,561 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-01-11 01:47:56,562 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:47:56,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:56,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1725568197, now seen corresponding path program 1 times [2022-01-11 01:47:56,564 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:56,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423148444] [2022-01-11 01:47:56,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:56,565 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:56,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:56,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:56,610 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:56,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423148444] [2022-01-11 01:47:56,610 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423148444] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:56,611 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:56,611 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:56,611 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801452203] [2022-01-11 01:47:56,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:56,611 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:56,611 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:56,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:56,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:56,612 INFO L87 Difference]: Start difference. First operand 5460 states and 7055 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:57,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:57,016 INFO L93 Difference]: Finished difference Result 10882 states and 14060 transitions. [2022-01-11 01:47:57,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:57,016 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 154 [2022-01-11 01:47:57,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:57,022 INFO L225 Difference]: With dead ends: 10882 [2022-01-11 01:47:57,022 INFO L226 Difference]: Without dead ends: 5460 [2022-01-11 01:47:57,025 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:57,026 INFO L933 BasicCegarLoop]: 1994 mSDtfsCounter, 1769 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1769 SdHoareTripleChecker+Valid, 2099 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:57,026 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1769 Valid, 2099 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:57,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5460 states. [2022-01-11 01:47:57,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5460 to 5460. [2022-01-11 01:47:57,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5460 states, 5459 states have (on average 1.285217072723942) internal successors, (7016), 5459 states have internal predecessors, (7016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:57,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5460 states to 5460 states and 7016 transitions. [2022-01-11 01:47:57,392 INFO L78 Accepts]: Start accepts. Automaton has 5460 states and 7016 transitions. Word has length 154 [2022-01-11 01:47:57,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:57,392 INFO L470 AbstractCegarLoop]: Abstraction has 5460 states and 7016 transitions. [2022-01-11 01:47:57,393 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:57,393 INFO L276 IsEmpty]: Start isEmpty. Operand 5460 states and 7016 transitions. [2022-01-11 01:47:57,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-01-11 01:47:57,393 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:57,393 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] [2022-01-11 01:47:57,393 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-01-11 01:47:57,393 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:47:57,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:57,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1316743972, now seen corresponding path program 1 times [2022-01-11 01:47:57,394 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:57,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510847821] [2022-01-11 01:47:57,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:57,394 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:57,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:57,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:57,435 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:57,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510847821] [2022-01-11 01:47:57,435 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510847821] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:57,435 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:57,435 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:57,435 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239935274] [2022-01-11 01:47:57,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:57,436 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:57,436 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:57,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:57,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:57,436 INFO L87 Difference]: Start difference. First operand 5460 states and 7016 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:58,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:58,207 INFO L93 Difference]: Finished difference Result 16106 states and 20715 transitions. [2022-01-11 01:47:58,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:58,208 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 154 [2022-01-11 01:47:58,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:58,220 INFO L225 Difference]: With dead ends: 16106 [2022-01-11 01:47:58,220 INFO L226 Difference]: Without dead ends: 10690 [2022-01-11 01:47:58,226 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:58,226 INFO L933 BasicCegarLoop]: 1994 mSDtfsCounter, 1822 mSDsluCounter, 1796 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1822 SdHoareTripleChecker+Valid, 3790 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:58,226 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1822 Valid, 3790 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:58,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10690 states. [2022-01-11 01:47:58,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10690 to 10360. [2022-01-11 01:47:58,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10360 states, 10359 states have (on average 1.2821700936383822) internal successors, (13282), 10359 states have internal predecessors, (13282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:58,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10360 states to 10360 states and 13282 transitions. [2022-01-11 01:47:58,985 INFO L78 Accepts]: Start accepts. Automaton has 10360 states and 13282 transitions. Word has length 154 [2022-01-11 01:47:58,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:58,985 INFO L470 AbstractCegarLoop]: Abstraction has 10360 states and 13282 transitions. [2022-01-11 01:47:58,985 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:58,985 INFO L276 IsEmpty]: Start isEmpty. Operand 10360 states and 13282 transitions. [2022-01-11 01:47:58,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2022-01-11 01:47:58,990 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:58,990 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] [2022-01-11 01:47:58,991 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-01-11 01:47:58,991 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:47:58,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:58,991 INFO L85 PathProgramCache]: Analyzing trace with hash -219316736, now seen corresponding path program 1 times [2022-01-11 01:47:58,991 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:58,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959693865] [2022-01-11 01:47:58,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:58,991 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:59,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:59,049 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:59,050 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:59,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959693865] [2022-01-11 01:47:59,050 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959693865] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:59,050 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:59,050 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:47:59,050 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332580761] [2022-01-11 01:47:59,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:59,051 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:59,051 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:59,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:59,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:59,052 INFO L87 Difference]: Start difference. First operand 10360 states and 13282 transitions. Second operand has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:00,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:00,607 INFO L93 Difference]: Finished difference Result 30703 states and 39410 transitions. [2022-01-11 01:48:00,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:48:00,608 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 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 250 [2022-01-11 01:48:00,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:00,631 INFO L225 Difference]: With dead ends: 30703 [2022-01-11 01:48:00,631 INFO L226 Difference]: Without dead ends: 20393 [2022-01-11 01:48:00,643 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:00,643 INFO L933 BasicCegarLoop]: 1991 mSDtfsCounter, 1855 mSDsluCounter, 1796 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1855 SdHoareTripleChecker+Valid, 3787 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 01:48:00,643 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1855 Valid, 3787 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 01:48:00,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20393 states. [2022-01-11 01:48:02,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20393 to 19747. [2022-01-11 01:48:02,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19747 states, 19746 states have (on average 1.2798541476754786) internal successors, (25272), 19746 states have internal predecessors, (25272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:02,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19747 states to 19747 states and 25272 transitions. [2022-01-11 01:48:02,255 INFO L78 Accepts]: Start accepts. Automaton has 19747 states and 25272 transitions. Word has length 250 [2022-01-11 01:48:02,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:02,255 INFO L470 AbstractCegarLoop]: Abstraction has 19747 states and 25272 transitions. [2022-01-11 01:48:02,255 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:02,255 INFO L276 IsEmpty]: Start isEmpty. Operand 19747 states and 25272 transitions. [2022-01-11 01:48:02,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2022-01-11 01:48:02,264 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:02,264 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] [2022-01-11 01:48:02,264 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-01-11 01:48:02,264 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:48:02,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:02,265 INFO L85 PathProgramCache]: Analyzing trace with hash 687455487, now seen corresponding path program 1 times [2022-01-11 01:48:02,265 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:02,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607920130] [2022-01-11 01:48:02,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:02,265 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:02,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:02,325 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:48:02,325 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:02,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607920130] [2022-01-11 01:48:02,325 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607920130] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:02,325 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:02,325 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 01:48:02,325 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231817491] [2022-01-11 01:48:02,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:02,326 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 01:48:02,326 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:02,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 01:48:02,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 01:48:02,326 INFO L87 Difference]: Start difference. First operand 19747 states and 25272 transitions. Second operand has 5 states, 5 states have (on average 50.0) internal successors, (250), 5 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:04,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:04,559 INFO L93 Difference]: Finished difference Result 47276 states and 60682 transitions. [2022-01-11 01:48:04,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 01:48:04,560 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 50.0) internal successors, (250), 5 states have internal predecessors, (250), 0 states have call successors, (0), 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 250 [2022-01-11 01:48:04,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:04,590 INFO L225 Difference]: With dead ends: 47276 [2022-01-11 01:48:04,590 INFO L226 Difference]: Without dead ends: 27631 [2022-01-11 01:48:04,605 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-11 01:48:04,605 INFO L933 BasicCegarLoop]: 2010 mSDtfsCounter, 4554 mSDsluCounter, 4475 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4554 SdHoareTripleChecker+Valid, 6485 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 01:48:04,605 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4554 Valid, 6485 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 01:48:04,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27631 states. [2022-01-11 01:48:06,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27631 to 19771. [2022-01-11 01:48:06,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19771 states, 19770 states have (on average 1.2701568032372281) internal successors, (25111), 19770 states have internal predecessors, (25111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:06,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19771 states to 19771 states and 25111 transitions. [2022-01-11 01:48:06,526 INFO L78 Accepts]: Start accepts. Automaton has 19771 states and 25111 transitions. Word has length 250 [2022-01-11 01:48:06,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:06,526 INFO L470 AbstractCegarLoop]: Abstraction has 19771 states and 25111 transitions. [2022-01-11 01:48:06,526 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 50.0) internal successors, (250), 5 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:06,526 INFO L276 IsEmpty]: Start isEmpty. Operand 19771 states and 25111 transitions. [2022-01-11 01:48:06,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2022-01-11 01:48:06,534 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:06,534 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] [2022-01-11 01:48:06,534 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-01-11 01:48:06,535 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:48:06,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:06,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1898020799, now seen corresponding path program 1 times [2022-01-11 01:48:06,535 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:06,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671951252] [2022-01-11 01:48:06,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:06,535 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:06,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:06,584 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:48:06,584 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:06,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671951252] [2022-01-11 01:48:06,584 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671951252] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:06,584 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:06,584 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:48:06,584 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393419249] [2022-01-11 01:48:06,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:06,585 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:48:06,585 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:06,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:48:06,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:06,585 INFO L87 Difference]: Start difference. First operand 19771 states and 25111 transitions. Second operand has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:09,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:09,873 INFO L93 Difference]: Finished difference Result 58513 states and 73962 transitions. [2022-01-11 01:48:09,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:48:09,874 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 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 250 [2022-01-11 01:48:09,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:09,923 INFO L225 Difference]: With dead ends: 58513 [2022-01-11 01:48:09,923 INFO L226 Difference]: Without dead ends: 38891 [2022-01-11 01:48:09,943 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:09,944 INFO L933 BasicCegarLoop]: 2295 mSDtfsCounter, 1826 mSDsluCounter, 1959 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1826 SdHoareTripleChecker+Valid, 4254 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:48:09,944 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1826 Valid, 4254 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:48:09,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38891 states. [2022-01-11 01:48:13,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38891 to 38277. [2022-01-11 01:48:13,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38277 states, 38276 states have (on average 1.2591702372243703) internal successors, (48196), 38276 states have internal predecessors, (48196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:13,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38277 states to 38277 states and 48196 transitions. [2022-01-11 01:48:13,217 INFO L78 Accepts]: Start accepts. Automaton has 38277 states and 48196 transitions. Word has length 250 [2022-01-11 01:48:13,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:13,218 INFO L470 AbstractCegarLoop]: Abstraction has 38277 states and 48196 transitions. [2022-01-11 01:48:13,218 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:13,218 INFO L276 IsEmpty]: Start isEmpty. Operand 38277 states and 48196 transitions. [2022-01-11 01:48:13,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2022-01-11 01:48:13,231 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:13,231 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] [2022-01-11 01:48:13,231 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-01-11 01:48:13,231 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:48:13,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:13,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1070547810, now seen corresponding path program 1 times [2022-01-11 01:48:13,232 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:13,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552552990] [2022-01-11 01:48:13,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:13,232 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:13,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:13,263 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-11 01:48:13,263 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:13,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552552990] [2022-01-11 01:48:13,263 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552552990] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:13,263 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:13,263 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:48:13,263 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545254938] [2022-01-11 01:48:13,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:13,264 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:48:13,264 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:13,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:48:13,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:13,264 INFO L87 Difference]: Start difference. First operand 38277 states and 48196 transitions. Second operand has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:16,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:16,814 INFO L93 Difference]: Finished difference Result 76358 states and 96157 transitions. [2022-01-11 01:48:16,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:48:16,815 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 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 250 [2022-01-11 01:48:16,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:16,858 INFO L225 Difference]: With dead ends: 76358 [2022-01-11 01:48:16,858 INFO L226 Difference]: Without dead ends: 38135 [2022-01-11 01:48:16,882 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:16,883 INFO L933 BasicCegarLoop]: 1992 mSDtfsCounter, 1987 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1987 SdHoareTripleChecker+Valid, 1993 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:48:16,883 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1987 Valid, 1993 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:48:16,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38135 states. [2022-01-11 01:48:20,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38135 to 38135. [2022-01-11 01:48:20,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38135 states, 38134 states have (on average 1.2594010594220382) internal successors, (48026), 38134 states have internal predecessors, (48026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:20,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38135 states to 38135 states and 48026 transitions. [2022-01-11 01:48:20,235 INFO L78 Accepts]: Start accepts. Automaton has 38135 states and 48026 transitions. Word has length 250 [2022-01-11 01:48:20,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:20,235 INFO L470 AbstractCegarLoop]: Abstraction has 38135 states and 48026 transitions. [2022-01-11 01:48:20,235 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:20,235 INFO L276 IsEmpty]: Start isEmpty. Operand 38135 states and 48026 transitions. [2022-01-11 01:48:20,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2022-01-11 01:48:20,247 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:20,247 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] [2022-01-11 01:48:20,247 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-01-11 01:48:20,247 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:48:20,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:20,247 INFO L85 PathProgramCache]: Analyzing trace with hash 749709384, now seen corresponding path program 1 times [2022-01-11 01:48:20,248 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:20,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476443720] [2022-01-11 01:48:20,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:20,248 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:20,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:20,304 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:48:20,305 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:20,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476443720] [2022-01-11 01:48:20,305 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476443720] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:20,305 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:20,305 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:48:20,305 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395077923] [2022-01-11 01:48:20,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:20,305 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:48:20,306 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:20,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:48:20,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:20,306 INFO L87 Difference]: Start difference. First operand 38135 states and 48026 transitions. Second operand has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:26,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:26,409 INFO L93 Difference]: Finished difference Result 110920 states and 139379 transitions. [2022-01-11 01:48:26,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:48:26,410 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 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 251 [2022-01-11 01:48:26,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:26,527 INFO L225 Difference]: With dead ends: 110920 [2022-01-11 01:48:26,527 INFO L226 Difference]: Without dead ends: 72934 [2022-01-11 01:48:26,557 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:26,558 INFO L933 BasicCegarLoop]: 3122 mSDtfsCounter, 1591 mSDsluCounter, 1971 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1591 SdHoareTripleChecker+Valid, 5093 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:48:26,558 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1591 Valid, 5093 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:48:26,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72934 states. [2022-01-11 01:48:32,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72934 to 72932. [2022-01-11 01:48:33,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72932 states, 72931 states have (on average 1.2539112311637026) internal successors, (91449), 72931 states have internal predecessors, (91449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:33,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72932 states to 72932 states and 91449 transitions. [2022-01-11 01:48:33,115 INFO L78 Accepts]: Start accepts. Automaton has 72932 states and 91449 transitions. Word has length 251 [2022-01-11 01:48:33,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:33,116 INFO L470 AbstractCegarLoop]: Abstraction has 72932 states and 91449 transitions. [2022-01-11 01:48:33,116 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:33,116 INFO L276 IsEmpty]: Start isEmpty. Operand 72932 states and 91449 transitions. [2022-01-11 01:48:33,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2022-01-11 01:48:33,139 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:33,139 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] [2022-01-11 01:48:33,139 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-01-11 01:48:33,139 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:48:33,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:33,140 INFO L85 PathProgramCache]: Analyzing trace with hash 578869927, now seen corresponding path program 1 times [2022-01-11 01:48:33,140 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:33,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796751338] [2022-01-11 01:48:33,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:33,140 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:33,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:33,170 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-11 01:48:33,170 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:33,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796751338] [2022-01-11 01:48:33,170 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796751338] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:33,170 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:33,170 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:48:33,170 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071409008] [2022-01-11 01:48:33,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:33,170 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:48:33,171 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:33,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:48:33,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:33,171 INFO L87 Difference]: Start difference. First operand 72932 states and 91449 transitions. Second operand has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:39,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:39,770 INFO L93 Difference]: Finished difference Result 145574 states and 182554 transitions. [2022-01-11 01:48:39,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:48:39,771 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 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 251 [2022-01-11 01:48:39,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:39,876 INFO L225 Difference]: With dead ends: 145574 [2022-01-11 01:48:39,876 INFO L226 Difference]: Without dead ends: 72791 [2022-01-11 01:48:39,925 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:39,926 INFO L933 BasicCegarLoop]: 1991 mSDtfsCounter, 1985 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1985 SdHoareTripleChecker+Valid, 1992 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:48:39,926 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1985 Valid, 1992 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:48:39,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72791 states.