/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.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 SingleStatement --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=1000 --traceabstraction.additional.smt.options interpolation-heuristic=SMALLEST --traceabstraction.additional.smt.options log-additional-information=true -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem10_label55.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-c90d42b [2020-09-24 19:30:12,520 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-24 19:30:12,523 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-24 19:30:12,550 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-24 19:30:12,550 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-24 19:30:12,552 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-24 19:30:12,553 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-24 19:30:12,556 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-24 19:30:12,557 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-24 19:30:12,559 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-24 19:30:12,560 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-24 19:30:12,561 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-24 19:30:12,562 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-24 19:30:12,563 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-24 19:30:12,564 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-24 19:30:12,566 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-24 19:30:12,567 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-24 19:30:12,568 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-24 19:30:12,570 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-24 19:30:12,573 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-24 19:30:12,574 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-24 19:30:12,576 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-24 19:30:12,577 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-24 19:30:12,579 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-24 19:30:12,581 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-24 19:30:12,582 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-24 19:30:12,582 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-24 19:30:12,583 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-24 19:30:12,584 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-24 19:30:12,585 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-24 19:30:12,585 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-24 19:30:12,586 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-24 19:30:12,587 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-24 19:30:12,588 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-24 19:30:12,589 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-24 19:30:12,590 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-24 19:30:12,591 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-24 19:30:12,591 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-24 19:30:12,591 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-24 19:30:12,592 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-24 19:30:12,593 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-24 19:30:12,594 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-09-24 19:30:12,623 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-24 19:30:12,623 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-24 19:30:12,625 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-09-24 19:30:12,625 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-09-24 19:30:12,625 INFO L138 SettingsManager]: * Use SBE=true [2020-09-24 19:30:12,625 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-24 19:30:12,625 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-24 19:30:12,626 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-24 19:30:12,626 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-24 19:30:12,626 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-24 19:30:12,626 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-24 19:30:12,626 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-24 19:30:12,627 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-24 19:30:12,627 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-24 19:30:12,627 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-24 19:30:12,627 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-24 19:30:12,627 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-24 19:30:12,628 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-24 19:30:12,628 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-09-24 19:30:12,628 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-24 19:30:12,628 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-24 19:30:12,629 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-24 19:30:12,629 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-24 19:30:12,629 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-09-24 19:30:12,629 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-09-24 19:30:12,629 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-09-24 19:30:12,630 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-09-24 19:30:12,630 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-24 19:30:12,630 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-09-24 19:30:12,630 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> SingleStatement 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=1000;interpolation-heuristic=SMALLEST;log-additional-information=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=1000;interpolation-heuristic=SMALLEST;log-additional-information=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=1000;interpolation-heuristic=SMALLEST;log-additional-information=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=1000;interpolation-heuristic=SMALLEST;log-additional-information=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=1000;interpolation-heuristic=SMALLEST;log-additional-information=true; [2020-09-24 19:30:13,140 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-24 19:30:13,165 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-24 19:30:13,171 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-24 19:30:13,174 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-24 19:30:13,176 INFO L275 PluginConnector]: CDTParser initialized [2020-09-24 19:30:13,177 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label55.c [2020-09-24 19:30:13,253 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/cd0ddffdd/4e9a20a82d2944328d9c687971ad7b77/FLAGf60142db0 [2020-09-24 19:30:13,939 INFO L306 CDTParser]: Found 1 translation units. [2020-09-24 19:30:13,940 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/eca-rers2012/Problem10_label55.c [2020-09-24 19:30:13,955 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/cd0ddffdd/4e9a20a82d2944328d9c687971ad7b77/FLAGf60142db0 [2020-09-24 19:30:14,210 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/cd0ddffdd/4e9a20a82d2944328d9c687971ad7b77 [2020-09-24 19:30:14,228 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-24 19:30:14,234 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-24 19:30:14,238 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-24 19:30:14,239 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-24 19:30:14,243 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-24 19:30:14,244 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.09 07:30:14" (1/1) ... [2020-09-24 19:30:14,250 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25557aa5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 07:30:14, skipping insertion in model container [2020-09-24 19:30:14,250 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.09 07:30:14" (1/1) ... [2020-09-24 19:30:14,262 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-24 19:30:14,341 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-24 19:30:15,007 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-24 19:30:15,013 INFO L203 MainTranslator]: Completed pre-run [2020-09-24 19:30:15,132 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-24 19:30:15,151 INFO L208 MainTranslator]: Completed translation [2020-09-24 19:30:15,152 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 07:30:15 WrapperNode [2020-09-24 19:30:15,152 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-24 19:30:15,153 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-24 19:30:15,153 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-24 19:30:15,153 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-24 19:30:15,174 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 07:30:15" (1/1) ... [2020-09-24 19:30:15,174 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 07:30:15" (1/1) ... [2020-09-24 19:30:15,194 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 07:30:15" (1/1) ... [2020-09-24 19:30:15,195 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 07:30:15" (1/1) ... [2020-09-24 19:30:15,248 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 07:30:15" (1/1) ... [2020-09-24 19:30:15,268 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 07:30:15" (1/1) ... [2020-09-24 19:30:15,281 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 07:30:15" (1/1) ... [2020-09-24 19:30:15,298 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-24 19:30:15,299 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-24 19:30:15,299 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-24 19:30:15,299 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-24 19:30:15,301 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 07:30:15" (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-09-24 19:30:15,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-24 19:30:15,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-24 19:30:15,410 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2020-09-24 19:30:15,411 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-24 19:30:15,411 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2020-09-24 19:30:15,411 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-24 19:30:15,411 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-24 19:30:15,411 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-09-24 19:30:15,412 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-24 19:30:15,412 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-24 19:30:15,412 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-24 19:30:16,941 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-24 19:30:16,941 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-09-24 19:30:16,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.09 07:30:16 BoogieIcfgContainer [2020-09-24 19:30:16,951 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-24 19:30:16,952 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-24 19:30:16,952 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-24 19:30:16,957 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-24 19:30:16,957 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.09 07:30:14" (1/3) ... [2020-09-24 19:30:16,959 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69833e7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.09 07:30:16, skipping insertion in model container [2020-09-24 19:30:16,959 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 07:30:15" (2/3) ... [2020-09-24 19:30:16,960 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69833e7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.09 07:30:16, skipping insertion in model container [2020-09-24 19:30:16,960 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.09 07:30:16" (3/3) ... [2020-09-24 19:30:16,962 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem10_label55.c [2020-09-24 19:30:16,976 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-24 19:30:16,988 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-24 19:30:17,012 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-24 19:30:17,048 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-24 19:30:17,048 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-24 19:30:17,048 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-24 19:30:17,049 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-24 19:30:17,049 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-24 19:30:17,049 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-24 19:30:17,049 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-24 19:30:17,049 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-24 19:30:17,082 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states. [2020-09-24 19:30:17,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-09-24 19:30:17,091 INFO L414 BasicCegarLoop]: Found error trace [2020-09-24 19:30:17,093 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-24 19:30:17,094 INFO L427 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-24 19:30:17,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-24 19:30:17,102 INFO L82 PathProgramCache]: Analyzing trace with hash -18090369, now seen corresponding path program 1 times [2020-09-24 19:30:17,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-24 19:30:17,115 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [731459065] [2020-09-24 19:30:17,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-24 19:30:17,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 19:30:17,330 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-24 19:30:17,572 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-24 19:30:17,623 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-24 19:30:17,942 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-24 19:30:17,943 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 46 [2020-09-24 19:30:17,943 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 3 [2020-09-24 19:30:17,944 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 649 [2020-09-24 19:30:17,948 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-24 19:30:17,949 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-09-24 19:30:17,949 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 12 [2020-09-24 19:30:17,950 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 33 [2020-09-24 19:30:17,950 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 5 [2020-09-24 19:30:18,047 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-24 19:30:18,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 19:30:18,060 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-24 19:30:18,077 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-24 19:30:18,078 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 18 [2020-09-24 19:30:18,078 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-24 19:30:18,078 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 20 [2020-09-24 19:30:18,079 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-24 19:30:18,079 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-24 19:30:18,079 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-24 19:30:18,080 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 8 [2020-09-24 19:30:18,080 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-24 19:30:18,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-24 19:30:18,101 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [731459065] [2020-09-24 19:30:18,104 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-24 19:30:18,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-09-24 19:30:18,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625209063] [2020-09-24 19:30:18,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-09-24 19:30:18,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-24 19:30:18,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-09-24 19:30:18,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-09-24 19:30:18,140 INFO L87 Difference]: Start difference. First operand 456 states. Second operand 4 states. [2020-09-24 19:30:20,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-24 19:30:20,182 INFO L93 Difference]: Finished difference Result 1069 states and 1495 transitions. [2020-09-24 19:30:20,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-24 19:30:20,185 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2020-09-24 19:30:20,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-24 19:30:20,211 INFO L225 Difference]: With dead ends: 1069 [2020-09-24 19:30:20,211 INFO L226 Difference]: Without dead ends: 555 [2020-09-24 19:30:20,222 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-09-24 19:30:20,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2020-09-24 19:30:20,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 543. [2020-09-24 19:30:20,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543 states. [2020-09-24 19:30:20,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 670 transitions. [2020-09-24 19:30:20,378 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 670 transitions. Word has length 37 [2020-09-24 19:30:20,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-24 19:30:20,379 INFO L479 AbstractCegarLoop]: Abstraction has 543 states and 670 transitions. [2020-09-24 19:30:20,380 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-09-24 19:30:20,381 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 670 transitions. [2020-09-24 19:30:20,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2020-09-24 19:30:20,396 INFO L414 BasicCegarLoop]: Found error trace [2020-09-24 19:30:20,396 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-24 19:30:20,401 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-24 19:30:20,401 INFO L427 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-24 19:30:20,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-24 19:30:20,403 INFO L82 PathProgramCache]: Analyzing trace with hash 916079797, now seen corresponding path program 1 times [2020-09-24 19:30:20,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-24 19:30:20,403 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [950236821] [2020-09-24 19:30:20,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-24 19:30:20,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 19:30:20,490 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-24 19:30:20,614 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-24 19:30:20,955 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-24 19:30:21,060 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-24 19:30:21,470 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-24 19:30:21,471 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 128 [2020-09-24 19:30:21,471 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 4 [2020-09-24 19:30:21,471 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1011 [2020-09-24 19:30:21,471 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-24 19:30:21,472 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-24 19:30:21,472 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 97 [2020-09-24 19:30:21,472 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 30 [2020-09-24 19:30:21,472 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-24 19:30:21,536 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-24 19:30:21,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 19:30:21,542 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-24 19:30:21,550 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-24 19:30:21,550 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 18 [2020-09-24 19:30:21,551 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-24 19:30:21,551 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 9 [2020-09-24 19:30:21,551 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-24 19:30:21,551 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-09-24 19:30:21,552 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-24 19:30:21,552 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-09-24 19:30:21,552 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-24 19:30:21,568 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-24 19:30:21,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 19:30:21,601 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-24 19:30:21,645 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-24 19:30:21,645 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 76 [2020-09-24 19:30:21,645 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-24 19:30:21,646 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 59 [2020-09-24 19:30:21,646 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-24 19:30:21,646 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-24 19:30:21,646 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-24 19:30:21,647 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 68 [2020-09-24 19:30:21,647 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-24 19:30:21,717 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-24 19:30:21,717 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [950236821] [2020-09-24 19:30:21,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-24 19:30:21,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-09-24 19:30:21,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526127209] [2020-09-24 19:30:21,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-24 19:30:21,721 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-24 19:30:21,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-24 19:30:21,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-24 19:30:21,721 INFO L87 Difference]: Start difference. First operand 543 states and 670 transitions. Second operand 5 states. [2020-09-24 19:30:23,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-24 19:30:23,628 INFO L93 Difference]: Finished difference Result 1235 states and 1577 transitions. [2020-09-24 19:30:23,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-24 19:30:23,628 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 117 [2020-09-24 19:30:23,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-24 19:30:23,635 INFO L225 Difference]: With dead ends: 1235 [2020-09-24 19:30:23,635 INFO L226 Difference]: Without dead ends: 707 [2020-09-24 19:30:23,638 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-09-24 19:30:23,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2020-09-24 19:30:23,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 697. [2020-09-24 19:30:23,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2020-09-24 19:30:23,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 855 transitions. [2020-09-24 19:30:23,692 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 855 transitions. Word has length 117 [2020-09-24 19:30:23,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-24 19:30:23,696 INFO L479 AbstractCegarLoop]: Abstraction has 697 states and 855 transitions. [2020-09-24 19:30:23,696 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-24 19:30:23,696 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 855 transitions. [2020-09-24 19:30:23,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2020-09-24 19:30:23,704 INFO L414 BasicCegarLoop]: Found error trace [2020-09-24 19:30:23,705 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-24 19:30:23,705 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-24 19:30:23,705 INFO L427 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-24 19:30:23,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-24 19:30:23,706 INFO L82 PathProgramCache]: Analyzing trace with hash 804111666, now seen corresponding path program 1 times [2020-09-24 19:30:23,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-24 19:30:23,706 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [712958135] [2020-09-24 19:30:23,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-24 19:30:23,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 19:30:23,802 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-24 19:30:23,906 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-24 19:30:24,006 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-24 19:30:24,242 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-24 19:30:24,782 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-24 19:30:24,783 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 137 [2020-09-24 19:30:24,783 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 4 [2020-09-24 19:30:24,783 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1022 [2020-09-24 19:30:24,783 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-24 19:30:24,784 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-24 19:30:24,784 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 105 [2020-09-24 19:30:24,784 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 31 [2020-09-24 19:30:24,784 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-24 19:30:24,847 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-24 19:30:24,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 19:30:24,852 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-24 19:30:24,861 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-24 19:30:24,861 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 18 [2020-09-24 19:30:24,861 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-24 19:30:24,862 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 10 [2020-09-24 19:30:24,862 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-24 19:30:24,862 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-09-24 19:30:24,862 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-24 19:30:24,863 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-09-24 19:30:24,863 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-24 19:30:24,889 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-24 19:30:24,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 19:30:24,937 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-24 19:30:25,039 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-24 19:30:25,040 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 85 [2020-09-24 19:30:25,040 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-24 19:30:25,041 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 130 [2020-09-24 19:30:25,041 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-24 19:30:25,041 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-24 19:30:25,042 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-24 19:30:25,042 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 76 [2020-09-24 19:30:25,042 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-24 19:30:25,143 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-24 19:30:25,143 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [712958135] [2020-09-24 19:30:25,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-24 19:30:25,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-09-24 19:30:25,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427194874] [2020-09-24 19:30:25,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-24 19:30:25,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-24 19:30:25,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-24 19:30:25,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-24 19:30:25,147 INFO L87 Difference]: Start difference. First operand 697 states and 855 transitions. Second operand 5 states. [2020-09-24 19:30:27,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-24 19:30:27,056 INFO L93 Difference]: Finished difference Result 1875 states and 2393 transitions. [2020-09-24 19:30:27,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-24 19:30:27,057 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 126 [2020-09-24 19:30:27,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-24 19:30:27,069 INFO L225 Difference]: With dead ends: 1875 [2020-09-24 19:30:27,070 INFO L226 Difference]: Without dead ends: 1193 [2020-09-24 19:30:27,073 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-09-24 19:30:27,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2020-09-24 19:30:27,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 1153. [2020-09-24 19:30:27,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1153 states. [2020-09-24 19:30:27,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 1406 transitions. [2020-09-24 19:30:27,130 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 1406 transitions. Word has length 126 [2020-09-24 19:30:27,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-24 19:30:27,132 INFO L479 AbstractCegarLoop]: Abstraction has 1153 states and 1406 transitions. [2020-09-24 19:30:27,132 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-24 19:30:27,132 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 1406 transitions. [2020-09-24 19:30:27,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2020-09-24 19:30:27,135 INFO L414 BasicCegarLoop]: Found error trace [2020-09-24 19:30:27,135 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-24 19:30:27,135 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-24 19:30:27,136 INFO L427 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-24 19:30:27,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-24 19:30:27,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1709305720, now seen corresponding path program 1 times [2020-09-24 19:30:27,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-24 19:30:27,137 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [225400695] [2020-09-24 19:30:27,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-24 19:30:27,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 19:30:27,228 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-24 19:30:27,363 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-24 19:30:27,717 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-24 19:30:28,200 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-24 19:30:28,200 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 146 [2020-09-24 19:30:28,200 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 3 [2020-09-24 19:30:28,201 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1013 [2020-09-24 19:30:28,201 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-24 19:30:28,201 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-24 19:30:28,201 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 114 [2020-09-24 19:30:28,202 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 31 [2020-09-24 19:30:28,202 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-24 19:30:28,272 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-24 19:30:28,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 19:30:28,279 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-24 19:30:28,286 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-24 19:30:28,287 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 18 [2020-09-24 19:30:28,287 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-24 19:30:28,287 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 9 [2020-09-24 19:30:28,287 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-24 19:30:28,288 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-09-24 19:30:28,288 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-24 19:30:28,288 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-09-24 19:30:28,288 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-24 19:30:28,303 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-24 19:30:28,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 19:30:28,340 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-24 19:30:28,423 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-24 19:30:28,424 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 94 [2020-09-24 19:30:28,424 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-24 19:30:28,424 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 100 [2020-09-24 19:30:28,424 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-24 19:30:28,424 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-24 19:30:28,425 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-24 19:30:28,425 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 85 [2020-09-24 19:30:28,425 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-24 19:30:28,479 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-24 19:30:28,480 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [225400695] [2020-09-24 19:30:28,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-24 19:30:28,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-09-24 19:30:28,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464238817] [2020-09-24 19:30:28,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-24 19:30:28,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-24 19:30:28,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-24 19:30:28,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-24 19:30:28,483 INFO L87 Difference]: Start difference. First operand 1153 states and 1406 transitions. Second operand 5 states. [2020-09-24 19:30:30,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-24 19:30:30,533 INFO L93 Difference]: Finished difference Result 3103 states and 3921 transitions. [2020-09-24 19:30:30,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-24 19:30:30,534 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 135 [2020-09-24 19:30:30,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-24 19:30:30,549 INFO L225 Difference]: With dead ends: 3103 [2020-09-24 19:30:30,549 INFO L226 Difference]: Without dead ends: 1965 [2020-09-24 19:30:30,554 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-09-24 19:30:30,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1965 states. [2020-09-24 19:30:30,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1965 to 1916. [2020-09-24 19:30:30,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1916 states. [2020-09-24 19:30:30,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1916 states to 1916 states and 2319 transitions. [2020-09-24 19:30:30,625 INFO L78 Accepts]: Start accepts. Automaton has 1916 states and 2319 transitions. Word has length 135 [2020-09-24 19:30:30,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-24 19:30:30,625 INFO L479 AbstractCegarLoop]: Abstraction has 1916 states and 2319 transitions. [2020-09-24 19:30:30,625 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-24 19:30:30,626 INFO L276 IsEmpty]: Start isEmpty. Operand 1916 states and 2319 transitions. [2020-09-24 19:30:30,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2020-09-24 19:30:30,629 INFO L414 BasicCegarLoop]: Found error trace [2020-09-24 19:30:30,629 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-24 19:30:30,629 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-24 19:30:30,630 INFO L427 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-24 19:30:30,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-24 19:30:30,630 INFO L82 PathProgramCache]: Analyzing trace with hash -844817794, now seen corresponding path program 1 times [2020-09-24 19:30:30,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-24 19:30:30,632 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [356383861] [2020-09-24 19:30:30,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-24 19:30:30,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 19:30:30,701 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-24 19:30:30,985 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-24 19:30:31,051 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-24 19:30:31,239 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-24 19:30:31,682 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-24 19:30:31,682 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 156 [2020-09-24 19:30:31,682 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 4 [2020-09-24 19:30:31,683 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1012 [2020-09-24 19:30:31,683 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-24 19:30:31,683 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-24 19:30:31,684 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 123 [2020-09-24 19:30:31,684 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 32 [2020-09-24 19:30:31,684 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-24 19:30:31,826 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-24 19:30:31,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 19:30:31,830 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-24 19:30:31,837 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-24 19:30:31,837 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 18 [2020-09-24 19:30:31,838 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-24 19:30:31,838 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 8 [2020-09-24 19:30:31,838 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-24 19:30:31,838 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-09-24 19:30:31,838 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-24 19:30:31,839 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-09-24 19:30:31,839 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-24 19:30:31,851 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-24 19:30:31,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 19:30:31,892 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-24 19:30:31,969 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-24 19:30:31,969 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 104 [2020-09-24 19:30:31,970 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-24 19:30:31,970 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 97 [2020-09-24 19:30:31,970 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-24 19:30:31,970 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-24 19:30:31,970 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-24 19:30:31,971 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 94 [2020-09-24 19:30:31,971 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-24 19:30:32,020 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-24 19:30:32,020 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [356383861] [2020-09-24 19:30:32,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-24 19:30:32,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-09-24 19:30:32,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423530864] [2020-09-24 19:30:32,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-24 19:30:32,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-24 19:30:32,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-24 19:30:32,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-24 19:30:32,022 INFO L87 Difference]: Start difference. First operand 1916 states and 2319 transitions. Second operand 5 states. [2020-09-24 19:30:34,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-24 19:30:34,385 INFO L93 Difference]: Finished difference Result 4678 states and 5797 transitions. [2020-09-24 19:30:34,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-24 19:30:34,386 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 145 [2020-09-24 19:30:34,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-24 19:30:34,401 INFO L225 Difference]: With dead ends: 4678 [2020-09-24 19:30:34,401 INFO L226 Difference]: Without dead ends: 2777 [2020-09-24 19:30:34,408 INFO L675 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-09-24 19:30:34,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2777 states. [2020-09-24 19:30:34,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2777 to 2714. [2020-09-24 19:30:34,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2714 states. [2020-09-24 19:30:34,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2714 states to 2714 states and 3348 transitions. [2020-09-24 19:30:34,489 INFO L78 Accepts]: Start accepts. Automaton has 2714 states and 3348 transitions. Word has length 145 [2020-09-24 19:30:34,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-24 19:30:34,490 INFO L479 AbstractCegarLoop]: Abstraction has 2714 states and 3348 transitions. [2020-09-24 19:30:34,490 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-24 19:30:34,490 INFO L276 IsEmpty]: Start isEmpty. Operand 2714 states and 3348 transitions. [2020-09-24 19:30:34,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2020-09-24 19:30:34,494 INFO L414 BasicCegarLoop]: Found error trace [2020-09-24 19:30:34,494 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-24 19:30:34,495 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-24 19:30:34,495 INFO L427 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-24 19:30:34,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-24 19:30:34,495 INFO L82 PathProgramCache]: Analyzing trace with hash -720151569, now seen corresponding path program 1 times [2020-09-24 19:30:34,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-24 19:30:34,496 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1393439372] [2020-09-24 19:30:34,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-24 19:30:34,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 19:30:34,577 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-24 19:30:34,657 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-24 19:30:34,945 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-24 19:30:35,549 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-24 19:30:35,549 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 175 [2020-09-24 19:30:35,549 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 3 [2020-09-24 19:30:35,550 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1011 [2020-09-24 19:30:35,550 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-24 19:30:35,550 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-24 19:30:35,550 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 142 [2020-09-24 19:30:35,550 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 32 [2020-09-24 19:30:35,551 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-24 19:30:35,640 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-24 19:30:35,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 19:30:35,644 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-24 19:30:35,652 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-24 19:30:35,653 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 18 [2020-09-24 19:30:35,653 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-24 19:30:35,653 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 10 [2020-09-24 19:30:35,654 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-24 19:30:35,654 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-09-24 19:30:35,654 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-24 19:30:35,654 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-09-24 19:30:35,654 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-24 19:30:35,670 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-24 19:30:35,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 19:30:35,728 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-24 19:30:35,840 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-24 19:30:35,840 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 123 [2020-09-24 19:30:35,840 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-24 19:30:35,840 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 139 [2020-09-24 19:30:35,841 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-24 19:30:35,841 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-24 19:30:35,841 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-24 19:30:35,841 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 113 [2020-09-24 19:30:35,842 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-24 19:30:35,963 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-24 19:30:35,964 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1393439372] [2020-09-24 19:30:35,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-24 19:30:35,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-09-24 19:30:35,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978708300] [2020-09-24 19:30:35,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-24 19:30:35,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-24 19:30:35,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-24 19:30:35,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-24 19:30:35,966 INFO L87 Difference]: Start difference. First operand 2714 states and 3348 transitions. Second operand 5 states. [2020-09-24 19:30:38,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-24 19:30:38,235 INFO L93 Difference]: Finished difference Result 6125 states and 7696 transitions. [2020-09-24 19:30:38,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-24 19:30:38,236 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 164 [2020-09-24 19:30:38,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-24 19:30:38,254 INFO L225 Difference]: With dead ends: 6125 [2020-09-24 19:30:38,255 INFO L226 Difference]: Without dead ends: 3426 [2020-09-24 19:30:38,264 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-09-24 19:30:38,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3426 states. [2020-09-24 19:30:38,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3426 to 3365. [2020-09-24 19:30:38,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3365 states. [2020-09-24 19:30:38,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3365 states to 3365 states and 4225 transitions. [2020-09-24 19:30:38,360 INFO L78 Accepts]: Start accepts. Automaton has 3365 states and 4225 transitions. Word has length 164 [2020-09-24 19:30:38,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-24 19:30:38,361 INFO L479 AbstractCegarLoop]: Abstraction has 3365 states and 4225 transitions. [2020-09-24 19:30:38,361 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-24 19:30:38,361 INFO L276 IsEmpty]: Start isEmpty. Operand 3365 states and 4225 transitions. [2020-09-24 19:30:38,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2020-09-24 19:30:38,365 INFO L414 BasicCegarLoop]: Found error trace [2020-09-24 19:30:38,365 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-24 19:30:38,365 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-24 19:30:38,366 INFO L427 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-24 19:30:38,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-24 19:30:38,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1789909959, now seen corresponding path program 1 times [2020-09-24 19:30:38,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-24 19:30:38,366 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [769711052] [2020-09-24 19:30:38,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-24 19:30:38,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 19:30:38,441 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-24 19:30:38,511 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-24 19:30:38,755 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-24 19:30:38,959 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-24 19:30:39,056 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-24 19:30:39,421 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-24 19:30:39,421 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 177 [2020-09-24 19:30:39,422 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 5 [2020-09-24 19:30:39,422 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1016 [2020-09-24 19:30:39,422 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-24 19:30:39,422 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-24 19:30:39,423 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 144 [2020-09-24 19:30:39,423 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 32 [2020-09-24 19:30:39,423 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-24 19:30:39,500 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-24 19:30:39,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 19:30:39,504 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-24 19:30:39,512 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-24 19:30:39,512 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 18 [2020-09-24 19:30:39,512 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-24 19:30:39,512 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 9 [2020-09-24 19:30:39,513 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-24 19:30:39,513 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-09-24 19:30:39,513 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-24 19:30:39,513 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-09-24 19:30:39,513 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-24 19:30:39,527 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-24 19:30:39,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 19:30:39,579 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-24 19:30:39,706 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-24 19:30:39,706 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 125 [2020-09-24 19:30:39,706 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-24 19:30:39,707 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 150 [2020-09-24 19:30:39,707 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-24 19:30:39,707 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-24 19:30:39,707 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-24 19:30:39,708 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 115 [2020-09-24 19:30:39,708 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-24 19:30:39,806 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-24 19:30:39,806 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [769711052] [2020-09-24 19:30:39,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-24 19:30:39,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-09-24 19:30:39,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970606956] [2020-09-24 19:30:39,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-24 19:30:39,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-24 19:30:39,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-24 19:30:39,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-24 19:30:39,813 INFO L87 Difference]: Start difference. First operand 3365 states and 4225 transitions. Second operand 5 states. [2020-09-24 19:30:41,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-24 19:30:41,443 INFO L93 Difference]: Finished difference Result 4493 states and 5771 transitions. [2020-09-24 19:30:41,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-24 19:30:41,445 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 166 [2020-09-24 19:30:41,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-24 19:30:41,469 INFO L225 Difference]: With dead ends: 4493 [2020-09-24 19:30:41,470 INFO L226 Difference]: Without dead ends: 4491 [2020-09-24 19:30:41,475 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-09-24 19:30:41,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4491 states. [2020-09-24 19:30:41,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4491 to 3677. [2020-09-24 19:30:41,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3677 states. [2020-09-24 19:30:41,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3677 states to 3677 states and 4703 transitions. [2020-09-24 19:30:41,586 INFO L78 Accepts]: Start accepts. Automaton has 3677 states and 4703 transitions. Word has length 166 [2020-09-24 19:30:41,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-24 19:30:41,587 INFO L479 AbstractCegarLoop]: Abstraction has 3677 states and 4703 transitions. [2020-09-24 19:30:41,587 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-24 19:30:41,587 INFO L276 IsEmpty]: Start isEmpty. Operand 3677 states and 4703 transitions. [2020-09-24 19:30:41,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2020-09-24 19:30:41,592 INFO L414 BasicCegarLoop]: Found error trace [2020-09-24 19:30:41,593 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-24 19:30:41,593 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-24 19:30:41,593 INFO L427 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-24 19:30:41,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-24 19:30:41,593 INFO L82 PathProgramCache]: Analyzing trace with hash -375587405, now seen corresponding path program 1 times [2020-09-24 19:30:41,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-24 19:30:41,594 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1885538959] [2020-09-24 19:30:41,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-24 19:30:41,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 19:30:41,681 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-24 19:30:41,999 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-24 19:30:42,664 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-24 19:30:42,664 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 194 [2020-09-24 19:30:42,665 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-09-24 19:30:42,665 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1024 [2020-09-24 19:30:42,665 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-24 19:30:42,665 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-24 19:30:42,665 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 162 [2020-09-24 19:30:42,666 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 31 [2020-09-24 19:30:42,666 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-24 19:30:42,740 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-24 19:30:42,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 19:30:42,744 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-24 19:30:42,751 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-24 19:30:42,752 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 18 [2020-09-24 19:30:42,752 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-24 19:30:42,752 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 8 [2020-09-24 19:30:42,752 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-24 19:30:42,753 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-09-24 19:30:42,753 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-24 19:30:42,753 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-09-24 19:30:42,753 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-24 19:30:42,766 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-24 19:30:42,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 19:30:42,833 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-24 19:30:42,937 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-24 19:30:42,938 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 142 [2020-09-24 19:30:42,938 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-24 19:30:42,938 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 141 [2020-09-24 19:30:42,939 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-24 19:30:42,939 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-24 19:30:42,939 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-24 19:30:42,940 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 133 [2020-09-24 19:30:42,940 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-24 19:30:43,122 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-24 19:30:43,122 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1885538959] [2020-09-24 19:30:43,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-24 19:30:43,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-09-24 19:30:43,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8724539] [2020-09-24 19:30:43,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-24 19:30:43,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-24 19:30:43,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-24 19:30:43,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-09-24 19:30:43,125 INFO L87 Difference]: Start difference. First operand 3677 states and 4703 transitions. Second operand 6 states. [2020-09-24 19:30:45,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-24 19:30:45,823 INFO L93 Difference]: Finished difference Result 9061 states and 12087 transitions. [2020-09-24 19:30:45,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-24 19:30:45,825 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 183 [2020-09-24 19:30:45,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-24 19:30:45,853 INFO L225 Difference]: With dead ends: 9061 [2020-09-24 19:30:45,853 INFO L226 Difference]: Without dead ends: 5399 [2020-09-24 19:30:45,869 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-09-24 19:30:45,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5399 states. [2020-09-24 19:30:46,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5399 to 5199. [2020-09-24 19:30:46,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5199 states. [2020-09-24 19:30:46,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5199 states to 5199 states and 6755 transitions. [2020-09-24 19:30:46,026 INFO L78 Accepts]: Start accepts. Automaton has 5199 states and 6755 transitions. Word has length 183 [2020-09-24 19:30:46,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-24 19:30:46,027 INFO L479 AbstractCegarLoop]: Abstraction has 5199 states and 6755 transitions. [2020-09-24 19:30:46,027 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-24 19:30:46,027 INFO L276 IsEmpty]: Start isEmpty. Operand 5199 states and 6755 transitions. [2020-09-24 19:30:46,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2020-09-24 19:30:46,036 INFO L414 BasicCegarLoop]: Found error trace [2020-09-24 19:30:46,037 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-24 19:30:46,037 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-24 19:30:46,037 INFO L427 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-24 19:30:46,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-24 19:30:46,038 INFO L82 PathProgramCache]: Analyzing trace with hash -980701640, now seen corresponding path program 1 times [2020-09-24 19:30:46,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-24 19:30:46,039 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1329496231] [2020-09-24 19:30:46,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-24 19:30:46,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 19:30:46,144 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-24 19:30:46,467 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-24 19:30:46,975 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-24 19:30:47,117 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-24 19:30:47,117 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 199 [2020-09-24 19:30:47,118 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 3 [2020-09-24 19:30:47,118 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1012 [2020-09-24 19:30:47,119 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-24 19:30:47,119 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-09-24 19:30:47,119 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 13 [2020-09-24 19:30:47,119 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 153 [2020-09-24 19:30:47,119 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-24 19:30:47,182 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-24 19:30:47,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 19:30:47,189 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-24 19:30:47,202 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-24 19:30:47,203 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 18 [2020-09-24 19:30:47,203 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-24 19:30:47,203 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 16 [2020-09-24 19:30:47,203 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-24 19:30:47,204 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-24 19:30:47,204 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-24 19:30:47,204 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 9 [2020-09-24 19:30:47,204 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-24 19:30:47,229 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-24 19:30:47,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 19:30:47,291 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-24 19:30:47,551 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-24 19:30:47,552 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 147 [2020-09-24 19:30:47,552 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-24 19:30:47,552 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 289 [2020-09-24 19:30:47,553 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-24 19:30:47,553 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-24 19:30:47,553 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-09-24 19:30:47,554 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 146 [2020-09-24 19:30:47,554 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-24 19:30:47,818 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-24 19:30:47,823 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1329496231] [2020-09-24 19:30:47,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-24 19:30:47,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-09-24 19:30:47,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308735645] [2020-09-24 19:30:47,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-24 19:30:47,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-24 19:30:47,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-24 19:30:47,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-09-24 19:30:47,826 INFO L87 Difference]: Start difference. First operand 5199 states and 6755 transitions. Second operand 8 states. [2020-09-24 19:30:50,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-24 19:30:50,864 INFO L93 Difference]: Finished difference Result 11071 states and 14541 transitions. [2020-09-24 19:30:50,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-09-24 19:30:50,865 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 188 [2020-09-24 19:30:50,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-24 19:30:50,907 INFO L225 Difference]: With dead ends: 11071 [2020-09-24 19:30:50,908 INFO L226 Difference]: Without dead ends: 5887 [2020-09-24 19:30:50,928 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2020-09-24 19:30:50,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5887 states. [2020-09-24 19:30:51,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5887 to 5689. [2020-09-24 19:30:51,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5689 states. [2020-09-24 19:30:51,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5689 states to 5689 states and 6871 transitions. [2020-09-24 19:30:51,061 INFO L78 Accepts]: Start accepts. Automaton has 5689 states and 6871 transitions. Word has length 188 [2020-09-24 19:30:51,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-24 19:30:51,062 INFO L479 AbstractCegarLoop]: Abstraction has 5689 states and 6871 transitions. [2020-09-24 19:30:51,062 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-24 19:30:51,062 INFO L276 IsEmpty]: Start isEmpty. Operand 5689 states and 6871 transitions. [2020-09-24 19:30:51,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2020-09-24 19:30:51,072 INFO L414 BasicCegarLoop]: Found error trace [2020-09-24 19:30:51,072 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-24 19:30:51,073 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-24 19:30:51,073 INFO L427 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-24 19:30:51,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-24 19:30:51,073 INFO L82 PathProgramCache]: Analyzing trace with hash -209667586, now seen corresponding path program 1 times [2020-09-24 19:30:51,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-24 19:30:51,075 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1214776578] [2020-09-24 19:30:51,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-24 19:30:51,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 19:30:51,183 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-24 19:30:51,287 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-24 19:30:51,423 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-24 19:30:52,123 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-24 19:30:52,189 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-24 19:30:52,189 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 274 [2020-09-24 19:30:52,189 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 4 [2020-09-24 19:30:52,189 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1055 [2020-09-24 19:30:52,190 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-24 19:30:52,190 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-24 19:30:52,190 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 106 [2020-09-24 19:30:52,190 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 135 [2020-09-24 19:30:52,191 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-24 19:30:52,277 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-24 19:30:52,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 19:30:52,281 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-24 19:30:52,289 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-24 19:30:52,289 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 18 [2020-09-24 19:30:52,289 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-24 19:30:52,290 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 9 [2020-09-24 19:30:52,290 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-24 19:30:52,290 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-09-24 19:30:52,290 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-24 19:30:52,291 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-09-24 19:30:52,291 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-24 19:30:52,306 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-24 19:30:52,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 19:30:52,340 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-24 19:30:52,409 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-24 19:30:52,409 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 85 [2020-09-24 19:30:52,409 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-24 19:30:52,410 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 84 [2020-09-24 19:30:52,410 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-24 19:30:52,410 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-24 19:30:52,410 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-24 19:30:52,411 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 77 [2020-09-24 19:30:52,411 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-24 19:30:52,435 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2020-09-24 19:30:52,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 19:30:52,490 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-24 19:30:52,698 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-24 19:30:52,698 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 131 [2020-09-24 19:30:52,698 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-24 19:30:52,699 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 235 [2020-09-24 19:30:52,699 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-24 19:30:52,699 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-24 19:30:52,699 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-09-24 19:30:52,699 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 130 [2020-09-24 19:30:52,700 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-24 19:30:52,841 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 124 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-24 19:30:52,841 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1214776578] [2020-09-24 19:30:52,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-24 19:30:52,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-24 19:30:52,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144804423] [2020-09-24 19:30:52,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-24 19:30:52,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-24 19:30:52,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-24 19:30:52,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-24 19:30:52,843 INFO L87 Difference]: Start difference. First operand 5689 states and 6871 transitions. Second operand 7 states. [2020-09-24 19:30:55,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-24 19:30:55,261 INFO L93 Difference]: Finished difference Result 11543 states and 14138 transitions. [2020-09-24 19:30:55,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-24 19:30:55,262 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 261 [2020-09-24 19:30:55,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-24 19:30:55,274 INFO L225 Difference]: With dead ends: 11543 [2020-09-24 19:30:55,275 INFO L226 Difference]: Without dead ends: 3817 [2020-09-24 19:30:55,292 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-09-24 19:30:55,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3817 states. [2020-09-24 19:30:55,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3817 to 3629. [2020-09-24 19:30:55,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3629 states. [2020-09-24 19:30:55,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3629 states to 3629 states and 4079 transitions. [2020-09-24 19:30:55,387 INFO L78 Accepts]: Start accepts. Automaton has 3629 states and 4079 transitions. Word has length 261 [2020-09-24 19:30:55,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-24 19:30:55,388 INFO L479 AbstractCegarLoop]: Abstraction has 3629 states and 4079 transitions. [2020-09-24 19:30:55,388 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-24 19:30:55,388 INFO L276 IsEmpty]: Start isEmpty. Operand 3629 states and 4079 transitions. [2020-09-24 19:30:55,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2020-09-24 19:30:55,398 INFO L414 BasicCegarLoop]: Found error trace [2020-09-24 19:30:55,399 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-09-24 19:30:55,399 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-24 19:30:55,399 INFO L427 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-24 19:30:55,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-24 19:30:55,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1920210634, now seen corresponding path program 1 times [2020-09-24 19:30:55,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-24 19:30:55,400 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1034634113] [2020-09-24 19:30:55,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-24 19:30:55,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-24 19:30:55,556 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-09-24 19:30:55,556 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-24 19:30:55,563 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-24 19:30:55,614 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.09 07:30:55 BoogieIcfgContainer [2020-09-24 19:30:55,615 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-24 19:30:55,618 INFO L168 Benchmark]: Toolchain (without parser) took 41387.54 ms. Allocated memory was 139.5 MB in the beginning and 683.7 MB in the end (delta: 544.2 MB). Free memory was 100.8 MB in the beginning and 478.1 MB in the end (delta: -377.4 MB). Peak memory consumption was 166.9 MB. Max. memory is 7.1 GB. [2020-09-24 19:30:55,619 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 139.5 MB. Free memory was 120.6 MB in the beginning and 120.4 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-09-24 19:30:55,620 INFO L168 Benchmark]: CACSL2BoogieTranslator took 914.41 ms. Allocated memory was 139.5 MB in the beginning and 204.5 MB in the end (delta: 65.0 MB). Free memory was 100.1 MB in the beginning and 170.3 MB in the end (delta: -70.2 MB). Peak memory consumption was 34.0 MB. Max. memory is 7.1 GB. [2020-09-24 19:30:55,621 INFO L168 Benchmark]: Boogie Preprocessor took 145.29 ms. Allocated memory is still 204.5 MB. Free memory was 170.3 MB in the beginning and 165.3 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 7.1 GB. [2020-09-24 19:30:55,622 INFO L168 Benchmark]: RCFGBuilder took 1652.28 ms. Allocated memory was 204.5 MB in the beginning and 235.9 MB in the end (delta: 31.5 MB). Free memory was 165.3 MB in the beginning and 163.6 MB in the end (delta: 1.7 MB). Peak memory consumption was 84.2 MB. Max. memory is 7.1 GB. [2020-09-24 19:30:55,622 INFO L168 Benchmark]: TraceAbstraction took 38662.52 ms. Allocated memory was 235.9 MB in the beginning and 683.7 MB in the end (delta: 447.7 MB). Free memory was 163.6 MB in the beginning and 478.1 MB in the end (delta: -314.5 MB). Peak memory consumption was 133.2 MB. Max. memory is 7.1 GB. [2020-09-24 19:30:55,626 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 139.5 MB. Free memory was 120.6 MB in the beginning and 120.4 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 914.41 ms. Allocated memory was 139.5 MB in the beginning and 204.5 MB in the end (delta: 65.0 MB). Free memory was 100.1 MB in the beginning and 170.3 MB in the end (delta: -70.2 MB). Peak memory consumption was 34.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 145.29 ms. Allocated memory is still 204.5 MB. Free memory was 170.3 MB in the beginning and 165.3 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1652.28 ms. Allocated memory was 204.5 MB in the beginning and 235.9 MB in the end (delta: 31.5 MB). Free memory was 165.3 MB in the beginning and 163.6 MB in the end (delta: 1.7 MB). Peak memory consumption was 84.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 38662.52 ms. Allocated memory was 235.9 MB in the beginning and 683.7 MB in the end (delta: 447.7 MB). Free memory was 163.6 MB in the beginning and 478.1 MB in the end (delta: -314.5 MB). Peak memory consumption was 133.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 58]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int inputC = 3; [L8] int inputD = 4; [L9] int inputE = 5; [L10] int inputF = 6; [L11] int inputB = 2; [L14] int a1 = 23; [L15] int a19 = 9; [L16] int a10 = 0; [L17] int a12 = 0; [L18] int a4 = 14; [L579] int output = -1; [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL, EXPR calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) [L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) [L225] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) [L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) [L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) [L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) [L244] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) [L249] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) [L254] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) [L260] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) [L265] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) [L271] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) [L277] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) [L283] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) [L286] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) [L291] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) [L296] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) [L301] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) [L306] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) [L312] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) [L317] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) [L320] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) [L323] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) [L326] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) [L329] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) [L335] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) [L340] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) [L345] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) [L351] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) [L354] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) [L357] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) [L360] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) [L365] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0))))) [L370] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) [L375] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) [L378] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) [L383] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) [L388] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0))))) [L393] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) [L398] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) [L403] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14))) [L408] COND FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))) [L414] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14))) [L419] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10)))))) [L425] COND TRUE ((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0)) [L426] a1 = ((((a1 / 5) * 5) / 5) + 505228) [L427] a10 = 1 [L429] return 25; [L590] RET, EXPR calculate_output(input) [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL, EXPR calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) [L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) [L225] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) [L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) [L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) [L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) [L244] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) [L249] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) [L254] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) [L260] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) [L265] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) [L271] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) [L277] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) [L283] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) [L286] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) [L291] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) [L296] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) [L301] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) [L306] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) [L312] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) [L317] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) [L320] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) [L323] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) [L326] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) [L329] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) [L335] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) [L340] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) [L345] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) [L351] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) [L354] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) [L357] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) [L360] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) [L365] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0))))) [L370] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) [L375] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) [L378] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) [L383] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) [L388] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0))))) [L393] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) [L398] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) [L403] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14))) [L408] COND FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))) [L414] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14))) [L419] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10)))))) [L425] COND FALSE !(((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0))) [L430] COND FALSE !((((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 6)) && (a19==10))) && (a12==0))) [L436] COND FALSE !(((a19==9) && ((((input == 4) && (( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 ))) && (a12==0)) && (a4==14)))) [L442] COND FALSE !((((a19==10) && ((a12==0) && ((((a10==1) && a1 <= -13 ) || (( ((38 < a1) && (218 >= a1)) && (a10==0)) || ((a10==0) && 218 < a1 ))) && (input == 3)))) && (a4==14))) [L448] COND FALSE !(((a19==9) && (((a4==14) && ((((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4))) && (input == 5))) && (a12==0)))) [L454] COND FALSE !((((a12==0) && ((((input == 5) && (a19==10)) && ((38 < a1) && (218 >= a1)) ) && (a4==14))) && (a10==1))) [L460] COND FALSE !(((a19==9) && ((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3)) && (a10==1)) && (a12==0))))) [L465] COND FALSE !(((a10==0) && ((a12==0) && ((((input == 5) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a4==14))))) [L471] COND FALSE !(( 218 < a1 && (((((input == 3) && (a10==1)) && (a12==0)) && (a4==14)) && (a19==10)))) [L476] COND FALSE !((((a12==0) && ((a19==9) && (((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a4==14)))) && (a10==3))) [L481] COND FALSE !((((((a4==14) && ( ((38 < a1) && (218 >= a1)) && (input == 2))) && (a12==0)) && (a10==1)) && (a19==10))) [L487] COND FALSE !((((a19==10) && ((a10==1) && ((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (input == 5))))) && (a4==14))) [L493] COND FALSE !(((((a10==1) && (((input == 5) && 218 < a1 ) && (a4==14))) && (a19==10)) && (a12==0))) [L499] COND FALSE !((((a4==14) && ((a19==9) && ((input == 2) && (((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 ))))) && (a12==0))) [L504] COND FALSE !((((a4==14) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 2))) && (a12==0))) && (a10==4))) [L509] COND FALSE !(((a4==14) && (((a19==9) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 6)) && (a10==3))) && (a12==0)))) [L514] COND FALSE !((((a4==14) && ((((input == 6) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a12==0))) && (a10==0))) [L517] COND FALSE !(((a12==0) && ((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 2)) && (a19==10))))) [L523] COND FALSE !((((a12==0) && ((a19==9) && ((a10==2) && ((input == 6) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))))) && (a4==14))) [L526] COND FALSE !(((a4==14) && ((a19==9) && ((a12==0) && (((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)))))) [L529] COND FALSE !(((a19==9) && (((a10==1) && ((a12==0) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )))) && (a4==14)))) [L534] COND FALSE !(((a19==9) && ((a4==14) && ((a10==1) && (((input == 5) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a12==0)))))) [L540] COND FALSE !(((a12==0) && (((((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a19==9)) && (a4==14)) && (a10==0)))) [L545] COND FALSE !(((a4==14) && (((a12==0) && ((a19==9) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )))) && (a10==4)))) [L548] COND FALSE !(((((( ((38 < a1) && (218 >= a1)) && (input == 3)) && (a10==1)) && (a12==0)) && (a4==14)) && (a19==10))) [L554] COND FALSE !((((a4==14) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 4)) && (a12==0)) && (a19==9))) && (a10==2))) [L557] COND TRUE ((a12==0) && ((( 218 < a1 && ((a19==9) && (input == 5))) && (a10==1)) && (a4==14))) [L558] a1 = ((((a1 * 9)/ 10) + 58620) - 603783) [L559] a10 = 4 [L560] a19 = 8 [L562] return -1; [L590] RET, EXPR calculate_output(input) [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND TRUE (((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8)) [L58] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 456 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 38.5s, OverallIterations: 11, TraceHistogramMax: 3, AutomataDifference: 22.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2150 SDtfs, 7200 SDslu, 2312 SDs, 0 SdLazy, 11906 SolverSat, 1604 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 120 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5689occurred 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.9s AutomataMinimizationTime, 10 MinimizatonAttempts, 1635 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 13.4s InterpolantComputationTime, 1834 NumberOfCodeBlocks, 1834 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1512 ConstructedInterpolants, 0 QuantifiedInterpolants, 628695 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 2 PerfectInterpolantSequences, 286/295 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...