/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_label41.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-0f64333 [2020-10-27 17:28:11,980 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-27 17:28:11,983 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-27 17:28:12,029 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-27 17:28:12,029 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-27 17:28:12,031 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-27 17:28:12,033 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-27 17:28:12,035 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-27 17:28:12,037 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-27 17:28:12,039 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-27 17:28:12,040 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-27 17:28:12,044 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-27 17:28:12,045 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-27 17:28:12,047 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-27 17:28:12,048 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-27 17:28:12,051 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-27 17:28:12,052 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-27 17:28:12,053 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-27 17:28:12,056 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-27 17:28:12,062 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-27 17:28:12,066 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-27 17:28:12,072 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-27 17:28:12,073 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-27 17:28:12,074 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-27 17:28:12,084 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-27 17:28:12,094 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-27 17:28:12,094 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-27 17:28:12,095 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-27 17:28:12,100 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-27 17:28:12,101 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-27 17:28:12,101 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-27 17:28:12,102 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-27 17:28:12,103 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-27 17:28:12,107 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-27 17:28:12,109 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-27 17:28:12,109 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-27 17:28:12,110 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-27 17:28:12,111 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-27 17:28:12,111 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-27 17:28:12,112 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-27 17:28:12,113 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-27 17:28:12,117 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:12,169 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-27 17:28:12,169 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-27 17:28:12,173 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-27 17:28:12,174 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-27 17:28:12,174 INFO L138 SettingsManager]: * Use SBE=true [2020-10-27 17:28:12,174 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-27 17:28:12,174 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-27 17:28:12,174 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-27 17:28:12,175 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-27 17:28:12,175 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-27 17:28:12,176 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-27 17:28:12,176 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-27 17:28:12,176 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-27 17:28:12,177 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-27 17:28:12,177 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-27 17:28:12,177 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-27 17:28:12,177 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-27 17:28:12,177 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-27 17:28:12,178 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-27 17:28:12,178 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-27 17:28:12,178 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-27 17:28:12,178 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-27 17:28:12,178 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-27 17:28:12,179 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-27 17:28:12,179 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-27 17:28:12,179 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-27 17:28:12,179 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-27 17:28:12,179 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-27 17:28:12,179 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-27 17:28:12,180 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:12,554 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-27 17:28:12,593 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-27 17:28:12,597 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-27 17:28:12,598 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-27 17:28:12,599 INFO L275 PluginConnector]: CDTParser initialized [2020-10-27 17:28:12,600 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label41.c [2020-10-27 17:28:12,687 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/6183ba47b/9ef4703955f1432c974080c6fd8c0ddd/FLAGbc9c93dc0 [2020-10-27 17:28:13,472 INFO L306 CDTParser]: Found 1 translation units. [2020-10-27 17:28:13,473 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/eca-rers2012/Problem10_label41.c [2020-10-27 17:28:13,497 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/6183ba47b/9ef4703955f1432c974080c6fd8c0ddd/FLAGbc9c93dc0 [2020-10-27 17:28:13,710 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/6183ba47b/9ef4703955f1432c974080c6fd8c0ddd [2020-10-27 17:28:13,716 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-27 17:28:13,723 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-27 17:28:13,725 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-27 17:28:13,725 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-27 17:28:13,729 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-27 17:28:13,730 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 05:28:13" (1/1) ... [2020-10-27 17:28:13,734 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ad199fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:28:13, skipping insertion in model container [2020-10-27 17:28:13,735 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 05:28:13" (1/1) ... [2020-10-27 17:28:13,744 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-27 17:28:13,794 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-27 17:28:14,232 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-27 17:28:14,254 INFO L203 MainTranslator]: Completed pre-run [2020-10-27 17:28:14,432 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-27 17:28:14,461 INFO L208 MainTranslator]: Completed translation [2020-10-27 17:28:14,464 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:28:14 WrapperNode [2020-10-27 17:28:14,464 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-27 17:28:14,465 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-27 17:28:14,466 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-27 17:28:14,466 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-27 17:28:14,482 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:14" (1/1) ... [2020-10-27 17:28:14,485 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:14" (1/1) ... [2020-10-27 17:28:14,525 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:14" (1/1) ... [2020-10-27 17:28:14,526 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:14" (1/1) ... [2020-10-27 17:28:14,567 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:14" (1/1) ... [2020-10-27 17:28:14,590 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:14" (1/1) ... [2020-10-27 17:28:14,610 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:14" (1/1) ... [2020-10-27 17:28:14,631 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-27 17:28:14,636 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-27 17:28:14,636 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-27 17:28:14,636 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-27 17:28:14,637 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:28:14" (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:14,743 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-27 17:28:14,743 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-27 17:28:14,743 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-27 17:28:14,743 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2020-10-27 17:28:14,743 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-27 17:28:14,744 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2020-10-27 17:28:14,744 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-27 17:28:14,744 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-27 17:28:14,744 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-27 17:28:14,744 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-27 17:28:14,744 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-27 17:28:14,744 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-10-27 17:28:14,745 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-27 17:28:14,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-27 17:28:14,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-27 17:28:14,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-27 17:28:14,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-27 17:28:14,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-27 17:28:14,746 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-27 17:28:16,274 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-27 17:28:16,275 INFO L298 CfgBuilder]: Removed 1 assume(true) statements. [2020-10-27 17:28:16,277 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 05:28:16 BoogieIcfgContainer [2020-10-27 17:28:16,277 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-27 17:28:16,279 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-27 17:28:16,280 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-27 17:28:16,283 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-27 17:28:16,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 05:28:13" (1/3) ... [2020-10-27 17:28:16,285 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e4b99dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 05:28:16, skipping insertion in model container [2020-10-27 17:28:16,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:28:14" (2/3) ... [2020-10-27 17:28:16,285 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e4b99dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 05:28:16, skipping insertion in model container [2020-10-27 17:28:16,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 05:28:16" (3/3) ... [2020-10-27 17:28:16,287 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem10_label41.c [2020-10-27 17:28:16,299 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-27 17:28:16,305 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-27 17:28:16,321 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-27 17:28:16,356 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-27 17:28:16,356 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-27 17:28:16,357 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-27 17:28:16,357 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-27 17:28:16,357 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-27 17:28:16,357 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-27 17:28:16,357 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-27 17:28:16,357 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-27 17:28:16,385 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states. [2020-10-27 17:28:16,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-27 17:28:16,393 INFO L414 BasicCegarLoop]: Found error trace [2020-10-27 17:28:16,394 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-27 17:28:16,395 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-27 17:28:16,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-27 17:28:16,402 INFO L82 PathProgramCache]: Analyzing trace with hash 2022893322, now seen corresponding path program 1 times [2020-10-27 17:28:16,414 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-27 17:28:16,414 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1176705091] [2020-10-27 17:28:16,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-27 17:28:16,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:28:16,640 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:28:17,144 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:28:17,144 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 37 [2020-10-27 17:28:17,145 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:28:17,145 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 547 [2020-10-27 17:28:17,147 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:28:17,147 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-10-27 17:28:17,147 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 5 [2020-10-27 17:28:17,148 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 28 [2020-10-27 17:28:17,148 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 2 [2020-10-27 17:28:17,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-27 17:28:17,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:28:17,297 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:28:17,318 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:28:17,319 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-27 17:28:17,319 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:28:17,319 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 26 [2020-10-27 17:28:17,319 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:28:17,320 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-27 17:28:17,320 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:28:17,320 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 2 [2020-10-27 17:28:17,320 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:28:17,341 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:17,342 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1176705091] [2020-10-27 17:28:17,345 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-27 17:28:17,345 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-27 17:28:17,346 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952208062] [2020-10-27 17:28:17,352 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-27 17:28:17,353 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-27 17:28:17,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-27 17:28:17,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-27 17:28:17,373 INFO L87 Difference]: Start difference. First operand 219 states. Second operand 4 states. [2020-10-27 17:28:19,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-27 17:28:19,256 INFO L93 Difference]: Finished difference Result 586 states and 1013 transitions. [2020-10-27 17:28:19,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-27 17:28:19,258 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2020-10-27 17:28:19,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-27 17:28:19,274 INFO L225 Difference]: With dead ends: 586 [2020-10-27 17:28:19,274 INFO L226 Difference]: Without dead ends: 303 [2020-10-27 17:28:19,282 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-27 17:28:19,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2020-10-27 17:28:19,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 297. [2020-10-27 17:28:19,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2020-10-27 17:28:19,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 424 transitions. [2020-10-27 17:28:19,363 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 424 transitions. Word has length 27 [2020-10-27 17:28:19,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-27 17:28:19,364 INFO L481 AbstractCegarLoop]: Abstraction has 297 states and 424 transitions. [2020-10-27 17:28:19,364 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-27 17:28:19,364 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 424 transitions. [2020-10-27 17:28:19,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-10-27 17:28:19,369 INFO L414 BasicCegarLoop]: Found error trace [2020-10-27 17:28:19,369 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-10-27 17:28:19,370 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-27 17:28:19,370 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-27 17:28:19,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-27 17:28:19,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1730865675, now seen corresponding path program 1 times [2020-10-27 17:28:19,371 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-27 17:28:19,372 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1237126550] [2020-10-27 17:28:19,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-27 17:28:19,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:28:19,461 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:28:19,758 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:28:20,408 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:28:20,549 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:28:20,550 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 111 [2020-10-27 17:28:20,550 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 3 [2020-10-27 17:28:20,550 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1122 [2020-10-27 17:28:20,553 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:28:20,553 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-27 17:28:20,553 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 82 [2020-10-27 17:28:20,553 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 25 [2020-10-27 17:28:20,554 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-27 17:28:20,662 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-27 17:28:20,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:28:20,669 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:28:20,675 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:28:20,675 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-27 17:28:20,676 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:28:20,676 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 7 [2020-10-27 17:28:20,676 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:28:20,676 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-27 17:28:20,676 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:28:20,677 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-27 17:28:20,677 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:28:20,695 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-27 17:28:20,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:28:20,722 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:28:20,790 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:28:20,790 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 73 [2020-10-27 17:28:20,791 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:28:20,791 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 78 [2020-10-27 17:28:20,791 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:28:20,791 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-27 17:28:20,792 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:28:20,792 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 67 [2020-10-27 17:28:20,792 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:28:20,842 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-27 17:28:20,842 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1237126550] [2020-10-27 17:28:20,843 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-27 17:28:20,843 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-10-27 17:28:20,843 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145923629] [2020-10-27 17:28:20,845 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-27 17:28:20,845 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-27 17:28:20,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-27 17:28:20,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-27 17:28:20,847 INFO L87 Difference]: Start difference. First operand 297 states and 424 transitions. Second operand 5 states. [2020-10-27 17:28:22,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-27 17:28:22,545 INFO L93 Difference]: Finished difference Result 739 states and 1081 transitions. [2020-10-27 17:28:22,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-27 17:28:22,549 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2020-10-27 17:28:22,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-27 17:28:22,554 INFO L225 Difference]: With dead ends: 739 [2020-10-27 17:28:22,554 INFO L226 Difference]: Without dead ends: 448 [2020-10-27 17:28:22,556 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:28:22,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2020-10-27 17:28:22,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 444. [2020-10-27 17:28:22,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2020-10-27 17:28:22,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 602 transitions. [2020-10-27 17:28:22,605 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 602 transitions. Word has length 99 [2020-10-27 17:28:22,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-27 17:28:22,606 INFO L481 AbstractCegarLoop]: Abstraction has 444 states and 602 transitions. [2020-10-27 17:28:22,606 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-27 17:28:22,606 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 602 transitions. [2020-10-27 17:28:22,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2020-10-27 17:28:22,608 INFO L414 BasicCegarLoop]: Found error trace [2020-10-27 17:28:22,609 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-10-27 17:28:22,609 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-27 17:28:22,609 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-27 17:28:22,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-27 17:28:22,610 INFO L82 PathProgramCache]: Analyzing trace with hash -6243867, now seen corresponding path program 1 times [2020-10-27 17:28:22,610 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-27 17:28:22,611 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [997677189] [2020-10-27 17:28:22,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-27 17:28:22,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:28:22,674 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:28:22,940 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:28:22,940 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 118 [2020-10-27 17:28:22,940 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:28:22,941 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 287 [2020-10-27 17:28:22,941 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:28:22,941 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-27 17:28:22,941 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 89 [2020-10-27 17:28:22,941 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 25 [2020-10-27 17:28:22,942 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:28:23,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-27 17:28:23,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:28:23,062 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:28:23,069 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:28:23,069 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-27 17:28:23,069 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:28:23,070 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 7 [2020-10-27 17:28:23,070 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:28:23,070 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-27 17:28:23,070 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:28:23,072 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-27 17:28:23,073 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 2 [2020-10-27 17:28:23,092 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-27 17:28:23,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:28:23,139 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:28:23,207 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:28:23,207 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 80 [2020-10-27 17:28:23,207 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:28:23,208 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 82 [2020-10-27 17:28:23,208 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:28:23,208 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-27 17:28:23,208 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:28:23,208 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 74 [2020-10-27 17:28:23,208 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:28:23,273 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-27 17:28:23,274 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [997677189] [2020-10-27 17:28:23,274 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-27 17:28:23,274 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-10-27 17:28:23,274 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129343519] [2020-10-27 17:28:23,275 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-27 17:28:23,275 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-27 17:28:23,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-27 17:28:23,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-27 17:28:23,279 INFO L87 Difference]: Start difference. First operand 444 states and 602 transitions. Second operand 5 states. [2020-10-27 17:28:25,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-27 17:28:25,369 INFO L93 Difference]: Finished difference Result 1325 states and 1843 transitions. [2020-10-27 17:28:25,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-27 17:28:25,370 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2020-10-27 17:28:25,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-27 17:28:25,384 INFO L225 Difference]: With dead ends: 1325 [2020-10-27 17:28:25,385 INFO L226 Difference]: Without dead ends: 887 [2020-10-27 17:28:25,388 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:28:25,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2020-10-27 17:28:25,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 879. [2020-10-27 17:28:25,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 879 states. [2020-10-27 17:28:25,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1193 transitions. [2020-10-27 17:28:25,489 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1193 transitions. Word has length 106 [2020-10-27 17:28:25,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-27 17:28:25,490 INFO L481 AbstractCegarLoop]: Abstraction has 879 states and 1193 transitions. [2020-10-27 17:28:25,490 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-27 17:28:25,490 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1193 transitions. [2020-10-27 17:28:25,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2020-10-27 17:28:25,495 INFO L414 BasicCegarLoop]: Found error trace [2020-10-27 17:28:25,495 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25,495 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-27 17:28:25,496 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-27 17:28:25,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-27 17:28:25,496 INFO L82 PathProgramCache]: Analyzing trace with hash 2017762651, now seen corresponding path program 1 times [2020-10-27 17:28:25,497 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-27 17:28:25,497 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2079100087] [2020-10-27 17:28:25,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-27 17:28:25,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:28:25,585 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:28:25,805 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:28:25,949 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:28:26,896 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:28:26,897 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 151 [2020-10-27 17:28:26,897 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 3 [2020-10-27 17:28:26,897 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1336 [2020-10-27 17:28:26,899 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:28:26,899 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-27 17:28:26,899 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 122 [2020-10-27 17:28:26,899 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 22 [2020-10-27 17:28:26,905 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 6 [2020-10-27 17:28:27,082 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-27 17:28:27,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:28:27,087 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:28:27,098 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:28:27,098 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-27 17:28:27,099 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:28:27,099 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 11 [2020-10-27 17:28:27,099 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:28:27,099 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-27 17:28:27,099 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:28:27,099 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-27 17:28:27,100 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:28:27,142 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-27 17:28:27,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:28:27,201 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:28:27,312 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:28:27,313 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 113 [2020-10-27 17:28:27,313 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:28:27,313 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 135 [2020-10-27 17:28:27,313 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:28:27,313 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-27 17:28:27,313 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:28:27,314 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 107 [2020-10-27 17:28:27,314 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:28:27,411 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-27 17:28:27,411 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2079100087] [2020-10-27 17:28:27,412 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-27 17:28:27,412 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-10-27 17:28:27,412 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977466507] [2020-10-27 17:28:27,414 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-27 17:28:27,414 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-27 17:28:27,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-27 17:28:27,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-27 17:28:27,427 INFO L87 Difference]: Start difference. First operand 879 states and 1193 transitions. Second operand 5 states. [2020-10-27 17:28:28,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-27 17:28:28,723 INFO L93 Difference]: Finished difference Result 1779 states and 2436 transitions. [2020-10-27 17:28:28,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-27 17:28:28,724 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 139 [2020-10-27 17:28:28,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-27 17:28:28,731 INFO L225 Difference]: With dead ends: 1779 [2020-10-27 17:28:28,731 INFO L226 Difference]: Without dead ends: 887 [2020-10-27 17:28:28,734 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-27 17:28:28,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2020-10-27 17:28:28,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 879. [2020-10-27 17:28:28,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 879 states. [2020-10-27 17:28:28,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1189 transitions. [2020-10-27 17:28:28,772 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1189 transitions. Word has length 139 [2020-10-27 17:28:28,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-27 17:28:28,773 INFO L481 AbstractCegarLoop]: Abstraction has 879 states and 1189 transitions. [2020-10-27 17:28:28,773 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-27 17:28:28,773 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1189 transitions. [2020-10-27 17:28:28,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2020-10-27 17:28:28,776 INFO L414 BasicCegarLoop]: Found error trace [2020-10-27 17:28:28,776 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28,776 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-27 17:28:28,777 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-27 17:28:28,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-27 17:28:28,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1847863695, now seen corresponding path program 1 times [2020-10-27 17:28:28,777 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-27 17:28:28,778 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1223984879] [2020-10-27 17:28:28,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-27 17:28:28,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:28:28,849 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:28:29,293 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:28:29,293 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 156 [2020-10-27 17:28:29,294 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:28:29,294 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 477 [2020-10-27 17:28:29,294 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:28:29,294 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-10-27 17:28:29,294 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 5 [2020-10-27 17:28:29,294 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 123 [2020-10-27 17:28:29,295 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:28:29,388 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-27 17:28:29,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:28:29,397 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:28:29,408 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:28:29,408 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-27 17:28:29,408 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:28:29,409 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 14 [2020-10-27 17:28:29,409 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:28:29,409 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-27 17:28:29,409 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:28:29,409 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 2 [2020-10-27 17:28:29,410 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:28:29,427 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-27 17:28:29,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:28:29,475 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:28:29,656 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:28:29,656 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 118 [2020-10-27 17:28:29,656 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:28:29,656 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 198 [2020-10-27 17:28:29,656 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:28:29,657 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-27 17:28:29,657 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-27 17:28:29,657 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 118 [2020-10-27 17:28:29,657 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:28:29,874 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-27 17:28:29,875 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1223984879] [2020-10-27 17:28:29,875 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-27 17:28:29,875 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-27 17:28:29,876 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366591241] [2020-10-27 17:28:29,877 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-27 17:28:29,877 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-27 17:28:29,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-27 17:28:29,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-27 17:28:29,878 INFO L87 Difference]: Start difference. First operand 879 states and 1189 transitions. Second operand 7 states. [2020-10-27 17:28:31,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-27 17:28:31,847 INFO L93 Difference]: Finished difference Result 1915 states and 2624 transitions. [2020-10-27 17:28:31,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-27 17:28:31,851 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 144 [2020-10-27 17:28:31,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-27 17:28:31,859 INFO L225 Difference]: With dead ends: 1915 [2020-10-27 17:28:31,860 INFO L226 Difference]: Without dead ends: 1042 [2020-10-27 17:28:31,863 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-10-27 17:28:31,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1042 states. [2020-10-27 17:28:31,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1042 to 1040. [2020-10-27 17:28:31,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1040 states. [2020-10-27 17:28:31,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1040 states to 1040 states and 1403 transitions. [2020-10-27 17:28:31,922 INFO L78 Accepts]: Start accepts. Automaton has 1040 states and 1403 transitions. Word has length 144 [2020-10-27 17:28:31,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-27 17:28:31,922 INFO L481 AbstractCegarLoop]: Abstraction has 1040 states and 1403 transitions. [2020-10-27 17:28:31,922 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-27 17:28:31,922 INFO L276 IsEmpty]: Start isEmpty. Operand 1040 states and 1403 transitions. [2020-10-27 17:28:31,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2020-10-27 17:28:31,932 INFO L414 BasicCegarLoop]: Found error trace [2020-10-27 17:28:31,932 INFO L422 BasicCegarLoop]: trace histogram [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, 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] [2020-10-27 17:28:31,934 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-27 17:28:31,934 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-27 17:28:31,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-27 17:28:31,935 INFO L82 PathProgramCache]: Analyzing trace with hash 630394196, now seen corresponding path program 1 times [2020-10-27 17:28:31,935 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-27 17:28:31,936 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1123471122] [2020-10-27 17:28:31,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-27 17:28:32,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:28:32,064 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:28:32,512 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:28:32,512 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 228 [2020-10-27 17:28:32,513 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:28:32,513 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 500 [2020-10-27 17:28:32,513 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:28:32,513 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-27 17:28:32,513 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 80 [2020-10-27 17:28:32,513 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 120 [2020-10-27 17:28:32,513 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:28:32,615 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-27 17:28:32,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:28:32,619 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:28:32,624 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:28:32,624 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-27 17:28:32,624 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:28:32,625 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 5 [2020-10-27 17:28:32,625 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:28:32,625 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-27 17:28:32,625 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:28:32,625 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-27 17:28:32,625 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:28:32,640 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-27 17:28:32,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:28:32,661 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:28:32,702 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:28:32,702 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 71 [2020-10-27 17:28:32,702 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:28:32,703 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 50 [2020-10-27 17:28:32,703 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:28:32,703 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-27 17:28:32,703 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:28:32,703 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 65 [2020-10-27 17:28:32,703 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:28:32,723 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2020-10-27 17:28:32,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:28:32,777 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:28:33,004 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:28:33,004 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 118 [2020-10-27 17:28:33,004 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:28:33,005 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 245 [2020-10-27 17:28:33,005 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:28:33,005 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-27 17:28:33,005 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-27 17:28:33,005 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 118 [2020-10-27 17:28:33,006 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:28:33,189 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 105 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-27 17:28:33,190 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1123471122] [2020-10-27 17:28:33,191 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-27 17:28:33,191 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-27 17:28:33,192 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715561620] [2020-10-27 17:28:33,192 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-27 17:28:33,193 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-27 17:28:33,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-27 17:28:33,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-27 17:28:33,194 INFO L87 Difference]: Start difference. First operand 1040 states and 1403 transitions. Second operand 7 states. [2020-10-27 17:28:35,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-27 17:28:35,559 INFO L93 Difference]: Finished difference Result 2311 states and 3520 transitions. [2020-10-27 17:28:35,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-27 17:28:35,560 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 214 [2020-10-27 17:28:35,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-27 17:28:35,575 INFO L225 Difference]: With dead ends: 2311 [2020-10-27 17:28:35,575 INFO L226 Difference]: Without dead ends: 1420 [2020-10-27 17:28:35,582 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2020-10-27 17:28:35,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1420 states. [2020-10-27 17:28:35,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1420 to 1201. [2020-10-27 17:28:35,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1201 states. [2020-10-27 17:28:35,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1201 states to 1201 states and 1598 transitions. [2020-10-27 17:28:35,670 INFO L78 Accepts]: Start accepts. Automaton has 1201 states and 1598 transitions. Word has length 214 [2020-10-27 17:28:35,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-27 17:28:35,671 INFO L481 AbstractCegarLoop]: Abstraction has 1201 states and 1598 transitions. [2020-10-27 17:28:35,671 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-27 17:28:35,671 INFO L276 IsEmpty]: Start isEmpty. Operand 1201 states and 1598 transitions. [2020-10-27 17:28:35,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2020-10-27 17:28:35,676 INFO L414 BasicCegarLoop]: Found error trace [2020-10-27 17:28:35,677 INFO L422 BasicCegarLoop]: trace histogram [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, 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] [2020-10-27 17:28:35,677 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-27 17:28:35,677 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-27 17:28:35,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-27 17:28:35,679 INFO L82 PathProgramCache]: Analyzing trace with hash 938198732, now seen corresponding path program 1 times [2020-10-27 17:28:35,679 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-27 17:28:35,680 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1987264894] [2020-10-27 17:28:35,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-27 17:28:35,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:28:35,736 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:28:36,329 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:28:36,330 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 232 [2020-10-27 17:28:36,330 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:28:36,330 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 611 [2020-10-27 17:28:36,330 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:28:36,331 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-10-27 17:28:36,331 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 5 [2020-10-27 17:28:36,331 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 80 [2020-10-27 17:28:36,331 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:28:36,413 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-27 17:28:36,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:28:36,422 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:28:36,433 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:28:36,434 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-27 17:28:36,434 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:28:36,434 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 13 [2020-10-27 17:28:36,434 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:28:36,434 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-27 17:28:36,434 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:28:36,435 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 2 [2020-10-27 17:28:36,435 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:28:36,450 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-27 17:28:36,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:28:36,472 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:28:36,578 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:28:36,578 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 75 [2020-10-27 17:28:36,579 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:28:36,579 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 113 [2020-10-27 17:28:36,579 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:28:36,580 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-27 17:28:36,580 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-27 17:28:36,580 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 75 [2020-10-27 17:28:36,580 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-27 17:28:36,630 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2020-10-27 17:28:36,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:28:36,675 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:28:36,731 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:28:36,732 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 118 [2020-10-27 17:28:36,732 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:28:36,732 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 73 [2020-10-27 17:28:36,732 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:28:36,732 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-27 17:28:36,733 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 115 [2020-10-27 17:28:36,733 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-27 17:28:36,733 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:28:36,874 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 38 proven. 69 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-27 17:28:36,874 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1987264894] [2020-10-27 17:28:36,874 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-27 17:28:36,874 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-27 17:28:36,875 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835661028] [2020-10-27 17:28:36,875 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-27 17:28:36,876 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-27 17:28:36,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-27 17:28:36,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-27 17:28:36,877 INFO L87 Difference]: Start difference. First operand 1201 states and 1598 transitions. Second operand 7 states. [2020-10-27 17:28:38,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-27 17:28:38,919 INFO L93 Difference]: Finished difference Result 2281 states and 3119 transitions. [2020-10-27 17:28:38,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-27 17:28:38,921 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 218 [2020-10-27 17:28:38,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-27 17:28:38,929 INFO L225 Difference]: With dead ends: 2281 [2020-10-27 17:28:38,929 INFO L226 Difference]: Without dead ends: 1229 [2020-10-27 17:28:38,933 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2020-10-27 17:28:38,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2020-10-27 17:28:38,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 1197. [2020-10-27 17:28:38,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1197 states. [2020-10-27 17:28:38,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1197 states to 1197 states and 1422 transitions. [2020-10-27 17:28:38,998 INFO L78 Accepts]: Start accepts. Automaton has 1197 states and 1422 transitions. Word has length 218 [2020-10-27 17:28:38,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-27 17:28:38,998 INFO L481 AbstractCegarLoop]: Abstraction has 1197 states and 1422 transitions. [2020-10-27 17:28:38,998 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-27 17:28:38,998 INFO L276 IsEmpty]: Start isEmpty. Operand 1197 states and 1422 transitions. [2020-10-27 17:28:39,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2020-10-27 17:28:39,003 INFO L414 BasicCegarLoop]: Found error trace [2020-10-27 17:28:39,004 INFO L422 BasicCegarLoop]: trace histogram [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, 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] [2020-10-27 17:28:39,004 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-27 17:28:39,004 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-27 17:28:39,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-27 17:28:39,005 INFO L82 PathProgramCache]: Analyzing trace with hash 722464374, now seen corresponding path program 1 times [2020-10-27 17:28:39,005 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-27 17:28:39,006 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [716083552] [2020-10-27 17:28:39,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-27 17:28:39,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:28:39,106 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:28:39,320 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:28:39,559 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:28:39,559 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 237 [2020-10-27 17:28:39,559 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-27 17:28:39,559 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 491 [2020-10-27 17:28:39,560 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:28:39,560 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-27 17:28:39,560 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 89 [2020-10-27 17:28:39,560 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 26 [2020-10-27 17:28:39,561 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:28:39,668 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-27 17:28:39,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:28:39,671 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:28:39,676 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:28:39,676 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-27 17:28:39,676 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:28:39,676 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 5 [2020-10-27 17:28:39,676 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:28:39,676 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-27 17:28:39,676 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:28:39,677 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-27 17:28:39,677 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:28:39,696 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-27 17:28:39,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:28:39,721 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:28:39,791 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:28:39,791 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 80 [2020-10-27 17:28:39,791 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:28:39,791 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 79 [2020-10-27 17:28:39,792 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:28:39,792 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-27 17:28:39,792 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:28:39,792 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 74 [2020-10-27 17:28:39,792 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:28:39,838 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-10-27 17:28:39,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:28:39,888 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:28:39,982 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:28:40,240 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:28:40,241 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 118 [2020-10-27 17:28:40,241 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-27 17:28:40,241 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 371 [2020-10-27 17:28:40,241 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:28:40,241 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-27 17:28:40,241 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-27 17:28:40,241 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 118 [2020-10-27 17:28:40,242 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:28:40,634 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 114 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-27 17:28:40,635 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [716083552] [2020-10-27 17:28:40,635 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-27 17:28:40,635 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-10-27 17:28:40,635 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527029051] [2020-10-27 17:28:40,636 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-27 17:28:40,636 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-27 17:28:40,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-27 17:28:40,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-27 17:28:40,637 INFO L87 Difference]: Start difference. First operand 1197 states and 1422 transitions. Second operand 6 states. [2020-10-27 17:28:42,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-27 17:28:42,136 INFO L93 Difference]: Finished difference Result 2292 states and 2759 transitions. [2020-10-27 17:28:42,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-27 17:28:42,137 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 223 [2020-10-27 17:28:42,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-27 17:28:42,144 INFO L225 Difference]: With dead ends: 2292 [2020-10-27 17:28:42,144 INFO L226 Difference]: Without dead ends: 1221 [2020-10-27 17:28:42,147 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-10-27 17:28:42,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1221 states. [2020-10-27 17:28:42,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1221 to 1197. [2020-10-27 17:28:42,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1197 states. [2020-10-27 17:28:42,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1197 states to 1197 states and 1417 transitions. [2020-10-27 17:28:42,185 INFO L78 Accepts]: Start accepts. Automaton has 1197 states and 1417 transitions. Word has length 223 [2020-10-27 17:28:42,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-27 17:28:42,185 INFO L481 AbstractCegarLoop]: Abstraction has 1197 states and 1417 transitions. [2020-10-27 17:28:42,185 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-27 17:28:42,185 INFO L276 IsEmpty]: Start isEmpty. Operand 1197 states and 1417 transitions. [2020-10-27 17:28:42,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2020-10-27 17:28:42,190 INFO L414 BasicCegarLoop]: Found error trace [2020-10-27 17:28:42,191 INFO L422 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-10-27 17:28:42,191 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-27 17:28:42,191 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-27 17:28:42,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-27 17:28:42,192 INFO L82 PathProgramCache]: Analyzing trace with hash 2071165358, now seen corresponding path program 1 times [2020-10-27 17:28:42,192 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-27 17:28:42,192 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1838391286] [2020-10-27 17:28:42,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-27 17:28:42,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:28:42,302 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:28:42,697 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:28:42,698 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 273 [2020-10-27 17:28:42,698 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:28:42,698 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 438 [2020-10-27 17:28:42,698 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:28:42,698 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-27 17:28:42,698 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 125 [2020-10-27 17:28:42,699 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 120 [2020-10-27 17:28:42,699 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:28:42,814 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-27 17:28:42,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:28:42,818 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:28:42,822 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:28:42,823 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-27 17:28:42,823 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:28:42,823 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 5 [2020-10-27 17:28:42,823 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:28:42,823 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-27 17:28:42,823 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:28:42,824 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-27 17:28:42,824 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:28:42,838 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-27 17:28:42,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:28:42,887 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:28:42,996 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:28:42,996 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 116 [2020-10-27 17:28:42,997 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:28:42,997 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 129 [2020-10-27 17:28:42,997 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:28:42,997 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-27 17:28:42,997 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:28:42,997 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 110 [2020-10-27 17:28:42,997 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:28:43,033 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2020-10-27 17:28:43,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:28:43,074 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:28:43,235 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:28:43,236 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 118 [2020-10-27 17:28:43,236 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:28:43,236 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 177 [2020-10-27 17:28:43,236 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:28:43,236 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-27 17:28:43,236 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-27 17:28:43,237 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 118 [2020-10-27 17:28:43,237 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:28:43,518 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 150 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-27 17:28:43,519 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1838391286] [2020-10-27 17:28:43,519 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-27 17:28:43,519 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-27 17:28:43,521 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846115329] [2020-10-27 17:28:43,521 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-27 17:28:43,526 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-27 17:28:43,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-27 17:28:43,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-27 17:28:43,528 INFO L87 Difference]: Start difference. First operand 1197 states and 1417 transitions. Second operand 7 states. [2020-10-27 17:28:45,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-27 17:28:45,843 INFO L93 Difference]: Finished difference Result 2559 states and 3086 transitions. [2020-10-27 17:28:45,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-27 17:28:45,844 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 259 [2020-10-27 17:28:45,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-27 17:28:45,855 INFO L225 Difference]: With dead ends: 2559 [2020-10-27 17:28:45,855 INFO L226 Difference]: Without dead ends: 1511 [2020-10-27 17:28:45,859 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-10-27 17:28:45,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1511 states. [2020-10-27 17:28:45,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1511 to 1495. [2020-10-27 17:28:45,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1495 states. [2020-10-27 17:28:45,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1495 states to 1495 states and 1731 transitions. [2020-10-27 17:28:45,913 INFO L78 Accepts]: Start accepts. Automaton has 1495 states and 1731 transitions. Word has length 259 [2020-10-27 17:28:45,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-27 17:28:45,914 INFO L481 AbstractCegarLoop]: Abstraction has 1495 states and 1731 transitions. [2020-10-27 17:28:45,914 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-27 17:28:45,914 INFO L276 IsEmpty]: Start isEmpty. Operand 1495 states and 1731 transitions. [2020-10-27 17:28:45,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2020-10-27 17:28:45,920 INFO L414 BasicCegarLoop]: Found error trace [2020-10-27 17:28:45,921 INFO L422 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-10-27 17:28:45,921 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-27 17:28:45,921 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-27 17:28:45,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-27 17:28:45,922 INFO L82 PathProgramCache]: Analyzing trace with hash 817013972, now seen corresponding path program 1 times [2020-10-27 17:28:45,922 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-27 17:28:45,922 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [344615474] [2020-10-27 17:28:45,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-27 17:28:45,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-27 17:28:45,994 INFO L173 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-10-27 17:28:45,995 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-27 17:28:46,000 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-27 17:28:46,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.10 05:28:46 BoogieIcfgContainer [2020-10-27 17:28:46,044 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-27 17:28:46,047 INFO L168 Benchmark]: Toolchain (without parser) took 32327.92 ms. Allocated memory was 151.0 MB in the beginning and 512.8 MB in the end (delta: 361.8 MB). Free memory was 124.3 MB in the beginning and 252.0 MB in the end (delta: -127.8 MB). Peak memory consumption was 234.4 MB. Max. memory is 8.0 GB. [2020-10-27 17:28:46,047 INFO L168 Benchmark]: CDTParser took 0.67 ms. Allocated memory is still 151.0 MB. Free memory is still 124.5 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-10-27 17:28:46,048 INFO L168 Benchmark]: CACSL2BoogieTranslator took 739.87 ms. Allocated memory is still 151.0 MB. Free memory was 123.6 MB in the beginning and 97.0 MB in the end (delta: 26.7 MB). Peak memory consumption was 27.3 MB. Max. memory is 8.0 GB. [2020-10-27 17:28:46,049 INFO L168 Benchmark]: Boogie Preprocessor took 166.23 ms. Allocated memory is still 151.0 MB. Free memory was 97.0 MB in the beginning and 128.6 MB in the end (delta: -31.7 MB). Peak memory consumption was 5.0 MB. Max. memory is 8.0 GB. [2020-10-27 17:28:46,049 INFO L168 Benchmark]: RCFGBuilder took 1641.77 ms. Allocated memory was 151.0 MB in the beginning and 181.4 MB in the end (delta: 30.4 MB). Free memory was 128.6 MB in the beginning and 138.7 MB in the end (delta: -10.0 MB). Peak memory consumption was 84.9 MB. Max. memory is 8.0 GB. [2020-10-27 17:28:46,050 INFO L168 Benchmark]: TraceAbstraction took 29764.76 ms. Allocated memory was 181.4 MB in the beginning and 512.8 MB in the end (delta: 331.4 MB). Free memory was 138.1 MB in the beginning and 252.0 MB in the end (delta: -113.9 MB). Peak memory consumption was 217.4 MB. Max. memory is 8.0 GB. [2020-10-27 17:28:46,053 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.67 ms. Allocated memory is still 151.0 MB. Free memory is still 124.5 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 739.87 ms. Allocated memory is still 151.0 MB. Free memory was 123.6 MB in the beginning and 97.0 MB in the end (delta: 26.7 MB). Peak memory consumption was 27.3 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 166.23 ms. Allocated memory is still 151.0 MB. Free memory was 97.0 MB in the beginning and 128.6 MB in the end (delta: -31.7 MB). Peak memory consumption was 5.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1641.77 ms. Allocated memory was 151.0 MB in the beginning and 181.4 MB in the end (delta: 30.4 MB). Free memory was 128.6 MB in the beginning and 138.7 MB in the end (delta: -10.0 MB). Peak memory consumption was 84.9 MB. Max. memory is 8.0 GB. * TraceAbstraction took 29764.76 ms. Allocated memory was 181.4 MB in the beginning and 512.8 MB in the end (delta: 331.4 MB). Free memory was 138.1 MB in the beginning and 252.0 MB in the end (delta: -113.9 MB). Peak memory consumption was 217.4 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L9] int inputC = 3; [L10] int inputD = 4; [L11] int inputE = 5; [L12] int inputF = 6; [L13] int inputB = 2; [L16] int a1 = 23; [L17] int a19 = 9; [L18] int a10 = 0; [L19] int a12 = 0; [L20] int a4 = 14; [L581] int output = -1; [L584] COND TRUE 1 [L587] int input; [L588] input = __VERIFIER_nondet_int() [L589] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L592] CALL, EXPR calculate_output(input) [L23] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L26] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L29] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L32] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L35] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L38] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L41] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L44] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L47] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L50] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L53] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L56] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L59] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L62] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L65] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L68] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L71] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L74] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L77] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L80] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L83] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L86] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L89] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L92] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L95] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L98] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L101] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L104] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L107] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L110] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L113] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L116] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L119] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L122] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L125] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L128] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L131] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L134] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L137] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L140] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L143] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L146] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L149] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L152] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L155] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L158] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L161] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L164] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L167] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L170] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L173] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L176] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L179] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L182] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L185] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L188] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L191] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L194] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L197] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L200] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L203] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L207] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L212] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) [L217] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) [L222] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) [L227] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) [L233] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) [L238] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) [L241] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) [L246] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) [L251] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) [L256] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) [L262] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) [L267] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) [L273] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) [L279] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) [L285] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) [L288] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) [L293] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) [L298] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) [L303] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) [L308] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) [L314] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) [L319] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) [L322] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) [L325] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) [L328] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) [L331] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) [L337] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) [L342] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) [L347] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) [L353] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) [L356] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) [L359] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) [L362] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) [L367] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0))))) [L372] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) [L377] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) [L380] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) [L385] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) [L390] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0))))) [L395] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) [L400] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) [L405] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14))) [L410] COND FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))) [L416] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14))) [L421] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10)))))) [L427] COND FALSE !(((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0))) [L432] COND FALSE !((((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 6)) && (a19==10))) && (a12==0))) [L438] COND FALSE !(((a19==9) && ((((input == 4) && (( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 ))) && (a12==0)) && (a4==14)))) [L444] COND FALSE !((((a19==10) && ((a12==0) && ((((a10==1) && a1 <= -13 ) || (( ((38 < a1) && (218 >= a1)) && (a10==0)) || ((a10==0) && 218 < a1 ))) && (input == 3)))) && (a4==14))) [L450] COND FALSE !(((a19==9) && (((a4==14) && ((((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4))) && (input == 5))) && (a12==0)))) [L456] COND FALSE !((((a12==0) && ((((input == 5) && (a19==10)) && ((38 < a1) && (218 >= a1)) ) && (a4==14))) && (a10==1))) [L462] COND FALSE !(((a19==9) && ((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3)) && (a10==1)) && (a12==0))))) [L467] COND FALSE !(((a10==0) && ((a12==0) && ((((input == 5) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a4==14))))) [L473] COND FALSE !(( 218 < a1 && (((((input == 3) && (a10==1)) && (a12==0)) && (a4==14)) && (a19==10)))) [L478] COND FALSE !((((a12==0) && ((a19==9) && (((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a4==14)))) && (a10==3))) [L483] COND FALSE !((((((a4==14) && ( ((38 < a1) && (218 >= a1)) && (input == 2))) && (a12==0)) && (a10==1)) && (a19==10))) [L489] COND FALSE !((((a19==10) && ((a10==1) && ((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (input == 5))))) && (a4==14))) [L495] COND FALSE !(((((a10==1) && (((input == 5) && 218 < a1 ) && (a4==14))) && (a19==10)) && (a12==0))) [L501] COND FALSE !((((a4==14) && ((a19==9) && ((input == 2) && (((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 ))))) && (a12==0))) [L506] COND FALSE !((((a4==14) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 2))) && (a12==0))) && (a10==4))) [L511] COND FALSE !(((a4==14) && (((a19==9) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 6)) && (a10==3))) && (a12==0)))) [L516] COND FALSE !((((a4==14) && ((((input == 6) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a12==0))) && (a10==0))) [L519] COND FALSE !(((a12==0) && ((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 2)) && (a19==10))))) [L525] COND FALSE !((((a12==0) && ((a19==9) && ((a10==2) && ((input == 6) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))))) && (a4==14))) [L528] COND TRUE ((a4==14) && ((a19==9) && ((a12==0) && (((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0))))) [L529] a1 = (((a1 * 5) + 278443) - -239546) [L530] return 26; [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 TRUE ((a19==9) && ((((input == 4) && (( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 ))) && (a12==0)) && (a4==14))) [L439] a1 = (((((a1 / 5) % 89)- -128) / 5) + 34) [L440] a10 = 0 [L441] a19 = 8 [L443] return -1; [L592] RET, EXPR calculate_output(input) [L592] output = calculate_output(input) [L584] COND TRUE 1 [L587] int input; [L588] input = __VERIFIER_nondet_int() [L589] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L592] CALL calculate_output(input) [L23] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L26] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L29] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L32] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L35] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L38] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L41] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L44] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L47] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L50] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L53] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L56] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L59] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L62] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L65] COND TRUE (((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8)) [L66] CALL reach_error() [L4] __assert_fail("0", "Problem10_label41.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: 29.6s, OverallIterations: 10, TraceHistogramMax: 3, AutomataDifference: 17.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 241 SDtfs, 3000 SDslu, 250 SDs, 0 SdLazy, 7403 SolverSat, 961 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 125 GetRequests, 64 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1495occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 9 MinimizatonAttempts, 319 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 10.2s InterpolantComputationTime, 1707 NumberOfCodeBlocks, 1707 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1420 ConstructedInterpolants, 0 QuantifiedInterpolants, 1245562 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 2 PerfectInterpolantSequences, 488/566 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...