/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=5000 --traceabstraction.additional.smt.options interpolation-heuristic=WIDESTAMONGSMALL --traceabstraction.additional.smt.options tolerance=0.8 --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-25 07:57:37,079 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-25 07:57:37,083 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-25 07:57:37,112 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-25 07:57:37,112 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-25 07:57:37,114 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-25 07:57:37,115 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-25 07:57:37,117 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-25 07:57:37,119 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-25 07:57:37,120 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-25 07:57:37,121 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-25 07:57:37,123 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-25 07:57:37,123 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-25 07:57:37,124 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-25 07:57:37,126 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-25 07:57:37,127 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-25 07:57:37,128 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-25 07:57:37,129 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-25 07:57:37,131 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-25 07:57:37,133 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-25 07:57:37,135 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-25 07:57:37,136 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-25 07:57:37,138 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-25 07:57:37,139 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-25 07:57:37,142 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-25 07:57:37,142 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-25 07:57:37,143 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-25 07:57:37,146 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-25 07:57:37,147 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-25 07:57:37,150 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-25 07:57:37,150 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-25 07:57:37,151 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-25 07:57:37,152 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-25 07:57:37,155 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-25 07:57:37,156 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-25 07:57:37,157 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-25 07:57:37,157 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-25 07:57:37,158 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-25 07:57:37,158 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-25 07:57:37,159 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-25 07:57:37,162 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-25 07:57:37,163 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-25 07:57:37,219 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-25 07:57:37,219 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-25 07:57:37,222 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-09-25 07:57:37,222 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-09-25 07:57:37,222 INFO L138 SettingsManager]: * Use SBE=true [2020-09-25 07:57:37,223 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-25 07:57:37,223 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-25 07:57:37,223 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-25 07:57:37,223 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-25 07:57:37,224 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-25 07:57:37,225 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-25 07:57:37,225 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-25 07:57:37,225 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-25 07:57:37,226 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-25 07:57:37,226 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-25 07:57:37,226 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-25 07:57:37,226 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-25 07:57:37,227 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-25 07:57:37,227 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-09-25 07:57:37,227 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-25 07:57:37,227 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-25 07:57:37,227 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-25 07:57:37,228 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-25 07:57:37,228 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-09-25 07:57:37,228 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-09-25 07:57:37,228 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-09-25 07:57:37,228 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-09-25 07:57:37,229 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-25 07:57:37,229 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-09-25 07:57:37,229 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=5000;interpolation-heuristic=WIDESTAMONGSMALL;tolerance=0.8;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=5000;interpolation-heuristic=WIDESTAMONGSMALL;tolerance=0.8;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=5000;interpolation-heuristic=WIDESTAMONGSMALL;tolerance=0.8;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=5000;interpolation-heuristic=WIDESTAMONGSMALL;tolerance=0.8;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=5000;interpolation-heuristic=WIDESTAMONGSMALL;tolerance=0.8;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=5000;interpolation-heuristic=WIDESTAMONGSMALL;tolerance=0.8;log-additional-information=true; [2020-09-25 07:57:37,689 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-25 07:57:37,711 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-25 07:57:37,716 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-25 07:57:37,719 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-25 07:57:37,720 INFO L275 PluginConnector]: CDTParser initialized [2020-09-25 07:57:37,721 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-25 07:57:37,818 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/7f5c13a67/27abb41734c940bebff9ada84421bf72/FLAG01f93c6ec [2020-09-25 07:57:38,484 INFO L306 CDTParser]: Found 1 translation units. [2020-09-25 07:57:38,487 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/eca-rers2012/Problem10_label55.c [2020-09-25 07:57:38,511 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/7f5c13a67/27abb41734c940bebff9ada84421bf72/FLAG01f93c6ec [2020-09-25 07:57:38,700 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/7f5c13a67/27abb41734c940bebff9ada84421bf72 [2020-09-25 07:57:38,714 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-25 07:57:38,721 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-25 07:57:38,722 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-25 07:57:38,722 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-25 07:57:38,727 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-25 07:57:38,729 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 07:57:38" (1/1) ... [2020-09-25 07:57:38,734 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51d7e22e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 07:57:38, skipping insertion in model container [2020-09-25 07:57:38,734 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 07:57:38" (1/1) ... [2020-09-25 07:57:38,744 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-25 07:57:38,802 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-25 07:57:39,260 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-25 07:57:39,267 INFO L203 MainTranslator]: Completed pre-run [2020-09-25 07:57:39,489 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-25 07:57:39,510 INFO L208 MainTranslator]: Completed translation [2020-09-25 07:57:39,511 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 07:57:39 WrapperNode [2020-09-25 07:57:39,511 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-25 07:57:39,512 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-25 07:57:39,512 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-25 07:57:39,512 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-25 07:57:39,529 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 07:57:39" (1/1) ... [2020-09-25 07:57:39,529 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 07:57:39" (1/1) ... [2020-09-25 07:57:39,555 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 07:57:39" (1/1) ... [2020-09-25 07:57:39,556 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 07:57:39" (1/1) ... [2020-09-25 07:57:39,594 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 07:57:39" (1/1) ... [2020-09-25 07:57:39,615 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 07:57:39" (1/1) ... [2020-09-25 07:57:39,633 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 07:57:39" (1/1) ... [2020-09-25 07:57:39,645 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-25 07:57:39,645 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-25 07:57:39,645 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-25 07:57:39,645 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-25 07:57:39,648 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 07:57:39" (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-25 07:57:39,737 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-25 07:57:39,737 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-25 07:57:39,737 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2020-09-25 07:57:39,738 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-25 07:57:39,738 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2020-09-25 07:57:39,738 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-25 07:57:39,738 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-25 07:57:39,738 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-09-25 07:57:39,739 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-25 07:57:39,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-25 07:57:39,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-25 07:57:41,129 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-25 07:57:41,129 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-09-25 07:57:41,138 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 07:57:41 BoogieIcfgContainer [2020-09-25 07:57:41,139 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-25 07:57:41,140 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-25 07:57:41,140 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-25 07:57:41,144 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-25 07:57:41,144 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.09 07:57:38" (1/3) ... [2020-09-25 07:57:41,146 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5485bd9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 07:57:41, skipping insertion in model container [2020-09-25 07:57:41,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 07:57:39" (2/3) ... [2020-09-25 07:57:41,146 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5485bd9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 07:57:41, skipping insertion in model container [2020-09-25 07:57:41,147 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 07:57:41" (3/3) ... [2020-09-25 07:57:41,149 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem10_label55.c [2020-09-25 07:57:41,161 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-25 07:57:41,176 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-25 07:57:41,202 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-25 07:57:41,244 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-25 07:57:41,245 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-25 07:57:41,245 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-25 07:57:41,245 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-25 07:57:41,245 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-25 07:57:41,245 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-25 07:57:41,246 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-25 07:57:41,246 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-25 07:57:41,280 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states. [2020-09-25 07:57:41,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-09-25 07:57:41,291 INFO L414 BasicCegarLoop]: Found error trace [2020-09-25 07:57:41,293 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-25 07:57:41,293 INFO L427 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-25 07:57:41,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-25 07:57:41,303 INFO L82 PathProgramCache]: Analyzing trace with hash -18090369, now seen corresponding path program 1 times [2020-09-25 07:57:41,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-25 07:57:41,317 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2088718078] [2020-09-25 07:57:41,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-25 07:57:41,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 07:57:41,535 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 07:57:41,775 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 07:57:41,831 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 07:57:42,187 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 07:57:42,187 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 46 [2020-09-25 07:57:42,188 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 3 [2020-09-25 07:57:42,188 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 690 [2020-09-25 07:57:42,192 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 07:57:42,192 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.8 [2020-09-25 07:57:42,193 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-09-25 07:57:42,193 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 11 [2020-09-25 07:57:42,193 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 34 [2020-09-25 07:57:42,193 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 5 [2020-09-25 07:57:42,331 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-25 07:57:42,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 07:57:42,361 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 07:57:42,381 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 07:57:42,382 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 18 [2020-09-25 07:57:42,382 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 07:57:42,383 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 30 [2020-09-25 07:57:42,383 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 07:57:42,384 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.8 [2020-09-25 07:57:42,384 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-25 07:57:42,384 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-25 07:57:42,385 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 7 [2020-09-25 07:57:42,385 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 07:57:42,408 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-25 07:57:42,409 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2088718078] [2020-09-25 07:57:42,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-25 07:57:42,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-09-25 07:57:42,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99699517] [2020-09-25 07:57:42,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-09-25 07:57:42,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-25 07:57:42,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-09-25 07:57:42,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-09-25 07:57:42,449 INFO L87 Difference]: Start difference. First operand 456 states. Second operand 4 states. [2020-09-25 07:57:44,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-25 07:57:44,443 INFO L93 Difference]: Finished difference Result 1104 states and 1521 transitions. [2020-09-25 07:57:44,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-25 07:57:44,446 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2020-09-25 07:57:44,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-25 07:57:44,470 INFO L225 Difference]: With dead ends: 1104 [2020-09-25 07:57:44,470 INFO L226 Difference]: Without dead ends: 578 [2020-09-25 07:57:44,480 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-09-25 07:57:44,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2020-09-25 07:57:44,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 544. [2020-09-25 07:57:44,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2020-09-25 07:57:44,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 655 transitions. [2020-09-25 07:57:44,579 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 655 transitions. Word has length 37 [2020-09-25 07:57:44,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-25 07:57:44,580 INFO L479 AbstractCegarLoop]: Abstraction has 544 states and 655 transitions. [2020-09-25 07:57:44,580 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-09-25 07:57:44,580 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 655 transitions. [2020-09-25 07:57:44,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2020-09-25 07:57:44,587 INFO L414 BasicCegarLoop]: Found error trace [2020-09-25 07:57:44,587 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] [2020-09-25 07:57:44,587 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-25 07:57:44,588 INFO L427 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-25 07:57:44,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-25 07:57:44,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1996109808, now seen corresponding path program 1 times [2020-09-25 07:57:44,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-25 07:57:44,589 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [780888264] [2020-09-25 07:57:44,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-25 07:57:44,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 07:57:44,699 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 07:57:44,902 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 07:57:44,973 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 07:57:45,049 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 07:57:45,215 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 07:57:48,916 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 07:57:48,916 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 127 [2020-09-25 07:57:48,916 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 5 [2020-09-25 07:57:48,917 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 4280 [2020-09-25 07:57:48,918 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 07:57:48,918 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.8 [2020-09-25 07:57:48,918 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-25 07:57:48,919 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 94 [2020-09-25 07:57:48,919 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 32 [2020-09-25 07:57:48,919 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 07:57:48,987 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-25 07:57:48,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 07:57:48,992 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 07:57:49,001 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 07:57:49,002 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 18 [2020-09-25 07:57:49,002 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 07:57:49,002 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 11 [2020-09-25 07:57:49,002 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 07:57:49,003 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.8 [2020-09-25 07:57:49,003 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-09-25 07:57:49,003 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-25 07:57:49,004 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-09-25 07:57:49,004 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 07:57:49,021 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-25 07:57:49,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 07:57:49,054 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 07:57:49,134 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 07:57:49,134 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 75 [2020-09-25 07:57:49,141 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 07:57:49,141 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 92 [2020-09-25 07:57:49,142 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 07:57:49,142 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.8 [2020-09-25 07:57:49,143 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-25 07:57:49,143 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-25 07:57:49,143 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 65 [2020-09-25 07:57:49,143 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 07:57:49,191 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-25 07:57:49,192 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [780888264] [2020-09-25 07:57:49,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-25 07:57:49,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-09-25 07:57:49,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828181058] [2020-09-25 07:57:49,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-25 07:57:49,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-25 07:57:49,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-25 07:57:49,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-25 07:57:49,197 INFO L87 Difference]: Start difference. First operand 544 states and 655 transitions. Second operand 5 states. [2020-09-25 07:57:50,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-25 07:57:50,911 INFO L93 Difference]: Finished difference Result 1224 states and 1530 transitions. [2020-09-25 07:57:50,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-25 07:57:50,914 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 116 [2020-09-25 07:57:50,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-25 07:57:50,919 INFO L225 Difference]: With dead ends: 1224 [2020-09-25 07:57:50,919 INFO L226 Difference]: Without dead ends: 695 [2020-09-25 07:57:50,922 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-25 07:57:50,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2020-09-25 07:57:50,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 695. [2020-09-25 07:57:50,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 695 states. [2020-09-25 07:57:50,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 850 transitions. [2020-09-25 07:57:50,960 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 850 transitions. Word has length 116 [2020-09-25 07:57:50,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-25 07:57:50,961 INFO L479 AbstractCegarLoop]: Abstraction has 695 states and 850 transitions. [2020-09-25 07:57:50,961 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-25 07:57:50,961 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 850 transitions. [2020-09-25 07:57:50,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2020-09-25 07:57:50,966 INFO L414 BasicCegarLoop]: Found error trace [2020-09-25 07:57:50,966 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-25 07:57:50,967 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-25 07:57:50,967 INFO L427 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-25 07:57:50,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-25 07:57:50,967 INFO L82 PathProgramCache]: Analyzing trace with hash 804111666, now seen corresponding path program 1 times [2020-09-25 07:57:50,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-25 07:57:50,968 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1821049792] [2020-09-25 07:57:50,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-25 07:57:50,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 07:57:51,028 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 07:57:51,080 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 07:57:51,143 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 07:57:51,344 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 07:57:53,845 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 07:57:53,845 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 137 [2020-09-25 07:57:53,846 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 4 [2020-09-25 07:57:53,846 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 2844 [2020-09-25 07:57:53,846 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 07:57:53,846 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.8 [2020-09-25 07:57:53,846 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 5 [2020-09-25 07:57:53,847 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 103 [2020-09-25 07:57:53,847 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 33 [2020-09-25 07:57:53,847 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 07:57:53,915 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-25 07:57:53,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 07:57:53,923 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 07:57:53,932 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 07:57:53,934 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 18 [2020-09-25 07:57:53,935 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 07:57:53,935 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 10 [2020-09-25 07:57:53,935 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 07:57:53,935 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.8 [2020-09-25 07:57:53,936 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-09-25 07:57:53,936 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-25 07:57:53,936 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-09-25 07:57:53,936 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 07:57:53,950 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-25 07:57:53,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 07:57:53,985 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 07:57:54,100 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 07:57:54,100 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 85 [2020-09-25 07:57:54,100 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 07:57:54,101 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 128 [2020-09-25 07:57:54,101 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 07:57:54,101 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.8 [2020-09-25 07:57:54,101 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 3 [2020-09-25 07:57:54,102 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-25 07:57:54,102 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 75 [2020-09-25 07:57:54,102 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 07:57:54,175 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-25 07:57:54,175 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1821049792] [2020-09-25 07:57:54,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-25 07:57:54,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-09-25 07:57:54,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999991853] [2020-09-25 07:57:54,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-25 07:57:54,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-25 07:57:54,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-25 07:57:54,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-09-25 07:57:54,180 INFO L87 Difference]: Start difference. First operand 695 states and 850 transitions. Second operand 6 states. [2020-09-25 07:57:56,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-25 07:57:56,787 INFO L93 Difference]: Finished difference Result 1905 states and 2481 transitions. [2020-09-25 07:57:56,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-25 07:57:56,788 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 126 [2020-09-25 07:57:56,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-25 07:57:56,805 INFO L225 Difference]: With dead ends: 1905 [2020-09-25 07:57:56,805 INFO L226 Difference]: Without dead ends: 1375 [2020-09-25 07:57:56,809 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-09-25 07:57:56,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1375 states. [2020-09-25 07:57:56,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1375 to 1319. [2020-09-25 07:57:56,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1319 states. [2020-09-25 07:57:56,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1319 states to 1319 states and 1695 transitions. [2020-09-25 07:57:56,904 INFO L78 Accepts]: Start accepts. Automaton has 1319 states and 1695 transitions. Word has length 126 [2020-09-25 07:57:56,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-25 07:57:56,905 INFO L479 AbstractCegarLoop]: Abstraction has 1319 states and 1695 transitions. [2020-09-25 07:57:56,906 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-25 07:57:56,906 INFO L276 IsEmpty]: Start isEmpty. Operand 1319 states and 1695 transitions. [2020-09-25 07:57:56,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2020-09-25 07:57:56,910 INFO L414 BasicCegarLoop]: Found error trace [2020-09-25 07:57:56,911 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] [2020-09-25 07:57:56,911 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-25 07:57:56,911 INFO L427 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-25 07:57:56,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-25 07:57:56,912 INFO L82 PathProgramCache]: Analyzing trace with hash -2061157014, now seen corresponding path program 1 times [2020-09-25 07:57:56,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-25 07:57:56,912 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1419139134] [2020-09-25 07:57:56,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-25 07:57:56,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 07:57:56,969 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 07:57:57,161 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 07:57:57,250 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 07:57:58,086 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 07:57:58,086 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 139 [2020-09-25 07:57:58,087 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 3 [2020-09-25 07:57:58,087 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1142 [2020-09-25 07:57:58,087 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 07:57:58,087 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.8 [2020-09-25 07:57:58,088 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-09-25 07:57:58,088 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 13 [2020-09-25 07:57:58,088 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 93 [2020-09-25 07:57:58,088 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 07:57:58,152 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-25 07:57:58,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 07:57:58,157 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 07:57:58,171 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 07:57:58,171 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 18 [2020-09-25 07:57:58,171 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 07:57:58,172 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 15 [2020-09-25 07:57:58,172 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 07:57:58,172 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.8 [2020-09-25 07:57:58,172 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-25 07:57:58,172 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-25 07:57:58,173 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 9 [2020-09-25 07:57:58,173 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 07:57:58,191 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-25 07:57:58,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 07:57:58,219 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 07:57:58,345 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 07:57:58,345 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 87 [2020-09-25 07:57:58,346 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 07:57:58,346 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 139 [2020-09-25 07:57:58,346 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 07:57:58,347 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.8 [2020-09-25 07:57:58,347 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-25 07:57:58,347 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-09-25 07:57:58,348 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 86 [2020-09-25 07:57:58,348 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 07:57:58,481 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-25 07:57:58,482 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1419139134] [2020-09-25 07:57:58,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-25 07:57:58,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-25 07:57:58,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845121390] [2020-09-25 07:57:58,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-25 07:57:58,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-25 07:57:58,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-25 07:57:58,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-25 07:57:58,486 INFO L87 Difference]: Start difference. First operand 1319 states and 1695 transitions. Second operand 7 states. [2020-09-25 07:58:00,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-25 07:58:00,739 INFO L93 Difference]: Finished difference Result 3319 states and 4494 transitions. [2020-09-25 07:58:00,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-25 07:58:00,739 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 128 [2020-09-25 07:58:00,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-25 07:58:00,755 INFO L225 Difference]: With dead ends: 3319 [2020-09-25 07:58:00,757 INFO L226 Difference]: Without dead ends: 2165 [2020-09-25 07:58:00,764 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2020-09-25 07:58:00,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2165 states. [2020-09-25 07:58:00,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2165 to 1811. [2020-09-25 07:58:00,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1811 states. [2020-09-25 07:58:00,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1811 states to 1811 states and 2265 transitions. [2020-09-25 07:58:00,847 INFO L78 Accepts]: Start accepts. Automaton has 1811 states and 2265 transitions. Word has length 128 [2020-09-25 07:58:00,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-25 07:58:00,848 INFO L479 AbstractCegarLoop]: Abstraction has 1811 states and 2265 transitions. [2020-09-25 07:58:00,848 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-25 07:58:00,848 INFO L276 IsEmpty]: Start isEmpty. Operand 1811 states and 2265 transitions. [2020-09-25 07:58:00,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2020-09-25 07:58:00,861 INFO L414 BasicCegarLoop]: Found error trace [2020-09-25 07:58:00,861 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 07:58:00,861 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-25 07:58:00,862 INFO L427 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-25 07:58:00,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-25 07:58:00,862 INFO L82 PathProgramCache]: Analyzing trace with hash 2004537840, now seen corresponding path program 1 times [2020-09-25 07:58:00,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-25 07:58:00,863 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1272851571] [2020-09-25 07:58:00,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-25 07:58:00,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 07:58:00,961 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 07:58:01,188 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 07:58:01,290 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 07:58:02,035 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 07:58:02,295 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 07:58:05,191 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 07:58:05,472 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 07:58:05,472 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 240 [2020-09-25 07:58:05,472 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 6 [2020-09-25 07:58:05,472 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 4557 [2020-09-25 07:58:05,473 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 07:58:05,473 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.8 [2020-09-25 07:58:05,473 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-09-25 07:58:05,474 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 96 [2020-09-25 07:58:05,474 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 143 [2020-09-25 07:58:05,474 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 07:58:05,551 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-25 07:58:05,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 07:58:05,557 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 07:58:05,565 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 07:58:05,565 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 18 [2020-09-25 07:58:05,566 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 07:58:05,566 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 10 [2020-09-25 07:58:05,566 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 07:58:05,566 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.8 [2020-09-25 07:58:05,566 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-09-25 07:58:05,567 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-25 07:58:05,567 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-09-25 07:58:05,567 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 07:58:05,584 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-25 07:58:05,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 07:58:05,611 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 07:58:05,672 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 07:58:05,673 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 75 [2020-09-25 07:58:05,673 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 07:58:05,673 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 74 [2020-09-25 07:58:05,673 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 07:58:05,674 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.8 [2020-09-25 07:58:05,674 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-25 07:58:05,674 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-25 07:58:05,674 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 67 [2020-09-25 07:58:05,675 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 07:58:05,694 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2020-09-25 07:58:05,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 07:58:05,733 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 07:58:05,868 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 07:58:05,904 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 07:58:05,904 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 107 [2020-09-25 07:58:05,905 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-09-25 07:58:05,905 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 189 [2020-09-25 07:58:05,905 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 07:58:05,905 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.8 [2020-09-25 07:58:05,905 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-25 07:58:05,906 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-09-25 07:58:05,906 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 106 [2020-09-25 07:58:05,906 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 07:58:06,014 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 90 proven. 17 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-09-25 07:58:06,015 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1272851571] [2020-09-25 07:58:06,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-25 07:58:06,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-09-25 07:58:06,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605889274] [2020-09-25 07:58:06,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-25 07:58:06,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-25 07:58:06,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-25 07:58:06,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-09-25 07:58:06,017 INFO L87 Difference]: Start difference. First operand 1811 states and 2265 transitions. Second operand 6 states. [2020-09-25 07:58:08,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-25 07:58:08,070 INFO L93 Difference]: Finished difference Result 4263 states and 5610 transitions. [2020-09-25 07:58:08,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-25 07:58:08,071 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 227 [2020-09-25 07:58:08,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-25 07:58:08,085 INFO L225 Difference]: With dead ends: 4263 [2020-09-25 07:58:08,085 INFO L226 Difference]: Without dead ends: 2617 [2020-09-25 07:58:08,092 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-09-25 07:58:08,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2617 states. [2020-09-25 07:58:08,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2617 to 2287. [2020-09-25 07:58:08,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2287 states. [2020-09-25 07:58:08,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2287 states to 2287 states and 2807 transitions. [2020-09-25 07:58:08,166 INFO L78 Accepts]: Start accepts. Automaton has 2287 states and 2807 transitions. Word has length 227 [2020-09-25 07:58:08,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-25 07:58:08,167 INFO L479 AbstractCegarLoop]: Abstraction has 2287 states and 2807 transitions. [2020-09-25 07:58:08,167 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-25 07:58:08,167 INFO L276 IsEmpty]: Start isEmpty. Operand 2287 states and 2807 transitions. [2020-09-25 07:58:08,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2020-09-25 07:58:08,174 INFO L414 BasicCegarLoop]: Found error trace [2020-09-25 07:58:08,174 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] [2020-09-25 07:58:08,174 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-25 07:58:08,174 INFO L427 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-25 07:58:08,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-25 07:58:08,175 INFO L82 PathProgramCache]: Analyzing trace with hash 75469727, now seen corresponding path program 1 times [2020-09-25 07:58:08,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-25 07:58:08,175 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1638911794] [2020-09-25 07:58:08,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-25 07:58:08,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 07:58:08,299 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 07:58:08,418 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 07:58:08,580 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 07:58:08,665 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 07:58:08,846 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 07:58:10,505 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 07:58:13,262 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 07:58:13,262 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 241 [2020-09-25 07:58:13,262 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 6 [2020-09-25 07:58:13,263 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 5039 [2020-09-25 07:58:13,263 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 07:58:13,263 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.8 [2020-09-25 07:58:13,264 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-25 07:58:13,264 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 106 [2020-09-25 07:58:13,264 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 104 [2020-09-25 07:58:13,265 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 07:58:13,339 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-25 07:58:13,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 07:58:13,344 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 07:58:13,352 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 07:58:13,352 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 18 [2020-09-25 07:58:13,352 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 07:58:13,353 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 9 [2020-09-25 07:58:13,353 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 07:58:13,354 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.8 [2020-09-25 07:58:13,354 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-09-25 07:58:13,354 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-25 07:58:13,354 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-09-25 07:58:13,355 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 07:58:13,367 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-25 07:58:13,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 07:58:13,403 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 07:58:13,480 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 07:58:13,480 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 85 [2020-09-25 07:58:13,481 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 07:58:13,481 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 93 [2020-09-25 07:58:13,481 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 07:58:13,482 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.8 [2020-09-25 07:58:13,482 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-25 07:58:13,482 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-25 07:58:13,482 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 77 [2020-09-25 07:58:13,483 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 07:58:13,514 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2020-09-25 07:58:13,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 07:58:13,555 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 07:58:13,694 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 07:58:13,694 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 98 [2020-09-25 07:58:13,695 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 07:58:13,695 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 159 [2020-09-25 07:58:13,695 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 07:58:13,695 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.8 [2020-09-25 07:58:13,696 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-25 07:58:13,696 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-09-25 07:58:13,696 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 97 [2020-09-25 07:58:13,696 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 07:58:13,790 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-25 07:58:13,791 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1638911794] [2020-09-25 07:58:13,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-25 07:58:13,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-25 07:58:13,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664539155] [2020-09-25 07:58:13,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-25 07:58:13,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-25 07:58:13,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-25 07:58:13,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-25 07:58:13,793 INFO L87 Difference]: Start difference. First operand 2287 states and 2807 transitions. Second operand 7 states. [2020-09-25 07:58:16,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-25 07:58:16,259 INFO L93 Difference]: Finished difference Result 5411 states and 6892 transitions. [2020-09-25 07:58:16,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-25 07:58:16,265 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 228 [2020-09-25 07:58:16,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-25 07:58:16,279 INFO L225 Difference]: With dead ends: 5411 [2020-09-25 07:58:16,279 INFO L226 Difference]: Without dead ends: 2301 [2020-09-25 07:58:16,288 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-25 07:58:16,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2301 states. [2020-09-25 07:58:16,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2301 to 2225. [2020-09-25 07:58:16,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2225 states. [2020-09-25 07:58:16,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2225 states to 2225 states and 2652 transitions. [2020-09-25 07:58:16,357 INFO L78 Accepts]: Start accepts. Automaton has 2225 states and 2652 transitions. Word has length 228 [2020-09-25 07:58:16,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-25 07:58:16,358 INFO L479 AbstractCegarLoop]: Abstraction has 2225 states and 2652 transitions. [2020-09-25 07:58:16,358 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-25 07:58:16,358 INFO L276 IsEmpty]: Start isEmpty. Operand 2225 states and 2652 transitions. [2020-09-25 07:58:16,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2020-09-25 07:58:16,364 INFO L414 BasicCegarLoop]: Found error trace [2020-09-25 07:58:16,365 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 07:58:16,365 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-25 07:58:16,365 INFO L427 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-25 07:58:16,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-25 07:58:16,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1331921650, now seen corresponding path program 1 times [2020-09-25 07:58:16,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-25 07:58:16,366 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [150805201] [2020-09-25 07:58:16,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-25 07:58:16,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 07:58:16,467 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 07:58:16,888 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 07:58:17,169 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 07:58:17,840 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 07:58:17,840 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 307 [2020-09-25 07:58:17,840 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 3 [2020-09-25 07:58:17,841 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1423 [2020-09-25 07:58:17,841 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 07:58:17,842 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.8 [2020-09-25 07:58:17,842 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-09-25 07:58:17,842 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 163 [2020-09-25 07:58:17,842 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 143 [2020-09-25 07:58:17,842 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 07:58:17,978 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-25 07:58:17,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 07:58:17,983 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 07:58:17,990 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 07:58:17,991 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 18 [2020-09-25 07:58:17,991 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 07:58:17,991 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 9 [2020-09-25 07:58:17,992 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 07:58:17,992 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.8 [2020-09-25 07:58:17,992 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-09-25 07:58:17,993 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-25 07:58:17,993 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-09-25 07:58:17,993 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 07:58:18,009 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-25 07:58:18,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 07:58:18,064 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 07:58:18,141 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 07:58:18,141 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 142 [2020-09-25 07:58:18,142 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 07:58:18,142 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 104 [2020-09-25 07:58:18,142 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 07:58:18,142 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.8 [2020-09-25 07:58:18,142 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-25 07:58:18,143 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-25 07:58:18,143 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 134 [2020-09-25 07:58:18,143 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-25 07:58:18,192 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2020-09-25 07:58:18,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 07:58:18,228 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 07:58:18,302 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 07:58:18,387 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 07:58:18,387 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 107 [2020-09-25 07:58:18,387 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-09-25 07:58:18,388 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 175 [2020-09-25 07:58:18,388 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 07:58:18,388 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.8 [2020-09-25 07:58:18,388 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-25 07:58:18,389 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-25 07:58:18,389 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 97 [2020-09-25 07:58:18,389 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 07:58:18,533 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 40 proven. 2 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2020-09-25 07:58:18,533 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [150805201] [2020-09-25 07:58:18,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-25 07:58:18,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-09-25 07:58:18,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286647383] [2020-09-25 07:58:18,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-25 07:58:18,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-25 07:58:18,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-25 07:58:18,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-25 07:58:18,538 INFO L87 Difference]: Start difference. First operand 2225 states and 2652 transitions. Second operand 5 states. [2020-09-25 07:58:20,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-25 07:58:20,427 INFO L93 Difference]: Finished difference Result 4608 states and 5595 transitions. [2020-09-25 07:58:20,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-25 07:58:20,429 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 294 [2020-09-25 07:58:20,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-25 07:58:20,441 INFO L225 Difference]: With dead ends: 4608 [2020-09-25 07:58:20,441 INFO L226 Difference]: Without dead ends: 2548 [2020-09-25 07:58:20,448 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 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-25 07:58:20,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2548 states. [2020-09-25 07:58:20,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2548 to 2220. [2020-09-25 07:58:20,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2220 states. [2020-09-25 07:58:20,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2220 states to 2220 states and 2501 transitions. [2020-09-25 07:58:20,506 INFO L78 Accepts]: Start accepts. Automaton has 2220 states and 2501 transitions. Word has length 294 [2020-09-25 07:58:20,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-25 07:58:20,507 INFO L479 AbstractCegarLoop]: Abstraction has 2220 states and 2501 transitions. [2020-09-25 07:58:20,507 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-25 07:58:20,507 INFO L276 IsEmpty]: Start isEmpty. Operand 2220 states and 2501 transitions. [2020-09-25 07:58:20,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2020-09-25 07:58:20,514 INFO L414 BasicCegarLoop]: Found error trace [2020-09-25 07:58:20,514 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-25 07:58:20,514 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-25 07:58:20,515 INFO L427 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-25 07:58:20,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-25 07:58:20,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1920210634, now seen corresponding path program 1 times [2020-09-25 07:58:20,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-25 07:58:20,516 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1873634334] [2020-09-25 07:58:20,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-25 07:58:20,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-25 07:58:20,688 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-09-25 07:58:20,688 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-25 07:58:20,698 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-25 07:58:20,777 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.09 07:58:20 BoogieIcfgContainer [2020-09-25 07:58:20,778 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-25 07:58:20,782 INFO L168 Benchmark]: Toolchain (without parser) took 42063.65 ms. Allocated memory was 147.3 MB in the beginning and 640.2 MB in the end (delta: 492.8 MB). Free memory was 100.5 MB in the beginning and 577.7 MB in the end (delta: -477.2 MB). Peak memory consumption was 481.7 MB. Max. memory is 7.1 GB. [2020-09-25 07:58:20,788 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 147.3 MB. Free memory was 120.7 MB in the beginning and 120.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-09-25 07:58:20,790 INFO L168 Benchmark]: CACSL2BoogieTranslator took 789.17 ms. Allocated memory was 147.3 MB in the beginning and 206.0 MB in the end (delta: 58.7 MB). Free memory was 99.9 MB in the beginning and 172.3 MB in the end (delta: -72.5 MB). Peak memory consumption was 31.4 MB. Max. memory is 7.1 GB. [2020-09-25 07:58:20,790 INFO L168 Benchmark]: Boogie Preprocessor took 133.26 ms. Allocated memory is still 206.0 MB. Free memory was 172.3 MB in the beginning and 167.5 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 7.1 GB. [2020-09-25 07:58:20,791 INFO L168 Benchmark]: RCFGBuilder took 1493.59 ms. Allocated memory was 206.0 MB in the beginning and 238.0 MB in the end (delta: 32.0 MB). Free memory was 167.5 MB in the beginning and 163.8 MB in the end (delta: 3.7 MB). Peak memory consumption was 81.5 MB. Max. memory is 7.1 GB. [2020-09-25 07:58:20,794 INFO L168 Benchmark]: TraceAbstraction took 39637.78 ms. Allocated memory was 238.0 MB in the beginning and 640.2 MB in the end (delta: 402.1 MB). Free memory was 163.8 MB in the beginning and 577.7 MB in the end (delta: -413.8 MB). Peak memory consumption was 454.3 MB. Max. memory is 7.1 GB. [2020-09-25 07:58:20,806 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.21 ms. Allocated memory is still 147.3 MB. Free memory was 120.7 MB in the beginning and 120.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 789.17 ms. Allocated memory was 147.3 MB in the beginning and 206.0 MB in the end (delta: 58.7 MB). Free memory was 99.9 MB in the beginning and 172.3 MB in the end (delta: -72.5 MB). Peak memory consumption was 31.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 133.26 ms. Allocated memory is still 206.0 MB. Free memory was 172.3 MB in the beginning and 167.5 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1493.59 ms. Allocated memory was 206.0 MB in the beginning and 238.0 MB in the end (delta: 32.0 MB). Free memory was 167.5 MB in the beginning and 163.8 MB in the end (delta: 3.7 MB). Peak memory consumption was 81.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 39637.78 ms. Allocated memory was 238.0 MB in the beginning and 640.2 MB in the end (delta: 402.1 MB). Free memory was 163.8 MB in the beginning and 577.7 MB in the end (delta: -413.8 MB). Peak memory consumption was 454.3 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: 39.4s, OverallIterations: 8, TraceHistogramMax: 3, AutomataDifference: 15.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1429 SDtfs, 4416 SDslu, 1855 SDs, 0 SdLazy, 8553 SolverSat, 1126 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2287occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 7 MinimizatonAttempts, 1178 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 22.7s InterpolantComputationTime, 1468 NumberOfCodeBlocks, 1468 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1149 ConstructedInterpolants, 0 QuantifiedInterpolants, 459812 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 2 PerfectInterpolantSequences, 435/458 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...