/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_label42.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-c90d42b [2020-09-25 05:39:13,998 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-25 05:39:14,002 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-25 05:39:14,053 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-25 05:39:14,053 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-25 05:39:14,061 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-25 05:39:14,063 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-25 05:39:14,067 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-25 05:39:14,070 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-25 05:39:14,073 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-25 05:39:14,075 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-25 05:39:14,076 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-25 05:39:14,076 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-25 05:39:14,079 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-25 05:39:14,082 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-25 05:39:14,083 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-25 05:39:14,085 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-25 05:39:14,087 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-25 05:39:14,089 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-25 05:39:14,097 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-25 05:39:14,100 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-25 05:39:14,101 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-25 05:39:14,103 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-25 05:39:14,104 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-25 05:39:14,116 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-25 05:39:14,117 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-25 05:39:14,117 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-25 05:39:14,118 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-25 05:39:14,119 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-25 05:39:14,127 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-25 05:39:14,127 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-25 05:39:14,132 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-25 05:39:14,133 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-25 05:39:14,134 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-25 05:39:14,135 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-25 05:39:14,135 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-25 05:39:14,138 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-25 05:39:14,139 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-25 05:39:14,139 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-25 05:39:14,140 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-25 05:39:14,141 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-25 05:39:14,142 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:14,189 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-25 05:39:14,189 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-25 05:39:14,192 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-09-25 05:39:14,192 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-09-25 05:39:14,193 INFO L138 SettingsManager]: * Use SBE=true [2020-09-25 05:39:14,193 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-25 05:39:14,193 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-25 05:39:14,194 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-25 05:39:14,194 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-25 05:39:14,194 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-25 05:39:14,195 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-25 05:39:14,196 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-25 05:39:14,196 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-25 05:39:14,196 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-25 05:39:14,197 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-25 05:39:14,197 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-25 05:39:14,197 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-25 05:39:14,197 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-25 05:39:14,197 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-09-25 05:39:14,198 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-25 05:39:14,198 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-25 05:39:14,198 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-25 05:39:14,198 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-25 05:39:14,199 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-09-25 05:39:14,199 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-09-25 05:39:14,199 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-09-25 05:39:14,199 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-09-25 05:39:14,199 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-25 05:39:14,200 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-09-25 05:39:14,200 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:14,661 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-25 05:39:14,685 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-25 05:39:14,692 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-25 05:39:14,695 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-25 05:39:14,696 INFO L275 PluginConnector]: CDTParser initialized [2020-09-25 05:39:14,697 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label42.c [2020-09-25 05:39:14,793 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/ac1dd38ac/678d1f5080e04651a6303906dc4a2d55/FLAGd13f9bbdc [2020-09-25 05:39:15,450 INFO L306 CDTParser]: Found 1 translation units. [2020-09-25 05:39:15,451 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/eca-rers2012/Problem10_label42.c [2020-09-25 05:39:15,464 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/ac1dd38ac/678d1f5080e04651a6303906dc4a2d55/FLAGd13f9bbdc [2020-09-25 05:39:15,677 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/ac1dd38ac/678d1f5080e04651a6303906dc4a2d55 [2020-09-25 05:39:15,691 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-25 05:39:15,697 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-25 05:39:15,698 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-25 05:39:15,698 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-25 05:39:15,703 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-25 05:39:15,704 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 05:39:15" (1/1) ... [2020-09-25 05:39:15,709 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cbac012 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 05:39:15, skipping insertion in model container [2020-09-25 05:39:15,709 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 05:39:15" (1/1) ... [2020-09-25 05:39:15,719 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-25 05:39:15,789 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-25 05:39:16,311 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-25 05:39:16,318 INFO L203 MainTranslator]: Completed pre-run [2020-09-25 05:39:16,564 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-25 05:39:16,591 INFO L208 MainTranslator]: Completed translation [2020-09-25 05:39:16,592 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 05:39:16 WrapperNode [2020-09-25 05:39:16,592 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-25 05:39:16,598 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-25 05:39:16,598 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-25 05:39:16,599 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-25 05:39:16,622 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:16" (1/1) ... [2020-09-25 05:39:16,624 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:16" (1/1) ... [2020-09-25 05:39:16,649 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:16" (1/1) ... [2020-09-25 05:39:16,657 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:16" (1/1) ... [2020-09-25 05:39:16,694 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:16" (1/1) ... [2020-09-25 05:39:16,708 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:16" (1/1) ... [2020-09-25 05:39:16,716 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:16" (1/1) ... [2020-09-25 05:39:16,728 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-25 05:39:16,729 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-25 05:39:16,729 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-25 05:39:16,729 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-25 05:39:16,730 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 05:39:16" (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:16,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-25 05:39:16,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-25 05:39:16,817 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2020-09-25 05:39:16,817 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-25 05:39:16,817 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2020-09-25 05:39:16,818 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-25 05:39:16,818 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-25 05:39:16,818 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-09-25 05:39:16,818 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-25 05:39:16,818 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-25 05:39:16,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-25 05:39:18,489 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-25 05:39:18,490 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-09-25 05:39:18,499 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 05:39:18 BoogieIcfgContainer [2020-09-25 05:39:18,499 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-25 05:39:18,501 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-25 05:39:18,501 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-25 05:39:18,505 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-25 05:39:18,506 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.09 05:39:15" (1/3) ... [2020-09-25 05:39:18,507 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60447c24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 05:39:18, skipping insertion in model container [2020-09-25 05:39:18,507 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 05:39:16" (2/3) ... [2020-09-25 05:39:18,508 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60447c24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 05:39:18, skipping insertion in model container [2020-09-25 05:39:18,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 05:39:18" (3/3) ... [2020-09-25 05:39:18,510 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem10_label42.c [2020-09-25 05:39:18,523 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-25 05:39:18,536 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-25 05:39:18,560 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-25 05:39:18,597 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-25 05:39:18,597 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-25 05:39:18,597 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-25 05:39:18,597 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-25 05:39:18,598 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-25 05:39:18,598 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-25 05:39:18,598 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-25 05:39:18,598 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-25 05:39:18,632 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states. [2020-09-25 05:39:18,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-09-25 05:39:18,642 INFO L414 BasicCegarLoop]: Found error trace [2020-09-25 05:39:18,644 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] [2020-09-25 05:39:18,645 INFO L427 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-25 05:39:18,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-25 05:39:18,654 INFO L82 PathProgramCache]: Analyzing trace with hash 969247631, now seen corresponding path program 1 times [2020-09-25 05:39:18,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-25 05:39:18,667 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [982380634] [2020-09-25 05:39:18,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-25 05:39:18,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 05:39:18,911 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:39:19,099 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:39:19,585 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 05:39:19,585 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 45 [2020-09-25 05:39:19,586 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-09-25 05:39:19,586 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 737 [2020-09-25 05:39:19,590 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 05:39:19,590 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-09-25 05:39:19,591 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-09-25 05:39:19,591 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 11 [2020-09-25 05:39:19,591 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 33 [2020-09-25 05:39:19,592 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 4 [2020-09-25 05:39:19,723 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-25 05:39:19,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 05:39:19,745 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:39:19,781 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 05:39:19,782 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 18 [2020-09-25 05:39:19,782 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 05:39:19,783 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 40 [2020-09-25 05:39:19,783 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 05:39:19,784 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-09-25 05:39:19,784 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-25 05:39:19,785 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-25 05:39:19,785 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 7 [2020-09-25 05:39:19,786 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 2 [2020-09-25 05:39:19,813 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:19,814 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [982380634] [2020-09-25 05:39:19,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-25 05:39:19,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-09-25 05:39:19,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639545430] [2020-09-25 05:39:19,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-09-25 05:39:19,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-25 05:39:19,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-09-25 05:39:19,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-09-25 05:39:19,854 INFO L87 Difference]: Start difference. First operand 456 states. Second operand 4 states. [2020-09-25 05:39:22,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-25 05:39:22,019 INFO L93 Difference]: Finished difference Result 1104 states and 1521 transitions. [2020-09-25 05:39:22,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-25 05:39:22,023 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2020-09-25 05:39:22,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-25 05:39:22,045 INFO L225 Difference]: With dead ends: 1104 [2020-09-25 05:39:22,045 INFO L226 Difference]: Without dead ends: 578 [2020-09-25 05:39:22,056 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-09-25 05:39:22,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2020-09-25 05:39:22,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 544. [2020-09-25 05:39:22,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2020-09-25 05:39:22,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 655 transitions. [2020-09-25 05:39:22,151 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 655 transitions. Word has length 36 [2020-09-25 05:39:22,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-25 05:39:22,151 INFO L479 AbstractCegarLoop]: Abstraction has 544 states and 655 transitions. [2020-09-25 05:39:22,151 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-09-25 05:39:22,152 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 655 transitions. [2020-09-25 05:39:22,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2020-09-25 05:39:22,158 INFO L414 BasicCegarLoop]: Found error trace [2020-09-25 05:39:22,159 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-25 05:39:22,159 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-25 05:39:22,159 INFO L427 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-25 05:39:22,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-25 05:39:22,160 INFO L82 PathProgramCache]: Analyzing trace with hash -2117330465, now seen corresponding path program 1 times [2020-09-25 05:39:22,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-25 05:39:22,160 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2122726251] [2020-09-25 05:39:22,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-25 05:39:22,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 05:39:22,271 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:39:22,354 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:39:22,474 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:39:22,539 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:39:22,707 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:39:23,619 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:39:23,932 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:39:27,207 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 05:39:27,208 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 126 [2020-09-25 05:39:27,208 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 7 [2020-09-25 05:39:27,208 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 5002 [2020-09-25 05:39:27,209 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 05:39:27,209 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-09-25 05:39:27,209 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-25 05:39:27,209 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 94 [2020-09-25 05:39:27,210 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 31 [2020-09-25 05:39:27,210 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 05:39:27,279 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-25 05:39:27,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 05:39:27,285 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:39:27,293 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 05:39:27,294 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 18 [2020-09-25 05:39:27,294 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 05:39:27,294 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 10 [2020-09-25 05:39:27,295 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 05:39:27,295 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-09-25 05:39:27,295 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-09-25 05:39:27,295 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-25 05:39:27,295 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-09-25 05:39:27,296 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 05:39:27,314 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-25 05:39:27,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 05:39:27,348 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:39:27,417 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 05:39:27,417 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 75 [2020-09-25 05:39:27,417 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 05:39:27,418 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 85 [2020-09-25 05:39:27,418 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 05:39:27,418 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-09-25 05:39:27,419 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-25 05:39:27,419 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-25 05:39:27,419 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 65 [2020-09-25 05:39:27,419 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 05:39:27,471 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-25 05:39:27,472 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2122726251] [2020-09-25 05:39:27,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-25 05:39:27,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-09-25 05:39:27,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944224266] [2020-09-25 05:39:27,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-25 05:39:27,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-25 05:39:27,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-25 05:39:27,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-25 05:39:27,476 INFO L87 Difference]: Start difference. First operand 544 states and 655 transitions. Second operand 5 states. [2020-09-25 05:39:29,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-25 05:39:29,140 INFO L93 Difference]: Finished difference Result 1224 states and 1530 transitions. [2020-09-25 05:39:29,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-25 05:39:29,140 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 115 [2020-09-25 05:39:29,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-25 05:39:29,146 INFO L225 Difference]: With dead ends: 1224 [2020-09-25 05:39:29,146 INFO L226 Difference]: Without dead ends: 695 [2020-09-25 05:39:29,149 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:29,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2020-09-25 05:39:29,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 695. [2020-09-25 05:39:29,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 695 states. [2020-09-25 05:39:29,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 850 transitions. [2020-09-25 05:39:29,196 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 850 transitions. Word has length 115 [2020-09-25 05:39:29,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-25 05:39:29,199 INFO L479 AbstractCegarLoop]: Abstraction has 695 states and 850 transitions. [2020-09-25 05:39:29,199 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-25 05:39:29,199 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 850 transitions. [2020-09-25 05:39:29,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2020-09-25 05:39:29,210 INFO L414 BasicCegarLoop]: Found error trace [2020-09-25 05:39:29,210 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-09-25 05:39:29,210 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-25 05:39:29,210 INFO L427 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-25 05:39:29,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-25 05:39:29,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1359994051, now seen corresponding path program 1 times [2020-09-25 05:39:29,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-25 05:39:29,212 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1119495653] [2020-09-25 05:39:29,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-25 05:39:29,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 05:39:29,297 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:39:29,681 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 05:39:29,681 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 136 [2020-09-25 05:39:29,682 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 05:39:29,682 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 413 [2020-09-25 05:39:29,682 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 05:39:29,682 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-09-25 05:39:29,683 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-25 05:39:29,683 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 105 [2020-09-25 05:39:29,683 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 30 [2020-09-25 05:39:29,683 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 05:39:29,747 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-25 05:39:29,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 05:39:29,756 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:39:29,764 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 05:39:29,765 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 18 [2020-09-25 05:39:29,765 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 05:39:29,767 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 12 [2020-09-25 05:39:29,767 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 05:39:29,767 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-09-25 05:39:29,767 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-09-25 05:39:29,768 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-25 05:39:29,768 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-09-25 05:39:29,768 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 05:39:29,783 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-25 05:39:29,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 05:39:29,830 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:39:29,925 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 05:39:29,926 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 85 [2020-09-25 05:39:29,926 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 05:39:29,926 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 114 [2020-09-25 05:39:29,927 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 05:39:29,927 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-09-25 05:39:29,928 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-25 05:39:29,929 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-25 05:39:29,929 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 76 [2020-09-25 05:39:29,929 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 2 [2020-09-25 05:39:30,006 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-25 05:39:30,007 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1119495653] [2020-09-25 05:39:30,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-25 05:39:30,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-09-25 05:39:30,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076528210] [2020-09-25 05:39:30,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-25 05:39:30,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-25 05:39:30,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-25 05:39:30,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-25 05:39:30,011 INFO L87 Difference]: Start difference. First operand 695 states and 850 transitions. Second operand 5 states. [2020-09-25 05:39:31,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-25 05:39:31,799 INFO L93 Difference]: Finished difference Result 1549 states and 1977 transitions. [2020-09-25 05:39:31,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-25 05:39:31,801 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 125 [2020-09-25 05:39:31,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-25 05:39:31,811 INFO L225 Difference]: With dead ends: 1549 [2020-09-25 05:39:31,811 INFO L226 Difference]: Without dead ends: 1019 [2020-09-25 05:39:31,813 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:31,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2020-09-25 05:39:31,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 999. [2020-09-25 05:39:31,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 999 states. [2020-09-25 05:39:31,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 999 states and 1279 transitions. [2020-09-25 05:39:31,853 INFO L78 Accepts]: Start accepts. Automaton has 999 states and 1279 transitions. Word has length 125 [2020-09-25 05:39:31,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-25 05:39:31,855 INFO L479 AbstractCegarLoop]: Abstraction has 999 states and 1279 transitions. [2020-09-25 05:39:31,855 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-25 05:39:31,855 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 1279 transitions. [2020-09-25 05:39:31,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2020-09-25 05:39:31,870 INFO L414 BasicCegarLoop]: Found error trace [2020-09-25 05:39:31,870 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-25 05:39:31,870 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-25 05:39:31,874 INFO L427 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-25 05:39:31,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-25 05:39:31,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1154324421, now seen corresponding path program 1 times [2020-09-25 05:39:31,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-25 05:39:31,875 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [302136178] [2020-09-25 05:39:31,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-25 05:39:31,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 05:39:31,929 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:39:32,143 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:39:32,204 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:39:32,536 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:39:33,706 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 05:39:33,706 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 138 [2020-09-25 05:39:33,707 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 4 [2020-09-25 05:39:33,707 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1800 [2020-09-25 05:39:33,707 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 05:39:33,707 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-09-25 05:39:33,708 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 5 [2020-09-25 05:39:33,708 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 105 [2020-09-25 05:39:33,708 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 32 [2020-09-25 05:39:33,708 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 05:39:33,777 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-25 05:39:33,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 05:39:33,781 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:39:33,789 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 05:39:33,790 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 18 [2020-09-25 05:39:33,790 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 05:39:33,790 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 10 [2020-09-25 05:39:33,791 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 05:39:33,791 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-09-25 05:39:33,791 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-09-25 05:39:33,791 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-25 05:39:33,792 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-09-25 05:39:33,792 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 05:39:33,807 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-25 05:39:33,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 05:39:33,845 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:39:33,963 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 05:39:33,963 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 87 [2020-09-25 05:39:33,963 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 05:39:33,964 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 136 [2020-09-25 05:39:33,964 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 05:39:33,964 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-09-25 05:39:33,964 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 3 [2020-09-25 05:39:33,964 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-25 05:39:33,965 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 77 [2020-09-25 05:39:33,965 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 05:39:34,024 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-25 05:39:34,025 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [302136178] [2020-09-25 05:39:34,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-25 05:39:34,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-09-25 05:39:34,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430629789] [2020-09-25 05:39:34,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-25 05:39:34,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-25 05:39:34,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-25 05:39:34,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-09-25 05:39:34,027 INFO L87 Difference]: Start difference. First operand 999 states and 1279 transitions. Second operand 6 states. [2020-09-25 05:39:36,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-25 05:39:36,418 INFO L93 Difference]: Finished difference Result 2797 states and 3802 transitions. [2020-09-25 05:39:36,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-25 05:39:36,420 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 127 [2020-09-25 05:39:36,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-25 05:39:36,434 INFO L225 Difference]: With dead ends: 2797 [2020-09-25 05:39:36,434 INFO L226 Difference]: Without dead ends: 1963 [2020-09-25 05:39:36,440 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-09-25 05:39:36,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1963 states. [2020-09-25 05:39:36,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1963 to 1914. [2020-09-25 05:39:36,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1914 states. [2020-09-25 05:39:36,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1914 states to 1914 states and 2488 transitions. [2020-09-25 05:39:36,512 INFO L78 Accepts]: Start accepts. Automaton has 1914 states and 2488 transitions. Word has length 127 [2020-09-25 05:39:36,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-25 05:39:36,513 INFO L479 AbstractCegarLoop]: Abstraction has 1914 states and 2488 transitions. [2020-09-25 05:39:36,513 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-25 05:39:36,513 INFO L276 IsEmpty]: Start isEmpty. Operand 1914 states and 2488 transitions. [2020-09-25 05:39:36,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2020-09-25 05:39:36,516 INFO L414 BasicCegarLoop]: Found error trace [2020-09-25 05:39:36,516 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-25 05:39:36,517 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-25 05:39:36,517 INFO L427 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-25 05:39:36,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-25 05:39:36,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1182078239, now seen corresponding path program 1 times [2020-09-25 05:39:36,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-25 05:39:36,518 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [557818675] [2020-09-25 05:39:36,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-25 05:39:36,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 05:39:36,598 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:39:37,007 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 05:39:37,007 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 169 [2020-09-25 05:39:37,008 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 05:39:37,008 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 439 [2020-09-25 05:39:37,008 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 05:39:37,008 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-09-25 05:39:37,008 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-09-25 05:39:37,009 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 13 [2020-09-25 05:39:37,009 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 124 [2020-09-25 05:39:37,009 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 05:39:37,092 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-25 05:39:37,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 05:39:37,099 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:39:37,113 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 05:39:37,113 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 18 [2020-09-25 05:39:37,113 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 05:39:37,113 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 16 [2020-09-25 05:39:37,114 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 05:39:37,114 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-09-25 05:39:37,114 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-25 05:39:37,114 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-25 05:39:37,115 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 9 [2020-09-25 05:39:37,115 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 05:39:37,135 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-25 05:39:37,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 05:39:37,189 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:39:37,431 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 05:39:37,432 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 118 [2020-09-25 05:39:37,432 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 05:39:37,432 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 267 [2020-09-25 05:39:37,432 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 05:39:37,433 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-09-25 05:39:37,433 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-25 05:39:37,433 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-09-25 05:39:37,433 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 117 [2020-09-25 05:39:37,434 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 05:39:37,533 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-25 05:39:37,533 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [557818675] [2020-09-25 05:39:37,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-25 05:39:37,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-25 05:39:37,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53824259] [2020-09-25 05:39:37,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-25 05:39:37,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-25 05:39:37,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-25 05:39:37,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-25 05:39:37,538 INFO L87 Difference]: Start difference. First operand 1914 states and 2488 transitions. Second operand 7 states. [2020-09-25 05:39:39,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-25 05:39:39,888 INFO L93 Difference]: Finished difference Result 3719 states and 4899 transitions. [2020-09-25 05:39:39,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-25 05:39:39,891 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 158 [2020-09-25 05:39:39,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-25 05:39:39,903 INFO L225 Difference]: With dead ends: 3719 [2020-09-25 05:39:39,904 INFO L226 Difference]: Without dead ends: 1970 [2020-09-25 05:39:39,910 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-09-25 05:39:39,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1970 states. [2020-09-25 05:39:39,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1970 to 1932. [2020-09-25 05:39:39,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1932 states. [2020-09-25 05:39:39,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1932 states to 1932 states and 2323 transitions. [2020-09-25 05:39:39,973 INFO L78 Accepts]: Start accepts. Automaton has 1932 states and 2323 transitions. Word has length 158 [2020-09-25 05:39:39,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-25 05:39:39,974 INFO L479 AbstractCegarLoop]: Abstraction has 1932 states and 2323 transitions. [2020-09-25 05:39:39,974 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-25 05:39:39,974 INFO L276 IsEmpty]: Start isEmpty. Operand 1932 states and 2323 transitions. [2020-09-25 05:39:39,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2020-09-25 05:39:39,979 INFO L414 BasicCegarLoop]: Found error trace [2020-09-25 05:39:39,979 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39,979 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-25 05:39:39,980 INFO L427 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-25 05:39:39,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-25 05:39:39,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1776525167, now seen corresponding path program 1 times [2020-09-25 05:39:39,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-25 05:39:39,981 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [94645884] [2020-09-25 05:39:39,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-25 05:39:40,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-25 05:39:40,034 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-09-25 05:39:40,034 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-25 05:39:40,042 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-25 05:39:40,109 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.09 05:39:40 BoogieIcfgContainer [2020-09-25 05:39:40,110 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-25 05:39:40,115 INFO L168 Benchmark]: Toolchain (without parser) took 24419.41 ms. Allocated memory was 145.2 MB in the beginning and 507.5 MB in the end (delta: 362.3 MB). Free memory was 101.9 MB in the beginning and 392.7 MB in the end (delta: -290.8 MB). Peak memory consumption was 71.5 MB. Max. memory is 7.1 GB. [2020-09-25 05:39:40,118 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-09-25 05:39:40,123 INFO L168 Benchmark]: CACSL2BoogieTranslator took 894.47 ms. Allocated memory was 145.2 MB in the beginning and 206.0 MB in the end (delta: 60.8 MB). Free memory was 101.3 MB in the beginning and 172.6 MB in the end (delta: -71.4 MB). Peak memory consumption was 31.2 MB. Max. memory is 7.1 GB. [2020-09-25 05:39:40,129 INFO L168 Benchmark]: Boogie Preprocessor took 130.31 ms. Allocated memory is still 206.0 MB. Free memory was 172.6 MB in the beginning and 167.7 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:39:40,135 INFO L168 Benchmark]: RCFGBuilder took 1770.92 ms. Allocated memory was 206.0 MB in the beginning and 237.5 MB in the end (delta: 31.5 MB). Free memory was 167.7 MB in the beginning and 161.9 MB in the end (delta: 5.7 MB). Peak memory consumption was 82.3 MB. Max. memory is 7.1 GB. [2020-09-25 05:39:40,136 INFO L168 Benchmark]: TraceAbstraction took 21608.88 ms. Allocated memory was 237.5 MB in the beginning and 507.5 MB in the end (delta: 270.0 MB). Free memory was 160.5 MB in the beginning and 392.7 MB in the end (delta: -232.2 MB). Peak memory consumption was 37.9 MB. Max. memory is 7.1 GB. [2020-09-25 05:39:40,143 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.22 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 894.47 ms. Allocated memory was 145.2 MB in the beginning and 206.0 MB in the end (delta: 60.8 MB). Free memory was 101.3 MB in the beginning and 172.6 MB in the end (delta: -71.4 MB). Peak memory consumption was 31.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 130.31 ms. Allocated memory is still 206.0 MB. Free memory was 172.6 MB in the beginning and 167.7 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1770.92 ms. Allocated memory was 206.0 MB in the beginning and 237.5 MB in the end (delta: 31.5 MB). Free memory was 167.7 MB in the beginning and 161.9 MB in the end (delta: 5.7 MB). Peak memory consumption was 82.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 21608.88 ms. Allocated memory was 237.5 MB in the beginning and 507.5 MB in the end (delta: 270.0 MB). Free memory was 160.5 MB in the beginning and 392.7 MB in the end (delta: -232.2 MB). Peak memory consumption was 37.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 55]: 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 TRUE ((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0))) [L211] a1 = (((a1 + -15535) - 211896) / 5) [L212] a10 = 2 [L214] return 22; [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 TRUE ((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2)))) [L409] a1 = ((((a1 % 299890)+ 300108) * 1) * 1) [L410] a10 = 0 [L411] a19 = 8 [L413] 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 TRUE (((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8)) [L55] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 456 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 21.4s, OverallIterations: 6, TraceHistogramMax: 3, AutomataDifference: 10.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1023 SDtfs, 3811 SDslu, 1188 SDs, 0 SdLazy, 5533 SolverSat, 729 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 58 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1932occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 141 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 9.9s InterpolantComputationTime, 798 NumberOfCodeBlocks, 798 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 556 ConstructedInterpolants, 0 QuantifiedInterpolants, 159831 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 77/80 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...