/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.smt.solver Internal_SMTInterpol --traceabstraction.compute.trace.for.counterexample.result false --rcfgbuilder.size.of.a.code.block SequenceOfStatements --traceabstraction.use.minimal.unsat.core.enumeration true --traceabstraction.additional.smt.options produce-proofs=true --traceabstraction.additional.smt.options produce-unsat-cores=true --traceabstraction.additional.smt.options enumeration-timeout=5000 --traceabstraction.additional.smt.options interpolation-heuristic=NARROWEST --traceabstraction.additional.smt.options log-additional-information=true --traceabstraction.additional.smt.options unknown-allowed=true -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem10_label55.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-adbd35c [2020-10-13 08:04:42,532 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-13 08:04:42,535 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-13 08:04:42,579 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-13 08:04:42,579 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-13 08:04:42,590 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-13 08:04:42,592 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-13 08:04:42,596 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-13 08:04:42,598 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-13 08:04:42,600 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-13 08:04:42,603 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-13 08:04:42,604 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-13 08:04:42,604 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-13 08:04:42,607 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-13 08:04:42,609 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-13 08:04:42,610 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-13 08:04:42,612 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-13 08:04:42,613 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-13 08:04:42,614 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-13 08:04:42,620 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-13 08:04:42,622 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-13 08:04:42,623 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-13 08:04:42,624 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-13 08:04:42,625 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-13 08:04:42,629 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-13 08:04:42,629 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-13 08:04:42,629 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-13 08:04:42,632 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-13 08:04:42,633 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-13 08:04:42,634 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-13 08:04:42,635 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-13 08:04:42,636 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-13 08:04:42,637 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-13 08:04:42,638 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-13 08:04:42,639 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-13 08:04:42,639 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-13 08:04:42,640 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-13 08:04:42,640 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-13 08:04:42,640 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-13 08:04:42,641 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-13 08:04:42,642 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-13 08:04:42,643 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-10-13 08:04:42,694 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-13 08:04:42,694 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-13 08:04:42,696 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-13 08:04:42,697 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-13 08:04:42,697 INFO L138 SettingsManager]: * Use SBE=true [2020-10-13 08:04:42,697 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-13 08:04:42,697 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-13 08:04:42,698 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-13 08:04:42,698 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-13 08:04:42,698 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-13 08:04:42,699 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-13 08:04:42,700 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-13 08:04:42,700 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-13 08:04:42,700 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-13 08:04:42,700 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-13 08:04:42,701 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-13 08:04:42,701 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-13 08:04:42,701 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-13 08:04:42,701 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-13 08:04:42,702 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-13 08:04:42,702 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-13 08:04:42,702 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-13 08:04:42,702 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-13 08:04:42,702 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-13 08:04:42,703 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-13 08:04:42,703 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-13 08:04:42,703 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-13 08:04:42,703 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-13 08:04:42,703 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-13 08:04:42,703 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> Internal_SMTInterpol Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute trace for counterexample result -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> SequenceOfStatements Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use minimal unsat core enumeration -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> produce-proofs=true;produce-unsat-cores=true;enumeration-timeout=5000;interpolation-heuristic=NARROWEST;log-additional-information=true;unknown-allowed=true; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> produce-proofs=true;produce-unsat-cores=true;enumeration-timeout=5000;interpolation-heuristic=NARROWEST;log-additional-information=true;unknown-allowed=true; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> produce-proofs=true;produce-unsat-cores=true;enumeration-timeout=5000;interpolation-heuristic=NARROWEST;log-additional-information=true;unknown-allowed=true; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> produce-proofs=true;produce-unsat-cores=true;enumeration-timeout=5000;interpolation-heuristic=NARROWEST;log-additional-information=true;unknown-allowed=true; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> produce-proofs=true;produce-unsat-cores=true;enumeration-timeout=5000;interpolation-heuristic=NARROWEST;log-additional-information=true;unknown-allowed=true; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> produce-proofs=true;produce-unsat-cores=true;enumeration-timeout=5000;interpolation-heuristic=NARROWEST;log-additional-information=true;unknown-allowed=true; [2020-10-13 08:04:42,961 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-13 08:04:42,980 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-13 08:04:42,984 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-13 08:04:42,986 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-13 08:04:42,986 INFO L275 PluginConnector]: CDTParser initialized [2020-10-13 08:04:42,987 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label55.c [2020-10-13 08:04:43,051 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/426231b3f/2cee7b987a1a4b00be0134b539fbd240/FLAGa8c8f082c [2020-10-13 08:04:43,620 INFO L306 CDTParser]: Found 1 translation units. [2020-10-13 08:04:43,621 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/eca-rers2012/Problem10_label55.c [2020-10-13 08:04:43,634 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/426231b3f/2cee7b987a1a4b00be0134b539fbd240/FLAGa8c8f082c [2020-10-13 08:04:43,861 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/426231b3f/2cee7b987a1a4b00be0134b539fbd240 [2020-10-13 08:04:43,871 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-13 08:04:43,873 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-13 08:04:43,874 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-13 08:04:43,874 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-13 08:04:43,878 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-13 08:04:43,879 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 08:04:43" (1/1) ... [2020-10-13 08:04:43,882 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e08502 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:04:43, skipping insertion in model container [2020-10-13 08:04:43,882 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 08:04:43" (1/1) ... [2020-10-13 08:04:43,890 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-13 08:04:43,931 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-13 08:04:44,306 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-13 08:04:44,313 INFO L203 MainTranslator]: Completed pre-run [2020-10-13 08:04:44,535 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-13 08:04:44,550 INFO L208 MainTranslator]: Completed translation [2020-10-13 08:04:44,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:04:44 WrapperNode [2020-10-13 08:04:44,551 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-13 08:04:44,552 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-13 08:04:44,552 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-13 08:04:44,552 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-13 08:04:44,566 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:04:44" (1/1) ... [2020-10-13 08:04:44,566 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:04:44" (1/1) ... [2020-10-13 08:04:44,585 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:04:44" (1/1) ... [2020-10-13 08:04:44,585 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:04:44" (1/1) ... [2020-10-13 08:04:44,623 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:04:44" (1/1) ... [2020-10-13 08:04:44,646 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:04:44" (1/1) ... [2020-10-13 08:04:44,658 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:04:44" (1/1) ... [2020-10-13 08:04:44,668 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-13 08:04:44,669 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-13 08:04:44,669 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-13 08:04:44,669 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-13 08:04:44,670 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:04:44" (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-10-13 08:04:44,741 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-13 08:04:44,741 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-13 08:04:44,742 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2020-10-13 08:04:44,742 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-13 08:04:44,742 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2020-10-13 08:04:44,742 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-10-13 08:04:44,742 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-13 08:04:44,743 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-10-13 08:04:44,744 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-13 08:04:44,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-13 08:04:44,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-13 08:04:45,902 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-13 08:04:45,903 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-10-13 08:04:45,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 08:04:45 BoogieIcfgContainer [2020-10-13 08:04:45,909 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-13 08:04:45,910 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-13 08:04:45,910 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-13 08:04:45,913 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-13 08:04:45,914 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 08:04:43" (1/3) ... [2020-10-13 08:04:45,915 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e460a0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 08:04:45, skipping insertion in model container [2020-10-13 08:04:45,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:04:44" (2/3) ... [2020-10-13 08:04:45,915 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e460a0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 08:04:45, skipping insertion in model container [2020-10-13 08:04:45,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 08:04:45" (3/3) ... [2020-10-13 08:04:45,917 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem10_label55.c [2020-10-13 08:04:45,928 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-13 08:04:45,936 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-13 08:04:45,949 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-13 08:04:45,975 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-13 08:04:45,975 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-13 08:04:45,976 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-13 08:04:45,976 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-13 08:04:45,976 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-13 08:04:45,976 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-13 08:04:45,977 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-13 08:04:45,977 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-13 08:04:46,000 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states. [2020-10-13 08:04:46,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-13 08:04:46,007 INFO L414 BasicCegarLoop]: Found error trace [2020-10-13 08:04:46,009 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-13 08:04:46,009 INFO L427 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-13 08:04:46,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-13 08:04:46,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1305395761, now seen corresponding path program 1 times [2020-10-13 08:04:46,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-13 08:04:46,028 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1731031360] [2020-10-13 08:04:46,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-13 08:04:46,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-13 08:04:46,216 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-13 08:04:46,479 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-13 08:04:46,480 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 32 [2020-10-13 08:04:46,480 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-13 08:04:46,480 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 295 [2020-10-13 08:04:46,482 FATAL L256 erpolLogProxyWrapper]: Heuristic: NARROWEST [2020-10-13 08:04:46,483 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-10-13 08:04:46,483 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 5 [2020-10-13 08:04:46,483 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 26 [2020-10-13 08:04:46,483 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 2 [2020-10-13 08:04:46,560 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-13 08:04:46,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-13 08:04:46,568 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-13 08:04:46,575 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-13 08:04:46,575 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-13 08:04:46,575 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-13 08:04:46,576 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 8 [2020-10-13 08:04:46,576 FATAL L256 erpolLogProxyWrapper]: Heuristic: NARROWEST [2020-10-13 08:04:46,576 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-13 08:04:46,576 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-13 08:04:46,576 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 2 [2020-10-13 08:04:46,577 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-13 08:04:46,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-13 08:04:46,587 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1731031360] [2020-10-13 08:04:46,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-13 08:04:46,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-13 08:04:46,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978346914] [2020-10-13 08:04:46,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-13 08:04:46,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-13 08:04:46,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-13 08:04:46,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-13 08:04:46,611 INFO L87 Difference]: Start difference. First operand 215 states. Second operand 4 states. [2020-10-13 08:04:47,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-13 08:04:47,975 INFO L93 Difference]: Finished difference Result 581 states and 1007 transitions. [2020-10-13 08:04:47,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-13 08:04:47,981 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-10-13 08:04:47,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-13 08:04:48,006 INFO L225 Difference]: With dead ends: 581 [2020-10-13 08:04:48,006 INFO L226 Difference]: Without dead ends: 302 [2020-10-13 08:04:48,017 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-13 08:04:48,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2020-10-13 08:04:48,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 296. [2020-10-13 08:04:48,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2020-10-13 08:04:48,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 423 transitions. [2020-10-13 08:04:48,100 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 423 transitions. Word has length 24 [2020-10-13 08:04:48,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-13 08:04:48,101 INFO L479 AbstractCegarLoop]: Abstraction has 296 states and 423 transitions. [2020-10-13 08:04:48,101 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-13 08:04:48,101 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 423 transitions. [2020-10-13 08:04:48,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-10-13 08:04:48,105 INFO L414 BasicCegarLoop]: Found error trace [2020-10-13 08:04:48,106 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-13 08:04:48,106 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-13 08:04:48,106 INFO L427 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-13 08:04:48,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-13 08:04:48,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1317266958, now seen corresponding path program 1 times [2020-10-13 08:04:48,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-13 08:04:48,108 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1880447857] [2020-10-13 08:04:48,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-13 08:04:48,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-13 08:04:48,169 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-13 08:04:48,390 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-13 08:04:48,817 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-13 08:04:48,916 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-13 08:04:48,916 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 106 [2020-10-13 08:04:48,917 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 3 [2020-10-13 08:04:48,917 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 772 [2020-10-13 08:04:48,918 FATAL L256 erpolLogProxyWrapper]: Heuristic: NARROWEST [2020-10-13 08:04:48,918 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-13 08:04:48,919 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 82 [2020-10-13 08:04:48,919 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 23 [2020-10-13 08:04:48,919 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-13 08:04:48,980 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-13 08:04:48,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-13 08:04:48,983 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-13 08:04:48,987 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-13 08:04:48,987 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-13 08:04:48,988 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-13 08:04:48,988 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 4 [2020-10-13 08:04:48,988 FATAL L256 erpolLogProxyWrapper]: Heuristic: NARROWEST [2020-10-13 08:04:48,988 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-13 08:04:48,989 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-13 08:04:48,989 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-13 08:04:48,989 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-13 08:04:49,001 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-13 08:04:49,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-13 08:04:49,027 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-13 08:04:49,080 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-13 08:04:49,080 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 73 [2020-10-13 08:04:49,081 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-13 08:04:49,081 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 63 [2020-10-13 08:04:49,081 FATAL L256 erpolLogProxyWrapper]: Heuristic: NARROWEST [2020-10-13 08:04:49,081 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-13 08:04:49,082 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-13 08:04:49,082 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 67 [2020-10-13 08:04:49,082 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-13 08:04:49,125 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-13 08:04:49,125 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1880447857] [2020-10-13 08:04:49,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-13 08:04:49,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-10-13 08:04:49,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284585098] [2020-10-13 08:04:49,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-13 08:04:49,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-13 08:04:49,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-13 08:04:49,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-13 08:04:49,129 INFO L87 Difference]: Start difference. First operand 296 states and 423 transitions. Second operand 6 states. [2020-10-13 08:04:50,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-13 08:04:50,707 INFO L93 Difference]: Finished difference Result 882 states and 1309 transitions. [2020-10-13 08:04:50,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-13 08:04:50,711 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2020-10-13 08:04:50,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-13 08:04:50,721 INFO L225 Difference]: With dead ends: 882 [2020-10-13 08:04:50,721 INFO L226 Difference]: Without dead ends: 592 [2020-10-13 08:04:50,723 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-10-13 08:04:50,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2020-10-13 08:04:50,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 588. [2020-10-13 08:04:50,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2020-10-13 08:04:50,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 829 transitions. [2020-10-13 08:04:50,775 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 829 transitions. Word has length 96 [2020-10-13 08:04:50,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-13 08:04:50,776 INFO L479 AbstractCegarLoop]: Abstraction has 588 states and 829 transitions. [2020-10-13 08:04:50,776 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-13 08:04:50,776 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 829 transitions. [2020-10-13 08:04:50,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2020-10-13 08:04:50,779 INFO L414 BasicCegarLoop]: Found error trace [2020-10-13 08:04:50,779 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-13 08:04:50,779 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-13 08:04:50,779 INFO L427 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-13 08:04:50,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-13 08:04:50,780 INFO L82 PathProgramCache]: Analyzing trace with hash -689374291, now seen corresponding path program 1 times [2020-10-13 08:04:50,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-13 08:04:50,780 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1279516887] [2020-10-13 08:04:50,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-13 08:04:50,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-13 08:04:50,835 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-13 08:04:51,040 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-13 08:04:51,040 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 113 [2020-10-13 08:04:51,041 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-13 08:04:51,041 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 226 [2020-10-13 08:04:51,041 FATAL L256 erpolLogProxyWrapper]: Heuristic: NARROWEST [2020-10-13 08:04:51,041 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-13 08:04:51,041 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 89 [2020-10-13 08:04:51,041 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 23 [2020-10-13 08:04:51,042 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-13 08:04:51,100 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-13 08:04:51,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-13 08:04:51,103 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-13 08:04:51,105 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-13 08:04:51,105 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-13 08:04:51,105 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-13 08:04:51,105 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 2 [2020-10-13 08:04:51,106 FATAL L256 erpolLogProxyWrapper]: Heuristic: NARROWEST [2020-10-13 08:04:51,106 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-13 08:04:51,106 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-13 08:04:51,106 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-13 08:04:51,106 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-13 08:04:51,116 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-13 08:04:51,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-13 08:04:51,146 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-13 08:04:51,216 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-13 08:04:51,216 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 80 [2020-10-13 08:04:51,217 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-13 08:04:51,217 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 82 [2020-10-13 08:04:51,217 FATAL L256 erpolLogProxyWrapper]: Heuristic: NARROWEST [2020-10-13 08:04:51,217 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-13 08:04:51,218 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-13 08:04:51,218 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 74 [2020-10-13 08:04:51,218 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-13 08:04:51,263 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-13 08:04:51,263 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1279516887] [2020-10-13 08:04:51,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-13 08:04:51,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-10-13 08:04:51,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675163171] [2020-10-13 08:04:51,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-13 08:04:51,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-13 08:04:51,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-13 08:04:51,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-13 08:04:51,266 INFO L87 Difference]: Start difference. First operand 588 states and 829 transitions. Second operand 5 states. [2020-10-13 08:04:52,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-13 08:04:52,315 INFO L93 Difference]: Finished difference Result 1609 states and 2348 transitions. [2020-10-13 08:04:52,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-13 08:04:52,316 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2020-10-13 08:04:52,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-13 08:04:52,323 INFO L225 Difference]: With dead ends: 1609 [2020-10-13 08:04:52,323 INFO L226 Difference]: Without dead ends: 1027 [2020-10-13 08:04:52,325 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-10-13 08:04:52,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1027 states. [2020-10-13 08:04:52,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1027 to 880. [2020-10-13 08:04:52,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 880 states. [2020-10-13 08:04:52,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 1211 transitions. [2020-10-13 08:04:52,367 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 1211 transitions. Word has length 103 [2020-10-13 08:04:52,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-13 08:04:52,368 INFO L479 AbstractCegarLoop]: Abstraction has 880 states and 1211 transitions. [2020-10-13 08:04:52,368 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-13 08:04:52,368 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1211 transitions. [2020-10-13 08:04:52,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2020-10-13 08:04:52,373 INFO L414 BasicCegarLoop]: Found error trace [2020-10-13 08:04:52,373 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-13 08:04:52,374 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-13 08:04:52,374 INFO L427 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-13 08:04:52,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-13 08:04:52,374 INFO L82 PathProgramCache]: Analyzing trace with hash -761339506, now seen corresponding path program 1 times [2020-10-13 08:04:52,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-13 08:04:52,375 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [224035513] [2020-10-13 08:04:52,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-13 08:04:52,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-13 08:04:52,443 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-13 08:04:52,697 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-13 08:04:53,392 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-13 08:04:53,393 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 170 [2020-10-13 08:04:53,393 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-13 08:04:53,393 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 976 [2020-10-13 08:04:53,394 FATAL L256 erpolLogProxyWrapper]: Heuristic: NARROWEST [2020-10-13 08:04:53,394 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-13 08:04:53,394 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 146 [2020-10-13 08:04:53,394 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 23 [2020-10-13 08:04:53,394 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-13 08:04:53,452 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-13 08:04:53,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-13 08:04:53,454 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-13 08:04:53,456 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-13 08:04:53,456 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-13 08:04:53,457 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-13 08:04:53,457 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 2 [2020-10-13 08:04:53,457 FATAL L256 erpolLogProxyWrapper]: Heuristic: NARROWEST [2020-10-13 08:04:53,457 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-13 08:04:53,457 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-13 08:04:53,458 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-13 08:04:53,458 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-13 08:04:53,468 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-13 08:04:53,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-13 08:04:53,510 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-13 08:04:53,595 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-13 08:04:53,595 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 137 [2020-10-13 08:04:53,596 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-13 08:04:53,596 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 101 [2020-10-13 08:04:53,596 FATAL L256 erpolLogProxyWrapper]: Heuristic: NARROWEST [2020-10-13 08:04:53,596 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-13 08:04:53,596 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-13 08:04:53,596 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 131 [2020-10-13 08:04:53,597 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-13 08:04:53,660 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-13 08:04:53,660 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [224035513] [2020-10-13 08:04:53,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-13 08:04:53,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-10-13 08:04:53,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053215349] [2020-10-13 08:04:53,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-13 08:04:53,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-13 08:04:53,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-13 08:04:53,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-13 08:04:53,663 INFO L87 Difference]: Start difference. First operand 880 states and 1211 transitions. Second operand 5 states. [2020-10-13 08:04:54,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-13 08:04:54,835 INFO L93 Difference]: Finished difference Result 2193 states and 3116 transitions. [2020-10-13 08:04:54,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-13 08:04:54,835 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 160 [2020-10-13 08:04:54,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-13 08:04:54,844 INFO L225 Difference]: With dead ends: 2193 [2020-10-13 08:04:54,844 INFO L226 Difference]: Without dead ends: 1319 [2020-10-13 08:04:54,846 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-10-13 08:04:54,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1319 states. [2020-10-13 08:04:54,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1319 to 1029. [2020-10-13 08:04:54,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1029 states. [2020-10-13 08:04:54,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 1387 transitions. [2020-10-13 08:04:54,894 INFO L78 Accepts]: Start accepts. Automaton has 1029 states and 1387 transitions. Word has length 160 [2020-10-13 08:04:54,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-13 08:04:54,896 INFO L479 AbstractCegarLoop]: Abstraction has 1029 states and 1387 transitions. [2020-10-13 08:04:54,896 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-13 08:04:54,896 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 1387 transitions. [2020-10-13 08:04:54,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2020-10-13 08:04:54,901 INFO L414 BasicCegarLoop]: Found error trace [2020-10-13 08:04:54,901 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-13 08:04:54,901 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-13 08:04:54,902 INFO L427 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-13 08:04:54,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-13 08:04:54,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1270361455, now seen corresponding path program 1 times [2020-10-13 08:04:54,902 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-13 08:04:54,903 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1227657472] [2020-10-13 08:04:54,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-13 08:04:54,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-13 08:04:54,969 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-13 08:04:55,175 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-13 08:04:56,099 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-13 08:04:56,100 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 175 [2020-10-13 08:04:56,100 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-13 08:04:56,103 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1155 [2020-10-13 08:04:56,103 FATAL L256 erpolLogProxyWrapper]: Heuristic: NARROWEST [2020-10-13 08:04:56,103 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 13 [2020-10-13 08:04:56,103 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 5 [2020-10-13 08:04:56,104 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 143 [2020-10-13 08:04:56,104 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-13 08:04:56,228 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-13 08:04:56,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-13 08:04:56,234 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-13 08:04:56,241 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-13 08:04:56,242 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-13 08:04:56,242 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-13 08:04:56,242 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 8 [2020-10-13 08:04:56,242 FATAL L256 erpolLogProxyWrapper]: Heuristic: NARROWEST [2020-10-13 08:04:56,242 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-13 08:04:56,243 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-13 08:04:56,243 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 2 [2020-10-13 08:04:56,243 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-13 08:04:56,257 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-13 08:04:56,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-13 08:04:56,300 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-13 08:04:56,406 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-13 08:04:56,916 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-13 08:04:56,917 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 142 [2020-10-13 08:04:56,917 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-13 08:04:56,917 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 634 [2020-10-13 08:04:56,917 FATAL L256 erpolLogProxyWrapper]: Heuristic: NARROWEST [2020-10-13 08:04:56,917 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 10 [2020-10-13 08:04:56,918 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-13 08:04:56,918 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 142 [2020-10-13 08:04:56,918 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-13 08:04:57,314 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2020-10-13 08:04:57,463 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2020-10-13 08:04:57,625 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 68 [2020-10-13 08:04:57,791 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2020-10-13 08:04:58,457 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-13 08:04:58,458 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1227657472] [2020-10-13 08:04:58,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-13 08:04:58,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-13 08:04:58,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671855843] [2020-10-13 08:04:58,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-13 08:04:58,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-13 08:04:58,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-13 08:04:58,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2020-10-13 08:04:58,460 INFO L87 Difference]: Start difference. First operand 1029 states and 1387 transitions. Second operand 12 states. [2020-10-13 08:04:59,107 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 47 [2020-10-13 08:04:59,369 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 51 [2020-10-13 08:04:59,768 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 54 [2020-10-13 08:05:00,030 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 57 [2020-10-13 08:05:00,239 WARN L193 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 60 [2020-10-13 08:05:00,398 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 57 [2020-10-13 08:05:00,620 WARN L193 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 85 [2020-10-13 08:05:00,768 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 61 [2020-10-13 08:05:00,971 WARN L193 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 78 [2020-10-13 08:05:01,276 WARN L193 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 85 [2020-10-13 08:05:01,612 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 64 [2020-10-13 08:05:01,907 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 67 [2020-10-13 08:05:02,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-13 08:05:02,194 INFO L93 Difference]: Finished difference Result 2220 states and 2995 transitions. [2020-10-13 08:05:02,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-10-13 08:05:02,195 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 165 [2020-10-13 08:05:02,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-13 08:05:02,202 INFO L225 Difference]: With dead ends: 2220 [2020-10-13 08:05:02,202 INFO L226 Difference]: Without dead ends: 1189 [2020-10-13 08:05:02,205 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=214, Invalid=542, Unknown=0, NotChecked=0, Total=756 [2020-10-13 08:05:02,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states. [2020-10-13 08:05:02,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 1181. [2020-10-13 08:05:02,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1181 states. [2020-10-13 08:05:02,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1181 states to 1181 states and 1565 transitions. [2020-10-13 08:05:02,242 INFO L78 Accepts]: Start accepts. Automaton has 1181 states and 1565 transitions. Word has length 165 [2020-10-13 08:05:02,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-13 08:05:02,242 INFO L479 AbstractCegarLoop]: Abstraction has 1181 states and 1565 transitions. [2020-10-13 08:05:02,243 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-13 08:05:02,243 INFO L276 IsEmpty]: Start isEmpty. Operand 1181 states and 1565 transitions. [2020-10-13 08:05:02,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2020-10-13 08:05:02,247 INFO L414 BasicCegarLoop]: Found error trace [2020-10-13 08:05:02,247 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 08:05:02,247 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-13 08:05:02,248 INFO L427 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-13 08:05:02,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-13 08:05:02,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1066694831, now seen corresponding path program 1 times [2020-10-13 08:05:02,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-13 08:05:02,248 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [605352399] [2020-10-13 08:05:02,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-13 08:05:02,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-13 08:05:02,312 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-13 08:05:02,488 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-13 08:05:02,823 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-13 08:05:03,065 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-13 08:05:03,458 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-13 08:05:03,458 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 242 [2020-10-13 08:05:03,458 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 4 [2020-10-13 08:05:03,458 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1169 [2020-10-13 08:05:03,459 FATAL L256 erpolLogProxyWrapper]: Heuristic: NARROWEST [2020-10-13 08:05:03,459 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-13 08:05:03,459 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 218 [2020-10-13 08:05:03,459 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 11 [2020-10-13 08:05:03,459 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-13 08:05:03,543 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-13 08:05:03,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-13 08:05:03,545 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-13 08:05:03,547 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-13 08:05:03,549 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-13 08:05:03,549 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-13 08:05:03,549 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 2 [2020-10-13 08:05:03,549 FATAL L256 erpolLogProxyWrapper]: Heuristic: NARROWEST [2020-10-13 08:05:03,549 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-13 08:05:03,550 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-13 08:05:03,550 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-13 08:05:03,550 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-13 08:05:03,559 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-13 08:05:03,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-13 08:05:03,564 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-13 08:05:03,582 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-13 08:05:03,582 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 80 [2020-10-13 08:05:03,582 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-13 08:05:03,582 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 18 [2020-10-13 08:05:03,582 FATAL L256 erpolLogProxyWrapper]: Heuristic: NARROWEST [2020-10-13 08:05:03,583 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-13 08:05:03,583 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-13 08:05:03,583 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-13 08:05:03,583 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-13 08:05:03,599 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-10-13 08:05:03,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-13 08:05:03,635 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-13 08:05:03,728 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-13 08:05:03,729 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 128 [2020-10-13 08:05:03,729 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-13 08:05:03,729 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 108 [2020-10-13 08:05:03,729 FATAL L256 erpolLogProxyWrapper]: Heuristic: NARROWEST [2020-10-13 08:05:03,730 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-13 08:05:03,730 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-13 08:05:03,731 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 122 [2020-10-13 08:05:03,731 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-13 08:05:03,850 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 35 proven. 2 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2020-10-13 08:05:03,850 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [605352399] [2020-10-13 08:05:03,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-13 08:05:03,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-10-13 08:05:03,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015908837] [2020-10-13 08:05:03,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-13 08:05:03,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-13 08:05:03,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-13 08:05:03,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-13 08:05:03,854 INFO L87 Difference]: Start difference. First operand 1181 states and 1565 transitions. Second operand 5 states. [2020-10-13 08:05:04,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-13 08:05:04,718 INFO L93 Difference]: Finished difference Result 2232 states and 3020 transitions. [2020-10-13 08:05:04,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-13 08:05:04,718 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 230 [2020-10-13 08:05:04,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-13 08:05:04,725 INFO L225 Difference]: With dead ends: 2232 [2020-10-13 08:05:04,725 INFO L226 Difference]: Without dead ends: 1183 [2020-10-13 08:05:04,729 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-13 08:05:04,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2020-10-13 08:05:04,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 1181. [2020-10-13 08:05:04,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1181 states. [2020-10-13 08:05:04,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1181 states to 1181 states and 1560 transitions. [2020-10-13 08:05:04,766 INFO L78 Accepts]: Start accepts. Automaton has 1181 states and 1560 transitions. Word has length 230 [2020-10-13 08:05:04,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-13 08:05:04,767 INFO L479 AbstractCegarLoop]: Abstraction has 1181 states and 1560 transitions. [2020-10-13 08:05:04,767 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-13 08:05:04,767 INFO L276 IsEmpty]: Start isEmpty. Operand 1181 states and 1560 transitions. [2020-10-13 08:05:04,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2020-10-13 08:05:04,772 INFO L414 BasicCegarLoop]: Found error trace [2020-10-13 08:05:04,772 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 08:05:04,772 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-13 08:05:04,772 INFO L427 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-13 08:05:04,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-13 08:05:04,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1643123341, now seen corresponding path program 1 times [2020-10-13 08:05:04,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-13 08:05:04,773 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [193579320] [2020-10-13 08:05:04,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-13 08:05:04,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-13 08:05:04,854 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-13 08:05:05,052 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-13 08:05:05,470 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-13 08:05:05,471 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 256 [2020-10-13 08:05:05,471 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-13 08:05:05,471 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 659 [2020-10-13 08:05:05,471 FATAL L256 erpolLogProxyWrapper]: Heuristic: NARROWEST [2020-10-13 08:05:05,471 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-13 08:05:05,472 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 89 [2020-10-13 08:05:05,472 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 26 [2020-10-13 08:05:05,472 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-13 08:05:05,532 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-13 08:05:05,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-13 08:05:05,534 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-13 08:05:05,535 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-13 08:05:05,535 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-13 08:05:05,536 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-13 08:05:05,537 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 2 [2020-10-13 08:05:05,537 FATAL L256 erpolLogProxyWrapper]: Heuristic: NARROWEST [2020-10-13 08:05:05,538 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-13 08:05:05,538 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-13 08:05:05,538 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-13 08:05:05,538 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-13 08:05:05,547 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-13 08:05:05,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-13 08:05:05,569 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-13 08:05:05,610 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-13 08:05:05,610 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 80 [2020-10-13 08:05:05,610 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-13 08:05:05,611 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 49 [2020-10-13 08:05:05,611 FATAL L256 erpolLogProxyWrapper]: Heuristic: NARROWEST [2020-10-13 08:05:05,611 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-13 08:05:05,611 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-13 08:05:05,611 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 74 [2020-10-13 08:05:05,612 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-13 08:05:05,631 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-10-13 08:05:05,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-13 08:05:05,679 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-13 08:05:05,731 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-13 08:05:06,023 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-13 08:05:06,024 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 142 [2020-10-13 08:05:06,024 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-13 08:05:06,024 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 361 [2020-10-13 08:05:06,024 FATAL L256 erpolLogProxyWrapper]: Heuristic: NARROWEST [2020-10-13 08:05:06,025 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-13 08:05:06,025 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-13 08:05:06,025 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 142 [2020-10-13 08:05:06,025 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-13 08:05:06,146 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 110 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-13 08:05:06,146 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [193579320] [2020-10-13 08:05:06,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-13 08:05:06,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-13 08:05:06,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885143036] [2020-10-13 08:05:06,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-13 08:05:06,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-13 08:05:06,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-13 08:05:06,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-13 08:05:06,149 INFO L87 Difference]: Start difference. First operand 1181 states and 1560 transitions. Second operand 7 states. [2020-10-13 08:05:08,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-13 08:05:08,041 INFO L93 Difference]: Finished difference Result 2682 states and 3570 transitions. [2020-10-13 08:05:08,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-13 08:05:08,044 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 244 [2020-10-13 08:05:08,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-13 08:05:08,052 INFO L225 Difference]: With dead ends: 2682 [2020-10-13 08:05:08,052 INFO L226 Difference]: Without dead ends: 1618 [2020-10-13 08:05:08,056 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-10-13 08:05:08,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1618 states. [2020-10-13 08:05:08,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1618 to 1467. [2020-10-13 08:05:08,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1467 states. [2020-10-13 08:05:08,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1467 states to 1467 states and 1924 transitions. [2020-10-13 08:05:08,098 INFO L78 Accepts]: Start accepts. Automaton has 1467 states and 1924 transitions. Word has length 244 [2020-10-13 08:05:08,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-13 08:05:08,098 INFO L479 AbstractCegarLoop]: Abstraction has 1467 states and 1924 transitions. [2020-10-13 08:05:08,098 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-13 08:05:08,099 INFO L276 IsEmpty]: Start isEmpty. Operand 1467 states and 1924 transitions. [2020-10-13 08:05:08,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2020-10-13 08:05:08,103 INFO L414 BasicCegarLoop]: Found error trace [2020-10-13 08:05:08,104 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 08:05:08,104 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-13 08:05:08,104 INFO L427 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-13 08:05:08,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-13 08:05:08,105 INFO L82 PathProgramCache]: Analyzing trace with hash -1637300869, now seen corresponding path program 1 times [2020-10-13 08:05:08,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-13 08:05:08,110 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1298138361] [2020-10-13 08:05:08,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-13 08:05:08,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-13 08:05:08,182 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-10-13 08:05:08,183 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-13 08:05:08,189 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-13 08:05:08,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 08:05:08 BoogieIcfgContainer [2020-10-13 08:05:08,260 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-13 08:05:08,263 INFO L168 Benchmark]: Toolchain (without parser) took 24389.52 ms. Allocated memory was 142.1 MB in the beginning and 627.0 MB in the end (delta: 485.0 MB). Free memory was 103.2 MB in the beginning and 127.2 MB in the end (delta: -24.0 MB). Peak memory consumption was 461.0 MB. Max. memory is 7.1 GB. [2020-10-13 08:05:08,264 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 142.1 MB. Free memory was 123.6 MB in the beginning and 123.4 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-10-13 08:05:08,264 INFO L168 Benchmark]: CACSL2BoogieTranslator took 677.70 ms. Allocated memory was 142.1 MB in the beginning and 207.6 MB in the end (delta: 65.5 MB). Free memory was 103.0 MB in the beginning and 173.9 MB in the end (delta: -70.9 MB). Peak memory consumption was 33.9 MB. Max. memory is 7.1 GB. [2020-10-13 08:05:08,265 INFO L168 Benchmark]: Boogie Preprocessor took 116.56 ms. Allocated memory is still 207.6 MB. Free memory was 173.9 MB in the beginning and 169.1 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 7.1 GB. [2020-10-13 08:05:08,268 INFO L168 Benchmark]: RCFGBuilder took 1240.15 ms. Allocated memory was 207.6 MB in the beginning and 237.0 MB in the end (delta: 29.4 MB). Free memory was 169.1 MB in the beginning and 176.8 MB in the end (delta: -7.7 MB). Peak memory consumption was 78.5 MB. Max. memory is 7.1 GB. [2020-10-13 08:05:08,270 INFO L168 Benchmark]: TraceAbstraction took 22350.23 ms. Allocated memory was 237.0 MB in the beginning and 627.0 MB in the end (delta: 390.1 MB). Free memory was 176.8 MB in the beginning and 127.2 MB in the end (delta: 49.6 MB). Peak memory consumption was 439.6 MB. Max. memory is 7.1 GB. [2020-10-13 08:05:08,278 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.18 ms. Allocated memory is still 142.1 MB. Free memory was 123.6 MB in the beginning and 123.4 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 677.70 ms. Allocated memory was 142.1 MB in the beginning and 207.6 MB in the end (delta: 65.5 MB). Free memory was 103.0 MB in the beginning and 173.9 MB in the end (delta: -70.9 MB). Peak memory consumption was 33.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 116.56 ms. Allocated memory is still 207.6 MB. Free memory was 173.9 MB in the beginning and 169.1 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1240.15 ms. Allocated memory was 207.6 MB in the beginning and 237.0 MB in the end (delta: 29.4 MB). Free memory was 169.1 MB in the beginning and 176.8 MB in the end (delta: -7.7 MB). Peak memory consumption was 78.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 22350.23 ms. Allocated memory was 237.0 MB in the beginning and 627.0 MB in the end (delta: 390.1 MB). Free memory was 176.8 MB in the beginning and 127.2 MB in the end (delta: 49.6 MB). Peak memory consumption was 439.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 58]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int inputC = 3; [L8] int inputD = 4; [L9] int inputE = 5; [L10] int inputF = 6; [L11] int inputB = 2; [L14] int a1 = 23; [L15] int a19 = 9; [L16] int a10 = 0; [L17] int a12 = 0; [L18] int a4 = 14; [L579] int output = -1; [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL, EXPR calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) [L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) [L225] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) [L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) [L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) [L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) [L244] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) [L249] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) [L254] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) [L260] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) [L265] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) [L271] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) [L277] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) [L283] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) [L286] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) [L291] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) [L296] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) [L301] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) [L306] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) [L312] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) [L317] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) [L320] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) [L323] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) [L326] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) [L329] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) [L335] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) [L340] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) [L345] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) [L351] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) [L354] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) [L357] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) [L360] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) [L365] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0))))) [L370] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) [L375] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) [L378] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) [L383] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) [L388] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0))))) [L393] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) [L398] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) [L403] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14))) [L408] COND FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))) [L414] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14))) [L419] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10)))))) [L425] COND TRUE ((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0)) [L426] a1 = ((((a1 / 5) * 5) / 5) + 505228) [L427] a10 = 1 [L429] return 25; [L590] RET, EXPR calculate_output(input) [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL, EXPR calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) [L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) [L225] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) [L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) [L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) [L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) [L244] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) [L249] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) [L254] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) [L260] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) [L265] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) [L271] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) [L277] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) [L283] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) [L286] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) [L291] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) [L296] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) [L301] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) [L306] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) [L312] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) [L317] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) [L320] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) [L323] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) [L326] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) [L329] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) [L335] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) [L340] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) [L345] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) [L351] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) [L354] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) [L357] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) [L360] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) [L365] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0))))) [L370] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) [L375] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) [L378] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) [L383] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) [L388] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0))))) [L393] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) [L398] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) [L403] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14))) [L408] COND FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))) [L414] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14))) [L419] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10)))))) [L425] COND FALSE !(((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0))) [L430] COND FALSE !((((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 6)) && (a19==10))) && (a12==0))) [L436] COND FALSE !(((a19==9) && ((((input == 4) && (( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 ))) && (a12==0)) && (a4==14)))) [L442] COND FALSE !((((a19==10) && ((a12==0) && ((((a10==1) && a1 <= -13 ) || (( ((38 < a1) && (218 >= a1)) && (a10==0)) || ((a10==0) && 218 < a1 ))) && (input == 3)))) && (a4==14))) [L448] COND FALSE !(((a19==9) && (((a4==14) && ((((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4))) && (input == 5))) && (a12==0)))) [L454] COND FALSE !((((a12==0) && ((((input == 5) && (a19==10)) && ((38 < a1) && (218 >= a1)) ) && (a4==14))) && (a10==1))) [L460] COND FALSE !(((a19==9) && ((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3)) && (a10==1)) && (a12==0))))) [L465] COND FALSE !(((a10==0) && ((a12==0) && ((((input == 5) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a4==14))))) [L471] COND FALSE !(( 218 < a1 && (((((input == 3) && (a10==1)) && (a12==0)) && (a4==14)) && (a19==10)))) [L476] COND FALSE !((((a12==0) && ((a19==9) && (((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a4==14)))) && (a10==3))) [L481] COND FALSE !((((((a4==14) && ( ((38 < a1) && (218 >= a1)) && (input == 2))) && (a12==0)) && (a10==1)) && (a19==10))) [L487] COND FALSE !((((a19==10) && ((a10==1) && ((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (input == 5))))) && (a4==14))) [L493] COND FALSE !(((((a10==1) && (((input == 5) && 218 < a1 ) && (a4==14))) && (a19==10)) && (a12==0))) [L499] COND FALSE !((((a4==14) && ((a19==9) && ((input == 2) && (((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 ))))) && (a12==0))) [L504] COND FALSE !((((a4==14) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 2))) && (a12==0))) && (a10==4))) [L509] COND FALSE !(((a4==14) && (((a19==9) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 6)) && (a10==3))) && (a12==0)))) [L514] COND FALSE !((((a4==14) && ((((input == 6) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a12==0))) && (a10==0))) [L517] COND FALSE !(((a12==0) && ((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 2)) && (a19==10))))) [L523] COND FALSE !((((a12==0) && ((a19==9) && ((a10==2) && ((input == 6) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))))) && (a4==14))) [L526] COND FALSE !(((a4==14) && ((a19==9) && ((a12==0) && (((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)))))) [L529] COND FALSE !(((a19==9) && (((a10==1) && ((a12==0) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )))) && (a4==14)))) [L534] COND FALSE !(((a19==9) && ((a4==14) && ((a10==1) && (((input == 5) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a12==0)))))) [L540] COND FALSE !(((a12==0) && (((((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a19==9)) && (a4==14)) && (a10==0)))) [L545] COND FALSE !(((a4==14) && (((a12==0) && ((a19==9) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )))) && (a10==4)))) [L548] COND FALSE !(((((( ((38 < a1) && (218 >= a1)) && (input == 3)) && (a10==1)) && (a12==0)) && (a4==14)) && (a19==10))) [L554] COND FALSE !((((a4==14) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 4)) && (a12==0)) && (a19==9))) && (a10==2))) [L557] COND TRUE ((a12==0) && ((( 218 < a1 && ((a19==9) && (input == 5))) && (a10==1)) && (a4==14))) [L558] a1 = ((((a1 * 9)/ 10) + 58620) - 603783) [L559] a10 = 4 [L560] a19 = 8 [L562] return -1; [L590] RET, EXPR calculate_output(input) [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND TRUE (((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8)) [L58] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 215 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 22.2s, OverallIterations: 8, TraceHistogramMax: 3, AutomataDifference: 11.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 168 SDtfs, 3348 SDslu, 154 SDs, 0 SdLazy, 5526 SolverSat, 987 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 103 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1467occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 7 MinimizatonAttempts, 608 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 9.0s InterpolantComputationTime, 1302 NumberOfCodeBlocks, 1302 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1015 ConstructedInterpolants, 0 QuantifiedInterpolants, 1833237 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 2 PerfectInterpolantSequences, 287/294 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...