/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 --traceabstraction.use.minimal.unsat.core.enumeration true --traceabstraction.additional.smt.options produce-proofs=true --traceabstraction.additional.smt.options produce-unsat-cores=true --traceabstraction.additional.smt.options enumeration-timeout=1000 --traceabstraction.additional.smt.options interpolation-heuristic=SMALLEST --traceabstraction.additional.smt.options log-additional-information=true -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem10_label42.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-eb0fd7c [2020-09-21 12:31:45,688 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-21 12:31:45,694 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-21 12:31:45,741 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-21 12:31:45,741 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-21 12:31:45,750 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-21 12:31:45,753 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-21 12:31:45,757 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-21 12:31:45,760 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-21 12:31:45,764 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-21 12:31:45,765 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-21 12:31:45,768 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-21 12:31:45,768 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-21 12:31:45,772 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-21 12:31:45,775 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-21 12:31:45,777 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-21 12:31:45,780 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-21 12:31:45,782 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-21 12:31:45,784 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-21 12:31:45,793 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-21 12:31:45,795 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-21 12:31:45,796 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-21 12:31:45,799 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-21 12:31:45,800 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-21 12:31:45,804 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-21 12:31:45,804 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-21 12:31:45,805 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-21 12:31:45,812 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-21 12:31:45,814 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-21 12:31:45,816 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-21 12:31:45,816 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-21 12:31:45,818 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-21 12:31:45,819 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-21 12:31:45,820 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-21 12:31:45,821 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-21 12:31:45,821 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-21 12:31:45,822 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-21 12:31:45,822 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-21 12:31:45,822 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-21 12:31:45,824 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-21 12:31:45,825 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-21 12:31:45,826 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-21 12:31:45,879 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-21 12:31:45,879 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-21 12:31:45,882 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-09-21 12:31:45,882 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-09-21 12:31:45,883 INFO L138 SettingsManager]: * Use SBE=true [2020-09-21 12:31:45,883 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-21 12:31:45,884 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-21 12:31:45,884 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-21 12:31:45,884 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-21 12:31:45,884 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-21 12:31:45,885 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-21 12:31:45,885 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-21 12:31:45,885 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-21 12:31:45,885 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-21 12:31:45,886 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-21 12:31:45,886 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-21 12:31:45,886 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-21 12:31:45,886 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-21 12:31:45,886 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-09-21 12:31:45,886 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-21 12:31:45,886 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-21 12:31:45,887 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-21 12:31:45,887 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-21 12:31:45,887 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-09-21 12:31:45,887 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-09-21 12:31:45,887 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-09-21 12:31:45,887 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-09-21 12:31:45,887 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-21 12:31:45,888 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-09-21 12:31:45,890 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.traceabstraction: Use minimal unsat core enumeration -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> produce-proofs=true;produce-unsat-cores=true;enumeration-timeout=1000;interpolation-heuristic=SMALLEST;log-additional-information=true; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> produce-proofs=true;produce-unsat-cores=true;enumeration-timeout=1000;interpolation-heuristic=SMALLEST;log-additional-information=true; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> produce-proofs=true;produce-unsat-cores=true;enumeration-timeout=1000;interpolation-heuristic=SMALLEST;log-additional-information=true; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> produce-proofs=true;produce-unsat-cores=true;enumeration-timeout=1000;interpolation-heuristic=SMALLEST;log-additional-information=true; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> produce-proofs=true;produce-unsat-cores=true;enumeration-timeout=1000;interpolation-heuristic=SMALLEST;log-additional-information=true; [2020-09-21 12:31:46,371 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-21 12:31:46,391 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-21 12:31:46,395 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-21 12:31:46,397 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-21 12:31:46,397 INFO L275 PluginConnector]: CDTParser initialized [2020-09-21 12:31:46,399 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-21 12:31:46,478 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/faf78919b/f7ec7a6b41984fe79f8360b1bf819201/FLAGd7bbd89b6 [2020-09-21 12:31:47,161 INFO L306 CDTParser]: Found 1 translation units. [2020-09-21 12:31:47,162 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/eca-rers2012/Problem10_label42.c [2020-09-21 12:31:47,189 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/faf78919b/f7ec7a6b41984fe79f8360b1bf819201/FLAGd7bbd89b6 [2020-09-21 12:31:47,391 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/faf78919b/f7ec7a6b41984fe79f8360b1bf819201 [2020-09-21 12:31:47,408 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-21 12:31:47,416 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-21 12:31:47,419 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-21 12:31:47,419 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-21 12:31:47,423 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-21 12:31:47,424 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 12:31:47" (1/1) ... [2020-09-21 12:31:47,430 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e001708 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 12:31:47, skipping insertion in model container [2020-09-21 12:31:47,431 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 12:31:47" (1/1) ... [2020-09-21 12:31:47,441 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-21 12:31:47,516 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-21 12:31:48,063 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-21 12:31:48,072 INFO L203 MainTranslator]: Completed pre-run [2020-09-21 12:31:48,245 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-21 12:31:48,265 INFO L208 MainTranslator]: Completed translation [2020-09-21 12:31:48,265 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 12:31:48 WrapperNode [2020-09-21 12:31:48,266 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-21 12:31:48,266 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-21 12:31:48,267 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-21 12:31:48,267 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-21 12:31:48,286 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 12:31:48" (1/1) ... [2020-09-21 12:31:48,287 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 12:31:48" (1/1) ... [2020-09-21 12:31:48,306 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 12:31:48" (1/1) ... [2020-09-21 12:31:48,307 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 12:31:48" (1/1) ... [2020-09-21 12:31:48,346 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 12:31:48" (1/1) ... [2020-09-21 12:31:48,365 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 12:31:48" (1/1) ... [2020-09-21 12:31:48,372 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 12:31:48" (1/1) ... [2020-09-21 12:31:48,382 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-21 12:31:48,383 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-21 12:31:48,383 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-21 12:31:48,383 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-21 12:31:48,385 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 12:31:48" (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-21 12:31:48,486 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-21 12:31:48,486 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-21 12:31:48,487 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2020-09-21 12:31:48,487 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-21 12:31:48,487 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2020-09-21 12:31:48,487 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-21 12:31:48,488 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-21 12:31:48,488 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-09-21 12:31:48,488 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-21 12:31:48,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-21 12:31:48,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-21 12:31:49,812 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-21 12:31:49,813 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-09-21 12:31:49,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 12:31:49 BoogieIcfgContainer [2020-09-21 12:31:49,822 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-21 12:31:49,826 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-21 12:31:49,826 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-21 12:31:49,830 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-21 12:31:49,830 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.09 12:31:47" (1/3) ... [2020-09-21 12:31:49,832 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3572d228 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 12:31:49, skipping insertion in model container [2020-09-21 12:31:49,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 12:31:48" (2/3) ... [2020-09-21 12:31:49,833 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3572d228 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 12:31:49, skipping insertion in model container [2020-09-21 12:31:49,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 12:31:49" (3/3) ... [2020-09-21 12:31:49,838 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem10_label42.c [2020-09-21 12:31:49,850 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-21 12:31:49,864 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-21 12:31:49,888 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-21 12:31:49,932 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-21 12:31:49,934 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-21 12:31:49,934 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-21 12:31:49,934 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-21 12:31:49,934 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-21 12:31:49,935 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-21 12:31:49,935 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-21 12:31:49,935 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-21 12:31:49,972 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states. [2020-09-21 12:31:49,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-09-21 12:31:49,988 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 12:31:49,990 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] [2020-09-21 12:31:49,990 INFO L427 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 12:31:50,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 12:31:50,001 INFO L82 PathProgramCache]: Analyzing trace with hash -42109674, now seen corresponding path program 1 times [2020-09-21 12:31:50,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 12:31:50,015 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [627384216] [2020-09-21 12:31:50,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 12:31:50,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 12:31:50,250 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:31:50,715 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-21 12:31:50,715 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 32 [2020-09-21 12:31:50,715 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 12:31:50,716 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 504 [2020-09-21 12:31:50,719 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-21 12:31:50,719 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-09-21 12:31:50,719 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 6 [2020-09-21 12:31:50,720 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 25 [2020-09-21 12:31:50,720 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 4 [2020-09-21 12:31:50,865 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 12:31:50,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 12:31:50,882 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:31:50,892 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-21 12:31:50,892 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 9 [2020-09-21 12:31:50,892 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 12:31:50,893 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 14 [2020-09-21 12:31:50,893 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-21 12:31:50,893 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-21 12:31:50,893 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-21 12:31:50,894 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 2 [2020-09-21 12:31:50,894 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 12:31:50,918 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-21 12:31:50,920 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [627384216] [2020-09-21 12:31:50,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 12:31:50,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-09-21 12:31:50,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056745155] [2020-09-21 12:31:50,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-21 12:31:50,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 12:31:50,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-21 12:31:50,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-21 12:31:50,954 INFO L87 Difference]: Start difference. First operand 215 states. Second operand 5 states. [2020-09-21 12:31:53,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 12:31:53,187 INFO L93 Difference]: Finished difference Result 730 states and 1301 transitions. [2020-09-21 12:31:53,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-21 12:31:53,190 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2020-09-21 12:31:53,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 12:31:53,212 INFO L225 Difference]: With dead ends: 730 [2020-09-21 12:31:53,212 INFO L226 Difference]: Without dead ends: 447 [2020-09-21 12:31:53,222 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-09-21 12:31:53,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2020-09-21 12:31:53,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 441. [2020-09-21 12:31:53,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2020-09-21 12:31:53,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 672 transitions. [2020-09-21 12:31:53,330 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 672 transitions. Word has length 23 [2020-09-21 12:31:53,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 12:31:53,331 INFO L479 AbstractCegarLoop]: Abstraction has 441 states and 672 transitions. [2020-09-21 12:31:53,331 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-21 12:31:53,331 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 672 transitions. [2020-09-21 12:31:53,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-09-21 12:31:53,337 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 12:31:53,337 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-09-21 12:31:53,337 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-21 12:31:53,338 INFO L427 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 12:31:53,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 12:31:53,354 INFO L82 PathProgramCache]: Analyzing trace with hash -75254131, now seen corresponding path program 1 times [2020-09-21 12:31:53,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 12:31:53,354 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [162016867] [2020-09-21 12:31:53,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 12:31:53,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 12:31:53,437 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:31:53,578 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:31:54,422 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-21 12:31:54,423 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 107 [2020-09-21 12:31:54,423 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-09-21 12:31:54,423 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1019 [2020-09-21 12:31:54,424 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-21 12:31:54,425 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-21 12:31:54,425 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 84 [2020-09-21 12:31:54,425 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 12 [2020-09-21 12:31:54,425 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-21 12:31:54,565 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 12:31:54,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 12:31:54,569 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:31:54,575 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-21 12:31:54,575 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 9 [2020-09-21 12:31:54,575 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 12:31:54,575 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 6 [2020-09-21 12:31:54,576 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-21 12:31:54,576 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-09-21 12:31:54,576 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-21 12:31:54,576 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-09-21 12:31:54,577 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-21 12:31:54,589 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-21 12:31:54,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 12:31:54,633 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:31:54,713 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-21 12:31:54,714 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 75 [2020-09-21 12:31:54,714 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 12:31:54,715 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 102 [2020-09-21 12:31:54,715 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-21 12:31:54,715 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-21 12:31:54,716 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-21 12:31:54,716 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 68 [2020-09-21 12:31:54,716 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-21 12:31:54,791 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 12:31:54,792 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [162016867] [2020-09-21 12:31:54,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 12:31:54,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-09-21 12:31:54,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532683408] [2020-09-21 12:31:54,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-21 12:31:54,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 12:31:54,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-21 12:31:54,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-21 12:31:54,796 INFO L87 Difference]: Start difference. First operand 441 states and 672 transitions. Second operand 5 states. [2020-09-21 12:31:55,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 12:31:55,757 INFO L93 Difference]: Finished difference Result 891 states and 1366 transitions. [2020-09-21 12:31:55,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-21 12:31:55,760 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2020-09-21 12:31:55,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 12:31:55,765 INFO L225 Difference]: With dead ends: 891 [2020-09-21 12:31:55,765 INFO L226 Difference]: Without dead ends: 447 [2020-09-21 12:31:55,767 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-09-21 12:31:55,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2020-09-21 12:31:55,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 441. [2020-09-21 12:31:55,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2020-09-21 12:31:55,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 669 transitions. [2020-09-21 12:31:55,800 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 669 transitions. Word has length 96 [2020-09-21 12:31:55,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 12:31:55,801 INFO L479 AbstractCegarLoop]: Abstraction has 441 states and 669 transitions. [2020-09-21 12:31:55,801 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-21 12:31:55,801 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 669 transitions. [2020-09-21 12:31:55,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2020-09-21 12:31:55,805 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 12:31:55,805 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-09-21 12:31:55,805 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-21 12:31:55,805 INFO L427 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 12:31:55,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 12:31:55,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1249958265, now seen corresponding path program 1 times [2020-09-21 12:31:55,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 12:31:55,806 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [619216679] [2020-09-21 12:31:55,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 12:31:55,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 12:31:55,870 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:31:56,144 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-21 12:31:56,144 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 113 [2020-09-21 12:31:56,144 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 12:31:56,145 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 302 [2020-09-21 12:31:56,145 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-21 12:31:56,145 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-21 12:31:56,145 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 90 [2020-09-21 12:31:56,146 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 22 [2020-09-21 12:31:56,146 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-21 12:31:56,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 12:31:56,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 12:31:56,214 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:31:56,219 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-21 12:31:56,219 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 9 [2020-09-21 12:31:56,220 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 12:31:56,220 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 6 [2020-09-21 12:31:56,220 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-21 12:31:56,220 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-09-21 12:31:56,220 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-21 12:31:56,221 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-09-21 12:31:56,221 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 12:31:56,233 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-21 12:31:56,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 12:31:56,270 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:31:56,329 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-21 12:31:56,330 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 81 [2020-09-21 12:31:56,330 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 12:31:56,330 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 76 [2020-09-21 12:31:56,330 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-21 12:31:56,330 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-21 12:31:56,331 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-21 12:31:56,331 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 74 [2020-09-21 12:31:56,331 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 12:31:56,372 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 12:31:56,373 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [619216679] [2020-09-21 12:31:56,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 12:31:56,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-09-21 12:31:56,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566837217] [2020-09-21 12:31:56,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-21 12:31:56,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 12:31:56,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-21 12:31:56,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-21 12:31:56,375 INFO L87 Difference]: Start difference. First operand 441 states and 669 transitions. Second operand 5 states. [2020-09-21 12:31:57,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 12:31:57,885 INFO L93 Difference]: Finished difference Result 1321 states and 2050 transitions. [2020-09-21 12:31:57,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-21 12:31:57,886 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2020-09-21 12:31:57,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 12:31:57,898 INFO L225 Difference]: With dead ends: 1321 [2020-09-21 12:31:57,898 INFO L226 Difference]: Without dead ends: 886 [2020-09-21 12:31:57,901 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-21 12:31:57,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2020-09-21 12:31:57,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 731. [2020-09-21 12:31:57,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 731 states. [2020-09-21 12:31:57,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1041 transitions. [2020-09-21 12:31:57,948 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1041 transitions. Word has length 102 [2020-09-21 12:31:57,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 12:31:57,949 INFO L479 AbstractCegarLoop]: Abstraction has 731 states and 1041 transitions. [2020-09-21 12:31:57,949 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-21 12:31:57,949 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1041 transitions. [2020-09-21 12:31:57,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2020-09-21 12:31:57,953 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 12:31:57,954 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-09-21 12:31:57,954 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-21 12:31:57,954 INFO L427 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 12:31:57,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 12:31:57,955 INFO L82 PathProgramCache]: Analyzing trace with hash -625070566, now seen corresponding path program 1 times [2020-09-21 12:31:57,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 12:31:57,955 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1730855784] [2020-09-21 12:31:57,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 12:31:57,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 12:31:58,015 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:31:58,269 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:31:58,610 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:31:59,012 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-21 12:31:59,012 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 124 [2020-09-21 12:31:59,012 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 3 [2020-09-21 12:31:59,013 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1023 [2020-09-21 12:31:59,013 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-21 12:31:59,013 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-21 12:31:59,013 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 101 [2020-09-21 12:31:59,013 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 22 [2020-09-21 12:31:59,014 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 12:31:59,074 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 12:31:59,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 12:31:59,078 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:31:59,083 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-21 12:31:59,084 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 9 [2020-09-21 12:31:59,084 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 12:31:59,084 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 6 [2020-09-21 12:31:59,084 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-21 12:31:59,092 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-09-21 12:31:59,092 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-21 12:31:59,093 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-09-21 12:31:59,094 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 10 [2020-09-21 12:31:59,107 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-21 12:31:59,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 12:31:59,145 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:31:59,206 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-21 12:31:59,206 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 92 [2020-09-21 12:31:59,207 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 12:31:59,207 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 78 [2020-09-21 12:31:59,207 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-21 12:31:59,207 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-21 12:31:59,208 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-21 12:31:59,208 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 85 [2020-09-21 12:31:59,208 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 12:31:59,269 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 12:31:59,271 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1730855784] [2020-09-21 12:31:59,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 12:31:59,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-09-21 12:31:59,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635195011] [2020-09-21 12:31:59,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-21 12:31:59,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 12:31:59,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-21 12:31:59,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-21 12:31:59,284 INFO L87 Difference]: Start difference. First operand 731 states and 1041 transitions. Second operand 5 states. [2020-09-21 12:32:00,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 12:32:00,612 INFO L93 Difference]: Finished difference Result 1905 states and 2835 transitions. [2020-09-21 12:32:00,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-21 12:32:00,613 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 113 [2020-09-21 12:32:00,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 12:32:00,621 INFO L225 Difference]: With dead ends: 1905 [2020-09-21 12:32:00,622 INFO L226 Difference]: Without dead ends: 1180 [2020-09-21 12:32:00,625 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-21 12:32:00,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2020-09-21 12:32:00,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 880. [2020-09-21 12:32:00,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 880 states. [2020-09-21 12:32:00,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 1163 transitions. [2020-09-21 12:32:00,667 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 1163 transitions. Word has length 113 [2020-09-21 12:32:00,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 12:32:00,668 INFO L479 AbstractCegarLoop]: Abstraction has 880 states and 1163 transitions. [2020-09-21 12:32:00,668 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-21 12:32:00,669 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1163 transitions. [2020-09-21 12:32:00,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2020-09-21 12:32:00,672 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 12:32:00,672 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 12:32:00,672 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-21 12:32:00,672 INFO L427 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 12:32:00,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 12:32:00,673 INFO L82 PathProgramCache]: Analyzing trace with hash -40864794, now seen corresponding path program 1 times [2020-09-21 12:32:00,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 12:32:00,673 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [978543154] [2020-09-21 12:32:00,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 12:32:00,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 12:32:00,770 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:32:01,273 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-21 12:32:01,273 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 146 [2020-09-21 12:32:01,273 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 12:32:01,274 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 553 [2020-09-21 12:32:01,274 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-21 12:32:01,274 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-09-21 12:32:01,274 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 6 [2020-09-21 12:32:01,275 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 118 [2020-09-21 12:32:01,275 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 12:32:01,329 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 12:32:01,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 12:32:01,335 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:32:01,339 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-21 12:32:01,340 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 9 [2020-09-21 12:32:01,340 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 12:32:01,340 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 6 [2020-09-21 12:32:01,340 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-21 12:32:01,341 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-21 12:32:01,341 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-21 12:32:01,341 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 2 [2020-09-21 12:32:01,341 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 12:32:01,354 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-21 12:32:01,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 12:32:01,406 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:32:01,618 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-21 12:32:01,618 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 114 [2020-09-21 12:32:01,618 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 12:32:01,618 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 237 [2020-09-21 12:32:01,619 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-21 12:32:01,619 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-21 12:32:01,619 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-09-21 12:32:01,619 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 113 [2020-09-21 12:32:01,619 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 12:32:01,715 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 12:32:01,715 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [978543154] [2020-09-21 12:32:01,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 12:32:01,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-21 12:32:01,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859285958] [2020-09-21 12:32:01,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-21 12:32:01,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 12:32:01,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-21 12:32:01,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-21 12:32:01,718 INFO L87 Difference]: Start difference. First operand 880 states and 1163 transitions. Second operand 7 states. [2020-09-21 12:32:03,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 12:32:03,081 INFO L93 Difference]: Finished difference Result 2072 states and 2879 transitions. [2020-09-21 12:32:03,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-21 12:32:03,085 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 135 [2020-09-21 12:32:03,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 12:32:03,094 INFO L225 Difference]: With dead ends: 2072 [2020-09-21 12:32:03,094 INFO L226 Difference]: Without dead ends: 1198 [2020-09-21 12:32:03,098 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-09-21 12:32:03,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2020-09-21 12:32:03,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 1178. [2020-09-21 12:32:03,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1178 states. [2020-09-21 12:32:03,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1178 states to 1178 states and 1516 transitions. [2020-09-21 12:32:03,149 INFO L78 Accepts]: Start accepts. Automaton has 1178 states and 1516 transitions. Word has length 135 [2020-09-21 12:32:03,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 12:32:03,149 INFO L479 AbstractCegarLoop]: Abstraction has 1178 states and 1516 transitions. [2020-09-21 12:32:03,149 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-21 12:32:03,151 INFO L276 IsEmpty]: Start isEmpty. Operand 1178 states and 1516 transitions. [2020-09-21 12:32:03,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2020-09-21 12:32:03,154 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 12:32:03,154 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-09-21 12:32:03,154 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-21 12:32:03,154 INFO L427 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 12:32:03,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 12:32:03,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1701421403, now seen corresponding path program 1 times [2020-09-21 12:32:03,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 12:32:03,158 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1265011018] [2020-09-21 12:32:03,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 12:32:03,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 12:32:03,233 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:32:03,656 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:32:04,227 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-21 12:32:04,227 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 151 [2020-09-21 12:32:04,228 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-09-21 12:32:04,228 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1028 [2020-09-21 12:32:04,228 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-21 12:32:04,229 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-21 12:32:04,229 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 128 [2020-09-21 12:32:04,229 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 22 [2020-09-21 12:32:04,267 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 38 [2020-09-21 12:32:04,342 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 12:32:04,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 12:32:04,345 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:32:04,354 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-21 12:32:04,354 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 9 [2020-09-21 12:32:04,354 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 12:32:04,359 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 10 [2020-09-21 12:32:04,359 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-21 12:32:04,360 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-09-21 12:32:04,360 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-21 12:32:04,360 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-09-21 12:32:04,360 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 12:32:04,375 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-21 12:32:04,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 12:32:04,431 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:32:04,545 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-21 12:32:04,546 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 119 [2020-09-21 12:32:04,546 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 12:32:04,546 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 140 [2020-09-21 12:32:04,546 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-21 12:32:04,547 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-21 12:32:04,547 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-21 12:32:04,547 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 112 [2020-09-21 12:32:04,547 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 12:32:04,613 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 12:32:04,614 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1265011018] [2020-09-21 12:32:04,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 12:32:04,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-09-21 12:32:04,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360012749] [2020-09-21 12:32:04,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-21 12:32:04,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 12:32:04,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-21 12:32:04,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-21 12:32:04,617 INFO L87 Difference]: Start difference. First operand 1178 states and 1516 transitions. Second operand 5 states. [2020-09-21 12:32:05,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 12:32:05,942 INFO L93 Difference]: Finished difference Result 3520 states and 4645 transitions. [2020-09-21 12:32:05,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-21 12:32:05,943 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 140 [2020-09-21 12:32:05,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 12:32:05,957 INFO L225 Difference]: With dead ends: 3520 [2020-09-21 12:32:05,957 INFO L226 Difference]: Without dead ends: 2348 [2020-09-21 12:32:05,961 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-21 12:32:05,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2348 states. [2020-09-21 12:32:06,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2348 to 1766. [2020-09-21 12:32:06,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1766 states. [2020-09-21 12:32:06,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1766 states to 1766 states and 2284 transitions. [2020-09-21 12:32:06,027 INFO L78 Accepts]: Start accepts. Automaton has 1766 states and 2284 transitions. Word has length 140 [2020-09-21 12:32:06,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 12:32:06,028 INFO L479 AbstractCegarLoop]: Abstraction has 1766 states and 2284 transitions. [2020-09-21 12:32:06,028 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-21 12:32:06,028 INFO L276 IsEmpty]: Start isEmpty. Operand 1766 states and 2284 transitions. [2020-09-21 12:32:06,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2020-09-21 12:32:06,034 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 12:32:06,035 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 12:32:06,035 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-21 12:32:06,035 INFO L427 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 12:32:06,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 12:32:06,036 INFO L82 PathProgramCache]: Analyzing trace with hash -2040878078, now seen corresponding path program 1 times [2020-09-21 12:32:06,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 12:32:06,036 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1685858844] [2020-09-21 12:32:06,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 12:32:06,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-21 12:32:06,097 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-09-21 12:32:06,097 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-21 12:32:06,103 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-21 12:32:06,163 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.09 12:32:06 BoogieIcfgContainer [2020-09-21 12:32:06,163 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-21 12:32:06,168 INFO L168 Benchmark]: Toolchain (without parser) took 18755.75 ms. Allocated memory was 143.1 MB in the beginning and 434.1 MB in the end (delta: 291.0 MB). Free memory was 104.9 MB in the beginning and 106.2 MB in the end (delta: -1.3 MB). Peak memory consumption was 289.7 MB. Max. memory is 7.1 GB. [2020-09-21 12:32:06,169 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 143.1 MB. Free memory was 124.7 MB in the beginning and 124.5 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-09-21 12:32:06,175 INFO L168 Benchmark]: CACSL2BoogieTranslator took 847.39 ms. Allocated memory was 143.1 MB in the beginning and 207.1 MB in the end (delta: 64.0 MB). Free memory was 104.2 MB in the beginning and 173.2 MB in the end (delta: -69.0 MB). Peak memory consumption was 33.3 MB. Max. memory is 7.1 GB. [2020-09-21 12:32:06,177 INFO L168 Benchmark]: Boogie Preprocessor took 116.08 ms. Allocated memory is still 207.1 MB. Free memory was 173.2 MB in the beginning and 168.5 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.7 MB. Max. memory is 7.1 GB. [2020-09-21 12:32:06,178 INFO L168 Benchmark]: RCFGBuilder took 1440.87 ms. Allocated memory was 207.1 MB in the beginning and 234.9 MB in the end (delta: 27.8 MB). Free memory was 168.5 MB in the beginning and 173.0 MB in the end (delta: -4.5 MB). Peak memory consumption was 76.7 MB. Max. memory is 7.1 GB. [2020-09-21 12:32:06,179 INFO L168 Benchmark]: TraceAbstraction took 16337.42 ms. Allocated memory was 234.9 MB in the beginning and 434.1 MB in the end (delta: 199.2 MB). Free memory was 173.0 MB in the beginning and 106.2 MB in the end (delta: 66.8 MB). Peak memory consumption was 266.0 MB. Max. memory is 7.1 GB. [2020-09-21 12:32:06,193 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 143.1 MB. Free memory was 124.7 MB in the beginning and 124.5 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 847.39 ms. Allocated memory was 143.1 MB in the beginning and 207.1 MB in the end (delta: 64.0 MB). Free memory was 104.2 MB in the beginning and 173.2 MB in the end (delta: -69.0 MB). Peak memory consumption was 33.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 116.08 ms. Allocated memory is still 207.1 MB. Free memory was 173.2 MB in the beginning and 168.5 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1440.87 ms. Allocated memory was 207.1 MB in the beginning and 234.9 MB in the end (delta: 27.8 MB). Free memory was 168.5 MB in the beginning and 173.0 MB in the end (delta: -4.5 MB). Peak memory consumption was 76.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16337.42 ms. Allocated memory was 234.9 MB in the beginning and 434.1 MB in the end (delta: 199.2 MB). Free memory was 173.0 MB in the beginning and 106.2 MB in the end (delta: 66.8 MB). Peak memory consumption was 266.0 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, 215 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 16.1s, OverallIterations: 7, TraceHistogramMax: 3, AutomataDifference: 8.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 156 SDtfs, 2624 SDslu, 142 SDs, 0 SdLazy, 4345 SolverSat, 736 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1766occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 6 MinimizatonAttempts, 1069 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 814 NumberOfCodeBlocks, 814 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 603 ConstructedInterpolants, 0 QuantifiedInterpolants, 160262 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 76/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...