/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.4 --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 05:39:38,227 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-25 05:39:38,231 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-25 05:39:38,277 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-25 05:39:38,278 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-25 05:39:38,289 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-25 05:39:38,291 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-25 05:39:38,295 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-25 05:39:38,298 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-25 05:39:38,302 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-25 05:39:38,303 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-25 05:39:38,305 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-25 05:39:38,305 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-25 05:39:38,308 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-25 05:39:38,312 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-25 05:39:38,314 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-25 05:39:38,316 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-25 05:39:38,317 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-25 05:39:38,318 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-25 05:39:38,327 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-25 05:39:38,328 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-25 05:39:38,330 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-25 05:39:38,331 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-25 05:39:38,332 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-25 05:39:38,335 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-25 05:39:38,336 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-25 05:39:38,336 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-25 05:39:38,339 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-25 05:39:38,339 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-25 05:39:38,341 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-25 05:39:38,342 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-25 05:39:38,343 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-25 05:39:38,343 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-25 05:39:38,344 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-25 05:39:38,345 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-25 05:39:38,346 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-25 05:39:38,346 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-25 05:39:38,347 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-25 05:39:38,347 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-25 05:39:38,348 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-25 05:39:38,349 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-25 05:39:38,350 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 05:39:38,396 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-25 05:39:38,396 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-25 05:39:38,399 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-09-25 05:39:38,399 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-09-25 05:39:38,399 INFO L138 SettingsManager]: * Use SBE=true [2020-09-25 05:39:38,399 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-25 05:39:38,400 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-25 05:39:38,400 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-25 05:39:38,400 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-25 05:39:38,401 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-25 05:39:38,402 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-25 05:39:38,402 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-25 05:39:38,402 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-25 05:39:38,403 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-25 05:39:38,403 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-25 05:39:38,403 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-25 05:39:38,403 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-25 05:39:38,403 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-25 05:39:38,404 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-09-25 05:39:38,404 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-25 05:39:38,404 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-25 05:39:38,404 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-25 05:39:38,404 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-25 05:39:38,405 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-09-25 05:39:38,405 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-09-25 05:39:38,405 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-09-25 05:39:38,405 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-09-25 05:39:38,406 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-25 05:39:38,406 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-09-25 05:39:38,406 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.4;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.4;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.4;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.4;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.4;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.4;log-additional-information=true; [2020-09-25 05:39:38,863 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-25 05:39:38,886 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-25 05:39:38,891 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-25 05:39:38,895 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-25 05:39:38,896 INFO L275 PluginConnector]: CDTParser initialized [2020-09-25 05:39:38,897 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 05:39:38,985 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/8549a9ef9/c38137ae45a14b72a69ff20f73ee54f8/FLAGa388d37f4 [2020-09-25 05:39:39,615 INFO L306 CDTParser]: Found 1 translation units. [2020-09-25 05:39:39,616 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/eca-rers2012/Problem10_label55.c [2020-09-25 05:39:39,629 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/8549a9ef9/c38137ae45a14b72a69ff20f73ee54f8/FLAGa388d37f4 [2020-09-25 05:39:39,879 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/8549a9ef9/c38137ae45a14b72a69ff20f73ee54f8 [2020-09-25 05:39:39,894 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-25 05:39:39,900 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-25 05:39:39,901 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-25 05:39:39,902 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-25 05:39:39,907 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-25 05:39:39,908 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 05:39:39" (1/1) ... [2020-09-25 05:39:39,912 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cb7919e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 05:39:39, skipping insertion in model container [2020-09-25 05:39:39,913 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 05:39:39" (1/1) ... [2020-09-25 05:39:39,922 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-25 05:39:39,979 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-25 05:39:40,416 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-25 05:39:40,422 INFO L203 MainTranslator]: Completed pre-run [2020-09-25 05:39:40,712 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-25 05:39:40,742 INFO L208 MainTranslator]: Completed translation [2020-09-25 05:39:40,744 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 05:39:40 WrapperNode [2020-09-25 05:39:40,745 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-25 05:39:40,746 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-25 05:39:40,746 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-25 05:39:40,746 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-25 05:39:40,766 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 05:39:40" (1/1) ... [2020-09-25 05:39:40,769 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 05:39:40" (1/1) ... [2020-09-25 05:39:40,789 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 05:39:40" (1/1) ... [2020-09-25 05:39:40,790 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 05:39:40" (1/1) ... [2020-09-25 05:39:40,835 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 05:39:40" (1/1) ... [2020-09-25 05:39:40,852 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 05:39:40" (1/1) ... [2020-09-25 05:39:40,863 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 05:39:40" (1/1) ... [2020-09-25 05:39:40,877 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-25 05:39:40,878 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-25 05:39:40,878 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-25 05:39:40,878 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-25 05:39:40,879 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 05:39:40" (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 05:39:40,993 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-25 05:39:40,994 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-25 05:39:40,994 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2020-09-25 05:39:40,995 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-25 05:39:40,995 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2020-09-25 05:39:40,995 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-25 05:39:40,995 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-25 05:39:40,996 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-09-25 05:39:40,996 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-25 05:39:40,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-25 05:39:40,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-25 05:39:42,488 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-25 05:39:42,489 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-09-25 05:39:42,497 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 05:39:42 BoogieIcfgContainer [2020-09-25 05:39:42,497 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-25 05:39:42,498 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-25 05:39:42,499 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-25 05:39:42,502 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-25 05:39:42,503 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.09 05:39:39" (1/3) ... [2020-09-25 05:39:42,504 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@600cbf66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 05:39:42, skipping insertion in model container [2020-09-25 05:39:42,504 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 05:39:40" (2/3) ... [2020-09-25 05:39:42,505 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@600cbf66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 05:39:42, skipping insertion in model container [2020-09-25 05:39:42,505 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 05:39:42" (3/3) ... [2020-09-25 05:39:42,507 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem10_label55.c [2020-09-25 05:39:42,520 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-25 05:39:42,532 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-25 05:39:42,558 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-25 05:39:42,602 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-25 05:39:42,603 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-25 05:39:42,603 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-25 05:39:42,604 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-25 05:39:42,604 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-25 05:39:42,604 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-25 05:39:42,604 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-25 05:39:42,604 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-25 05:39:42,646 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states. [2020-09-25 05:39:42,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-09-25 05:39:42,657 INFO L414 BasicCegarLoop]: Found error trace [2020-09-25 05:39:42,658 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 05:39:42,659 INFO L427 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-25 05:39:42,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-25 05:39:42,667 INFO L82 PathProgramCache]: Analyzing trace with hash -18090369, now seen corresponding path program 1 times [2020-09-25 05:39:42,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-25 05:39:42,680 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1079871953] [2020-09-25 05:39:42,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-25 05:39:42,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 05:39:42,909 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:39:43,127 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:39:43,153 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:39:43,552 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 05:39:43,552 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 46 [2020-09-25 05:39:43,553 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 3 [2020-09-25 05:39:43,553 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 683 [2020-09-25 05:39:43,556 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 05:39:43,557 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-09-25 05:39:43,557 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-09-25 05:39:43,557 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 11 [2020-09-25 05:39:43,558 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 34 [2020-09-25 05:39:43,558 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 4 [2020-09-25 05:39:43,662 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-25 05:39:43,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 05:39:43,675 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:39:43,692 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 05:39:43,692 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 18 [2020-09-25 05:39:43,692 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 05:39:43,693 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 20 [2020-09-25 05:39:43,693 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 05:39:43,693 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-09-25 05:39:43,694 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-25 05:39:43,694 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-25 05:39:43,694 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 7 [2020-09-25 05:39:43,695 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 05:39:43,714 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 05:39:43,715 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1079871953] [2020-09-25 05:39:43,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-25 05:39:43,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-09-25 05:39:43,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740493494] [2020-09-25 05:39:43,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-09-25 05:39:43,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-25 05:39:43,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-09-25 05:39:43,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-09-25 05:39:43,748 INFO L87 Difference]: Start difference. First operand 456 states. Second operand 4 states. [2020-09-25 05:39:45,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-25 05:39:45,703 INFO L93 Difference]: Finished difference Result 1104 states and 1521 transitions. [2020-09-25 05:39:45,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-25 05:39:45,708 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2020-09-25 05:39:45,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-25 05:39:45,739 INFO L225 Difference]: With dead ends: 1104 [2020-09-25 05:39:45,739 INFO L226 Difference]: Without dead ends: 578 [2020-09-25 05:39:45,748 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-09-25 05:39:45,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2020-09-25 05:39:45,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 544. [2020-09-25 05:39:45,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2020-09-25 05:39:45,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 655 transitions. [2020-09-25 05:39:45,899 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 655 transitions. Word has length 37 [2020-09-25 05:39:45,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-25 05:39:45,900 INFO L479 AbstractCegarLoop]: Abstraction has 544 states and 655 transitions. [2020-09-25 05:39:45,900 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-09-25 05:39:45,901 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 655 transitions. [2020-09-25 05:39:45,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2020-09-25 05:39:45,908 INFO L414 BasicCegarLoop]: Found error trace [2020-09-25 05:39:45,908 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 05:39:45,909 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-25 05:39:45,909 INFO L427 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-25 05:39:45,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-25 05:39:45,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1996109808, now seen corresponding path program 1 times [2020-09-25 05:39:45,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-25 05:39:45,910 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [101663055] [2020-09-25 05:39:45,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-25 05:39:45,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 05:39:45,986 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:39:46,154 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:39:46,225 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:39:46,309 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:39:46,490 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:39:49,857 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 05:39:49,858 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 127 [2020-09-25 05:39:49,877 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 5 [2020-09-25 05:39:49,878 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 3904 [2020-09-25 05:39:49,878 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 05:39:49,878 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-09-25 05:39:49,878 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-25 05:39:49,878 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 94 [2020-09-25 05:39:49,879 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 32 [2020-09-25 05:39:49,879 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 05:39:49,935 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-25 05:39:49,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 05:39:49,939 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:39:49,946 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 05:39:49,947 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 18 [2020-09-25 05:39:49,947 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 05:39:49,947 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 9 [2020-09-25 05:39:49,948 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 05:39:49,948 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-09-25 05:39:49,948 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-09-25 05:39:49,948 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-25 05:39:49,949 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-09-25 05:39:49,949 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 05:39:49,964 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-25 05:39:49,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 05:39:49,999 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:39:50,068 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 05:39:50,069 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 75 [2020-09-25 05:39:50,077 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 05:39:50,077 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 87 [2020-09-25 05:39:50,077 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 05:39:50,078 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-09-25 05:39:50,078 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-25 05:39:50,078 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-25 05:39:50,078 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 65 [2020-09-25 05:39:50,079 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 05:39:50,123 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 05:39:50,123 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [101663055] [2020-09-25 05:39:50,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-25 05:39:50,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-09-25 05:39:50,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71595712] [2020-09-25 05:39:50,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-25 05:39:50,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-25 05:39:50,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-25 05:39:50,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-25 05:39:50,128 INFO L87 Difference]: Start difference. First operand 544 states and 655 transitions. Second operand 5 states. [2020-09-25 05:39:51,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-25 05:39:51,827 INFO L93 Difference]: Finished difference Result 1224 states and 1530 transitions. [2020-09-25 05:39:51,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-25 05:39:51,827 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 116 [2020-09-25 05:39:51,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-25 05:39:51,832 INFO L225 Difference]: With dead ends: 1224 [2020-09-25 05:39:51,832 INFO L226 Difference]: Without dead ends: 695 [2020-09-25 05:39:51,835 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 05:39:51,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2020-09-25 05:39:51,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 695. [2020-09-25 05:39:51,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 695 states. [2020-09-25 05:39:51,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 850 transitions. [2020-09-25 05:39:51,859 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 850 transitions. Word has length 116 [2020-09-25 05:39:51,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-25 05:39:51,860 INFO L479 AbstractCegarLoop]: Abstraction has 695 states and 850 transitions. [2020-09-25 05:39:51,860 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-25 05:39:51,861 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 850 transitions. [2020-09-25 05:39:51,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2020-09-25 05:39:51,865 INFO L414 BasicCegarLoop]: Found error trace [2020-09-25 05:39:51,865 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 05:39:51,866 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-25 05:39:51,866 INFO L427 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-25 05:39:51,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-25 05:39:51,866 INFO L82 PathProgramCache]: Analyzing trace with hash 804111666, now seen corresponding path program 1 times [2020-09-25 05:39:51,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-25 05:39:51,867 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [806427577] [2020-09-25 05:39:51,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-25 05:39:51,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 05:39:51,927 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:39:51,980 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:39:52,043 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:39:52,247 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:39:54,543 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 05:39:54,544 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 137 [2020-09-25 05:39:54,544 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 4 [2020-09-25 05:39:54,545 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 2644 [2020-09-25 05:39:54,545 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 05:39:54,545 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-09-25 05:39:54,546 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 5 [2020-09-25 05:39:54,546 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 103 [2020-09-25 05:39:54,546 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 33 [2020-09-25 05:39:54,547 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 05:39:54,641 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-25 05:39:54,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 05:39:54,647 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:39:54,656 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 05:39:54,657 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 18 [2020-09-25 05:39:54,657 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 05:39:54,657 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 12 [2020-09-25 05:39:54,658 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 05:39:54,658 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-09-25 05:39:54,658 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-09-25 05:39:54,658 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-25 05:39:54,659 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-09-25 05:39:54,659 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 05:39:54,678 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-25 05:39:54,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 05:39:54,724 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:39:54,869 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 05:39:54,869 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 85 [2020-09-25 05:39:54,869 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 05:39:54,869 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 166 [2020-09-25 05:39:54,870 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 05:39:54,870 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-09-25 05:39:54,870 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 3 [2020-09-25 05:39:54,870 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-25 05:39:54,871 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 75 [2020-09-25 05:39:54,871 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 05:39:54,934 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 05:39:54,934 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [806427577] [2020-09-25 05:39:54,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-25 05:39:54,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-09-25 05:39:54,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097687021] [2020-09-25 05:39:54,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-25 05:39:54,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-25 05:39:54,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-25 05:39:54,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-09-25 05:39:54,938 INFO L87 Difference]: Start difference. First operand 695 states and 850 transitions. Second operand 6 states. [2020-09-25 05:39:57,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-25 05:39:57,563 INFO L93 Difference]: Finished difference Result 1905 states and 2481 transitions. [2020-09-25 05:39:57,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-25 05:39:57,564 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 126 [2020-09-25 05:39:57,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-25 05:39:57,573 INFO L225 Difference]: With dead ends: 1905 [2020-09-25 05:39:57,573 INFO L226 Difference]: Without dead ends: 1375 [2020-09-25 05:39:57,575 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-09-25 05:39:57,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1375 states. [2020-09-25 05:39:57,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1375 to 1319. [2020-09-25 05:39:57,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1319 states. [2020-09-25 05:39:57,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1319 states to 1319 states and 1695 transitions. [2020-09-25 05:39:57,618 INFO L78 Accepts]: Start accepts. Automaton has 1319 states and 1695 transitions. Word has length 126 [2020-09-25 05:39:57,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-25 05:39:57,618 INFO L479 AbstractCegarLoop]: Abstraction has 1319 states and 1695 transitions. [2020-09-25 05:39:57,618 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-25 05:39:57,619 INFO L276 IsEmpty]: Start isEmpty. Operand 1319 states and 1695 transitions. [2020-09-25 05:39:57,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2020-09-25 05:39:57,622 INFO L414 BasicCegarLoop]: Found error trace [2020-09-25 05:39:57,622 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 05:39:57,622 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-25 05:39:57,623 INFO L427 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-25 05:39:57,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-25 05:39:57,623 INFO L82 PathProgramCache]: Analyzing trace with hash -2061157014, now seen corresponding path program 1 times [2020-09-25 05:39:57,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-25 05:39:57,624 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1405372049] [2020-09-25 05:39:57,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-25 05:39:57,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 05:39:57,670 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:39:57,857 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:39:57,945 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:39:58,760 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 05:39:58,760 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 139 [2020-09-25 05:39:58,761 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 3 [2020-09-25 05:39:58,761 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1111 [2020-09-25 05:39:58,761 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 05:39:58,761 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-09-25 05:39:58,762 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-25 05:39:58,762 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 107 [2020-09-25 05:39:58,762 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 31 [2020-09-25 05:39:58,762 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 05:39:58,813 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-25 05:39:58,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 05:39:58,817 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:39:58,824 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 05:39:58,824 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 18 [2020-09-25 05:39:58,824 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 05:39:58,825 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 8 [2020-09-25 05:39:58,825 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 05:39:58,825 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-09-25 05:39:58,825 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-09-25 05:39:58,826 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-25 05:39:58,826 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-09-25 05:39:58,826 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-25 05:39:58,842 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-25 05:39:58,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 05:39:58,871 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:39:58,938 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 05:39:58,939 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 87 [2020-09-25 05:39:58,939 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 05:39:58,939 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 81 [2020-09-25 05:39:58,940 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 05:39:58,940 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-09-25 05:39:58,940 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-25 05:39:58,940 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-25 05:39:58,940 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 78 [2020-09-25 05:39:58,941 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 05:39:58,979 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 05:39:58,981 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1405372049] [2020-09-25 05:39:58,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-25 05:39:58,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-09-25 05:39:58,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330886154] [2020-09-25 05:39:58,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-25 05:39:58,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-25 05:39:58,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-25 05:39:58,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-25 05:39:58,984 INFO L87 Difference]: Start difference. First operand 1319 states and 1695 transitions. Second operand 5 states. [2020-09-25 05:40:00,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-25 05:40:00,677 INFO L93 Difference]: Finished difference Result 3253 states and 4342 transitions. [2020-09-25 05:40:00,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-25 05:40:00,677 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 128 [2020-09-25 05:40:00,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-25 05:40:00,690 INFO L225 Difference]: With dead ends: 3253 [2020-09-25 05:40:00,690 INFO L226 Difference]: Without dead ends: 2099 [2020-09-25 05:40:00,695 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 05:40:00,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2099 states. [2020-09-25 05:40:00,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2099 to 1779. [2020-09-25 05:40:00,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1779 states. [2020-09-25 05:40:00,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1779 states to 1779 states and 2205 transitions. [2020-09-25 05:40:00,764 INFO L78 Accepts]: Start accepts. Automaton has 1779 states and 2205 transitions. Word has length 128 [2020-09-25 05:40:00,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-25 05:40:00,765 INFO L479 AbstractCegarLoop]: Abstraction has 1779 states and 2205 transitions. [2020-09-25 05:40:00,765 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-25 05:40:00,765 INFO L276 IsEmpty]: Start isEmpty. Operand 1779 states and 2205 transitions. [2020-09-25 05:40:00,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2020-09-25 05:40:00,774 INFO L414 BasicCegarLoop]: Found error trace [2020-09-25 05:40:00,774 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 05:40:00,774 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-25 05:40:00,775 INFO L427 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-25 05:40:00,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-25 05:40:00,776 INFO L82 PathProgramCache]: Analyzing trace with hash 2004537840, now seen corresponding path program 1 times [2020-09-25 05:40:00,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-25 05:40:00,776 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [220683776] [2020-09-25 05:40:00,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-25 05:40:00,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 05:40:00,877 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:40:01,090 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:40:01,186 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:40:01,856 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:40:02,062 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:40:04,898 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:40:05,147 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 05:40:05,147 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 240 [2020-09-25 05:40:05,147 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 6 [2020-09-25 05:40:05,147 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 4323 [2020-09-25 05:40:05,148 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 05:40:05,148 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-09-25 05:40:05,148 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 5 [2020-09-25 05:40:05,148 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 94 [2020-09-25 05:40:05,149 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 114 [2020-09-25 05:40:05,149 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 05:40:05,221 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-25 05:40:05,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 05:40:05,225 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:40:05,232 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 05:40:05,232 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 18 [2020-09-25 05:40:05,232 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 05:40:05,232 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 8 [2020-09-25 05:40:05,233 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 05:40:05,233 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-09-25 05:40:05,233 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-09-25 05:40:05,233 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-25 05:40:05,233 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-09-25 05:40:05,234 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 05:40:05,246 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-25 05:40:05,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 05:40:05,271 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:40:05,379 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 05:40:05,380 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 75 [2020-09-25 05:40:05,380 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 05:40:05,381 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 120 [2020-09-25 05:40:05,381 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 05:40:05,381 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-09-25 05:40:05,382 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 3 [2020-09-25 05:40:05,382 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-25 05:40:05,382 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 66 [2020-09-25 05:40:05,383 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 05:40:05,437 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2020-09-25 05:40:05,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 05:40:05,486 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:40:05,695 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 05:40:05,696 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 107 [2020-09-25 05:40:05,696 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 05:40:05,696 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 230 [2020-09-25 05:40:05,697 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 05:40:05,697 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-09-25 05:40:05,697 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-25 05:40:05,697 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-09-25 05:40:05,698 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 106 [2020-09-25 05:40:05,698 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 05:40:05,894 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 115 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-25 05:40:05,895 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [220683776] [2020-09-25 05:40:05,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-25 05:40:05,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-09-25 05:40:05,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41815425] [2020-09-25 05:40:05,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-25 05:40:05,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-25 05:40:05,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-25 05:40:05,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-09-25 05:40:05,898 INFO L87 Difference]: Start difference. First operand 1779 states and 2205 transitions. Second operand 8 states. [2020-09-25 05:40:09,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-25 05:40:09,123 INFO L93 Difference]: Finished difference Result 4557 states and 5938 transitions. [2020-09-25 05:40:09,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-09-25 05:40:09,126 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 227 [2020-09-25 05:40:09,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-25 05:40:09,146 INFO L225 Difference]: With dead ends: 4557 [2020-09-25 05:40:09,147 INFO L226 Difference]: Without dead ends: 2943 [2020-09-25 05:40:09,153 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2020-09-25 05:40:09,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2943 states. [2020-09-25 05:40:09,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2943 to 2892. [2020-09-25 05:40:09,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2892 states. [2020-09-25 05:40:09,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2892 states to 2892 states and 3698 transitions. [2020-09-25 05:40:09,255 INFO L78 Accepts]: Start accepts. Automaton has 2892 states and 3698 transitions. Word has length 227 [2020-09-25 05:40:09,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-25 05:40:09,256 INFO L479 AbstractCegarLoop]: Abstraction has 2892 states and 3698 transitions. [2020-09-25 05:40:09,256 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-25 05:40:09,256 INFO L276 IsEmpty]: Start isEmpty. Operand 2892 states and 3698 transitions. [2020-09-25 05:40:09,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2020-09-25 05:40:09,261 INFO L414 BasicCegarLoop]: Found error trace [2020-09-25 05:40:09,261 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 05:40:09,262 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-25 05:40:09,262 INFO L427 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-25 05:40:09,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-25 05:40:09,262 INFO L82 PathProgramCache]: Analyzing trace with hash 75469727, now seen corresponding path program 1 times [2020-09-25 05:40:09,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-25 05:40:09,263 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [792065803] [2020-09-25 05:40:09,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-25 05:40:09,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 05:40:09,354 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:40:09,492 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:40:09,621 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:40:09,697 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:40:09,874 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:40:11,381 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:40:14,344 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 05:40:14,344 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 241 [2020-09-25 05:40:14,344 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 6 [2020-09-25 05:40:14,345 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 5025 [2020-09-25 05:40:14,345 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 05:40:14,345 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-09-25 05:40:14,345 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-25 05:40:14,345 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 106 [2020-09-25 05:40:14,345 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 104 [2020-09-25 05:40:14,346 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-25 05:40:14,401 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-25 05:40:14,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 05:40:14,409 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:40:14,416 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 05:40:14,416 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 18 [2020-09-25 05:40:14,417 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 05:40:14,417 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 13 [2020-09-25 05:40:14,417 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 05:40:14,417 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-09-25 05:40:14,418 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-09-25 05:40:14,418 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-25 05:40:14,418 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-09-25 05:40:14,418 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 05:40:14,432 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-25 05:40:14,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 05:40:14,459 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:40:14,522 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 05:40:14,522 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 85 [2020-09-25 05:40:14,522 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 05:40:14,523 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 75 [2020-09-25 05:40:14,523 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 05:40:14,523 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-09-25 05:40:14,523 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-25 05:40:14,523 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-25 05:40:14,524 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 77 [2020-09-25 05:40:14,524 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-25 05:40:14,555 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2020-09-25 05:40:14,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 05:40:14,600 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:40:14,762 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 05:40:14,763 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 98 [2020-09-25 05:40:14,763 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 05:40:14,763 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 183 [2020-09-25 05:40:14,764 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 05:40:14,764 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-09-25 05:40:14,764 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-25 05:40:14,765 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-09-25 05:40:14,765 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 97 [2020-09-25 05:40:14,765 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 05:40:14,944 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 05:40:14,944 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [792065803] [2020-09-25 05:40:14,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-25 05:40:14,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-25 05:40:14,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838782967] [2020-09-25 05:40:14,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-25 05:40:14,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-25 05:40:14,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-25 05:40:14,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-25 05:40:14,948 INFO L87 Difference]: Start difference. First operand 2892 states and 3698 transitions. Second operand 7 states. [2020-09-25 05:40:17,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-25 05:40:17,472 INFO L93 Difference]: Finished difference Result 6793 states and 9037 transitions. [2020-09-25 05:40:17,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-25 05:40:17,476 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 228 [2020-09-25 05:40:17,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-25 05:40:17,493 INFO L225 Difference]: With dead ends: 6793 [2020-09-25 05:40:17,493 INFO L226 Difference]: Without dead ends: 3092 [2020-09-25 05:40:17,504 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2020-09-25 05:40:17,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3092 states. [2020-09-25 05:40:17,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3092 to 2856. [2020-09-25 05:40:17,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2856 states. [2020-09-25 05:40:17,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2856 states to 2856 states and 3525 transitions. [2020-09-25 05:40:17,581 INFO L78 Accepts]: Start accepts. Automaton has 2856 states and 3525 transitions. Word has length 228 [2020-09-25 05:40:17,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-25 05:40:17,581 INFO L479 AbstractCegarLoop]: Abstraction has 2856 states and 3525 transitions. [2020-09-25 05:40:17,581 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-25 05:40:17,581 INFO L276 IsEmpty]: Start isEmpty. Operand 2856 states and 3525 transitions. [2020-09-25 05:40:17,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2020-09-25 05:40:17,588 INFO L414 BasicCegarLoop]: Found error trace [2020-09-25 05:40:17,588 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 05:40:17,588 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-25 05:40:17,589 INFO L427 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-25 05:40:17,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-25 05:40:17,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1331921650, now seen corresponding path program 1 times [2020-09-25 05:40:17,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-25 05:40:17,590 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2061198719] [2020-09-25 05:40:17,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-25 05:40:17,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 05:40:17,720 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:40:18,158 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:40:18,475 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:40:19,201 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 05:40:19,202 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 307 [2020-09-25 05:40:19,202 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 3 [2020-09-25 05:40:19,202 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1541 [2020-09-25 05:40:19,202 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 05:40:19,203 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-09-25 05:40:19,203 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-25 05:40:19,203 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 274 [2020-09-25 05:40:19,203 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 32 [2020-09-25 05:40:19,203 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-25 05:40:19,291 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-25 05:40:19,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 05:40:19,295 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:40:19,302 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 05:40:19,302 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 18 [2020-09-25 05:40:19,303 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 05:40:19,303 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 8 [2020-09-25 05:40:19,303 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 05:40:19,303 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-09-25 05:40:19,304 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-09-25 05:40:19,304 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-25 05:40:19,304 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-09-25 05:40:19,304 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-25 05:40:19,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-25 05:40:19,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 05:40:19,336 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:40:19,371 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 05:40:19,372 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 142 [2020-09-25 05:40:19,372 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 05:40:19,372 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 41 [2020-09-25 05:40:19,372 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 05:40:19,373 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-09-25 05:40:19,373 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-09-25 05:40:19,373 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-25 05:40:19,373 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-09-25 05:40:19,373 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 05:40:19,438 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2020-09-25 05:40:19,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 05:40:19,486 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:40:19,611 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 05:40:19,612 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 107 [2020-09-25 05:40:19,612 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 05:40:19,612 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 146 [2020-09-25 05:40:19,612 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 05:40:19,613 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-09-25 05:40:19,613 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-25 05:40:19,613 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-25 05:40:19,613 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 97 [2020-09-25 05:40:19,613 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 05:40:19,702 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 45 proven. 2 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2020-09-25 05:40:19,702 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2061198719] [2020-09-25 05:40:19,702 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-25 05:40:19,703 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-09-25 05:40:19,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371311948] [2020-09-25 05:40:19,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-25 05:40:19,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-25 05:40:19,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-25 05:40:19,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-25 05:40:19,705 INFO L87 Difference]: Start difference. First operand 2856 states and 3525 transitions. Second operand 5 states. [2020-09-25 05:40:21,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-25 05:40:21,328 INFO L93 Difference]: Finished difference Result 6324 states and 7947 transitions. [2020-09-25 05:40:21,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-25 05:40:21,329 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 294 [2020-09-25 05:40:21,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-25 05:40:21,346 INFO L225 Difference]: With dead ends: 6324 [2020-09-25 05:40:21,346 INFO L226 Difference]: Without dead ends: 3633 [2020-09-25 05:40:21,356 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 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 05:40:21,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3633 states. [2020-09-25 05:40:21,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3633 to 3163. [2020-09-25 05:40:21,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3163 states. [2020-09-25 05:40:21,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3163 states to 3163 states and 3650 transitions. [2020-09-25 05:40:21,435 INFO L78 Accepts]: Start accepts. Automaton has 3163 states and 3650 transitions. Word has length 294 [2020-09-25 05:40:21,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-25 05:40:21,435 INFO L479 AbstractCegarLoop]: Abstraction has 3163 states and 3650 transitions. [2020-09-25 05:40:21,435 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-25 05:40:21,436 INFO L276 IsEmpty]: Start isEmpty. Operand 3163 states and 3650 transitions. [2020-09-25 05:40:21,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2020-09-25 05:40:21,443 INFO L414 BasicCegarLoop]: Found error trace [2020-09-25 05:40:21,444 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 05:40:21,444 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-25 05:40:21,444 INFO L427 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-25 05:40:21,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-25 05:40:21,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1920210634, now seen corresponding path program 1 times [2020-09-25 05:40:21,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-25 05:40:21,445 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [321270112] [2020-09-25 05:40:21,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-25 05:40:21,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-25 05:40:21,520 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-09-25 05:40:21,520 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-25 05:40:21,528 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-25 05:40:21,586 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.09 05:40:21 BoogieIcfgContainer [2020-09-25 05:40:21,587 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-25 05:40:21,590 INFO L168 Benchmark]: Toolchain (without parser) took 41693.18 ms. Allocated memory was 139.5 MB in the beginning and 651.2 MB in the end (delta: 511.7 MB). Free memory was 101.0 MB in the beginning and 182.0 MB in the end (delta: -81.0 MB). Peak memory consumption was 430.7 MB. Max. memory is 7.1 GB. [2020-09-25 05:40:21,591 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 139.5 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-09-25 05:40:21,597 INFO L168 Benchmark]: CACSL2BoogieTranslator took 843.92 ms. Allocated memory was 139.5 MB in the beginning and 204.5 MB in the end (delta: 65.0 MB). Free memory was 100.4 MB in the beginning and 169.3 MB in the end (delta: -68.9 MB). Peak memory consumption was 34.4 MB. Max. memory is 7.1 GB. [2020-09-25 05:40:21,598 INFO L168 Benchmark]: Boogie Preprocessor took 131.78 ms. Allocated memory is still 204.5 MB. Free memory was 169.3 MB in the beginning and 164.4 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 7.1 GB. [2020-09-25 05:40:21,599 INFO L168 Benchmark]: RCFGBuilder took 1619.52 ms. Allocated memory was 204.5 MB in the beginning and 238.0 MB in the end (delta: 33.6 MB). Free memory was 164.4 MB in the beginning and 162.9 MB in the end (delta: 1.5 MB). Peak memory consumption was 81.0 MB. Max. memory is 7.1 GB. [2020-09-25 05:40:21,602 INFO L168 Benchmark]: TraceAbstraction took 39088.26 ms. Allocated memory was 238.0 MB in the beginning and 651.2 MB in the end (delta: 413.1 MB). Free memory was 161.4 MB in the beginning and 182.0 MB in the end (delta: -20.5 MB). Peak memory consumption was 392.6 MB. Max. memory is 7.1 GB. [2020-09-25 05:40:21,612 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.20 ms. Allocated memory is still 139.5 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 843.92 ms. Allocated memory was 139.5 MB in the beginning and 204.5 MB in the end (delta: 65.0 MB). Free memory was 100.4 MB in the beginning and 169.3 MB in the end (delta: -68.9 MB). Peak memory consumption was 34.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 131.78 ms. Allocated memory is still 204.5 MB. Free memory was 169.3 MB in the beginning and 164.4 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1619.52 ms. Allocated memory was 204.5 MB in the beginning and 238.0 MB in the end (delta: 33.6 MB). Free memory was 164.4 MB in the beginning and 162.9 MB in the end (delta: 1.5 MB). Peak memory consumption was 81.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 39088.26 ms. Allocated memory was 238.0 MB in the beginning and 651.2 MB in the end (delta: 413.1 MB). Free memory was 161.4 MB in the beginning and 182.0 MB in the end (delta: -20.5 MB). Peak memory consumption was 392.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 58]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int inputC = 3; [L8] int inputD = 4; [L9] int inputE = 5; [L10] int inputF = 6; [L11] int inputB = 2; [L14] int a1 = 23; [L15] int a19 = 9; [L16] int a10 = 0; [L17] int a12 = 0; [L18] int a4 = 14; [L579] int output = -1; [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL, EXPR calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) [L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) [L225] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) [L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) [L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) [L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) [L244] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) [L249] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) [L254] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) [L260] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) [L265] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) [L271] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) [L277] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) [L283] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) [L286] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) [L291] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) [L296] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) [L301] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) [L306] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) [L312] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) [L317] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) [L320] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) [L323] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) [L326] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) [L329] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) [L335] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) [L340] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) [L345] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) [L351] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) [L354] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) [L357] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) [L360] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) [L365] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0))))) [L370] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) [L375] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) [L378] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) [L383] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) [L388] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0))))) [L393] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) [L398] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) [L403] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14))) [L408] COND FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))) [L414] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14))) [L419] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10)))))) [L425] COND TRUE ((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0)) [L426] a1 = ((((a1 / 5) * 5) / 5) + 505228) [L427] a10 = 1 [L429] return 25; [L590] RET, EXPR calculate_output(input) [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL, EXPR calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) [L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) [L225] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) [L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) [L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) [L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) [L244] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) [L249] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) [L254] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) [L260] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) [L265] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) [L271] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) [L277] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) [L283] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) [L286] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) [L291] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) [L296] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) [L301] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) [L306] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) [L312] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) [L317] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) [L320] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) [L323] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) [L326] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) [L329] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) [L335] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) [L340] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) [L345] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) [L351] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) [L354] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) [L357] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) [L360] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) [L365] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0))))) [L370] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) [L375] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) [L378] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) [L383] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) [L388] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0))))) [L393] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) [L398] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) [L403] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14))) [L408] COND FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))) [L414] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14))) [L419] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10)))))) [L425] COND FALSE !(((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0))) [L430] COND FALSE !((((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 6)) && (a19==10))) && (a12==0))) [L436] COND FALSE !(((a19==9) && ((((input == 4) && (( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 ))) && (a12==0)) && (a4==14)))) [L442] COND FALSE !((((a19==10) && ((a12==0) && ((((a10==1) && a1 <= -13 ) || (( ((38 < a1) && (218 >= a1)) && (a10==0)) || ((a10==0) && 218 < a1 ))) && (input == 3)))) && (a4==14))) [L448] COND FALSE !(((a19==9) && (((a4==14) && ((((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4))) && (input == 5))) && (a12==0)))) [L454] COND FALSE !((((a12==0) && ((((input == 5) && (a19==10)) && ((38 < a1) && (218 >= a1)) ) && (a4==14))) && (a10==1))) [L460] COND FALSE !(((a19==9) && ((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3)) && (a10==1)) && (a12==0))))) [L465] COND FALSE !(((a10==0) && ((a12==0) && ((((input == 5) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a4==14))))) [L471] COND FALSE !(( 218 < a1 && (((((input == 3) && (a10==1)) && (a12==0)) && (a4==14)) && (a19==10)))) [L476] COND FALSE !((((a12==0) && ((a19==9) && (((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a4==14)))) && (a10==3))) [L481] COND FALSE !((((((a4==14) && ( ((38 < a1) && (218 >= a1)) && (input == 2))) && (a12==0)) && (a10==1)) && (a19==10))) [L487] COND FALSE !((((a19==10) && ((a10==1) && ((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (input == 5))))) && (a4==14))) [L493] COND FALSE !(((((a10==1) && (((input == 5) && 218 < a1 ) && (a4==14))) && (a19==10)) && (a12==0))) [L499] COND FALSE !((((a4==14) && ((a19==9) && ((input == 2) && (((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 ))))) && (a12==0))) [L504] COND FALSE !((((a4==14) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 2))) && (a12==0))) && (a10==4))) [L509] COND FALSE !(((a4==14) && (((a19==9) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 6)) && (a10==3))) && (a12==0)))) [L514] COND FALSE !((((a4==14) && ((((input == 6) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a12==0))) && (a10==0))) [L517] COND FALSE !(((a12==0) && ((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 2)) && (a19==10))))) [L523] COND FALSE !((((a12==0) && ((a19==9) && ((a10==2) && ((input == 6) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))))) && (a4==14))) [L526] COND FALSE !(((a4==14) && ((a19==9) && ((a12==0) && (((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)))))) [L529] COND FALSE !(((a19==9) && (((a10==1) && ((a12==0) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )))) && (a4==14)))) [L534] COND FALSE !(((a19==9) && ((a4==14) && ((a10==1) && (((input == 5) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a12==0)))))) [L540] COND FALSE !(((a12==0) && (((((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a19==9)) && (a4==14)) && (a10==0)))) [L545] COND FALSE !(((a4==14) && (((a12==0) && ((a19==9) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )))) && (a10==4)))) [L548] COND FALSE !(((((( ((38 < a1) && (218 >= a1)) && (input == 3)) && (a10==1)) && (a12==0)) && (a4==14)) && (a19==10))) [L554] COND FALSE !((((a4==14) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 4)) && (a12==0)) && (a19==9))) && (a10==2))) [L557] COND TRUE ((a12==0) && ((( 218 < a1 && ((a19==9) && (input == 5))) && (a10==1)) && (a4==14))) [L558] a1 = ((((a1 * 9)/ 10) + 58620) - 603783) [L559] a10 = 4 [L560] a19 = 8 [L562] return -1; [L590] RET, EXPR calculate_output(input) [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND TRUE (((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8)) [L58] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 456 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 38.9s, OverallIterations: 8, TraceHistogramMax: 3, AutomataDifference: 15.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1438 SDtfs, 4946 SDslu, 1865 SDs, 0 SdLazy, 8913 SolverSat, 1107 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 96 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3163occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 7 MinimizatonAttempts, 1167 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 21.8s InterpolantComputationTime, 1468 NumberOfCodeBlocks, 1468 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1149 ConstructedInterpolants, 0 QuantifiedInterpolants, 434328 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 449/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...