/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.smt.solver Internal_SMTInterpol --traceabstraction.compute.trace.for.counterexample.result false --rcfgbuilder.size.of.a.code.block SequenceOfStatements --traceabstraction.use.minimal.unsat.core.enumeration true --traceabstraction.additional.smt.options produce-proofs=true --traceabstraction.additional.smt.options produce-unsat-cores=true --traceabstraction.additional.smt.options enumeration-timeout=5000 --traceabstraction.additional.smt.options interpolation-heuristic=SHALLOWEST --traceabstraction.additional.smt.options log-additional-information=true --traceabstraction.additional.smt.options unknown-allowed=true -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf language data_model -i ../../../trunk/examples/svcomp/eca-rers2012/Problem10_label47.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-0f64333 [2020-10-26 22:33:19,564 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-26 22:33:19,568 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-26 22:33:19,627 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-26 22:33:19,628 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-26 22:33:19,634 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-26 22:33:19,638 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-26 22:33:19,642 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-26 22:33:19,646 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-26 22:33:19,652 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-26 22:33:19,653 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-26 22:33:19,655 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-26 22:33:19,656 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-26 22:33:19,659 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-26 22:33:19,661 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-26 22:33:19,663 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-26 22:33:19,664 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-26 22:33:19,668 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-26 22:33:19,675 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-26 22:33:19,686 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-26 22:33:19,688 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-26 22:33:19,689 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-26 22:33:19,691 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-26 22:33:19,692 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-26 22:33:19,694 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-26 22:33:19,695 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-26 22:33:19,695 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-26 22:33:19,707 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-26 22:33:19,711 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-26 22:33:19,712 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-26 22:33:19,712 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-26 22:33:19,713 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-26 22:33:19,715 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-26 22:33:19,716 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-26 22:33:19,717 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-26 22:33:19,718 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-26 22:33:19,719 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-26 22:33:19,719 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-26 22:33:19,719 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-26 22:33:19,720 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-26 22:33:19,721 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-26 22:33:19,729 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-26 22:33:19,778 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-26 22:33:19,778 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-26 22:33:19,783 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-26 22:33:19,783 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-26 22:33:19,784 INFO L138 SettingsManager]: * Use SBE=true [2020-10-26 22:33:19,784 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-26 22:33:19,784 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-26 22:33:19,784 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-26 22:33:19,784 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-26 22:33:19,785 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-26 22:33:19,786 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-26 22:33:19,786 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-26 22:33:19,786 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-26 22:33:19,786 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-26 22:33:19,787 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-26 22:33:19,787 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-26 22:33:19,787 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-26 22:33:19,787 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-26 22:33:19,787 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-26 22:33:19,788 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-26 22:33:19,788 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-26 22:33:19,788 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-26 22:33:19,788 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-26 22:33:19,788 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-26 22:33:19,789 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-26 22:33:19,789 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-26 22:33:19,789 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-26 22:33:19,789 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-26 22:33:19,789 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-26 22:33:19,790 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-2/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.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> Internal_SMTInterpol Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute trace for counterexample result -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> SequenceOfStatements Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use minimal unsat core enumeration -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> produce-proofs=true;produce-unsat-cores=true;enumeration-timeout=5000;interpolation-heuristic=SHALLOWEST;log-additional-information=true;unknown-allowed=true; [2020-10-26 22:33:20,228 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-26 22:33:20,271 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-26 22:33:20,274 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-26 22:33:20,276 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-26 22:33:20,277 INFO L275 PluginConnector]: CDTParser initialized [2020-10-26 22:33:20,278 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label47.c [2020-10-26 22:33:20,349 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/bbba88c0f/47e62ca23f2041478bc2a26f49bb57d2/FLAG8461b49fa [2020-10-26 22:33:21,227 INFO L306 CDTParser]: Found 1 translation units. [2020-10-26 22:33:21,228 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/eca-rers2012/Problem10_label47.c [2020-10-26 22:33:21,247 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/bbba88c0f/47e62ca23f2041478bc2a26f49bb57d2/FLAG8461b49fa [2020-10-26 22:33:21,475 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/bbba88c0f/47e62ca23f2041478bc2a26f49bb57d2 [2020-10-26 22:33:21,479 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-26 22:33:21,487 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-26 22:33:21,489 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-26 22:33:21,489 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-26 22:33:21,494 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-26 22:33:21,495 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 10:33:21" (1/1) ... [2020-10-26 22:33:21,499 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49d8fdd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:33:21, skipping insertion in model container [2020-10-26 22:33:21,500 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 10:33:21" (1/1) ... [2020-10-26 22:33:21,510 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-26 22:33:21,558 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-26 22:33:22,050 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 22:33:22,066 INFO L203 MainTranslator]: Completed pre-run [2020-10-26 22:33:22,184 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 22:33:22,202 INFO L208 MainTranslator]: Completed translation [2020-10-26 22:33:22,203 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:33:22 WrapperNode [2020-10-26 22:33:22,203 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-26 22:33:22,204 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-26 22:33:22,204 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-26 22:33:22,205 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-26 22:33:22,217 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:33:22" (1/1) ... [2020-10-26 22:33:22,217 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:33:22" (1/1) ... [2020-10-26 22:33:22,241 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:33:22" (1/1) ... [2020-10-26 22:33:22,241 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:33:22" (1/1) ... [2020-10-26 22:33:22,284 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:33:22" (1/1) ... [2020-10-26 22:33:22,318 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:33:22" (1/1) ... [2020-10-26 22:33:22,328 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:33:22" (1/1) ... [2020-10-26 22:33:22,337 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-26 22:33:22,338 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-26 22:33:22,338 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-26 22:33:22,338 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-26 22:33:22,339 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:33:22" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-26 22:33:22,444 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-26 22:33:22,444 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-26 22:33:22,445 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-26 22:33:22,445 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2020-10-26 22:33:22,445 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-26 22:33:22,446 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2020-10-26 22:33:22,446 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-26 22:33:22,446 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-26 22:33:22,447 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-26 22:33:22,447 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-26 22:33:22,448 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-26 22:33:22,448 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-10-26 22:33:22,448 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-26 22:33:22,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-26 22:33:22,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-26 22:33:22,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-26 22:33:22,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-26 22:33:22,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-26 22:33:22,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-26 22:33:24,125 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-26 22:33:24,126 INFO L298 CfgBuilder]: Removed 1 assume(true) statements. [2020-10-26 22:33:24,128 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 10:33:24 BoogieIcfgContainer [2020-10-26 22:33:24,128 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-26 22:33:24,130 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-26 22:33:24,131 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-26 22:33:24,134 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-26 22:33:24,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 10:33:21" (1/3) ... [2020-10-26 22:33:24,135 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31922032 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 10:33:24, skipping insertion in model container [2020-10-26 22:33:24,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:33:22" (2/3) ... [2020-10-26 22:33:24,136 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31922032 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 10:33:24, skipping insertion in model container [2020-10-26 22:33:24,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 10:33:24" (3/3) ... [2020-10-26 22:33:24,138 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem10_label47.c [2020-10-26 22:33:24,151 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-26 22:33:24,157 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-26 22:33:24,170 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-26 22:33:24,197 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-26 22:33:24,197 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-26 22:33:24,198 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-26 22:33:24,198 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-26 22:33:24,198 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-26 22:33:24,198 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-26 22:33:24,198 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-26 22:33:24,198 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-26 22:33:24,224 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states. [2020-10-26 22:33:24,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-26 22:33:24,231 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 22:33:24,232 INFO L422 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] [2020-10-26 22:33:24,233 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 22:33:24,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 22:33:24,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1320202252, now seen corresponding path program 1 times [2020-10-26 22:33:24,250 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-26 22:33:24,251 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [214101230] [2020-10-26 22:33:24,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 22:33:24,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:24,468 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:24,998 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:24,999 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 36 [2020-10-26 22:33:24,999 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:33:24,999 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 579 [2020-10-26 22:33:25,001 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:25,002 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-10-26 22:33:25,002 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 5 [2020-10-26 22:33:25,002 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 27 [2020-10-26 22:33:25,003 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 3 [2020-10-26 22:33:25,179 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 22:33:25,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:25,212 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:25,240 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:25,241 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-26 22:33:25,241 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:33:25,241 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 41 [2020-10-26 22:33:25,242 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:25,243 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-26 22:33:25,243 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:33:25,243 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 2 [2020-10-26 22:33:25,243 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-26 22:33:25,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 22:33:25,262 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [214101230] [2020-10-26 22:33:25,264 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 22:33:25,264 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 22:33:25,265 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548787002] [2020-10-26 22:33:25,270 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-26 22:33:25,270 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-26 22:33:25,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 22:33:25,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-26 22:33:25,288 INFO L87 Difference]: Start difference. First operand 219 states. Second operand 4 states. [2020-10-26 22:33:27,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 22:33:27,116 INFO L93 Difference]: Finished difference Result 586 states and 1012 transitions. [2020-10-26 22:33:27,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-26 22:33:27,118 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2020-10-26 22:33:27,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 22:33:27,133 INFO L225 Difference]: With dead ends: 586 [2020-10-26 22:33:27,133 INFO L226 Difference]: Without dead ends: 303 [2020-10-26 22:33:27,141 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-26 22:33:27,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2020-10-26 22:33:27,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 299. [2020-10-26 22:33:27,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2020-10-26 22:33:27,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 396 transitions. [2020-10-26 22:33:27,226 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 396 transitions. Word has length 26 [2020-10-26 22:33:27,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 22:33:27,227 INFO L481 AbstractCegarLoop]: Abstraction has 299 states and 396 transitions. [2020-10-26 22:33:27,227 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-26 22:33:27,229 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 396 transitions. [2020-10-26 22:33:27,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-10-26 22:33:27,234 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 22:33:27,234 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 22:33:27,235 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-26 22:33:27,235 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 22:33:27,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 22:33:27,239 INFO L82 PathProgramCache]: Analyzing trace with hash 304520728, now seen corresponding path program 1 times [2020-10-26 22:33:27,239 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-26 22:33:27,240 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1591139381] [2020-10-26 22:33:27,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 22:33:27,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:27,316 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:27,395 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:28,020 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:28,020 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 108 [2020-10-26 22:33:28,020 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-26 22:33:28,021 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 730 [2020-10-26 22:33:28,021 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:28,022 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 8 [2020-10-26 22:33:28,022 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 5 [2020-10-26 22:33:28,022 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 99 [2020-10-26 22:33:28,022 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-26 22:33:28,120 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 22:33:28,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:28,133 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:28,167 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:28,167 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-26 22:33:28,167 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:33:28,168 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 36 [2020-10-26 22:33:28,168 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:28,168 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-26 22:33:28,168 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:33:28,169 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 2 [2020-10-26 22:33:28,169 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:28,188 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-26 22:33:28,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:28,224 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:28,297 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:28,381 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:28,382 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 71 [2020-10-26 22:33:28,382 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-26 22:33:28,382 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 171 [2020-10-26 22:33:28,383 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:28,383 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-26 22:33:28,383 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-26 22:33:28,384 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 71 [2020-10-26 22:33:28,384 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-26 22:33:28,485 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-26 22:33:28,486 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1591139381] [2020-10-26 22:33:28,487 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-26 22:33:28,487 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-10-26 22:33:28,487 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309192201] [2020-10-26 22:33:28,490 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-26 22:33:28,490 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-26 22:33:28,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-26 22:33:28,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-26 22:33:28,493 INFO L87 Difference]: Start difference. First operand 299 states and 396 transitions. Second operand 6 states. [2020-10-26 22:33:30,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 22:33:30,342 INFO L93 Difference]: Finished difference Result 890 states and 1204 transitions. [2020-10-26 22:33:30,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-26 22:33:30,344 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2020-10-26 22:33:30,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 22:33:30,355 INFO L225 Difference]: With dead ends: 890 [2020-10-26 22:33:30,356 INFO L226 Difference]: Without dead ends: 597 [2020-10-26 22:33:30,359 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2020-10-26 22:33:30,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2020-10-26 22:33:30,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 591. [2020-10-26 22:33:30,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2020-10-26 22:33:30,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 760 transitions. [2020-10-26 22:33:30,414 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 760 transitions. Word has length 96 [2020-10-26 22:33:30,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 22:33:30,414 INFO L481 AbstractCegarLoop]: Abstraction has 591 states and 760 transitions. [2020-10-26 22:33:30,415 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-26 22:33:30,415 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 760 transitions. [2020-10-26 22:33:30,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-10-26 22:33:30,417 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 22:33:30,418 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 22:33:30,418 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-26 22:33:30,418 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 22:33:30,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 22:33:30,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1295015976, now seen corresponding path program 1 times [2020-10-26 22:33:30,419 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-26 22:33:30,420 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1735165951] [2020-10-26 22:33:30,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 22:33:30,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:30,490 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:30,865 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:30,865 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 117 [2020-10-26 22:33:30,866 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:33:30,866 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 401 [2020-10-26 22:33:30,866 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:30,866 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-26 22:33:30,866 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 89 [2020-10-26 22:33:30,867 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 24 [2020-10-26 22:33:30,867 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:30,972 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 22:33:30,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:30,978 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:30,984 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:30,985 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-26 22:33:30,985 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:33:30,985 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 8 [2020-10-26 22:33:30,986 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:30,986 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-26 22:33:30,986 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:33:30,986 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-26 22:33:30,986 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:31,002 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-26 22:33:31,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:31,042 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:31,116 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:31,116 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 80 [2020-10-26 22:33:31,116 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:33:31,116 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 89 [2020-10-26 22:33:31,117 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:31,117 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-26 22:33:31,117 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:33:31,117 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 74 [2020-10-26 22:33:31,117 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:31,166 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 17 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 22:33:31,167 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1735165951] [2020-10-26 22:33:31,167 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-26 22:33:31,167 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-10-26 22:33:31,168 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146421171] [2020-10-26 22:33:31,168 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-26 22:33:31,168 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-26 22:33:31,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-26 22:33:31,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-26 22:33:31,170 INFO L87 Difference]: Start difference. First operand 591 states and 760 transitions. Second operand 5 states. [2020-10-26 22:33:32,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 22:33:32,851 INFO L93 Difference]: Finished difference Result 1472 states and 1975 transitions. [2020-10-26 22:33:32,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-26 22:33:32,852 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2020-10-26 22:33:32,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 22:33:32,863 INFO L225 Difference]: With dead ends: 1472 [2020-10-26 22:33:32,864 INFO L226 Difference]: Without dead ends: 887 [2020-10-26 22:33:32,866 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-26 22:33:32,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2020-10-26 22:33:32,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 881. [2020-10-26 22:33:32,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 881 states. [2020-10-26 22:33:32,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1137 transitions. [2020-10-26 22:33:32,939 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1137 transitions. Word has length 105 [2020-10-26 22:33:32,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 22:33:32,940 INFO L481 AbstractCegarLoop]: Abstraction has 881 states and 1137 transitions. [2020-10-26 22:33:32,940 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-26 22:33:32,940 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1137 transitions. [2020-10-26 22:33:32,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2020-10-26 22:33:32,947 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 22:33:32,948 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-10-26 22:33:32,948 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-26 22:33:32,948 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 22:33:32,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 22:33:32,949 INFO L82 PathProgramCache]: Analyzing trace with hash 859512192, now seen corresponding path program 1 times [2020-10-26 22:33:32,949 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-26 22:33:32,949 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [960794501] [2020-10-26 22:33:32,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 22:33:33,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:33,050 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:33,205 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:33,533 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:33,997 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:34,601 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:34,602 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 192 [2020-10-26 22:33:34,602 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 4 [2020-10-26 22:33:34,603 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1592 [2020-10-26 22:33:34,603 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:34,603 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-26 22:33:34,603 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 89 [2020-10-26 22:33:34,611 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 26 [2020-10-26 22:33:34,611 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 7 [2020-10-26 22:33:34,772 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 22:33:34,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:34,777 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:34,783 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:34,783 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-26 22:33:34,784 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:33:34,784 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 7 [2020-10-26 22:33:34,784 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:34,784 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-26 22:33:34,785 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:33:34,785 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-26 22:33:34,785 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:34,810 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-26 22:33:34,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:34,840 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:34,904 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:34,905 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 80 [2020-10-26 22:33:34,905 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:33:34,905 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 76 [2020-10-26 22:33:34,905 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:34,906 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-26 22:33:34,906 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:33:34,906 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 74 [2020-10-26 22:33:34,906 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:34,939 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-10-26 22:33:34,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:34,970 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:35,027 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:35,163 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:35,164 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 74 [2020-10-26 22:33:35,164 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-26 22:33:35,164 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 206 [2020-10-26 22:33:35,164 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:35,165 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-26 22:33:35,165 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-26 22:33:35,165 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 74 [2020-10-26 22:33:35,165 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:35,425 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 106 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-26 22:33:35,426 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [960794501] [2020-10-26 22:33:35,426 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-26 22:33:35,426 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-10-26 22:33:35,426 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466399941] [2020-10-26 22:33:35,429 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-26 22:33:35,429 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-26 22:33:35,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-26 22:33:35,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-26 22:33:35,430 INFO L87 Difference]: Start difference. First operand 881 states and 1137 transitions. Second operand 6 states. [2020-10-26 22:33:37,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 22:33:37,221 INFO L93 Difference]: Finished difference Result 1805 states and 2343 transitions. [2020-10-26 22:33:37,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-26 22:33:37,222 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 178 [2020-10-26 22:33:37,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 22:33:37,232 INFO L225 Difference]: With dead ends: 1805 [2020-10-26 22:33:37,233 INFO L226 Difference]: Without dead ends: 907 [2020-10-26 22:33:37,236 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-10-26 22:33:37,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2020-10-26 22:33:37,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 881. [2020-10-26 22:33:37,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 881 states. [2020-10-26 22:33:37,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1130 transitions. [2020-10-26 22:33:37,289 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1130 transitions. Word has length 178 [2020-10-26 22:33:37,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 22:33:37,291 INFO L481 AbstractCegarLoop]: Abstraction has 881 states and 1130 transitions. [2020-10-26 22:33:37,291 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-26 22:33:37,292 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1130 transitions. [2020-10-26 22:33:37,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2020-10-26 22:33:37,299 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 22:33:37,299 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-10-26 22:33:37,300 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-26 22:33:37,300 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 22:33:37,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 22:33:37,300 INFO L82 PathProgramCache]: Analyzing trace with hash 29748756, now seen corresponding path program 1 times [2020-10-26 22:33:37,301 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-26 22:33:37,302 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2069590301] [2020-10-26 22:33:37,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 22:33:37,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:37,387 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:37,576 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:37,842 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:38,512 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:38,512 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 200 [2020-10-26 22:33:38,513 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 3 [2020-10-26 22:33:38,513 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1155 [2020-10-26 22:33:38,513 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:38,513 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-26 22:33:38,513 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 80 [2020-10-26 22:33:38,514 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 93 [2020-10-26 22:33:38,514 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:38,623 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 22:33:38,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:38,630 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:38,635 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:38,635 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-26 22:33:38,635 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:33:38,635 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 5 [2020-10-26 22:33:38,636 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:38,636 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-26 22:33:38,636 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:33:38,636 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-26 22:33:38,636 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:38,651 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-26 22:33:38,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:38,674 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:38,760 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:38,760 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 71 [2020-10-26 22:33:38,761 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:33:38,761 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 95 [2020-10-26 22:33:38,761 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:38,761 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-26 22:33:38,761 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:33:38,762 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 65 [2020-10-26 22:33:38,762 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:38,792 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2020-10-26 22:33:38,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:38,827 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:38,946 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:38,948 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 91 [2020-10-26 22:33:38,949 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:33:38,949 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 132 [2020-10-26 22:33:38,949 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:38,949 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-26 22:33:38,949 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-26 22:33:38,950 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 91 [2020-10-26 22:33:38,950 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:39,057 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 103 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-26 22:33:39,057 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2069590301] [2020-10-26 22:33:39,058 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-26 22:33:39,058 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-26 22:33:39,058 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142213479] [2020-10-26 22:33:39,059 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-26 22:33:39,059 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-26 22:33:39,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-26 22:33:39,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-26 22:33:39,060 INFO L87 Difference]: Start difference. First operand 881 states and 1130 transitions. Second operand 7 states. [2020-10-26 22:33:41,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 22:33:41,108 INFO L93 Difference]: Finished difference Result 2082 states and 2777 transitions. [2020-10-26 22:33:41,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-26 22:33:41,108 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 186 [2020-10-26 22:33:41,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 22:33:41,119 INFO L225 Difference]: With dead ends: 2082 [2020-10-26 22:33:41,120 INFO L226 Difference]: Without dead ends: 1207 [2020-10-26 22:33:41,123 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-10-26 22:33:41,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1207 states. [2020-10-26 22:33:41,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1207 to 1191. [2020-10-26 22:33:41,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1191 states. [2020-10-26 22:33:41,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1191 states to 1191 states and 1568 transitions. [2020-10-26 22:33:41,187 INFO L78 Accepts]: Start accepts. Automaton has 1191 states and 1568 transitions. Word has length 186 [2020-10-26 22:33:41,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 22:33:41,188 INFO L481 AbstractCegarLoop]: Abstraction has 1191 states and 1568 transitions. [2020-10-26 22:33:41,188 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-26 22:33:41,188 INFO L276 IsEmpty]: Start isEmpty. Operand 1191 states and 1568 transitions. [2020-10-26 22:33:41,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2020-10-26 22:33:41,192 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 22:33:41,192 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-10-26 22:33:41,192 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-26 22:33:41,192 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 22:33:41,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 22:33:41,193 INFO L82 PathProgramCache]: Analyzing trace with hash -528039464, now seen corresponding path program 1 times [2020-10-26 22:33:41,193 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-26 22:33:41,194 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1507555739] [2020-10-26 22:33:41,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 22:33:41,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:41,254 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:41,391 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:41,996 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:42,562 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:42,649 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:45,972 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:45,972 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 207 [2020-10-26 22:33:45,973 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 5 [2020-10-26 22:33:45,973 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 4738 [2020-10-26 22:33:45,973 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:45,974 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-10-26 22:33:45,974 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 5 [2020-10-26 22:33:45,974 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 83 [2020-10-26 22:33:45,974 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-26 22:33:46,146 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 22:33:46,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:46,159 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:46,187 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:46,187 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-26 22:33:46,187 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:33:46,187 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 31 [2020-10-26 22:33:46,188 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:46,188 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-26 22:33:46,188 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:33:46,188 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 2 [2020-10-26 22:33:46,189 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:46,207 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-26 22:33:46,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:46,232 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:46,337 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:46,338 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 78 [2020-10-26 22:33:46,338 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:33:46,338 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 114 [2020-10-26 22:33:46,338 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:46,339 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-26 22:33:46,339 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-26 22:33:46,339 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 78 [2020-10-26 22:33:46,340 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-26 22:33:46,391 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2020-10-26 22:33:46,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:46,422 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:46,454 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:46,455 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 91 [2020-10-26 22:33:46,455 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:33:46,455 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 43 [2020-10-26 22:33:46,455 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:46,456 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-26 22:33:46,456 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 88 [2020-10-26 22:33:46,457 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-26 22:33:46,457 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-26 22:33:46,551 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 36 proven. 72 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-26 22:33:46,551 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1507555739] [2020-10-26 22:33:46,553 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-26 22:33:46,553 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-26 22:33:46,553 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874358577] [2020-10-26 22:33:46,554 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-26 22:33:46,554 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-26 22:33:46,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-26 22:33:46,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-26 22:33:46,555 INFO L87 Difference]: Start difference. First operand 1191 states and 1568 transitions. Second operand 7 states. [2020-10-26 22:33:48,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 22:33:48,370 INFO L93 Difference]: Finished difference Result 2541 states and 3341 transitions. [2020-10-26 22:33:48,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-26 22:33:48,371 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 193 [2020-10-26 22:33:48,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 22:33:48,381 INFO L225 Difference]: With dead ends: 2541 [2020-10-26 22:33:48,382 INFO L226 Difference]: Without dead ends: 1356 [2020-10-26 22:33:48,386 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2020-10-26 22:33:48,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356 states. [2020-10-26 22:33:48,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356 to 1344. [2020-10-26 22:33:48,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1344 states. [2020-10-26 22:33:48,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1344 states to 1344 states and 1744 transitions. [2020-10-26 22:33:48,462 INFO L78 Accepts]: Start accepts. Automaton has 1344 states and 1744 transitions. Word has length 193 [2020-10-26 22:33:48,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 22:33:48,462 INFO L481 AbstractCegarLoop]: Abstraction has 1344 states and 1744 transitions. [2020-10-26 22:33:48,462 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-26 22:33:48,463 INFO L276 IsEmpty]: Start isEmpty. Operand 1344 states and 1744 transitions. [2020-10-26 22:33:48,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2020-10-26 22:33:48,467 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 22:33:48,468 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 22:33:48,468 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-26 22:33:48,471 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 22:33:48,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 22:33:48,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1876890312, now seen corresponding path program 1 times [2020-10-26 22:33:48,472 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-26 22:33:48,472 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1362257444] [2020-10-26 22:33:48,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 22:33:48,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:48,573 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:48,933 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:48,933 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 246 [2020-10-26 22:33:48,933 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:33:48,934 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 397 [2020-10-26 22:33:48,934 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:48,934 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-26 22:33:48,934 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 80 [2020-10-26 22:33:48,934 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 139 [2020-10-26 22:33:48,935 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:49,065 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 22:33:49,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:49,069 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:49,074 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:49,074 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-26 22:33:49,074 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:33:49,074 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 5 [2020-10-26 22:33:49,075 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:49,075 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-26 22:33:49,075 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:33:49,075 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-26 22:33:49,076 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-26 22:33:49,100 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-26 22:33:49,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:49,126 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:49,183 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:49,183 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 71 [2020-10-26 22:33:49,183 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:33:49,184 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 68 [2020-10-26 22:33:49,184 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:49,184 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-26 22:33:49,185 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:33:49,185 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 65 [2020-10-26 22:33:49,185 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-26 22:33:49,208 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2020-10-26 22:33:49,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:49,274 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:49,457 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:49,457 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 137 [2020-10-26 22:33:49,457 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:33:49,457 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 207 [2020-10-26 22:33:49,458 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:49,458 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-26 22:33:49,458 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-26 22:33:49,458 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 137 [2020-10-26 22:33:49,458 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:49,645 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 103 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-26 22:33:49,646 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1362257444] [2020-10-26 22:33:49,646 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-26 22:33:49,646 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-26 22:33:49,646 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13874531] [2020-10-26 22:33:49,647 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-26 22:33:49,647 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-26 22:33:49,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-26 22:33:49,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-26 22:33:49,649 INFO L87 Difference]: Start difference. First operand 1344 states and 1744 transitions. Second operand 7 states. [2020-10-26 22:33:51,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 22:33:51,674 INFO L93 Difference]: Finished difference Result 2581 states and 3434 transitions. [2020-10-26 22:33:51,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-26 22:33:51,675 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 232 [2020-10-26 22:33:51,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 22:33:51,684 INFO L225 Difference]: With dead ends: 2581 [2020-10-26 22:33:51,685 INFO L226 Difference]: Without dead ends: 1386 [2020-10-26 22:33:51,690 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2020-10-26 22:33:51,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1386 states. [2020-10-26 22:33:51,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1386 to 1350. [2020-10-26 22:33:51,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1350 states. [2020-10-26 22:33:51,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1350 states to 1350 states and 1570 transitions. [2020-10-26 22:33:51,750 INFO L78 Accepts]: Start accepts. Automaton has 1350 states and 1570 transitions. Word has length 232 [2020-10-26 22:33:51,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 22:33:51,751 INFO L481 AbstractCegarLoop]: Abstraction has 1350 states and 1570 transitions. [2020-10-26 22:33:51,751 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-26 22:33:51,751 INFO L276 IsEmpty]: Start isEmpty. Operand 1350 states and 1570 transitions. [2020-10-26 22:33:51,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2020-10-26 22:33:51,757 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 22:33:51,758 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-10-26 22:33:51,758 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-26 22:33:51,758 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 22:33:51,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 22:33:51,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1801094992, now seen corresponding path program 1 times [2020-10-26 22:33:51,759 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-26 22:33:51,760 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1761267129] [2020-10-26 22:33:51,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 22:33:51,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:51,900 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:52,455 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:52,456 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 291 [2020-10-26 22:33:52,456 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:33:52,456 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 603 [2020-10-26 22:33:52,456 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:52,456 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-26 22:33:52,457 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 125 [2020-10-26 22:33:52,457 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 139 [2020-10-26 22:33:52,457 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:52,577 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 22:33:52,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:52,581 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:52,586 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:52,586 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-26 22:33:52,586 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:33:52,586 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 5 [2020-10-26 22:33:52,586 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:52,587 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-26 22:33:52,587 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:33:52,587 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-26 22:33:52,587 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:52,602 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-26 22:33:52,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:52,655 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:52,748 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:52,748 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 116 [2020-10-26 22:33:52,748 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:33:52,748 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 111 [2020-10-26 22:33:52,748 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:52,749 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-26 22:33:52,749 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:33:52,749 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 110 [2020-10-26 22:33:52,749 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:52,796 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2020-10-26 22:33:52,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:52,850 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:53,043 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:53,043 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 137 [2020-10-26 22:33:53,043 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:33:53,044 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 213 [2020-10-26 22:33:53,044 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:53,044 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-26 22:33:53,044 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-26 22:33:53,045 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 137 [2020-10-26 22:33:53,045 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:53,271 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 148 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-26 22:33:53,271 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1761267129] [2020-10-26 22:33:53,272 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-26 22:33:53,272 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-26 22:33:53,272 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917778895] [2020-10-26 22:33:53,273 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-26 22:33:53,274 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-26 22:33:53,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-26 22:33:53,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-26 22:33:53,275 INFO L87 Difference]: Start difference. First operand 1350 states and 1570 transitions. Second operand 7 states. [2020-10-26 22:33:55,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 22:33:55,724 INFO L93 Difference]: Finished difference Result 3457 states and 4121 transitions. [2020-10-26 22:33:55,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-26 22:33:55,730 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 277 [2020-10-26 22:33:55,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 22:33:55,744 INFO L225 Difference]: With dead ends: 3457 [2020-10-26 22:33:55,744 INFO L226 Difference]: Without dead ends: 2256 [2020-10-26 22:33:55,749 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2020-10-26 22:33:55,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2256 states. [2020-10-26 22:33:55,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2256 to 2099. [2020-10-26 22:33:55,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2099 states. [2020-10-26 22:33:55,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2099 states to 2099 states and 2412 transitions. [2020-10-26 22:33:55,827 INFO L78 Accepts]: Start accepts. Automaton has 2099 states and 2412 transitions. Word has length 277 [2020-10-26 22:33:55,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 22:33:55,828 INFO L481 AbstractCegarLoop]: Abstraction has 2099 states and 2412 transitions. [2020-10-26 22:33:55,828 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-26 22:33:55,828 INFO L276 IsEmpty]: Start isEmpty. Operand 2099 states and 2412 transitions. [2020-10-26 22:33:55,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2020-10-26 22:33:55,836 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 22:33:55,836 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-10-26 22:33:55,836 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-26 22:33:55,836 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 22:33:55,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 22:33:55,837 INFO L82 PathProgramCache]: Analyzing trace with hash 168118256, now seen corresponding path program 1 times [2020-10-26 22:33:55,837 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-26 22:33:55,838 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1600431289] [2020-10-26 22:33:55,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 22:33:55,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:55,960 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:56,201 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:56,440 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:56,760 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:57,884 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:57,884 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 297 [2020-10-26 22:33:57,884 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 4 [2020-10-26 22:33:57,885 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1987 [2020-10-26 22:33:57,885 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:57,885 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-26 22:33:57,885 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 194 [2020-10-26 22:33:57,885 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 76 [2020-10-26 22:33:57,885 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:58,017 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 22:33:58,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:58,022 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:58,027 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:58,028 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-26 22:33:58,028 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:33:58,028 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 6 [2020-10-26 22:33:58,028 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:58,029 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-26 22:33:58,029 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:33:58,029 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-26 22:33:58,029 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:58,045 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-26 22:33:58,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:58,052 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:58,068 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:58,068 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 71 [2020-10-26 22:33:58,068 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:33:58,069 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 17 [2020-10-26 22:33:58,069 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:58,069 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-26 22:33:58,069 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:33:58,069 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-26 22:33:58,069 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:58,091 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2020-10-26 22:33:58,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:58,135 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:58,215 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:58,215 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 113 [2020-10-26 22:33:58,216 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:33:58,216 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 97 [2020-10-26 22:33:58,216 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:58,216 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-26 22:33:58,216 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:33:58,216 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 107 [2020-10-26 22:33:58,217 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:58,263 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2020-10-26 22:33:58,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:58,301 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:58,410 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:58,410 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 74 [2020-10-26 22:33:58,411 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:33:58,411 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 118 [2020-10-26 22:33:58,411 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:58,411 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-26 22:33:58,412 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-26 22:33:58,412 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 74 [2020-10-26 22:33:58,412 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:58,704 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 196 proven. 2 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2020-10-26 22:33:58,704 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1600431289] [2020-10-26 22:33:58,705 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-26 22:33:58,706 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-10-26 22:33:58,707 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907188952] [2020-10-26 22:33:58,708 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-26 22:33:58,712 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-26 22:33:58,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-26 22:33:58,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-10-26 22:33:58,716 INFO L87 Difference]: Start difference. First operand 2099 states and 2412 transitions. Second operand 8 states. [2020-10-26 22:34:01,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 22:34:01,440 INFO L93 Difference]: Finished difference Result 4494 states and 5235 transitions. [2020-10-26 22:34:01,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-26 22:34:01,441 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 281 [2020-10-26 22:34:01,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 22:34:01,453 INFO L225 Difference]: With dead ends: 4494 [2020-10-26 22:34:01,453 INFO L226 Difference]: Without dead ends: 1958 [2020-10-26 22:34:01,460 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2020-10-26 22:34:01,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1958 states. [2020-10-26 22:34:01,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1958 to 1803. [2020-10-26 22:34:01,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1803 states. [2020-10-26 22:34:01,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1803 states to 1803 states and 2024 transitions. [2020-10-26 22:34:01,550 INFO L78 Accepts]: Start accepts. Automaton has 1803 states and 2024 transitions. Word has length 281 [2020-10-26 22:34:01,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 22:34:01,550 INFO L481 AbstractCegarLoop]: Abstraction has 1803 states and 2024 transitions. [2020-10-26 22:34:01,550 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-26 22:34:01,551 INFO L276 IsEmpty]: Start isEmpty. Operand 1803 states and 2024 transitions. [2020-10-26 22:34:01,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2020-10-26 22:34:01,557 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 22:34:01,558 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-10-26 22:34:01,558 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-26 22:34:01,558 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 22:34:01,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 22:34:01,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1555548736, now seen corresponding path program 1 times [2020-10-26 22:34:01,559 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-26 22:34:01,559 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [823474507] [2020-10-26 22:34:01,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 22:34:01,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:01,668 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:02,048 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:02,481 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:02,482 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 296 [2020-10-26 22:34:02,482 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-26 22:34:02,482 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 857 [2020-10-26 22:34:02,482 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:02,482 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 7 [2020-10-26 22:34:02,482 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 125 [2020-10-26 22:34:02,483 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 166 [2020-10-26 22:34:02,483 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:02,645 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 22:34:02,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:02,650 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:02,654 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:02,654 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-26 22:34:02,654 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:34:02,655 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 5 [2020-10-26 22:34:02,655 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:02,655 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-26 22:34:02,655 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:34:02,655 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-26 22:34:02,656 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:02,675 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-26 22:34:02,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:02,726 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:02,816 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:02,816 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 116 [2020-10-26 22:34:02,817 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:34:02,817 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 107 [2020-10-26 22:34:02,817 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:02,817 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-26 22:34:02,817 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:34:02,818 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 110 [2020-10-26 22:34:02,818 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:02,857 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2020-10-26 22:34:02,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:02,911 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:03,202 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:03,202 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 142 [2020-10-26 22:34:03,202 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:34:03,203 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 313 [2020-10-26 22:34:03,203 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:03,203 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 5 [2020-10-26 22:34:03,203 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-26 22:34:03,203 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 142 [2020-10-26 22:34:03,204 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:03,531 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 133 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-26 22:34:03,531 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [823474507] [2020-10-26 22:34:03,532 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-26 22:34:03,532 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-10-26 22:34:03,532 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201374283] [2020-10-26 22:34:03,534 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-26 22:34:03,534 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-26 22:34:03,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-26 22:34:03,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-26 22:34:03,535 INFO L87 Difference]: Start difference. First operand 1803 states and 2024 transitions. Second operand 8 states. [2020-10-26 22:34:05,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 22:34:05,815 INFO L93 Difference]: Finished difference Result 3145 states and 3569 transitions. [2020-10-26 22:34:05,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-26 22:34:05,817 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 282 [2020-10-26 22:34:05,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 22:34:05,834 INFO L225 Difference]: With dead ends: 3145 [2020-10-26 22:34:05,834 INFO L226 Difference]: Without dead ends: 2979 [2020-10-26 22:34:05,837 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-10-26 22:34:05,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2979 states. [2020-10-26 22:34:05,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2979 to 2548. [2020-10-26 22:34:05,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2548 states. [2020-10-26 22:34:05,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2548 states to 2548 states and 2938 transitions. [2020-10-26 22:34:05,943 INFO L78 Accepts]: Start accepts. Automaton has 2548 states and 2938 transitions. Word has length 282 [2020-10-26 22:34:05,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 22:34:05,944 INFO L481 AbstractCegarLoop]: Abstraction has 2548 states and 2938 transitions. [2020-10-26 22:34:05,944 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-26 22:34:05,944 INFO L276 IsEmpty]: Start isEmpty. Operand 2548 states and 2938 transitions. [2020-10-26 22:34:05,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2020-10-26 22:34:05,952 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 22:34:05,953 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-10-26 22:34:05,953 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-26 22:34:05,953 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 22:34:05,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 22:34:05,954 INFO L82 PathProgramCache]: Analyzing trace with hash -575154392, now seen corresponding path program 1 times [2020-10-26 22:34:05,954 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-26 22:34:05,954 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [748974297] [2020-10-26 22:34:05,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 22:34:06,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:06,064 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:06,157 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:06,331 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:08,358 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:10,227 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:10,227 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 302 [2020-10-26 22:34:10,227 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 4 [2020-10-26 22:34:10,228 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 4205 [2020-10-26 22:34:10,228 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:10,228 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-10-26 22:34:10,228 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 125 [2020-10-26 22:34:10,228 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 150 [2020-10-26 22:34:10,228 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:10,341 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 22:34:10,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:10,345 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:10,349 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:10,349 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-26 22:34:10,349 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:34:10,349 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 5 [2020-10-26 22:34:10,350 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:10,350 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-26 22:34:10,350 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:34:10,350 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-26 22:34:10,350 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:10,366 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-26 22:34:10,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:10,409 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:10,511 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:10,511 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 116 [2020-10-26 22:34:10,512 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:34:10,512 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 117 [2020-10-26 22:34:10,512 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:10,513 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-26 22:34:10,513 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:34:10,513 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 110 [2020-10-26 22:34:10,513 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-26 22:34:10,562 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2020-10-26 22:34:10,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:10,589 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:10,679 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:10,680 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 73 [2020-10-26 22:34:10,680 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:34:10,680 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 100 [2020-10-26 22:34:10,680 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:10,681 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-26 22:34:10,681 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-26 22:34:10,681 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 73 [2020-10-26 22:34:10,681 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:10,892 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2020-10-26 22:34:10,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:10,918 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:11,018 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:11,018 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 74 [2020-10-26 22:34:11,019 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:34:11,019 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 109 [2020-10-26 22:34:11,019 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:11,019 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-26 22:34:11,019 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-26 22:34:11,020 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 74 [2020-10-26 22:34:11,020 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:11,391 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 193 proven. 71 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-10-26 22:34:11,391 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [748974297] [2020-10-26 22:34:11,392 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-26 22:34:11,392 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-10-26 22:34:11,392 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636743785] [2020-10-26 22:34:11,393 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-26 22:34:11,393 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-26 22:34:11,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-26 22:34:11,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-10-26 22:34:11,394 INFO L87 Difference]: Start difference. First operand 2548 states and 2938 transitions. Second operand 8 states. [2020-10-26 22:34:13,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 22:34:13,865 INFO L93 Difference]: Finished difference Result 5255 states and 6089 transitions. [2020-10-26 22:34:13,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-26 22:34:13,868 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 286 [2020-10-26 22:34:13,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 22:34:13,881 INFO L225 Difference]: With dead ends: 5255 [2020-10-26 22:34:13,882 INFO L226 Difference]: Without dead ends: 2856 [2020-10-26 22:34:13,889 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2020-10-26 22:34:13,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2856 states. [2020-10-26 22:34:13,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2856 to 2842. [2020-10-26 22:34:13,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2842 states. [2020-10-26 22:34:13,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2842 states to 2842 states and 3241 transitions. [2020-10-26 22:34:13,978 INFO L78 Accepts]: Start accepts. Automaton has 2842 states and 3241 transitions. Word has length 286 [2020-10-26 22:34:13,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 22:34:13,979 INFO L481 AbstractCegarLoop]: Abstraction has 2842 states and 3241 transitions. [2020-10-26 22:34:13,979 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-26 22:34:13,980 INFO L276 IsEmpty]: Start isEmpty. Operand 2842 states and 3241 transitions. [2020-10-26 22:34:13,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2020-10-26 22:34:13,987 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 22:34:13,987 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1] [2020-10-26 22:34:13,987 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-26 22:34:13,988 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 22:34:13,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 22:34:13,988 INFO L82 PathProgramCache]: Analyzing trace with hash -107764312, now seen corresponding path program 1 times [2020-10-26 22:34:13,988 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-26 22:34:13,989 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1938645293] [2020-10-26 22:34:13,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 22:34:14,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:14,125 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:14,499 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:14,760 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:15,943 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:15,943 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 315 [2020-10-26 22:34:15,943 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 3 [2020-10-26 22:34:15,943 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1867 [2020-10-26 22:34:15,943 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:15,944 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-26 22:34:15,944 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 212 [2020-10-26 22:34:15,944 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 76 [2020-10-26 22:34:15,944 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:16,054 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 22:34:16,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:16,060 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:16,064 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:16,065 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-26 22:34:16,066 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:34:16,066 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 7 [2020-10-26 22:34:16,066 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:16,066 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-26 22:34:16,066 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:34:16,066 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-26 22:34:16,067 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:16,081 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-26 22:34:16,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:16,089 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:16,121 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:16,121 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 116 [2020-10-26 22:34:16,122 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:34:16,122 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 33 [2020-10-26 22:34:16,122 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:16,122 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-26 22:34:16,122 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:34:16,122 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-26 22:34:16,123 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:16,191 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2020-10-26 22:34:16,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:16,217 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:16,266 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:16,267 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 86 [2020-10-26 22:34:16,267 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:34:16,267 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 58 [2020-10-26 22:34:16,267 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:16,267 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-26 22:34:16,268 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:34:16,268 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 80 [2020-10-26 22:34:16,268 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:16,296 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2020-10-26 22:34:16,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:16,317 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:16,399 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:16,399 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 74 [2020-10-26 22:34:16,399 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:34:16,399 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 90 [2020-10-26 22:34:16,400 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:16,400 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-26 22:34:16,400 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-26 22:34:16,400 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 74 [2020-10-26 22:34:16,400 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:16,593 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 199 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2020-10-26 22:34:16,594 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1938645293] [2020-10-26 22:34:16,594 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-26 22:34:16,594 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-26 22:34:16,594 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516386889] [2020-10-26 22:34:16,595 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-26 22:34:16,595 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-26 22:34:16,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-26 22:34:16,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-26 22:34:16,596 INFO L87 Difference]: Start difference. First operand 2842 states and 3241 transitions. Second operand 7 states. [2020-10-26 22:34:19,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 22:34:19,050 INFO L93 Difference]: Finished difference Result 6119 states and 7051 transitions. [2020-10-26 22:34:19,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-26 22:34:19,051 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 299 [2020-10-26 22:34:19,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 22:34:19,067 INFO L225 Difference]: With dead ends: 6119 [2020-10-26 22:34:19,067 INFO L226 Difference]: Without dead ends: 3279 [2020-10-26 22:34:19,075 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-10-26 22:34:19,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3279 states. [2020-10-26 22:34:19,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3279 to 3271. [2020-10-26 22:34:19,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3271 states. [2020-10-26 22:34:19,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3271 states to 3271 states and 3718 transitions. [2020-10-26 22:34:19,213 INFO L78 Accepts]: Start accepts. Automaton has 3271 states and 3718 transitions. Word has length 299 [2020-10-26 22:34:19,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 22:34:19,214 INFO L481 AbstractCegarLoop]: Abstraction has 3271 states and 3718 transitions. [2020-10-26 22:34:19,214 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-26 22:34:19,215 INFO L276 IsEmpty]: Start isEmpty. Operand 3271 states and 3718 transitions. [2020-10-26 22:34:19,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2020-10-26 22:34:19,222 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 22:34:19,222 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-10-26 22:34:19,222 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-26 22:34:19,222 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 22:34:19,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 22:34:19,223 INFO L82 PathProgramCache]: Analyzing trace with hash -998748284, now seen corresponding path program 1 times [2020-10-26 22:34:19,223 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-26 22:34:19,223 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [168872162] [2020-10-26 22:34:19,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 22:34:19,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 22:34:19,291 INFO L173 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-10-26 22:34:19,292 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-26 22:34:19,298 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-26 22:34:19,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 10:34:19 BoogieIcfgContainer [2020-10-26 22:34:19,346 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-26 22:34:19,348 INFO L168 Benchmark]: Toolchain (without parser) took 57865.71 ms. Allocated memory was 157.3 MB in the beginning and 879.8 MB in the end (delta: 722.5 MB). Free memory was 131.0 MB in the beginning and 809.3 MB in the end (delta: -678.3 MB). Peak memory consumption was 45.6 MB. Max. memory is 8.0 GB. [2020-10-26 22:34:19,349 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 157.3 MB. Free memory is still 130.2 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-10-26 22:34:19,350 INFO L168 Benchmark]: CACSL2BoogieTranslator took 714.45 ms. Allocated memory is still 157.3 MB. Free memory was 130.4 MB in the beginning and 103.8 MB in the end (delta: 26.7 MB). Peak memory consumption was 26.2 MB. Max. memory is 8.0 GB. [2020-10-26 22:34:19,350 INFO L168 Benchmark]: Boogie Preprocessor took 132.65 ms. Allocated memory is still 157.3 MB. Free memory was 103.8 MB in the beginning and 99.2 MB in the end (delta: 4.6 MB). Peak memory consumption was 5.2 MB. Max. memory is 8.0 GB. [2020-10-26 22:34:19,351 INFO L168 Benchmark]: RCFGBuilder took 1790.61 ms. Allocated memory was 157.3 MB in the beginning and 203.4 MB in the end (delta: 46.1 MB). Free memory was 99.0 MB in the beginning and 169.7 MB in the end (delta: -70.7 MB). Peak memory consumption was 50.8 MB. Max. memory is 8.0 GB. [2020-10-26 22:34:19,352 INFO L168 Benchmark]: TraceAbstraction took 55215.23 ms. Allocated memory was 203.4 MB in the beginning and 879.8 MB in the end (delta: 676.3 MB). Free memory was 169.2 MB in the beginning and 809.3 MB in the end (delta: -640.2 MB). Peak memory consumption was 36.7 MB. Max. memory is 8.0 GB. [2020-10-26 22:34:19,355 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 157.3 MB. Free memory is still 130.2 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 714.45 ms. Allocated memory is still 157.3 MB. Free memory was 130.4 MB in the beginning and 103.8 MB in the end (delta: 26.7 MB). Peak memory consumption was 26.2 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 132.65 ms. Allocated memory is still 157.3 MB. Free memory was 103.8 MB in the beginning and 99.2 MB in the end (delta: 4.6 MB). Peak memory consumption was 5.2 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1790.61 ms. Allocated memory was 157.3 MB in the beginning and 203.4 MB in the end (delta: 46.1 MB). Free memory was 99.0 MB in the beginning and 169.7 MB in the end (delta: -70.7 MB). Peak memory consumption was 50.8 MB. Max. memory is 8.0 GB. * TraceAbstraction took 55215.23 ms. Allocated memory was 203.4 MB in the beginning and 879.8 MB in the end (delta: 676.3 MB). Free memory was 169.2 MB in the beginning and 809.3 MB in the end (delta: -640.2 MB). Peak memory consumption was 36.7 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L9] int inputC = 3; [L10] int inputD = 4; [L11] int inputE = 5; [L12] int inputF = 6; [L13] int inputB = 2; [L16] int a1 = 23; [L17] int a19 = 9; [L18] int a10 = 0; [L19] int a12 = 0; [L20] int a4 = 14; [L581] int output = -1; [L584] COND TRUE 1 [L587] int input; [L588] input = __VERIFIER_nondet_int() [L589] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L592] CALL, EXPR calculate_output(input) [L23] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L26] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L29] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L32] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L35] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L38] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L41] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L44] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L47] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L50] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L53] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L56] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L59] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L62] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L65] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L68] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L71] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L74] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L77] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L80] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L83] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L86] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L89] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L92] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L95] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L98] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L101] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L104] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L107] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L110] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L113] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L116] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L119] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L122] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L125] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L128] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L131] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L134] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L137] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L140] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L143] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L146] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L149] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L152] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L155] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L158] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L161] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L164] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L167] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L170] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L173] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L176] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L179] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L182] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L185] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L188] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L191] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L194] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L197] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L200] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L203] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L207] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L212] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) [L217] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) [L222] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) [L227] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) [L233] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) [L238] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) [L241] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) [L246] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) [L251] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) [L256] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) [L262] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) [L267] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) [L273] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) [L279] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) [L285] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) [L288] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) [L293] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) [L298] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) [L303] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) [L308] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) [L314] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) [L319] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) [L322] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) [L325] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) [L328] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) [L331] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) [L337] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) [L342] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) [L347] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) [L353] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) [L356] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) [L359] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) [L362] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) [L367] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0))))) [L372] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) [L377] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) [L380] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) [L385] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) [L390] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0))))) [L395] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) [L400] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) [L405] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14))) [L410] COND FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))) [L416] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14))) [L421] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10)))))) [L427] COND FALSE !(((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0))) [L432] COND FALSE !((((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 6)) && (a19==10))) && (a12==0))) [L438] COND FALSE !(((a19==9) && ((((input == 4) && (( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 ))) && (a12==0)) && (a4==14)))) [L444] COND FALSE !((((a19==10) && ((a12==0) && ((((a10==1) && a1 <= -13 ) || (( ((38 < a1) && (218 >= a1)) && (a10==0)) || ((a10==0) && 218 < a1 ))) && (input == 3)))) && (a4==14))) [L450] COND FALSE !(((a19==9) && (((a4==14) && ((((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4))) && (input == 5))) && (a12==0)))) [L456] COND FALSE !((((a12==0) && ((((input == 5) && (a19==10)) && ((38 < a1) && (218 >= a1)) ) && (a4==14))) && (a10==1))) [L462] COND FALSE !(((a19==9) && ((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3)) && (a10==1)) && (a12==0))))) [L467] COND FALSE !(((a10==0) && ((a12==0) && ((((input == 5) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a4==14))))) [L473] COND FALSE !(( 218 < a1 && (((((input == 3) && (a10==1)) && (a12==0)) && (a4==14)) && (a19==10)))) [L478] COND FALSE !((((a12==0) && ((a19==9) && (((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a4==14)))) && (a10==3))) [L483] COND FALSE !((((((a4==14) && ( ((38 < a1) && (218 >= a1)) && (input == 2))) && (a12==0)) && (a10==1)) && (a19==10))) [L489] COND FALSE !((((a19==10) && ((a10==1) && ((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (input == 5))))) && (a4==14))) [L495] COND FALSE !(((((a10==1) && (((input == 5) && 218 < a1 ) && (a4==14))) && (a19==10)) && (a12==0))) [L501] COND FALSE !((((a4==14) && ((a19==9) && ((input == 2) && (((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 ))))) && (a12==0))) [L506] COND FALSE !((((a4==14) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 2))) && (a12==0))) && (a10==4))) [L511] COND FALSE !(((a4==14) && (((a19==9) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 6)) && (a10==3))) && (a12==0)))) [L516] COND FALSE !((((a4==14) && ((((input == 6) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a12==0))) && (a10==0))) [L519] COND FALSE !(((a12==0) && ((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 2)) && (a19==10))))) [L525] COND FALSE !((((a12==0) && ((a19==9) && ((a10==2) && ((input == 6) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))))) && (a4==14))) [L528] COND FALSE !(((a4==14) && ((a19==9) && ((a12==0) && (((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)))))) [L531] COND FALSE !(((a19==9) && (((a10==1) && ((a12==0) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )))) && (a4==14)))) [L536] COND FALSE !(((a19==9) && ((a4==14) && ((a10==1) && (((input == 5) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a12==0)))))) [L542] COND TRUE ((a12==0) && (((((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a19==9)) && (a4==14)) && (a10==0))) [L543] a1 = (((((a1 + -272193) - -47605) - -570122) % 89)+ 110) [L544] a10 = 1 [L546] return 25; [L592] RET, EXPR calculate_output(input) [L592] output = calculate_output(input) [L584] COND TRUE 1 [L587] int input; [L588] input = __VERIFIER_nondet_int() [L589] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L592] CALL, EXPR calculate_output(input) [L23] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L26] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L29] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L32] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L35] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L38] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L41] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L44] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L47] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L50] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L53] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L56] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L59] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L62] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L65] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L68] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L71] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L74] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L77] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L80] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L83] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L86] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L89] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L92] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L95] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L98] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L101] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L104] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L107] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L110] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L113] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L116] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L119] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L122] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L125] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L128] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L131] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L134] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L137] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L140] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L143] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L146] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L149] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L152] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L155] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L158] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L161] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L164] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L167] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L170] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L173] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L176] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L179] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L182] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L185] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L188] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L191] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L194] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L197] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L200] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L203] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L207] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L212] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) [L217] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) [L222] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) [L227] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) [L233] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) [L238] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) [L241] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) [L246] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) [L251] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) [L256] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) [L262] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) [L267] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) [L273] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) [L279] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) [L285] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) [L288] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) [L293] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) [L298] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) [L303] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) [L308] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) [L314] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) [L319] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) [L322] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) [L325] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) [L328] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) [L331] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) [L337] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) [L342] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) [L347] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) [L353] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) [L356] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) [L359] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) [L362] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) [L367] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0))))) [L372] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) [L377] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) [L380] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) [L385] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) [L390] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0))))) [L395] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) [L400] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) [L405] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14))) [L410] COND FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))) [L416] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14))) [L421] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10)))))) [L427] COND FALSE !(((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0))) [L432] COND FALSE !((((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 6)) && (a19==10))) && (a12==0))) [L438] COND FALSE !(((a19==9) && ((((input == 4) && (( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 ))) && (a12==0)) && (a4==14)))) [L444] COND FALSE !((((a19==10) && ((a12==0) && ((((a10==1) && a1 <= -13 ) || (( ((38 < a1) && (218 >= a1)) && (a10==0)) || ((a10==0) && 218 < a1 ))) && (input == 3)))) && (a4==14))) [L450] COND FALSE !(((a19==9) && (((a4==14) && ((((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4))) && (input == 5))) && (a12==0)))) [L456] COND FALSE !((((a12==0) && ((((input == 5) && (a19==10)) && ((38 < a1) && (218 >= a1)) ) && (a4==14))) && (a10==1))) [L462] COND FALSE !(((a19==9) && ((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3)) && (a10==1)) && (a12==0))))) [L467] COND FALSE !(((a10==0) && ((a12==0) && ((((input == 5) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a4==14))))) [L473] COND FALSE !(( 218 < a1 && (((((input == 3) && (a10==1)) && (a12==0)) && (a4==14)) && (a19==10)))) [L478] COND FALSE !((((a12==0) && ((a19==9) && (((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a4==14)))) && (a10==3))) [L483] COND FALSE !((((((a4==14) && ( ((38 < a1) && (218 >= a1)) && (input == 2))) && (a12==0)) && (a10==1)) && (a19==10))) [L489] COND FALSE !((((a19==10) && ((a10==1) && ((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (input == 5))))) && (a4==14))) [L495] COND FALSE !(((((a10==1) && (((input == 5) && 218 < a1 ) && (a4==14))) && (a19==10)) && (a12==0))) [L501] COND FALSE !((((a4==14) && ((a19==9) && ((input == 2) && (((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 ))))) && (a12==0))) [L506] COND FALSE !((((a4==14) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 2))) && (a12==0))) && (a10==4))) [L511] COND FALSE !(((a4==14) && (((a19==9) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 6)) && (a10==3))) && (a12==0)))) [L516] COND FALSE !((((a4==14) && ((((input == 6) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a12==0))) && (a10==0))) [L519] COND FALSE !(((a12==0) && ((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 2)) && (a19==10))))) [L525] COND FALSE !((((a12==0) && ((a19==9) && ((a10==2) && ((input == 6) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))))) && (a4==14))) [L528] COND FALSE !(((a4==14) && ((a19==9) && ((a12==0) && (((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)))))) [L531] COND FALSE !(((a19==9) && (((a10==1) && ((a12==0) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )))) && (a4==14)))) [L536] COND TRUE ((a19==9) && ((a4==14) && ((a10==1) && (((input == 5) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a12==0))))) [L537] a1 = (((a1 + -438195) * 1) * 1) [L538] a10 = 2 [L539] a19 = 8 [L541] return -1; [L592] RET, EXPR calculate_output(input) [L592] output = calculate_output(input) [L584] COND TRUE 1 [L587] int input; [L588] input = __VERIFIER_nondet_int() [L589] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L592] CALL calculate_output(input) [L23] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L26] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L29] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L32] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L35] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L38] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L41] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L44] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L47] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L50] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L53] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L56] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L59] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L62] COND TRUE (((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8)) [L63] CALL reach_error() [L4] __assert_fail("0", "Problem10_label47.c", 4, "reach_error") - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 219 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 55.1s, OverallIterations: 13, TraceHistogramMax: 4, AutomataDifference: 25.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 325 SDtfs, 5003 SDslu, 376 SDs, 0 SdLazy, 11084 SolverSat, 1481 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 205 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3271occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 12 MinimizatonAttempts, 871 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 25.9s InterpolantComputationTime, 2740 NumberOfCodeBlocks, 2740 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2429 ConstructedInterpolants, 0 QuantifiedInterpolants, 2166746 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 1 PerfectInterpolantSequences, 1421/1595 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...