/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=DEEPEST --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_label57.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-0f64333 [2020-10-27 17:28:45,997 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-27 17:28:46,002 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-27 17:28:46,065 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-27 17:28:46,065 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-27 17:28:46,073 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-27 17:28:46,076 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-27 17:28:46,081 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-27 17:28:46,084 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-27 17:28:46,091 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-27 17:28:46,092 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-27 17:28:46,094 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-27 17:28:46,094 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-27 17:28:46,098 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-27 17:28:46,100 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-27 17:28:46,103 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-27 17:28:46,104 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-27 17:28:46,108 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-27 17:28:46,116 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-27 17:28:46,135 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-27 17:28:46,138 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-27 17:28:46,140 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-27 17:28:46,142 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-27 17:28:46,145 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-27 17:28:46,154 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-27 17:28:46,155 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-27 17:28:46,158 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-27 17:28:46,161 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-27 17:28:46,161 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-27 17:28:46,162 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-27 17:28:46,163 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-27 17:28:46,164 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-27 17:28:46,166 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-27 17:28:46,167 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-27 17:28:46,168 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-27 17:28:46,168 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-27 17:28:46,169 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-27 17:28:46,169 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-27 17:28:46,169 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-27 17:28:46,170 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-27 17:28:46,171 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-27 17:28:46,179 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-27 17:28:46,233 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-27 17:28:46,234 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-27 17:28:46,239 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-27 17:28:46,239 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-27 17:28:46,239 INFO L138 SettingsManager]: * Use SBE=true [2020-10-27 17:28:46,240 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-27 17:28:46,240 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-27 17:28:46,240 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-27 17:28:46,240 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-27 17:28:46,240 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-27 17:28:46,242 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-27 17:28:46,242 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-27 17:28:46,242 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-27 17:28:46,242 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-27 17:28:46,243 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-27 17:28:46,243 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-27 17:28:46,243 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-27 17:28:46,243 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-27 17:28:46,243 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-27 17:28:46,243 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-27 17:28:46,244 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-27 17:28:46,244 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-27 17:28:46,244 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-27 17:28:46,244 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-27 17:28:46,245 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-27 17:28:46,245 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-27 17:28:46,245 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-27 17:28:46,245 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-27 17:28:46,245 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-27 17:28:46,245 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=DEEPEST;log-additional-information=true;unknown-allowed=true; [2020-10-27 17:28:46,663 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-27 17:28:46,693 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-27 17:28:46,696 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-27 17:28:46,698 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-27 17:28:46,699 INFO L275 PluginConnector]: CDTParser initialized [2020-10-27 17:28:46,700 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label57.c [2020-10-27 17:28:46,775 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/cb833e1f4/eff6cff1a5ed454383b2eb1286918c08/FLAG25d20a7f1 [2020-10-27 17:28:47,549 INFO L306 CDTParser]: Found 1 translation units. [2020-10-27 17:28:47,552 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/eca-rers2012/Problem10_label57.c [2020-10-27 17:28:47,575 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/cb833e1f4/eff6cff1a5ed454383b2eb1286918c08/FLAG25d20a7f1 [2020-10-27 17:28:47,750 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/cb833e1f4/eff6cff1a5ed454383b2eb1286918c08 [2020-10-27 17:28:47,753 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-27 17:28:47,762 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-27 17:28:47,767 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-27 17:28:47,767 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-27 17:28:47,771 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-27 17:28:47,773 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 05:28:47" (1/1) ... [2020-10-27 17:28:47,777 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cc0edcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:28:47, skipping insertion in model container [2020-10-27 17:28:47,778 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 05:28:47" (1/1) ... [2020-10-27 17:28:47,786 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-27 17:28:47,860 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-27 17:28:48,379 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-27 17:28:48,391 INFO L203 MainTranslator]: Completed pre-run [2020-10-27 17:28:48,569 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-27 17:28:48,607 INFO L208 MainTranslator]: Completed translation [2020-10-27 17:28:48,610 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:28:48 WrapperNode [2020-10-27 17:28:48,630 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-27 17:28:48,631 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-27 17:28:48,632 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-27 17:28:48,632 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-27 17:28:48,646 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:28:48" (1/1) ... [2020-10-27 17:28:48,647 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:28:48" (1/1) ... [2020-10-27 17:28:48,669 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:28:48" (1/1) ... [2020-10-27 17:28:48,669 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:28:48" (1/1) ... [2020-10-27 17:28:48,712 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:28:48" (1/1) ... [2020-10-27 17:28:48,729 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:28:48" (1/1) ... [2020-10-27 17:28:48,736 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:28:48" (1/1) ... [2020-10-27 17:28:48,746 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-27 17:28:48,749 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-27 17:28:48,750 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-27 17:28:48,750 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-27 17:28:48,751 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:28:48" (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-27 17:28:48,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-27 17:28:48,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-27 17:28:48,854 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-27 17:28:48,854 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2020-10-27 17:28:48,854 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-27 17:28:48,855 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2020-10-27 17:28:48,855 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-27 17:28:48,855 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-27 17:28:48,856 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-27 17:28:48,856 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-27 17:28:48,857 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-27 17:28:48,858 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-10-27 17:28:48,858 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-27 17:28:48,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-27 17:28:48,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-27 17:28:48,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-27 17:28:48,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-27 17:28:48,860 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-27 17:28:48,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-27 17:28:50,399 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-27 17:28:50,399 INFO L298 CfgBuilder]: Removed 1 assume(true) statements. [2020-10-27 17:28:50,402 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 05:28:50 BoogieIcfgContainer [2020-10-27 17:28:50,402 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-27 17:28:50,405 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-27 17:28:50,405 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-27 17:28:50,409 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-27 17:28:50,410 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 05:28:47" (1/3) ... [2020-10-27 17:28:50,412 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39cb91a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 05:28:50, skipping insertion in model container [2020-10-27 17:28:50,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:28:48" (2/3) ... [2020-10-27 17:28:50,413 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39cb91a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 05:28:50, skipping insertion in model container [2020-10-27 17:28:50,413 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 05:28:50" (3/3) ... [2020-10-27 17:28:50,415 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem10_label57.c [2020-10-27 17:28:50,434 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-27 17:28:50,442 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-27 17:28:50,483 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-27 17:28:50,560 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-27 17:28:50,560 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-27 17:28:50,560 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-27 17:28:50,561 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-27 17:28:50,561 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-27 17:28:50,561 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-27 17:28:50,561 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-27 17:28:50,561 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-27 17:28:50,606 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states. [2020-10-27 17:28:50,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-27 17:28:50,616 INFO L414 BasicCegarLoop]: Found error trace [2020-10-27 17:28:50,617 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-27 17:28:50,617 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-27 17:28:50,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-27 17:28:50,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1732860178, now seen corresponding path program 1 times [2020-10-27 17:28:50,644 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-27 17:28:50,644 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1151255922] [2020-10-27 17:28:50,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-27 17:28:50,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:28:50,868 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:28:51,323 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:28:51,324 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 23 [2020-10-27 17:28:51,326 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:28:51,327 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 530 [2020-10-27 17:28:51,329 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:28:51,329 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-10-27 17:28:51,329 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 5 [2020-10-27 17:28:51,330 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 14 [2020-10-27 17:28:51,330 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 2 [2020-10-27 17:28:51,486 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-27 17:28:51,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:28:51,505 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:28:51,526 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:28:51,527 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-27 17:28:51,527 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:28:51,527 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 26 [2020-10-27 17:28:51,527 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:28:51,527 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-27 17:28:51,528 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:28:51,528 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 2 [2020-10-27 17:28:51,528 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:28:51,546 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-27 17:28:51,548 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1151255922] [2020-10-27 17:28:51,550 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-27 17:28:51,550 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-27 17:28:51,551 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368650407] [2020-10-27 17:28:51,557 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-27 17:28:51,557 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-27 17:28:51,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-27 17:28:51,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-27 17:28:51,582 INFO L87 Difference]: Start difference. First operand 219 states. Second operand 5 states. [2020-10-27 17:28:53,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-27 17:28:53,762 INFO L93 Difference]: Finished difference Result 586 states and 1012 transitions. [2020-10-27 17:28:53,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-27 17:28:53,764 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-27 17:28:53,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-27 17:28:53,779 INFO L225 Difference]: With dead ends: 586 [2020-10-27 17:28:53,780 INFO L226 Difference]: Without dead ends: 303 [2020-10-27 17:28:53,788 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-27 17:28:53,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2020-10-27 17:28:53,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 299. [2020-10-27 17:28:53,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2020-10-27 17:28:53,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 396 transitions. [2020-10-27 17:28:53,864 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 396 transitions. Word has length 13 [2020-10-27 17:28:53,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-27 17:28:53,865 INFO L481 AbstractCegarLoop]: Abstraction has 299 states and 396 transitions. [2020-10-27 17:28:53,865 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-27 17:28:53,865 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 396 transitions. [2020-10-27 17:28:53,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2020-10-27 17:28:53,869 INFO L414 BasicCegarLoop]: Found error trace [2020-10-27 17:28:53,870 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-10-27 17:28:53,870 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-27 17:28:53,870 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-27 17:28:53,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-27 17:28:53,871 INFO L82 PathProgramCache]: Analyzing trace with hash -51302353, now seen corresponding path program 1 times [2020-10-27 17:28:53,871 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-27 17:28:53,872 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [379121077] [2020-10-27 17:28:53,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-27 17:28:53,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:28:53,980 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:28:54,104 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:28:54,874 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:28:54,874 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 95 [2020-10-27 17:28:54,874 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-27 17:28:54,874 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 929 [2020-10-27 17:28:54,875 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:28:54,876 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-27 17:28:54,876 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 80 [2020-10-27 17:28:54,876 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 11 [2020-10-27 17:28:54,876 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-27 17:28:54,970 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-27 17:28:54,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:28:54,980 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:28:54,988 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:28:54,988 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-27 17:28:54,988 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:28:54,988 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 9 [2020-10-27 17:28:54,989 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:28:54,989 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-27 17:28:54,989 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:28:54,989 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-27 17:28:54,990 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:28:55,021 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-27 17:28:55,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:28:55,075 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:28:55,142 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:28:55,142 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 71 [2020-10-27 17:28:55,143 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:28:55,151 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 81 [2020-10-27 17:28:55,151 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:28:55,151 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-27 17:28:55,151 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:28:55,151 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 65 [2020-10-27 17:28:55,152 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:28:55,219 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-27 17:28:55,220 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [379121077] [2020-10-27 17:28:55,220 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-27 17:28:55,220 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-10-27 17:28:55,221 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631985444] [2020-10-27 17:28:55,223 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-27 17:28:55,224 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-27 17:28:55,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-27 17:28:55,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-27 17:28:55,226 INFO L87 Difference]: Start difference. First operand 299 states and 396 transitions. Second operand 6 states. [2020-10-27 17:28:57,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-27 17:28:57,281 INFO L93 Difference]: Finished difference Result 886 states and 1254 transitions. [2020-10-27 17:28:57,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-27 17:28:57,281 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2020-10-27 17:28:57,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-27 17:28:57,287 INFO L225 Difference]: With dead ends: 886 [2020-10-27 17:28:57,288 INFO L226 Difference]: Without dead ends: 593 [2020-10-27 17:28:57,290 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-10-27 17:28:57,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2020-10-27 17:28:57,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 589. [2020-10-27 17:28:57,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2020-10-27 17:28:57,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 818 transitions. [2020-10-27 17:28:57,369 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 818 transitions. Word has length 83 [2020-10-27 17:28:57,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-27 17:28:57,370 INFO L481 AbstractCegarLoop]: Abstraction has 589 states and 818 transitions. [2020-10-27 17:28:57,370 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-27 17:28:57,370 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 818 transitions. [2020-10-27 17:28:57,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2020-10-27 17:28:57,381 INFO L414 BasicCegarLoop]: Found error trace [2020-10-27 17:28:57,381 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-27 17:28:57,381 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-27 17:28:57,381 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-27 17:28:57,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-27 17:28:57,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1520191261, now seen corresponding path program 1 times [2020-10-27 17:28:57,384 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-27 17:28:57,385 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [96582994] [2020-10-27 17:28:57,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-27 17:28:57,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:28:57,457 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:28:57,560 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:28:57,959 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:28:59,273 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:28:59,276 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 112 [2020-10-27 17:28:59,276 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 3 [2020-10-27 17:28:59,276 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1840 [2020-10-27 17:28:59,276 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:28:59,277 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-27 17:28:59,277 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 97 [2020-10-27 17:28:59,277 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 11 [2020-10-27 17:28:59,277 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:28:59,359 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-27 17:28:59,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:28:59,365 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:28:59,371 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:28:59,371 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-27 17:28:59,371 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:28:59,371 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 6 [2020-10-27 17:28:59,371 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:28:59,372 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-27 17:28:59,372 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:28:59,372 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-27 17:28:59,372 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:28:59,388 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-27 17:28:59,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:28:59,427 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:28:59,501 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:28:59,501 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 88 [2020-10-27 17:28:59,501 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:28:59,502 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 87 [2020-10-27 17:28:59,502 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:28:59,502 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-27 17:28:59,502 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:28:59,502 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 82 [2020-10-27 17:28:59,502 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:28:59,555 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-27 17:28:59,555 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [96582994] [2020-10-27 17:28:59,556 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-27 17:28:59,556 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-10-27 17:28:59,556 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075465575] [2020-10-27 17:28:59,558 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-27 17:28:59,558 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-27 17:28:59,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-27 17:28:59,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-27 17:28:59,559 INFO L87 Difference]: Start difference. First operand 589 states and 818 transitions. Second operand 5 states. [2020-10-27 17:29:00,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-27 17:29:00,945 INFO L93 Difference]: Finished difference Result 1756 states and 2499 transitions. [2020-10-27 17:29:00,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-27 17:29:00,946 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2020-10-27 17:29:00,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-27 17:29:00,964 INFO L225 Difference]: With dead ends: 1756 [2020-10-27 17:29:00,964 INFO L226 Difference]: Without dead ends: 1173 [2020-10-27 17:29:00,967 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-27 17:29:00,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2020-10-27 17:29:01,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 1169. [2020-10-27 17:29:01,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1169 states. [2020-10-27 17:29:01,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1169 states to 1169 states and 1572 transitions. [2020-10-27 17:29:01,044 INFO L78 Accepts]: Start accepts. Automaton has 1169 states and 1572 transitions. Word has length 100 [2020-10-27 17:29:01,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-27 17:29:01,045 INFO L481 AbstractCegarLoop]: Abstraction has 1169 states and 1572 transitions. [2020-10-27 17:29:01,045 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-27 17:29:01,045 INFO L276 IsEmpty]: Start isEmpty. Operand 1169 states and 1572 transitions. [2020-10-27 17:29:01,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2020-10-27 17:29:01,065 INFO L414 BasicCegarLoop]: Found error trace [2020-10-27 17:29:01,065 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-27 17:29:01,066 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-27 17:29:01,066 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-27 17:29:01,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-27 17:29:01,066 INFO L82 PathProgramCache]: Analyzing trace with hash 17403426, now seen corresponding path program 1 times [2020-10-27 17:29:01,067 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-27 17:29:01,067 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1156822352] [2020-10-27 17:29:01,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-27 17:29:01,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:29:01,131 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:29:01,449 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:29:01,506 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:29:02,161 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:29:04,872 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:29:04,872 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 204 [2020-10-27 17:29:04,872 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 4 [2020-10-27 17:29:04,872 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 3759 [2020-10-27 17:29:04,873 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:29:04,875 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-27 17:29:04,875 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 189 [2020-10-27 17:29:04,875 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 11 [2020-10-27 17:29:04,875 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 2 [2020-10-27 17:29:04,999 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-27 17:29:05,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:29:05,007 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:29:05,027 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:29:05,027 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-27 17:29:05,028 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:29:05,028 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 21 [2020-10-27 17:29:05,028 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:29:05,028 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-27 17:29:05,028 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:29:05,029 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-27 17:29:05,029 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:29:05,054 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-27 17:29:05,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:29:05,070 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:29:05,102 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:29:05,102 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 88 [2020-10-27 17:29:05,102 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:29:05,103 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 34 [2020-10-27 17:29:05,103 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:29:05,104 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-27 17:29:05,104 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:29:05,104 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-27 17:29:05,104 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-27 17:29:05,158 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2020-10-27 17:29:05,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:29:05,206 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:29:05,268 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:29:05,268 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 91 [2020-10-27 17:29:05,268 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:29:05,268 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 76 [2020-10-27 17:29:05,269 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:29:05,269 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-27 17:29:05,269 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:29:05,269 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 85 [2020-10-27 17:29:05,269 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:29:05,342 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2020-10-27 17:29:05,343 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1156822352] [2020-10-27 17:29:05,343 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-27 17:29:05,343 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-10-27 17:29:05,344 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606362835] [2020-10-27 17:29:05,346 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-27 17:29:05,346 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-27 17:29:05,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-27 17:29:05,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-27 17:29:05,347 INFO L87 Difference]: Start difference. First operand 1169 states and 1572 transitions. Second operand 5 states. [2020-10-27 17:29:06,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-27 17:29:06,830 INFO L93 Difference]: Finished difference Result 3351 states and 4581 transitions. [2020-10-27 17:29:06,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-27 17:29:06,831 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 190 [2020-10-27 17:29:06,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-27 17:29:06,846 INFO L225 Difference]: With dead ends: 3351 [2020-10-27 17:29:06,846 INFO L226 Difference]: Without dead ends: 2188 [2020-10-27 17:29:06,851 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-27 17:29:06,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2188 states. [2020-10-27 17:29:06,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2188 to 2184. [2020-10-27 17:29:06,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2184 states. [2020-10-27 17:29:06,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2184 states to 2184 states and 2817 transitions. [2020-10-27 17:29:06,952 INFO L78 Accepts]: Start accepts. Automaton has 2184 states and 2817 transitions. Word has length 190 [2020-10-27 17:29:06,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-27 17:29:06,953 INFO L481 AbstractCegarLoop]: Abstraction has 2184 states and 2817 transitions. [2020-10-27 17:29:06,953 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-27 17:29:06,953 INFO L276 IsEmpty]: Start isEmpty. Operand 2184 states and 2817 transitions. [2020-10-27 17:29:06,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2020-10-27 17:29:06,959 INFO L414 BasicCegarLoop]: Found error trace [2020-10-27 17:29:06,959 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 17:29:06,960 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-27 17:29:06,960 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-27 17:29:06,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-27 17:29:06,960 INFO L82 PathProgramCache]: Analyzing trace with hash 350103570, now seen corresponding path program 1 times [2020-10-27 17:29:06,961 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-27 17:29:06,961 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [780061720] [2020-10-27 17:29:06,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-27 17:29:07,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:29:07,056 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:29:07,294 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:29:07,618 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:29:07,618 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 233 [2020-10-27 17:29:07,619 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-27 17:29:07,619 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 595 [2020-10-27 17:29:07,619 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:29:07,619 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-27 17:29:07,619 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 89 [2020-10-27 17:29:07,619 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 130 [2020-10-27 17:29:07,620 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:29:07,706 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-27 17:29:07,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:29:07,710 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:29:07,714 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:29:07,715 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-27 17:29:07,715 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:29:07,715 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 5 [2020-10-27 17:29:07,715 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:29:07,715 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-27 17:29:07,716 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:29:07,716 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-27 17:29:07,716 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:29:07,728 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-27 17:29:07,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:29:07,751 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:29:07,801 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:29:07,801 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 80 [2020-10-27 17:29:07,801 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:29:07,802 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 58 [2020-10-27 17:29:07,802 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:29:07,802 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-27 17:29:07,802 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:29:07,802 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 74 [2020-10-27 17:29:07,802 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:29:07,825 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-10-27 17:29:07,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:29:07,875 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:29:08,066 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:29:08,066 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 128 [2020-10-27 17:29:08,066 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:29:08,067 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 210 [2020-10-27 17:29:08,067 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:29:08,067 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-27 17:29:08,067 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-27 17:29:08,067 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 128 [2020-10-27 17:29:08,068 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:29:08,269 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 86 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-27 17:29:08,270 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [780061720] [2020-10-27 17:29:08,270 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-27 17:29:08,270 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-27 17:29:08,270 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640787974] [2020-10-27 17:29:08,271 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-27 17:29:08,271 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-27 17:29:08,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-27 17:29:08,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-27 17:29:08,272 INFO L87 Difference]: Start difference. First operand 2184 states and 2817 transitions. Second operand 7 states. [2020-10-27 17:29:10,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-27 17:29:10,190 INFO L93 Difference]: Finished difference Result 5000 states and 6648 transitions. [2020-10-27 17:29:10,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-27 17:29:10,190 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 219 [2020-10-27 17:29:10,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-27 17:29:10,207 INFO L225 Difference]: With dead ends: 5000 [2020-10-27 17:29:10,207 INFO L226 Difference]: Without dead ends: 2095 [2020-10-27 17:29:10,216 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 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-27 17:29:10,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2095 states. [2020-10-27 17:29:10,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2095 to 2057. [2020-10-27 17:29:10,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2057 states. [2020-10-27 17:29:10,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2057 states to 2057 states and 2593 transitions. [2020-10-27 17:29:10,308 INFO L78 Accepts]: Start accepts. Automaton has 2057 states and 2593 transitions. Word has length 219 [2020-10-27 17:29:10,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-27 17:29:10,308 INFO L481 AbstractCegarLoop]: Abstraction has 2057 states and 2593 transitions. [2020-10-27 17:29:10,308 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-27 17:29:10,308 INFO L276 IsEmpty]: Start isEmpty. Operand 2057 states and 2593 transitions. [2020-10-27 17:29:10,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2020-10-27 17:29:10,314 INFO L414 BasicCegarLoop]: Found error trace [2020-10-27 17:29:10,315 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 17:29:10,315 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-27 17:29:10,315 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-27 17:29:10,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-27 17:29:10,316 INFO L82 PathProgramCache]: Analyzing trace with hash 795729612, now seen corresponding path program 1 times [2020-10-27 17:29:10,316 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-27 17:29:10,317 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1058171687] [2020-10-27 17:29:10,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-27 17:29:10,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:29:10,414 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:29:10,705 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:29:11,392 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:29:11,392 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 238 [2020-10-27 17:29:11,392 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-27 17:29:11,392 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1014 [2020-10-27 17:29:11,392 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:29:11,393 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-27 17:29:11,393 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 80 [2020-10-27 17:29:11,393 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 144 [2020-10-27 17:29:11,393 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:29:11,472 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-27 17:29:11,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:29:11,476 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:29:11,480 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:29:11,480 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-27 17:29:11,480 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:29:11,481 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 4 [2020-10-27 17:29:11,481 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:29:11,481 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-27 17:29:11,481 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:29:11,481 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-27 17:29:11,481 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:29:11,498 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-27 17:29:11,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:29:11,518 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:29:11,557 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:29:11,557 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 71 [2020-10-27 17:29:11,557 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:29:11,557 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 46 [2020-10-27 17:29:11,558 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:29:11,558 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-27 17:29:11,558 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:29:11,558 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 65 [2020-10-27 17:29:11,558 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:29:11,575 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2020-10-27 17:29:11,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:29:11,630 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:29:11,812 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:29:11,812 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 142 [2020-10-27 17:29:11,813 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:29:11,813 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 202 [2020-10-27 17:29:11,813 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:29:11,813 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-27 17:29:11,813 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-27 17:29:11,813 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 142 [2020-10-27 17:29:11,814 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:29:12,098 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 77 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-27 17:29:12,099 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1058171687] [2020-10-27 17:29:12,100 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-27 17:29:12,100 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-27 17:29:12,101 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662772477] [2020-10-27 17:29:12,101 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-27 17:29:12,102 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-27 17:29:12,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-27 17:29:12,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-27 17:29:12,102 INFO L87 Difference]: Start difference. First operand 2057 states and 2593 transitions. Second operand 7 states. [2020-10-27 17:29:13,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-27 17:29:13,762 INFO L93 Difference]: Finished difference Result 4573 states and 5837 transitions. [2020-10-27 17:29:13,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-27 17:29:13,763 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 224 [2020-10-27 17:29:13,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-27 17:29:13,778 INFO L225 Difference]: With dead ends: 4573 [2020-10-27 17:29:13,778 INFO L226 Difference]: Without dead ends: 2522 [2020-10-27 17:29:13,783 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2020-10-27 17:29:13,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2522 states. [2020-10-27 17:29:13,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2522 to 2371. [2020-10-27 17:29:13,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2371 states. [2020-10-27 17:29:13,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2371 states to 2371 states and 2971 transitions. [2020-10-27 17:29:13,864 INFO L78 Accepts]: Start accepts. Automaton has 2371 states and 2971 transitions. Word has length 224 [2020-10-27 17:29:13,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-27 17:29:13,865 INFO L481 AbstractCegarLoop]: Abstraction has 2371 states and 2971 transitions. [2020-10-27 17:29:13,865 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-27 17:29:13,865 INFO L276 IsEmpty]: Start isEmpty. Operand 2371 states and 2971 transitions. [2020-10-27 17:29:13,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2020-10-27 17:29:13,871 INFO L414 BasicCegarLoop]: Found error trace [2020-10-27 17:29:13,871 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 17:29:13,872 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-27 17:29:13,872 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-27 17:29:13,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-27 17:29:13,872 INFO L82 PathProgramCache]: Analyzing trace with hash 189952754, now seen corresponding path program 1 times [2020-10-27 17:29:13,873 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-27 17:29:13,873 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1174125893] [2020-10-27 17:29:13,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-27 17:29:13,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:29:13,964 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:29:14,028 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:29:16,619 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:29:18,823 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:29:18,823 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 245 [2020-10-27 17:29:18,823 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 3 [2020-10-27 17:29:18,824 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 4878 [2020-10-27 17:29:18,824 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:29:18,824 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 11 [2020-10-27 17:29:18,824 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 87 [2020-10-27 17:29:18,825 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 133 [2020-10-27 17:29:18,825 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-27 17:29:18,972 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-27 17:29:18,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:29:18,976 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:29:18,981 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:29:18,981 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-27 17:29:18,982 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:29:18,982 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 5 [2020-10-27 17:29:18,982 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:29:18,982 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-27 17:29:18,982 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:29:18,982 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-27 17:29:18,983 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:29:18,997 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-27 17:29:19,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:29:19,022 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:29:19,112 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:29:19,113 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 78 [2020-10-27 17:29:19,113 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:29:19,113 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 99 [2020-10-27 17:29:19,113 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:29:19,113 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-27 17:29:19,113 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:29:19,114 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 72 [2020-10-27 17:29:19,114 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:29:19,147 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2020-10-27 17:29:19,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:29:19,194 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:29:19,366 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:29:19,723 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:29:19,724 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 142 [2020-10-27 17:29:19,724 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-27 17:29:19,724 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 547 [2020-10-27 17:29:19,725 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:29:19,725 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-27 17:29:19,725 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-27 17:29:19,726 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 142 [2020-10-27 17:29:19,726 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-27 17:29:20,052 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 84 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-27 17:29:20,052 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1174125893] [2020-10-27 17:29:20,053 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-27 17:29:20,053 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-10-27 17:29:20,053 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139140076] [2020-10-27 17:29:20,054 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-27 17:29:20,054 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-27 17:29:20,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-27 17:29:20,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-10-27 17:29:20,056 INFO L87 Difference]: Start difference. First operand 2371 states and 2971 transitions. Second operand 8 states. [2020-10-27 17:29:22,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-27 17:29:22,112 INFO L93 Difference]: Finished difference Result 4925 states and 6356 transitions. [2020-10-27 17:29:22,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-27 17:29:22,114 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 231 [2020-10-27 17:29:22,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-27 17:29:22,131 INFO L225 Difference]: With dead ends: 4925 [2020-10-27 17:29:22,131 INFO L226 Difference]: Without dead ends: 2560 [2020-10-27 17:29:22,138 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2020-10-27 17:29:22,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2560 states. [2020-10-27 17:29:22,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2560 to 2522. [2020-10-27 17:29:22,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2522 states. [2020-10-27 17:29:22,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2522 states to 2522 states and 3156 transitions. [2020-10-27 17:29:22,233 INFO L78 Accepts]: Start accepts. Automaton has 2522 states and 3156 transitions. Word has length 231 [2020-10-27 17:29:22,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-27 17:29:22,234 INFO L481 AbstractCegarLoop]: Abstraction has 2522 states and 3156 transitions. [2020-10-27 17:29:22,234 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-27 17:29:22,234 INFO L276 IsEmpty]: Start isEmpty. Operand 2522 states and 3156 transitions. [2020-10-27 17:29:22,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2020-10-27 17:29:22,241 INFO L414 BasicCegarLoop]: Found error trace [2020-10-27 17:29:22,242 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 17:29:22,242 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-27 17:29:22,242 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-27 17:29:22,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-27 17:29:22,243 INFO L82 PathProgramCache]: Analyzing trace with hash 18406046, now seen corresponding path program 1 times [2020-10-27 17:29:22,243 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-27 17:29:22,244 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [211735520] [2020-10-27 17:29:22,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-27 17:29:22,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:29:22,304 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:29:22,384 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:29:25,002 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:29:26,983 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:29:26,986 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 255 [2020-10-27 17:29:26,986 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 3 [2020-10-27 17:29:26,986 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 4699 [2020-10-27 17:29:26,986 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:29:26,986 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 11 [2020-10-27 17:29:26,987 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 97 [2020-10-27 17:29:26,987 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 131 [2020-10-27 17:29:26,987 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:29:27,195 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-27 17:29:27,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:29:27,199 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:29:27,203 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:29:27,203 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-27 17:29:27,204 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:29:27,204 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 5 [2020-10-27 17:29:27,204 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:29:27,204 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-27 17:29:27,204 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:29:27,204 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-27 17:29:27,205 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:29:27,218 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-27 17:29:27,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:29:27,248 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:29:27,370 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:29:27,370 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 88 [2020-10-27 17:29:27,370 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:29:27,370 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 133 [2020-10-27 17:29:27,371 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:29:27,371 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-27 17:29:27,371 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:29:27,371 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 82 [2020-10-27 17:29:27,371 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:29:27,402 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2020-10-27 17:29:27,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:29:27,450 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:29:27,565 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:29:27,874 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:29:27,874 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 142 [2020-10-27 17:29:27,875 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-27 17:29:27,875 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 447 [2020-10-27 17:29:27,875 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:29:27,875 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-27 17:29:27,875 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-27 17:29:27,875 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 142 [2020-10-27 17:29:27,875 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:29:28,076 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 94 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-27 17:29:28,076 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [211735520] [2020-10-27 17:29:28,076 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-27 17:29:28,077 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-10-27 17:29:28,077 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886680894] [2020-10-27 17:29:28,077 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-27 17:29:28,078 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-27 17:29:28,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-27 17:29:28,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-27 17:29:28,079 INFO L87 Difference]: Start difference. First operand 2522 states and 3156 transitions. Second operand 8 states. [2020-10-27 17:29:30,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-27 17:29:30,689 INFO L93 Difference]: Finished difference Result 5338 states and 6710 transitions. [2020-10-27 17:29:30,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-27 17:29:30,690 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 241 [2020-10-27 17:29:30,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-27 17:29:30,707 INFO L225 Difference]: With dead ends: 5338 [2020-10-27 17:29:30,707 INFO L226 Difference]: Without dead ends: 2822 [2020-10-27 17:29:30,714 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2020-10-27 17:29:30,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2822 states. [2020-10-27 17:29:30,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2822 to 2671. [2020-10-27 17:29:30,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2671 states. [2020-10-27 17:29:30,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2671 states to 2671 states and 3328 transitions. [2020-10-27 17:29:30,800 INFO L78 Accepts]: Start accepts. Automaton has 2671 states and 3328 transitions. Word has length 241 [2020-10-27 17:29:30,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-27 17:29:30,800 INFO L481 AbstractCegarLoop]: Abstraction has 2671 states and 3328 transitions. [2020-10-27 17:29:30,801 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-27 17:29:30,801 INFO L276 IsEmpty]: Start isEmpty. Operand 2671 states and 3328 transitions. [2020-10-27 17:29:30,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2020-10-27 17:29:30,809 INFO L414 BasicCegarLoop]: Found error trace [2020-10-27 17:29:30,810 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 17:29:30,810 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-27 17:29:30,810 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-27 17:29:30,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-27 17:29:30,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1129771688, now seen corresponding path program 1 times [2020-10-27 17:29:30,811 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-27 17:29:30,812 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [229065105] [2020-10-27 17:29:30,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-27 17:29:30,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:29:30,893 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:29:31,187 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:29:32,132 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:29:32,133 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 264 [2020-10-27 17:29:32,133 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-27 17:29:32,133 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1259 [2020-10-27 17:29:32,133 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:29:32,133 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-27 17:29:32,133 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 106 [2020-10-27 17:29:32,133 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 144 [2020-10-27 17:29:32,134 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:29:32,236 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-27 17:29:32,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:29:32,240 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:29:32,244 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:29:32,244 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-27 17:29:32,244 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:29:32,244 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 4 [2020-10-27 17:29:32,244 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:29:32,244 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-27 17:29:32,245 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:29:32,245 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-27 17:29:32,245 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:29:32,261 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-27 17:29:32,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:29:32,307 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:29:32,396 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:29:32,397 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 97 [2020-10-27 17:29:32,397 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:29:32,397 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 108 [2020-10-27 17:29:32,397 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:29:32,398 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-27 17:29:32,398 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:29:32,398 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 91 [2020-10-27 17:29:32,398 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:29:32,450 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2020-10-27 17:29:32,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:29:32,516 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:29:32,750 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:29:32,751 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 142 [2020-10-27 17:29:32,751 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:29:32,751 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 260 [2020-10-27 17:29:32,751 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:29:32,752 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-27 17:29:32,752 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-27 17:29:32,752 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 142 [2020-10-27 17:29:32,752 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:29:33,018 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 103 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-27 17:29:33,018 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [229065105] [2020-10-27 17:29:33,018 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-27 17:29:33,018 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-10-27 17:29:33,020 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502617348] [2020-10-27 17:29:33,021 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-27 17:29:33,025 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-27 17:29:33,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-27 17:29:33,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-27 17:29:33,027 INFO L87 Difference]: Start difference. First operand 2671 states and 3328 transitions. Second operand 8 states. [2020-10-27 17:29:35,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-27 17:29:35,435 INFO L93 Difference]: Finished difference Result 5352 states and 6684 transitions. [2020-10-27 17:29:35,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-27 17:29:35,436 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 250 [2020-10-27 17:29:35,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-27 17:29:35,452 INFO L225 Difference]: With dead ends: 5352 [2020-10-27 17:29:35,453 INFO L226 Difference]: Without dead ends: 2687 [2020-10-27 17:29:35,460 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2020-10-27 17:29:35,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2687 states. [2020-10-27 17:29:35,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2687 to 2675. [2020-10-27 17:29:35,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2675 states. [2020-10-27 17:29:35,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2675 states to 2675 states and 3106 transitions. [2020-10-27 17:29:35,544 INFO L78 Accepts]: Start accepts. Automaton has 2675 states and 3106 transitions. Word has length 250 [2020-10-27 17:29:35,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-27 17:29:35,545 INFO L481 AbstractCegarLoop]: Abstraction has 2675 states and 3106 transitions. [2020-10-27 17:29:35,545 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-27 17:29:35,545 INFO L276 IsEmpty]: Start isEmpty. Operand 2675 states and 3106 transitions. [2020-10-27 17:29:35,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2020-10-27 17:29:35,553 INFO L414 BasicCegarLoop]: Found error trace [2020-10-27 17:29:35,553 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 17:29:35,553 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-27 17:29:35,554 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-27 17:29:35,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-27 17:29:35,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1511711514, now seen corresponding path program 1 times [2020-10-27 17:29:35,556 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-27 17:29:35,557 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1668304804] [2020-10-27 17:29:35,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-27 17:29:35,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:29:35,734 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:29:36,364 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:29:36,365 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 283 [2020-10-27 17:29:36,365 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:29:36,365 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 687 [2020-10-27 17:29:36,365 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:29:36,365 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 7 [2020-10-27 17:29:36,365 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 125 [2020-10-27 17:29:36,366 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 154 [2020-10-27 17:29:36,366 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:29:36,478 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-27 17:29:36,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:29:36,483 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:29:36,487 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:29:36,488 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-27 17:29:36,488 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:29:36,488 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 6 [2020-10-27 17:29:36,488 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:29:36,489 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-27 17:29:36,489 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:29:36,489 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-27 17:29:36,489 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:29:36,504 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-27 17:29:36,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:29:36,548 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:29:36,624 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:29:36,624 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 116 [2020-10-27 17:29:36,624 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:29:36,625 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 92 [2020-10-27 17:29:36,625 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:29:36,625 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-27 17:29:36,625 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:29:36,625 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 110 [2020-10-27 17:29:36,626 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:29:36,664 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2020-10-27 17:29:36,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:29:36,716 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:29:36,970 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:29:36,971 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 142 [2020-10-27 17:29:36,971 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:29:36,971 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 275 [2020-10-27 17:29:36,971 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:29:36,971 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 5 [2020-10-27 17:29:36,971 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-27 17:29:36,972 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 142 [2020-10-27 17:29:36,972 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:29:37,162 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 119 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-27 17:29:37,163 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1668304804] [2020-10-27 17:29:37,163 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-27 17:29:37,164 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-10-27 17:29:37,164 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879570379] [2020-10-27 17:29:37,166 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-27 17:29:37,166 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-27 17:29:37,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-27 17:29:37,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-27 17:29:37,167 INFO L87 Difference]: Start difference. First operand 2675 states and 3106 transitions. Second operand 8 states. [2020-10-27 17:29:39,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-27 17:29:39,926 INFO L93 Difference]: Finished difference Result 7835 states and 9188 transitions. [2020-10-27 17:29:39,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-27 17:29:39,926 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 269 [2020-10-27 17:29:39,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-27 17:29:39,948 INFO L225 Difference]: With dead ends: 7835 [2020-10-27 17:29:39,948 INFO L226 Difference]: Without dead ends: 5021 [2020-10-27 17:29:39,954 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2020-10-27 17:29:39,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5021 states. [2020-10-27 17:29:40,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5021 to 4298. [2020-10-27 17:29:40,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4298 states. [2020-10-27 17:29:40,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4298 states to 4298 states and 5030 transitions. [2020-10-27 17:29:40,075 INFO L78 Accepts]: Start accepts. Automaton has 4298 states and 5030 transitions. Word has length 269 [2020-10-27 17:29:40,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-27 17:29:40,075 INFO L481 AbstractCegarLoop]: Abstraction has 4298 states and 5030 transitions. [2020-10-27 17:29:40,075 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-27 17:29:40,076 INFO L276 IsEmpty]: Start isEmpty. Operand 4298 states and 5030 transitions. [2020-10-27 17:29:40,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2020-10-27 17:29:40,087 INFO L414 BasicCegarLoop]: Found error trace [2020-10-27 17:29:40,087 INFO L422 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-27 17:29:40,088 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-27 17:29:40,088 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-27 17:29:40,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-27 17:29:40,088 INFO L82 PathProgramCache]: Analyzing trace with hash -2122923225, now seen corresponding path program 1 times [2020-10-27 17:29:40,089 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-27 17:29:40,089 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1092748066] [2020-10-27 17:29:40,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-27 17:29:40,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:29:40,151 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:29:40,222 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:29:40,404 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:29:43,145 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:29:45,153 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:29:45,153 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 334 [2020-10-27 17:29:45,153 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 4 [2020-10-27 17:29:45,153 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 5021 [2020-10-27 17:29:45,154 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:29:45,154 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-27 17:29:45,154 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 190 [2020-10-27 17:29:45,154 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 130 [2020-10-27 17:29:45,154 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:29:45,247 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-27 17:29:45,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:29:45,251 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:29:45,254 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:29:45,254 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-27 17:29:45,254 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:29:45,254 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 3 [2020-10-27 17:29:45,255 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:29:45,255 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-27 17:29:45,255 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:29:45,255 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-27 17:29:45,255 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:29:45,273 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-27 17:29:45,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:29:45,284 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:29:45,307 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:29:45,308 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 97 [2020-10-27 17:29:45,308 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:29:45,308 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 24 [2020-10-27 17:29:45,308 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:29:45,308 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-27 17:29:45,308 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:29:45,308 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-27 17:29:45,309 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:29:45,333 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2020-10-27 17:29:45,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:29:45,358 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:29:45,407 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:29:45,407 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 83 [2020-10-27 17:29:45,407 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:29:45,407 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 58 [2020-10-27 17:29:45,408 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:29:45,408 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-27 17:29:45,408 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:29:45,408 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 77 [2020-10-27 17:29:45,408 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:29:45,428 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2020-10-27 17:29:45,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:29:45,468 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:29:45,612 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:29:45,613 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 128 [2020-10-27 17:29:45,613 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:29:45,613 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 160 [2020-10-27 17:29:45,613 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:29:45,613 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-27 17:29:45,613 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-27 17:29:45,614 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 128 [2020-10-27 17:29:45,614 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:29:45,748 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 192 proven. 2 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2020-10-27 17:29:45,749 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1092748066] [2020-10-27 17:29:45,749 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-27 17:29:45,749 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-27 17:29:45,749 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526987576] [2020-10-27 17:29:45,750 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-27 17:29:45,750 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-27 17:29:45,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-27 17:29:45,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-27 17:29:45,751 INFO L87 Difference]: Start difference. First operand 4298 states and 5030 transitions. Second operand 7 states. [2020-10-27 17:29:47,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-27 17:29:47,636 INFO L93 Difference]: Finished difference Result 9105 states and 10912 transitions. [2020-10-27 17:29:47,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-27 17:29:47,637 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 318 [2020-10-27 17:29:47,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-27 17:29:47,658 INFO L225 Difference]: With dead ends: 9105 [2020-10-27 17:29:47,658 INFO L226 Difference]: Without dead ends: 4376 [2020-10-27 17:29:47,669 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 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-27 17:29:47,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4376 states. [2020-10-27 17:29:47,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4376 to 4292. [2020-10-27 17:29:47,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4292 states. [2020-10-27 17:29:47,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4292 states to 4292 states and 4998 transitions. [2020-10-27 17:29:47,789 INFO L78 Accepts]: Start accepts. Automaton has 4292 states and 4998 transitions. Word has length 318 [2020-10-27 17:29:47,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-27 17:29:47,790 INFO L481 AbstractCegarLoop]: Abstraction has 4292 states and 4998 transitions. [2020-10-27 17:29:47,790 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-27 17:29:47,790 INFO L276 IsEmpty]: Start isEmpty. Operand 4292 states and 4998 transitions. [2020-10-27 17:29:47,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2020-10-27 17:29:47,804 INFO L414 BasicCegarLoop]: Found error trace [2020-10-27 17:29:47,804 INFO L422 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-27 17:29:47,805 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-27 17:29:47,805 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-27 17:29:47,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-27 17:29:47,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1441186231, now seen corresponding path program 1 times [2020-10-27 17:29:47,806 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-27 17:29:47,806 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1932508438] [2020-10-27 17:29:47,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-27 17:29:47,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-27 17:29:47,870 INFO L173 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-10-27 17:29:47,870 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-27 17:29:47,878 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-27 17:29:47,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.10 05:29:47 BoogieIcfgContainer [2020-10-27 17:29:47,931 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-27 17:29:47,934 INFO L168 Benchmark]: Toolchain (without parser) took 60176.54 ms. Allocated memory was 160.4 MB in the beginning and 1.1 GB in the end (delta: 942.7 MB). Free memory was 133.9 MB in the beginning and 891.3 MB in the end (delta: -757.5 MB). Peak memory consumption was 185.4 MB. Max. memory is 8.0 GB. [2020-10-27 17:29:47,934 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 160.4 MB. Free memory is still 133.1 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-10-27 17:29:47,935 INFO L168 Benchmark]: CACSL2BoogieTranslator took 863.73 ms. Allocated memory is still 160.4 MB. Free memory was 133.2 MB in the beginning and 141.9 MB in the end (delta: -8.7 MB). Peak memory consumption was 31.1 MB. Max. memory is 8.0 GB. [2020-10-27 17:29:47,935 INFO L168 Benchmark]: Boogie Preprocessor took 114.80 ms. Allocated memory is still 160.4 MB. Free memory was 141.9 MB in the beginning and 137.6 MB in the end (delta: 4.3 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. [2020-10-27 17:29:47,936 INFO L168 Benchmark]: RCFGBuilder took 1652.83 ms. Allocated memory was 160.4 MB in the beginning and 192.9 MB in the end (delta: 32.5 MB). Free memory was 137.6 MB in the beginning and 153.4 MB in the end (delta: -15.8 MB). Peak memory consumption was 90.2 MB. Max. memory is 8.0 GB. [2020-10-27 17:29:47,937 INFO L168 Benchmark]: TraceAbstraction took 57526.17 ms. Allocated memory was 192.9 MB in the beginning and 1.1 GB in the end (delta: 910.2 MB). Free memory was 153.4 MB in the beginning and 891.3 MB in the end (delta: -737.9 MB). Peak memory consumption was 172.2 MB. Max. memory is 8.0 GB. [2020-10-27 17:29:47,940 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 160.4 MB. Free memory is still 133.1 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 863.73 ms. Allocated memory is still 160.4 MB. Free memory was 133.2 MB in the beginning and 141.9 MB in the end (delta: -8.7 MB). Peak memory consumption was 31.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 114.80 ms. Allocated memory is still 160.4 MB. Free memory was 141.9 MB in the beginning and 137.6 MB in the end (delta: 4.3 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1652.83 ms. Allocated memory was 160.4 MB in the beginning and 192.9 MB in the end (delta: 32.5 MB). Free memory was 137.6 MB in the beginning and 153.4 MB in the end (delta: -15.8 MB). Peak memory consumption was 90.2 MB. Max. memory is 8.0 GB. * TraceAbstraction took 57526.17 ms. Allocated memory was 192.9 MB in the beginning and 1.1 GB in the end (delta: 910.2 MB). Free memory was 153.4 MB in the beginning and 891.3 MB in the end (delta: -737.9 MB). Peak memory consumption was 172.2 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 TRUE ((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0)) [L428] a1 = ((((a1 / 5) * 5) / 5) + 505228) [L429] a10 = 1 [L431] 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 TRUE ((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14))))) [L224] a19 = 10 [L226] return 25; [L592] RET, EXPR calculate_output(input) [L592] output = calculate_output(input) [L584] COND TRUE 1 [L587] int input; [L588] input = __VERIFIER_nondet_int() [L589] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L592] CALL, EXPR calculate_output(input) [L23] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L26] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L29] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L32] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L35] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L38] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L41] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L44] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L47] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L50] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L53] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L56] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L59] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L62] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L65] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L68] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L71] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L74] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L77] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L80] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L83] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L86] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L89] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L92] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L95] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L98] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L101] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L104] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L107] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L110] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L113] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L116] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L119] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L122] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L125] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L128] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L131] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L134] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L137] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L140] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L143] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L146] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L149] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L152] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L155] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L158] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L161] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L164] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L167] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L170] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L173] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L176] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L179] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L182] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L185] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L188] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L191] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L194] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L197] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L200] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L203] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L207] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L212] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) [L217] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) [L222] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) [L227] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) [L233] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) [L238] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) [L241] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) [L246] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) [L251] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) [L256] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) [L262] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) [L267] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) [L273] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) [L279] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) [L285] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) [L288] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) [L293] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) [L298] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) [L303] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) [L308] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) [L314] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) [L319] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) [L322] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) [L325] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) [L328] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) [L331] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) [L337] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) [L342] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) [L347] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) [L353] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) [L356] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) [L359] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) [L362] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) [L367] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0))))) [L372] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) [L377] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) [L380] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) [L385] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) [L390] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0))))) [L395] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) [L400] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) [L405] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14))) [L410] COND FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))) [L416] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14))) [L421] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10)))))) [L427] COND FALSE !(((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0))) [L432] COND FALSE !((((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 6)) && (a19==10))) && (a12==0))) [L438] COND FALSE !(((a19==9) && ((((input == 4) && (( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 ))) && (a12==0)) && (a4==14)))) [L444] COND FALSE !((((a19==10) && ((a12==0) && ((((a10==1) && a1 <= -13 ) || (( ((38 < a1) && (218 >= a1)) && (a10==0)) || ((a10==0) && 218 < a1 ))) && (input == 3)))) && (a4==14))) [L450] COND FALSE !(((a19==9) && (((a4==14) && ((((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4))) && (input == 5))) && (a12==0)))) [L456] COND FALSE !((((a12==0) && ((((input == 5) && (a19==10)) && ((38 < a1) && (218 >= a1)) ) && (a4==14))) && (a10==1))) [L462] COND FALSE !(((a19==9) && ((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3)) && (a10==1)) && (a12==0))))) [L467] COND FALSE !(((a10==0) && ((a12==0) && ((((input == 5) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a4==14))))) [L473] COND FALSE !(( 218 < a1 && (((((input == 3) && (a10==1)) && (a12==0)) && (a4==14)) && (a19==10)))) [L478] COND FALSE !((((a12==0) && ((a19==9) && (((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a4==14)))) && (a10==3))) [L483] COND FALSE !((((((a4==14) && ( ((38 < a1) && (218 >= a1)) && (input == 2))) && (a12==0)) && (a10==1)) && (a19==10))) [L489] COND FALSE !((((a19==10) && ((a10==1) && ((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (input == 5))))) && (a4==14))) [L495] COND TRUE ((((a10==1) && (((input == 5) && 218 < a1 ) && (a4==14))) && (a19==10)) && (a12==0)) [L496] a1 = (((((a1 % 89)- -93) * 5) % 89)- -56) [L497] a10 = 4 [L498] a19 = 8 [L500] 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 TRUE (((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8)) [L24] CALL reach_error() [L4] __assert_fail("0", "Problem10_label57.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: 57.3s, OverallIterations: 12, TraceHistogramMax: 4, AutomataDifference: 22.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 327 SDtfs, 5053 SDslu, 400 SDs, 0 SdLazy, 11629 SolverSat, 1815 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 187 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4298occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 11 MinimizatonAttempts, 1213 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 31.7s InterpolantComputationTime, 2465 NumberOfCodeBlocks, 2465 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2127 ConstructedInterpolants, 0 QuantifiedInterpolants, 1609953 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 1 PerfectInterpolantSequences, 945/966 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...