/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_label48.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-0f64333 [2020-10-26 22:33:20,256 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-26 22:33:20,260 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-26 22:33:20,322 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-26 22:33:20,323 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-26 22:33:20,330 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-26 22:33:20,333 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-26 22:33:20,338 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-26 22:33:20,342 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-26 22:33:20,349 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-26 22:33:20,351 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-26 22:33:20,353 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-26 22:33:20,353 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-26 22:33:20,357 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-26 22:33:20,360 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-26 22:33:20,362 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-26 22:33:20,364 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-26 22:33:20,367 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-26 22:33:20,375 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-26 22:33:20,385 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-26 22:33:20,387 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-26 22:33:20,389 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-26 22:33:20,392 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-26 22:33:20,394 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-26 22:33:20,405 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-26 22:33:20,405 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-26 22:33:20,406 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-26 22:33:20,408 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-26 22:33:20,409 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-26 22:33:20,410 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-26 22:33:20,410 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-26 22:33:20,411 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-26 22:33:20,414 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-26 22:33:20,415 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-26 22:33:20,416 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-26 22:33:20,416 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-26 22:33:20,425 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-26 22:33:20,425 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-26 22:33:20,425 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-26 22:33:20,427 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-26 22:33:20,428 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-26 22:33:20,436 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:20,486 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-26 22:33:20,487 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-26 22:33:20,491 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-26 22:33:20,491 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-26 22:33:20,492 INFO L138 SettingsManager]: * Use SBE=true [2020-10-26 22:33:20,492 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-26 22:33:20,492 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-26 22:33:20,492 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-26 22:33:20,493 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-26 22:33:20,493 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-26 22:33:20,494 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-26 22:33:20,494 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-26 22:33:20,495 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-26 22:33:20,495 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-26 22:33:20,495 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-26 22:33:20,495 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-26 22:33:20,496 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-26 22:33:20,496 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-26 22:33:20,496 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-26 22:33:20,496 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-26 22:33:20,497 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-26 22:33:20,497 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-26 22:33:20,497 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-26 22:33:20,497 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-26 22:33:20,498 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-26 22:33:20,498 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-26 22:33:20,498 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-26 22:33:20,498 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-26 22:33:20,498 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-26 22:33:20,499 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,979 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-26 22:33:21,006 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-26 22:33:21,010 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-26 22:33:21,011 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-26 22:33:21,012 INFO L275 PluginConnector]: CDTParser initialized [2020-10-26 22:33:21,013 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label48.c [2020-10-26 22:33:21,107 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/b42e2635e/9abcca7d03a943d49b0aa75d0257b4f9/FLAG8a1ea95bb [2020-10-26 22:33:21,803 INFO L306 CDTParser]: Found 1 translation units. [2020-10-26 22:33:21,804 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/eca-rers2012/Problem10_label48.c [2020-10-26 22:33:21,826 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/b42e2635e/9abcca7d03a943d49b0aa75d0257b4f9/FLAG8a1ea95bb [2020-10-26 22:33:22,079 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/b42e2635e/9abcca7d03a943d49b0aa75d0257b4f9 [2020-10-26 22:33:22,082 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-26 22:33:22,089 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-26 22:33:22,091 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-26 22:33:22,091 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-26 22:33:22,095 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-26 22:33:22,096 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 10:33:22" (1/1) ... [2020-10-26 22:33:22,104 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33a6a057 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:33:22, skipping insertion in model container [2020-10-26 22:33:22,104 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 10:33:22" (1/1) ... [2020-10-26 22:33:22,113 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-26 22:33:22,154 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-26 22:33:22,575 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 22:33:22,587 INFO L203 MainTranslator]: Completed pre-run [2020-10-26 22:33:22,797 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 22:33:22,832 INFO L208 MainTranslator]: Completed translation [2020-10-26 22:33:22,833 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,833 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-26 22:33:22,834 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-26 22:33:22,834 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-26 22:33:22,835 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-26 22:33:22,850 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,851 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,873 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,874 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,912 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,938 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,950 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,958 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-26 22:33:22,959 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-26 22:33:22,959 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-26 22:33:22,959 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-26 22:33:22,960 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:23,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-26 22:33:23,082 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-26 22:33:23,082 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-26 22:33:23,082 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2020-10-26 22:33:23,082 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-26 22:33:23,083 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2020-10-26 22:33:23,083 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-26 22:33:23,083 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-26 22:33:23,083 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-26 22:33:23,083 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-26 22:33:23,084 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-26 22:33:23,084 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-10-26 22:33:23,084 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-26 22:33:23,084 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-26 22:33:23,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-26 22:33:23,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-26 22:33:23,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-26 22:33:23,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-26 22:33:23,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-26 22:33:24,713 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-26 22:33:24,713 INFO L298 CfgBuilder]: Removed 1 assume(true) statements. [2020-10-26 22:33:24,717 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,717 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-26 22:33:24,720 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-26 22:33:24,721 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-26 22:33:24,725 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-26 22:33:24,726 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 10:33:22" (1/3) ... [2020-10-26 22:33:24,727 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@166a3765 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,727 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,728 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@166a3765 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,728 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,729 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem10_label48.c [2020-10-26 22:33:24,742 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-26 22:33:24,748 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-26 22:33:24,763 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-26 22:33:24,792 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-26 22:33:24,792 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-26 22:33:24,792 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-26 22:33:24,793 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-26 22:33:24,793 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-26 22:33:24,793 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-26 22:33:24,793 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-26 22:33:24,793 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-26 22:33:24,819 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states. [2020-10-26 22:33:24,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-26 22:33:24,825 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 22:33:24,826 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 22:33:24,826 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 22:33:24,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 22:33:24,833 INFO L82 PathProgramCache]: Analyzing trace with hash -2116519100, now seen corresponding path program 1 times [2020-10-26 22:33:24,843 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-26 22:33:24,844 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1687934949] [2020-10-26 22:33:24,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 22:33:25,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:25,082 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:25,616 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:25,617 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 24 [2020-10-26 22:33:25,617 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:33:25,617 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 607 [2020-10-26 22:33:25,620 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:25,621 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-10-26 22:33:25,621 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 5 [2020-10-26 22:33:25,621 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 15 [2020-10-26 22:33:25,622 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 4 [2020-10-26 22:33:25,785 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 22:33:25,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:25,817 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:25,864 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:25,864 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-26 22:33:25,864 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:33:25,864 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 55 [2020-10-26 22:33:25,865 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:25,866 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-26 22:33:25,866 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:33:25,866 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 2 [2020-10-26 22:33:25,866 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-26 22:33:25,882 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,883 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1687934949] [2020-10-26 22:33:25,885 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 22:33:25,885 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 22:33:25,887 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557848786] [2020-10-26 22:33:25,893 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-26 22:33:25,893 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-26 22:33:25,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 22:33:25,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-26 22:33:25,917 INFO L87 Difference]: Start difference. First operand 219 states. Second operand 4 states. [2020-10-26 22:33:27,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 22:33:27,811 INFO L93 Difference]: Finished difference Result 586 states and 1012 transitions. [2020-10-26 22:33:27,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-26 22:33:27,813 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-10-26 22:33:27,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 22:33:27,829 INFO L225 Difference]: With dead ends: 586 [2020-10-26 22:33:27,829 INFO L226 Difference]: Without dead ends: 303 [2020-10-26 22:33:27,838 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,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2020-10-26 22:33:27,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 299. [2020-10-26 22:33:27,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2020-10-26 22:33:27,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 396 transitions. [2020-10-26 22:33:27,914 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 396 transitions. Word has length 14 [2020-10-26 22:33:27,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 22:33:27,914 INFO L481 AbstractCegarLoop]: Abstraction has 299 states and 396 transitions. [2020-10-26 22:33:27,915 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-26 22:33:27,915 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 396 transitions. [2020-10-26 22:33:27,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2020-10-26 22:33:27,919 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 22:33:27,919 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-10-26 22:33:27,919 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-26 22:33:27,920 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 22:33:27,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 22:33:27,921 INFO L82 PathProgramCache]: Analyzing trace with hash -2034594136, now seen corresponding path program 1 times [2020-10-26 22:33:27,921 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-26 22:33:27,921 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [131532170] [2020-10-26 22:33:27,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 22:33:27,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:28,027 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:28,132 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:28,839 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:28,839 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 96 [2020-10-26 22:33:28,840 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-26 22:33:28,840 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 849 [2020-10-26 22:33:28,841 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:28,841 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 8 [2020-10-26 22:33:28,841 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 5 [2020-10-26 22:33:28,841 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 87 [2020-10-26 22:33:28,841 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-26 22:33:28,945 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 22:33:28,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:28,956 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:28,973 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:28,973 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-26 22:33:28,973 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:33:28,973 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 20 [2020-10-26 22:33:28,974 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:28,974 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-26 22:33:28,974 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:33:28,974 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 2 [2020-10-26 22:33:28,974 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:29,005 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-26 22:33:29,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:29,041 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:29,107 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:29,273 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:29,273 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 71 [2020-10-26 22:33:29,280 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-26 22:33:29,282 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 247 [2020-10-26 22:33:29,282 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:29,282 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-26 22:33:29,282 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-26 22:33:29,283 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 71 [2020-10-26 22:33:29,283 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:29,422 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-26 22:33:29,423 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [131532170] [2020-10-26 22:33:29,423 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-26 22:33:29,423 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-10-26 22:33:29,423 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771147659] [2020-10-26 22:33:29,426 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-26 22:33:29,427 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-26 22:33:29,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-26 22:33:29,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-26 22:33:29,429 INFO L87 Difference]: Start difference. First operand 299 states and 396 transitions. Second operand 7 states. [2020-10-26 22:33:31,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 22:33:31,859 INFO L93 Difference]: Finished difference Result 898 states and 1243 transitions. [2020-10-26 22:33:31,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-26 22:33:31,860 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 84 [2020-10-26 22:33:31,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 22:33:31,875 INFO L225 Difference]: With dead ends: 898 [2020-10-26 22:33:31,876 INFO L226 Difference]: Without dead ends: 895 [2020-10-26 22:33:31,878 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2020-10-26 22:33:31,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2020-10-26 22:33:31,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 591. [2020-10-26 22:33:31,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2020-10-26 22:33:31,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 852 transitions. [2020-10-26 22:33:31,993 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 852 transitions. Word has length 84 [2020-10-26 22:33:31,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 22:33:31,994 INFO L481 AbstractCegarLoop]: Abstraction has 591 states and 852 transitions. [2020-10-26 22:33:31,994 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-26 22:33:31,994 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 852 transitions. [2020-10-26 22:33:31,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2020-10-26 22:33:31,997 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 22:33:31,997 INFO L422 BasicCegarLoop]: trace histogram [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:31,998 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-26 22:33:31,998 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 22:33:31,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 22:33:31,999 INFO L82 PathProgramCache]: Analyzing trace with hash -37828364, now seen corresponding path program 1 times [2020-10-26 22:33:31,999 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-26 22:33:31,999 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1549068149] [2020-10-26 22:33:31,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 22:33:32,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:32,079 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:32,449 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:32,449 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 99 [2020-10-26 22:33:32,449 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:33:32,450 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 391 [2020-10-26 22:33:32,450 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:32,450 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-10-26 22:33:32,450 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 5 [2020-10-26 22:33:32,450 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 79 [2020-10-26 22:33:32,450 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:32,548 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 22:33:32,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:32,557 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:32,571 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:32,571 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-26 22:33:32,571 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:33:32,572 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 16 [2020-10-26 22:33:32,572 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:32,572 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-26 22:33:32,572 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:33:32,572 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 2 [2020-10-26 22:33:32,573 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:32,598 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-26 22:33:32,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:32,627 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:32,743 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:32,744 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 74 [2020-10-26 22:33:32,744 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:33:32,744 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 128 [2020-10-26 22:33:32,744 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:32,744 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-26 22:33:32,744 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-26 22:33:32,745 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 74 [2020-10-26 22:33:32,745 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:32,823 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 22:33:32,823 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1549068149] [2020-10-26 22:33:32,823 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 22:33:32,824 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-26 22:33:32,824 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205126619] [2020-10-26 22:33:32,824 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-26 22:33:32,825 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-26 22:33:32,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-26 22:33:32,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-26 22:33:32,826 INFO L87 Difference]: Start difference. First operand 591 states and 852 transitions. Second operand 8 states. [2020-10-26 22:33:35,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 22:33:35,159 INFO L93 Difference]: Finished difference Result 1492 states and 2183 transitions. [2020-10-26 22:33:35,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-26 22:33:35,161 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 87 [2020-10-26 22:33:35,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 22:33:35,170 INFO L225 Difference]: With dead ends: 1492 [2020-10-26 22:33:35,171 INFO L226 Difference]: Without dead ends: 907 [2020-10-26 22:33:35,174 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2020-10-26 22:33:35,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2020-10-26 22:33:35,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 889. [2020-10-26 22:33:35,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 889 states. [2020-10-26 22:33:35,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1175 transitions. [2020-10-26 22:33:35,233 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1175 transitions. Word has length 87 [2020-10-26 22:33:35,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 22:33:35,235 INFO L481 AbstractCegarLoop]: Abstraction has 889 states and 1175 transitions. [2020-10-26 22:33:35,235 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-26 22:33:35,235 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1175 transitions. [2020-10-26 22:33:35,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2020-10-26 22:33:35,250 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 22:33:35,250 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 22:33:35,250 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-26 22:33:35,251 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 22:33:35,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 22:33:35,253 INFO L82 PathProgramCache]: Analyzing trace with hash -413795864, now seen corresponding path program 1 times [2020-10-26 22:33:35,253 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-26 22:33:35,253 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1013014103] [2020-10-26 22:33:35,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 22:33:35,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:35,311 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:35,522 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:35,523 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 105 [2020-10-26 22:33:35,523 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:33:35,524 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 230 [2020-10-26 22:33:35,524 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:35,524 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-26 22:33:35,524 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 89 [2020-10-26 22:33:35,524 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 12 [2020-10-26 22:33:35,524 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:35,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 22:33:35,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:35,616 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:35,621 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:35,621 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-26 22:33:35,621 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:33:35,622 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 5 [2020-10-26 22:33:35,622 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:35,622 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-26 22:33:35,622 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:33:35,622 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-26 22:33:35,622 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:35,639 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-26 22:33:35,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:35,669 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:35,736 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:35,736 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 80 [2020-10-26 22:33:35,737 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:33:35,737 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 79 [2020-10-26 22:33:35,737 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:35,737 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-26 22:33:35,737 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:33:35,737 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 74 [2020-10-26 22:33:35,738 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:35,833 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 22:33:35,833 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1013014103] [2020-10-26 22:33:35,834 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-26 22:33:35,834 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-10-26 22:33:35,834 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793168767] [2020-10-26 22:33:35,835 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-26 22:33:35,835 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-26 22:33:35,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-26 22:33:35,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-26 22:33:35,836 INFO L87 Difference]: Start difference. First operand 889 states and 1175 transitions. Second operand 6 states. [2020-10-26 22:33:38,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 22:33:38,271 INFO L93 Difference]: Finished difference Result 2658 states and 3658 transitions. [2020-10-26 22:33:38,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-26 22:33:38,273 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2020-10-26 22:33:38,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 22:33:38,289 INFO L225 Difference]: With dead ends: 2658 [2020-10-26 22:33:38,290 INFO L226 Difference]: Without dead ends: 1775 [2020-10-26 22:33:38,293 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-10-26 22:33:38,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1775 states. [2020-10-26 22:33:38,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1775 to 1338. [2020-10-26 22:33:38,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1338 states. [2020-10-26 22:33:38,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1338 states to 1338 states and 1730 transitions. [2020-10-26 22:33:38,370 INFO L78 Accepts]: Start accepts. Automaton has 1338 states and 1730 transitions. Word has length 93 [2020-10-26 22:33:38,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 22:33:38,370 INFO L481 AbstractCegarLoop]: Abstraction has 1338 states and 1730 transitions. [2020-10-26 22:33:38,370 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-26 22:33:38,370 INFO L276 IsEmpty]: Start isEmpty. Operand 1338 states and 1730 transitions. [2020-10-26 22:33:38,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2020-10-26 22:33:38,377 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 22:33:38,377 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38,377 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-26 22:33:38,378 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 22:33:38,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 22:33:38,378 INFO L82 PathProgramCache]: Analyzing trace with hash -975426296, now seen corresponding path program 1 times [2020-10-26 22:33:38,379 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-26 22:33:38,379 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [303703494] [2020-10-26 22:33:38,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 22:33:38,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:38,471 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:38,824 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:39,483 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:39,484 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 234 [2020-10-26 22:33:39,484 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-26 22:33:39,484 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1047 [2020-10-26 22:33:39,484 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:39,485 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-26 22:33:39,485 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 80 [2020-10-26 22:33:39,485 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 139 [2020-10-26 22:33:39,485 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:39,597 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 22:33:39,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:39,601 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:39,607 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:39,608 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-26 22:33:39,608 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:33:39,608 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 7 [2020-10-26 22:33:39,608 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:39,609 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-26 22:33:39,609 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:33:39,609 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-26 22:33:39,609 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:39,625 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-26 22:33:39,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:39,652 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:39,710 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:39,710 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 71 [2020-10-26 22:33:39,711 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:33:39,711 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 69 [2020-10-26 22:33:39,711 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:39,711 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-26 22:33:39,711 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:33:39,712 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 65 [2020-10-26 22:33:39,712 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:39,738 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2020-10-26 22:33:39,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:39,805 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:40,018 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:40,018 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 137 [2020-10-26 22:33:40,018 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:33:40,019 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 237 [2020-10-26 22:33:40,019 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:40,019 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-26 22:33:40,019 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-26 22:33:40,019 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 137 [2020-10-26 22:33:40,020 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:40,235 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 79 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-26 22:33:40,240 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [303703494] [2020-10-26 22:33:40,240 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-26 22:33:40,240 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-26 22:33:40,241 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524708020] [2020-10-26 22:33:40,242 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-26 22:33:40,242 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-26 22:33:40,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-26 22:33:40,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-26 22:33:40,246 INFO L87 Difference]: Start difference. First operand 1338 states and 1730 transitions. Second operand 7 states. [2020-10-26 22:33:42,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 22:33:42,313 INFO L93 Difference]: Finished difference Result 2720 states and 3604 transitions. [2020-10-26 22:33:42,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-26 22:33:42,313 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 220 [2020-10-26 22:33:42,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 22:33:42,326 INFO L225 Difference]: With dead ends: 2720 [2020-10-26 22:33:42,326 INFO L226 Difference]: Without dead ends: 1388 [2020-10-26 22:33:42,331 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:42,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2020-10-26 22:33:42,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 1203. [2020-10-26 22:33:42,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1203 states. [2020-10-26 22:33:42,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1203 states to 1203 states and 1449 transitions. [2020-10-26 22:33:42,394 INFO L78 Accepts]: Start accepts. Automaton has 1203 states and 1449 transitions. Word has length 220 [2020-10-26 22:33:42,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 22:33:42,395 INFO L481 AbstractCegarLoop]: Abstraction has 1203 states and 1449 transitions. [2020-10-26 22:33:42,395 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-26 22:33:42,395 INFO L276 IsEmpty]: Start isEmpty. Operand 1203 states and 1449 transitions. [2020-10-26 22:33:42,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2020-10-26 22:33:42,399 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 22:33:42,401 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42,401 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-26 22:33:42,401 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 22:33:42,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 22:33:42,402 INFO L82 PathProgramCache]: Analyzing trace with hash 264908924, now seen corresponding path program 1 times [2020-10-26 22:33:42,402 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-26 22:33:42,403 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [672875959] [2020-10-26 22:33:42,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 22:33:42,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:42,505 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:42,742 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:43,703 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:44,281 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:44,282 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 240 [2020-10-26 22:33:44,282 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 3 [2020-10-26 22:33:44,282 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1821 [2020-10-26 22:33:44,282 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:44,282 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-26 22:33:44,283 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 80 [2020-10-26 22:33:44,283 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 145 [2020-10-26 22:33:44,283 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:44,402 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 22:33:44,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:44,407 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:44,411 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:44,411 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-26 22:33:44,411 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:33:44,412 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 5 [2020-10-26 22:33:44,412 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:44,412 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-26 22:33:44,412 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:33:44,412 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-26 22:33:44,413 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:44,429 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-26 22:33:44,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:44,451 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:44,504 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:44,505 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 71 [2020-10-26 22:33:44,505 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:33:44,505 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 61 [2020-10-26 22:33:44,505 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:44,505 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-26 22:33:44,506 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:33:44,506 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 65 [2020-10-26 22:33:44,506 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:44,524 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2020-10-26 22:33:44,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:44,576 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:44,767 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:44,767 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 143 [2020-10-26 22:33:44,768 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:33:44,768 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 211 [2020-10-26 22:33:44,768 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:44,768 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-26 22:33:44,768 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-26 22:33:44,768 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 143 [2020-10-26 22:33:44,769 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:44,964 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 79 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-26 22:33:44,965 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [672875959] [2020-10-26 22:33:44,966 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-26 22:33:44,966 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-26 22:33:44,967 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521263096] [2020-10-26 22:33:44,967 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-26 22:33:44,967 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-26 22:33:44,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-26 22:33:44,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-26 22:33:44,970 INFO L87 Difference]: Start difference. First operand 1203 states and 1449 transitions. Second operand 7 states. [2020-10-26 22:33:46,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 22:33:46,843 INFO L93 Difference]: Finished difference Result 2428 states and 2944 transitions. [2020-10-26 22:33:46,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-26 22:33:46,844 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 226 [2020-10-26 22:33:46,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 22:33:46,851 INFO L225 Difference]: With dead ends: 2428 [2020-10-26 22:33:46,851 INFO L226 Difference]: Without dead ends: 1231 [2020-10-26 22:33:46,855 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:46,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1231 states. [2020-10-26 22:33:46,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1231 to 1058. [2020-10-26 22:33:46,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1058 states. [2020-10-26 22:33:46,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1058 states to 1058 states and 1223 transitions. [2020-10-26 22:33:46,891 INFO L78 Accepts]: Start accepts. Automaton has 1058 states and 1223 transitions. Word has length 226 [2020-10-26 22:33:46,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 22:33:46,892 INFO L481 AbstractCegarLoop]: Abstraction has 1058 states and 1223 transitions. [2020-10-26 22:33:46,892 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-26 22:33:46,892 INFO L276 IsEmpty]: Start isEmpty. Operand 1058 states and 1223 transitions. [2020-10-26 22:33:46,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2020-10-26 22:33:46,896 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 22:33:46,897 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46,897 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-26 22:33:46,897 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 22:33:46,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 22:33:46,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1225021512, now seen corresponding path program 1 times [2020-10-26 22:33:46,898 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-26 22:33:46,898 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [910840353] [2020-10-26 22:33:46,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 22:33:46,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:46,996 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:47,206 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:47,685 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:48,139 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:48,140 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 243 [2020-10-26 22:33:48,140 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 3 [2020-10-26 22:33:48,140 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1174 [2020-10-26 22:33:48,140 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:48,140 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-26 22:33:48,141 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 89 [2020-10-26 22:33:48,141 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 139 [2020-10-26 22:33:48,141 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:48,246 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 22:33:48,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:48,250 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:48,254 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:48,254 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-26 22:33:48,254 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:33:48,255 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 5 [2020-10-26 22:33:48,255 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:48,255 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-26 22:33:48,255 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:33:48,255 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-26 22:33:48,255 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:48,270 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-26 22:33:48,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:48,299 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:48,353 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:48,353 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 80 [2020-10-26 22:33:48,353 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:33:48,353 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 63 [2020-10-26 22:33:48,353 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:48,354 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-26 22:33:48,354 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:33:48,354 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 74 [2020-10-26 22:33:48,354 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:48,377 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-10-26 22:33:48,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:48,437 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:48,625 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:48,625 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 137 [2020-10-26 22:33:48,626 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:33:48,626 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 209 [2020-10-26 22:33:48,626 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:48,626 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-26 22:33:48,626 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-26 22:33:48,626 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 137 [2020-10-26 22:33:48,627 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:48,798 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 88 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-26 22:33:48,798 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [910840353] [2020-10-26 22:33:48,799 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-26 22:33:48,799 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-26 22:33:48,799 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129223018] [2020-10-26 22:33:48,800 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-26 22:33:48,800 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-26 22:33:48,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-26 22:33:48,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-26 22:33:48,801 INFO L87 Difference]: Start difference. First operand 1058 states and 1223 transitions. Second operand 7 states. [2020-10-26 22:33:50,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 22:33:50,881 INFO L93 Difference]: Finished difference Result 2722 states and 3183 transitions. [2020-10-26 22:33:50,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-26 22:33:50,887 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 229 [2020-10-26 22:33:50,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 22:33:50,894 INFO L225 Difference]: With dead ends: 2722 [2020-10-26 22:33:50,894 INFO L226 Difference]: Without dead ends: 1076 [2020-10-26 22:33:50,899 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2020-10-26 22:33:50,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1076 states. [2020-10-26 22:33:50,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076 to 1046. [2020-10-26 22:33:50,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1046 states. [2020-10-26 22:33:50,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 1176 transitions. [2020-10-26 22:33:50,933 INFO L78 Accepts]: Start accepts. Automaton has 1046 states and 1176 transitions. Word has length 229 [2020-10-26 22:33:50,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 22:33:50,934 INFO L481 AbstractCegarLoop]: Abstraction has 1046 states and 1176 transitions. [2020-10-26 22:33:50,934 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-26 22:33:50,934 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1176 transitions. [2020-10-26 22:33:50,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2020-10-26 22:33:50,939 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 22:33:50,939 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50,940 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-26 22:33:50,940 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 22:33:50,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 22:33:50,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1419294272, now seen corresponding path program 1 times [2020-10-26 22:33:50,941 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-26 22:33:50,941 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [467626072] [2020-10-26 22:33:50,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 22:33:50,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:51,003 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:51,091 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:53,932 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:54,136 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:56,017 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:56,018 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 247 [2020-10-26 22:33:56,018 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 4 [2020-10-26 22:33:56,018 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 5032 [2020-10-26 22:33:56,018 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:56,019 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-10-26 22:33:56,019 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 5 [2020-10-26 22:33:56,019 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 83 [2020-10-26 22:33:56,019 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-26 22:33:56,120 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 22:33:56,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:56,129 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:56,139 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:56,140 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-26 22:33:56,140 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:33:56,140 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 13 [2020-10-26 22:33:56,141 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:56,142 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-26 22:33:56,142 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:33:56,142 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 2 [2020-10-26 22:33:56,142 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 2 [2020-10-26 22:33:56,158 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-26 22:33:56,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:56,186 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:56,302 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:56,302 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 78 [2020-10-26 22:33:56,302 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:33:56,302 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 127 [2020-10-26 22:33:56,303 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:56,303 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-26 22:33:56,303 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-26 22:33:56,303 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 78 [2020-10-26 22:33:56,303 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:56,382 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2020-10-26 22:33:56,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:56,441 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:56,511 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:56,512 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 143 [2020-10-26 22:33:56,512 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:33:56,512 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 93 [2020-10-26 22:33:56,512 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:56,512 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-26 22:33:56,513 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 140 [2020-10-26 22:33:56,513 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-26 22:33:56,513 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:56,674 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 12 proven. 72 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-26 22:33:56,675 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [467626072] [2020-10-26 22:33:56,675 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-26 22:33:56,675 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-26 22:33:56,675 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024416786] [2020-10-26 22:33:56,676 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-26 22:33:56,676 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-26 22:33:56,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-26 22:33:56,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-26 22:33:56,677 INFO L87 Difference]: Start difference. First operand 1046 states and 1176 transitions. Second operand 7 states. [2020-10-26 22:33:58,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 22:33:58,447 INFO L93 Difference]: Finished difference Result 2394 states and 2694 transitions. [2020-10-26 22:33:58,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-26 22:33:58,447 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 233 [2020-10-26 22:33:58,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 22:33:58,454 INFO L225 Difference]: With dead ends: 2394 [2020-10-26 22:33:58,455 INFO L226 Difference]: Without dead ends: 1354 [2020-10-26 22:33:58,458 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-10-26 22:33:58,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2020-10-26 22:33:58,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1338. [2020-10-26 22:33:58,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1338 states. [2020-10-26 22:33:58,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1338 states to 1338 states and 1490 transitions. [2020-10-26 22:33:58,498 INFO L78 Accepts]: Start accepts. Automaton has 1338 states and 1490 transitions. Word has length 233 [2020-10-26 22:33:58,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 22:33:58,499 INFO L481 AbstractCegarLoop]: Abstraction has 1338 states and 1490 transitions. [2020-10-26 22:33:58,499 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-26 22:33:58,499 INFO L276 IsEmpty]: Start isEmpty. Operand 1338 states and 1490 transitions. [2020-10-26 22:33:58,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2020-10-26 22:33:58,504 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 22:33:58,505 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 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:58,505 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-26 22:33:58,505 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 22:33:58,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 22:33:58,506 INFO L82 PathProgramCache]: Analyzing trace with hash 116594176, now seen corresponding path program 1 times [2020-10-26 22:33:58,506 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-26 22:33:58,506 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1419600139] [2020-10-26 22:33:58,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 22:33:58,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:58,636 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:58,929 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:59,799 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:59,800 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 279 [2020-10-26 22:33:59,800 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-26 22:33:59,800 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1223 [2020-10-26 22:33:59,800 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:59,800 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-26 22:33:59,801 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 125 [2020-10-26 22:33:59,801 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 139 [2020-10-26 22:33:59,801 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:59,908 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 22:33:59,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:59,912 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:59,915 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:59,916 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-26 22:33:59,916 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:33:59,916 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 4 [2020-10-26 22:33:59,916 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:59,916 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-26 22:33:59,917 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:33:59,917 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-26 22:33:59,917 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:59,931 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-26 22:33:59,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:59,973 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:00,066 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:00,067 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 116 [2020-10-26 22:34:00,067 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:34:00,067 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 108 [2020-10-26 22:34:00,067 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:00,068 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-26 22:34:00,068 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:34:00,068 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 110 [2020-10-26 22:34:00,068 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-26 22:34:00,128 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2020-10-26 22:34:00,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:00,192 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:00,487 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:00,488 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 137 [2020-10-26 22:34:00,488 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:34:00,488 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 323 [2020-10-26 22:34:00,488 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:00,489 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-26 22:34:00,489 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-26 22:34:00,489 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 137 [2020-10-26 22:34:00,489 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-26 22:34:00,775 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 124 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-26 22:34:00,776 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1419600139] [2020-10-26 22:34:00,776 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-26 22:34:00,776 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-26 22:34:00,778 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289716106] [2020-10-26 22:34:00,779 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-26 22:34:00,785 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-26 22:34:00,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-26 22:34:00,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-26 22:34:00,788 INFO L87 Difference]: Start difference. First operand 1338 states and 1490 transitions. Second operand 7 states. [2020-10-26 22:34:02,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 22:34:02,777 INFO L93 Difference]: Finished difference Result 3286 states and 3719 transitions. [2020-10-26 22:34:02,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-26 22:34:02,778 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 265 [2020-10-26 22:34:02,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 22:34:02,788 INFO L225 Difference]: With dead ends: 3286 [2020-10-26 22:34:02,788 INFO L226 Difference]: Without dead ends: 1952 [2020-10-26 22:34:02,793 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-10-26 22:34:02,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1952 states. [2020-10-26 22:34:02,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1952 to 1938. [2020-10-26 22:34:02,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1938 states. [2020-10-26 22:34:02,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1938 states to 1938 states and 2153 transitions. [2020-10-26 22:34:02,863 INFO L78 Accepts]: Start accepts. Automaton has 1938 states and 2153 transitions. Word has length 265 [2020-10-26 22:34:02,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 22:34:02,863 INFO L481 AbstractCegarLoop]: Abstraction has 1938 states and 2153 transitions. [2020-10-26 22:34:02,864 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-26 22:34:02,864 INFO L276 IsEmpty]: Start isEmpty. Operand 1938 states and 2153 transitions. [2020-10-26 22:34:02,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2020-10-26 22:34:02,871 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 22:34:02,872 INFO L422 BasicCegarLoop]: trace histogram [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, 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:02,872 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-26 22:34:02,872 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 22:34:02,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 22:34:02,873 INFO L82 PathProgramCache]: Analyzing trace with hash 563675448, now seen corresponding path program 1 times [2020-10-26 22:34:02,873 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-26 22:34:02,873 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1862931711] [2020-10-26 22:34:02,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 22:34:02,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:03,005 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:03,122 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:04,173 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:04,174 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 290 [2020-10-26 22:34:04,174 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-26 22:34:04,174 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1213 [2020-10-26 22:34:04,174 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:04,174 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-10-26 22:34:04,174 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 125 [2020-10-26 22:34:04,174 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 150 [2020-10-26 22:34:04,175 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:04,294 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 22:34:04,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:04,299 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:04,304 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:04,305 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-26 22:34:04,305 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:34:04,305 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 6 [2020-10-26 22:34:04,305 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:04,305 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-26 22:34:04,306 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:34:04,306 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-26 22:34:04,306 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:04,321 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-26 22:34:04,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:04,366 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:04,449 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:04,449 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 116 [2020-10-26 22:34:04,450 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:34:04,450 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 99 [2020-10-26 22:34:04,450 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:04,450 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-26 22:34:04,450 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:34:04,450 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 110 [2020-10-26 22:34:04,451 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:04,501 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2020-10-26 22:34:04,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:04,523 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:04,600 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:04,600 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 73 [2020-10-26 22:34:04,600 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:34:04,600 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 85 [2020-10-26 22:34:04,601 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:04,601 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-26 22:34:04,601 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-26 22:34:04,601 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 73 [2020-10-26 22:34:04,601 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:04,737 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2020-10-26 22:34:04,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:04,796 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:04,893 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:04,893 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 74 [2020-10-26 22:34:04,893 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:34:04,894 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 107 [2020-10-26 22:34:04,894 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:04,894 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-26 22:34:04,894 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-26 22:34:04,894 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 74 [2020-10-26 22:34:04,895 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:05,193 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 157 proven. 71 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-10-26 22:34:05,194 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1862931711] [2020-10-26 22:34:05,194 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-26 22:34:05,194 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-10-26 22:34:05,194 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279649420] [2020-10-26 22:34:05,195 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-26 22:34:05,195 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-26 22:34:05,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-26 22:34:05,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-10-26 22:34:05,196 INFO L87 Difference]: Start difference. First operand 1938 states and 2153 transitions. Second operand 8 states. [2020-10-26 22:34:07,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 22:34:07,459 INFO L93 Difference]: Finished difference Result 4045 states and 4522 transitions. [2020-10-26 22:34:07,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-26 22:34:07,460 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 274 [2020-10-26 22:34:07,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 22:34:07,473 INFO L225 Difference]: With dead ends: 4045 [2020-10-26 22:34:07,473 INFO L226 Difference]: Without dead ends: 2256 [2020-10-26 22:34:07,480 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2020-10-26 22:34:07,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2256 states. [2020-10-26 22:34:07,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2256 to 2230. [2020-10-26 22:34:07,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2230 states. [2020-10-26 22:34:07,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2230 states to 2230 states and 2464 transitions. [2020-10-26 22:34:07,565 INFO L78 Accepts]: Start accepts. Automaton has 2230 states and 2464 transitions. Word has length 274 [2020-10-26 22:34:07,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 22:34:07,565 INFO L481 AbstractCegarLoop]: Abstraction has 2230 states and 2464 transitions. [2020-10-26 22:34:07,565 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-26 22:34:07,566 INFO L276 IsEmpty]: Start isEmpty. Operand 2230 states and 2464 transitions. [2020-10-26 22:34:07,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2020-10-26 22:34:07,572 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 22:34:07,573 INFO L422 BasicCegarLoop]: trace histogram [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, 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:07,573 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-26 22:34:07,573 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 22:34:07,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 22:34:07,574 INFO L82 PathProgramCache]: Analyzing trace with hash -288227400, now seen corresponding path program 1 times [2020-10-26 22:34:07,574 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-26 22:34:07,574 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [316467087] [2020-10-26 22:34:07,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 22:34:07,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:07,677 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:08,102 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:08,103 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 303 [2020-10-26 22:34:08,103 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:34:08,103 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 465 [2020-10-26 22:34:08,103 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:08,103 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-26 22:34:08,103 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 212 [2020-10-26 22:34:08,104 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 76 [2020-10-26 22:34:08,104 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:08,237 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 22:34:08,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:08,241 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:08,246 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:08,246 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-26 22:34:08,246 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:34:08,246 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 5 [2020-10-26 22:34:08,246 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:08,246 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-26 22:34:08,247 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:34:08,247 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-26 22:34:08,247 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:08,261 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-26 22:34:08,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:08,270 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:08,304 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:08,304 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 116 [2020-10-26 22:34:08,304 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:34:08,304 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 35 [2020-10-26 22:34:08,304 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:08,305 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-26 22:34:08,305 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:34:08,305 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-26 22:34:08,305 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:08,337 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2020-10-26 22:34:08,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:08,365 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:08,423 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:08,424 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 86 [2020-10-26 22:34:08,424 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:34:08,424 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 70 [2020-10-26 22:34:08,424 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:08,425 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-26 22:34:08,425 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:34:08,425 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 80 [2020-10-26 22:34:08,425 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:08,463 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2020-10-26 22:34:08,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:08,486 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:08,572 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:08,573 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 74 [2020-10-26 22:34:08,573 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:34:08,573 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 94 [2020-10-26 22:34:08,573 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:08,573 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-26 22:34:08,573 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-26 22:34:08,574 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 74 [2020-10-26 22:34:08,574 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:08,754 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 163 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2020-10-26 22:34:08,754 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [316467087] [2020-10-26 22:34:08,754 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-26 22:34:08,754 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-10-26 22:34:08,755 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778547542] [2020-10-26 22:34:08,755 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-26 22:34:08,755 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-26 22:34:08,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-26 22:34:08,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-26 22:34:08,756 INFO L87 Difference]: Start difference. First operand 2230 states and 2464 transitions. Second operand 8 states. [2020-10-26 22:34:11,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 22:34:11,193 INFO L93 Difference]: Finished difference Result 4470 states and 4995 transitions. [2020-10-26 22:34:11,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-26 22:34:11,201 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 287 [2020-10-26 22:34:11,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 22:34:11,211 INFO L225 Difference]: With dead ends: 4470 [2020-10-26 22:34:11,212 INFO L226 Difference]: Without dead ends: 2389 [2020-10-26 22:34:11,217 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-10-26 22:34:11,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2389 states. [2020-10-26 22:34:11,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2389 to 2377. [2020-10-26 22:34:11,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2377 states. [2020-10-26 22:34:11,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2377 states to 2377 states and 2626 transitions. [2020-10-26 22:34:11,287 INFO L78 Accepts]: Start accepts. Automaton has 2377 states and 2626 transitions. Word has length 287 [2020-10-26 22:34:11,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 22:34:11,288 INFO L481 AbstractCegarLoop]: Abstraction has 2377 states and 2626 transitions. [2020-10-26 22:34:11,288 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-26 22:34:11,288 INFO L276 IsEmpty]: Start isEmpty. Operand 2377 states and 2626 transitions. [2020-10-26 22:34:11,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2020-10-26 22:34:11,295 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 22:34:11,296 INFO L422 BasicCegarLoop]: trace histogram [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, 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:11,296 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-26 22:34:11,296 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 22:34:11,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 22:34:11,297 INFO L82 PathProgramCache]: Analyzing trace with hash 619936468, now seen corresponding path program 1 times [2020-10-26 22:34:11,297 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-26 22:34:11,297 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1029065725] [2020-10-26 22:34:11,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 22:34:11,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:11,403 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:11,775 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:11,776 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 301 [2020-10-26 22:34:11,776 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:34:11,776 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 412 [2020-10-26 22:34:11,776 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:11,776 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-26 22:34:11,776 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 285 [2020-10-26 22:34:11,777 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 12 [2020-10-26 22:34:11,777 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:11,890 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 22:34:11,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:11,894 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:11,897 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:11,897 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-26 22:34:11,898 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:34:11,898 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 3 [2020-10-26 22:34:11,898 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:11,898 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-26 22:34:11,898 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:34:11,898 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-26 22:34:11,899 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:11,912 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-26 22:34:11,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:11,923 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:11,958 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:11,958 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 138 [2020-10-26 22:34:11,958 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:34:11,958 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 36 [2020-10-26 22:34:11,959 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:11,959 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-26 22:34:11,959 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:34:11,959 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-26 22:34:11,959 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:12,032 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2020-10-26 22:34:12,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:12,075 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:12,163 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:12,163 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 137 [2020-10-26 22:34:12,163 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:34:12,163 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 104 [2020-10-26 22:34:12,164 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:12,164 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-26 22:34:12,164 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:34:12,164 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 131 [2020-10-26 22:34:12,164 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:12,267 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2020-10-26 22:34:12,268 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1029065725] [2020-10-26 22:34:12,268 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-26 22:34:12,268 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-10-26 22:34:12,268 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7875889] [2020-10-26 22:34:12,269 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-26 22:34:12,269 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-26 22:34:12,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-26 22:34:12,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-26 22:34:12,270 INFO L87 Difference]: Start difference. First operand 2377 states and 2626 transitions. Second operand 5 states. [2020-10-26 22:34:13,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 22:34:13,916 INFO L93 Difference]: Finished difference Result 5185 states and 5785 transitions. [2020-10-26 22:34:13,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-26 22:34:13,920 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 287 [2020-10-26 22:34:13,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 22:34:13,932 INFO L225 Difference]: With dead ends: 5185 [2020-10-26 22:34:13,932 INFO L226 Difference]: Without dead ends: 2812 [2020-10-26 22:34:13,938 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 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:34:13,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2812 states. [2020-10-26 22:34:14,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2812 to 2665. [2020-10-26 22:34:14,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2665 states. [2020-10-26 22:34:14,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2665 states to 2665 states and 2937 transitions. [2020-10-26 22:34:14,014 INFO L78 Accepts]: Start accepts. Automaton has 2665 states and 2937 transitions. Word has length 287 [2020-10-26 22:34:14,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 22:34:14,015 INFO L481 AbstractCegarLoop]: Abstraction has 2665 states and 2937 transitions. [2020-10-26 22:34:14,015 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-26 22:34:14,016 INFO L276 IsEmpty]: Start isEmpty. Operand 2665 states and 2937 transitions. [2020-10-26 22:34:14,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2020-10-26 22:34:14,024 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 22:34:14,024 INFO L422 BasicCegarLoop]: trace histogram [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, 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, 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:14,024 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-26 22:34:14,024 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 22:34:14,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 22:34:14,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1063597340, now seen corresponding path program 1 times [2020-10-26 22:34:14,025 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-26 22:34:14,025 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [345089270] [2020-10-26 22:34:14,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 22:34:14,082 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,390 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:15,052 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:15,422 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:15,422 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 312 [2020-10-26 22:34:15,422 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 3 [2020-10-26 22:34:15,423 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1333 [2020-10-26 22:34:15,423 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:15,423 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-26 22:34:15,423 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 147 [2020-10-26 22:34:15,423 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 75 [2020-10-26 22:34:15,423 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:15,520 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 22:34:15,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:15,524 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:15,528 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:15,528 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-26 22:34:15,528 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:34:15,528 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 4 [2020-10-26 22:34:15,529 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:15,529 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-26 22:34:15,529 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:34:15,529 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-26 22:34:15,529 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:15,543 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-26 22:34:15,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:15,592 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:15,680 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:15,680 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 138 [2020-10-26 22:34:15,680 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:34:15,680 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 105 [2020-10-26 22:34:15,680 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:15,681 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-26 22:34:15,681 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:34:15,681 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 132 [2020-10-26 22:34:15,681 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:15,722 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2020-10-26 22:34:15,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:15,740 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:15,801 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:15,801 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 73 [2020-10-26 22:34:15,802 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:34:15,830 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 67 [2020-10-26 22:34:15,830 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:15,831 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-26 22:34:15,831 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-26 22:34:15,831 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 73 [2020-10-26 22:34:15,833 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 2 [2020-10-26 22:34:15,878 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2020-10-26 22:34:15,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:15,898 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:15,920 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:15,921 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 74 [2020-10-26 22:34:15,921 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:34:15,921 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 30 [2020-10-26 22:34:15,921 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:15,921 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-26 22:34:15,921 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 71 [2020-10-26 22:34:15,921 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-26 22:34:15,922 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:15,995 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 91 proven. 71 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2020-10-26 22:34:15,995 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [345089270] [2020-10-26 22:34:15,995 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-26 22:34:15,995 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-26 22:34:15,996 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040502072] [2020-10-26 22:34:15,996 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-26 22:34:15,996 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-26 22:34:15,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-26 22:34:15,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-26 22:34:15,997 INFO L87 Difference]: Start difference. First operand 2665 states and 2937 transitions. Second operand 7 states. [2020-10-26 22:34:17,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 22:34:17,886 INFO L93 Difference]: Finished difference Result 5916 states and 6594 transitions. [2020-10-26 22:34:17,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-26 22:34:17,886 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 296 [2020-10-26 22:34:17,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 22:34:17,902 INFO L225 Difference]: With dead ends: 5916 [2020-10-26 22:34:17,902 INFO L226 Difference]: Without dead ends: 3400 [2020-10-26 22:34:17,909 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2020-10-26 22:34:17,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3400 states. [2020-10-26 22:34:17,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3400 to 3098. [2020-10-26 22:34:17,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3098 states. [2020-10-26 22:34:18,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3098 states to 3098 states and 3463 transitions. [2020-10-26 22:34:18,006 INFO L78 Accepts]: Start accepts. Automaton has 3098 states and 3463 transitions. Word has length 296 [2020-10-26 22:34:18,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 22:34:18,007 INFO L481 AbstractCegarLoop]: Abstraction has 3098 states and 3463 transitions. [2020-10-26 22:34:18,007 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-26 22:34:18,007 INFO L276 IsEmpty]: Start isEmpty. Operand 3098 states and 3463 transitions. [2020-10-26 22:34:18,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2020-10-26 22:34:18,013 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 22:34:18,013 INFO L422 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18,014 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-26 22:34:18,014 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 22:34:18,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 22:34:18,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1099084576, now seen corresponding path program 1 times [2020-10-26 22:34:18,015 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-26 22:34:18,020 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1336195687] [2020-10-26 22:34:18,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 22:34:18,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 22:34:18,138 INFO L173 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-10-26 22:34:18,138 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-26 22:34:18,146 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-26 22:34:18,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 10:34:18 BoogieIcfgContainer [2020-10-26 22:34:18,222 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-26 22:34:18,225 INFO L168 Benchmark]: Toolchain (without parser) took 56139.56 ms. Allocated memory was 168.8 MB in the beginning and 813.7 MB in the end (delta: 644.9 MB). Free memory was 142.0 MB in the beginning and 343.1 MB in the end (delta: -201.1 MB). Peak memory consumption was 444.2 MB. Max. memory is 8.0 GB. [2020-10-26 22:34:18,225 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 168.8 MB. Free memory was 143.2 MB in the beginning and 143.0 MB in the end (delta: 149.9 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-10-26 22:34:18,226 INFO L168 Benchmark]: CACSL2BoogieTranslator took 742.36 ms. Allocated memory is still 168.8 MB. Free memory was 141.4 MB in the beginning and 114.7 MB in the end (delta: 26.7 MB). Peak memory consumption was 27.3 MB. Max. memory is 8.0 GB. [2020-10-26 22:34:18,226 INFO L168 Benchmark]: Boogie Preprocessor took 124.07 ms. Allocated memory is still 168.8 MB. Free memory was 114.7 MB in the beginning and 110.1 MB in the end (delta: 4.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. [2020-10-26 22:34:18,227 INFO L168 Benchmark]: RCFGBuilder took 1758.31 ms. Allocated memory was 168.8 MB in the beginning and 217.1 MB in the end (delta: 48.2 MB). Free memory was 110.0 MB in the beginning and 187.4 MB in the end (delta: -77.4 MB). Peak memory consumption was 58.3 MB. Max. memory is 8.0 GB. [2020-10-26 22:34:18,228 INFO L168 Benchmark]: TraceAbstraction took 53501.87 ms. Allocated memory was 217.1 MB in the beginning and 813.7 MB in the end (delta: 596.6 MB). Free memory was 186.9 MB in the beginning and 343.1 MB in the end (delta: -156.2 MB). Peak memory consumption was 440.4 MB. Max. memory is 8.0 GB. [2020-10-26 22:34:18,230 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.24 ms. Allocated memory is still 168.8 MB. Free memory was 143.2 MB in the beginning and 143.0 MB in the end (delta: 149.9 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 742.36 ms. Allocated memory is still 168.8 MB. Free memory was 141.4 MB in the beginning and 114.7 MB in the end (delta: 26.7 MB). Peak memory consumption was 27.3 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 124.07 ms. Allocated memory is still 168.8 MB. Free memory was 114.7 MB in the beginning and 110.1 MB in the end (delta: 4.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1758.31 ms. Allocated memory was 168.8 MB in the beginning and 217.1 MB in the end (delta: 48.2 MB). Free memory was 110.0 MB in the beginning and 187.4 MB in the end (delta: -77.4 MB). Peak memory consumption was 58.3 MB. Max. memory is 8.0 GB. * TraceAbstraction took 53501.87 ms. Allocated memory was 217.1 MB in the beginning and 813.7 MB in the end (delta: 596.6 MB). Free memory was 186.9 MB in the beginning and 343.1 MB in the end (delta: -156.2 MB). Peak memory consumption was 440.4 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 TRUE ((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)))))) [L363] a1 = ((((a1 - 46038) + -455425) * 10)/ 9) [L364] a19 = 10 [L366] return 24; [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 TRUE ((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0))) [L228] a1 = (((((a1 - 0) * 9)/ 10) % 25)- -12) [L229] a10 = 2 [L230] a19 = 8 [L232] 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 TRUE (((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8)) [L27] CALL reach_error() [L4] __assert_fail("0", "Problem10_label48.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: 53.3s, OverallIterations: 14, TraceHistogramMax: 4, AutomataDifference: 27.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 345 SDtfs, 5841 SDslu, 431 SDs, 0 SdLazy, 11754 SolverSat, 1971 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 19.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 219 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3098occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 13 MinimizatonAttempts, 1668 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 22.8s InterpolantComputationTime, 2921 NumberOfCodeBlocks, 2921 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2582 ConstructedInterpolants, 0 QuantifiedInterpolants, 1950378 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 2 PerfectInterpolantSequences, 1126/1356 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...