/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=WIDESTAMONGSMALL --traceabstraction.additional.smt.options tolerance=0.4 --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-14 02:31:56,756 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-14 02:31:56,759 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-14 02:31:56,804 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-14 02:31:56,805 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-14 02:31:56,817 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-14 02:31:56,821 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-14 02:31:56,824 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-14 02:31:56,826 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-14 02:31:56,827 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-14 02:31:56,828 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-14 02:31:56,830 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-14 02:31:56,831 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-14 02:31:56,835 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-14 02:31:56,836 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-14 02:31:56,840 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-14 02:31:56,842 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-14 02:31:56,843 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-14 02:31:56,846 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-14 02:31:56,850 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-14 02:31:56,854 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-14 02:31:56,856 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-14 02:31:56,858 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-14 02:31:56,859 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-14 02:31:56,865 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-14 02:31:56,865 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-14 02:31:56,865 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-14 02:31:56,868 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-14 02:31:56,869 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-14 02:31:56,870 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-14 02:31:56,870 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-14 02:31:56,871 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-14 02:31:56,872 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-14 02:31:56,872 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-14 02:31:56,874 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-14 02:31:56,874 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-14 02:31:56,874 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-14 02:31:56,875 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-14 02:31:56,875 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-14 02:31:56,876 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-14 02:31:56,878 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-14 02:31:56,878 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-14 02:31:56,910 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-14 02:31:56,911 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-14 02:31:56,912 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-14 02:31:56,912 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-14 02:31:56,912 INFO L138 SettingsManager]: * Use SBE=true [2020-10-14 02:31:56,913 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-14 02:31:56,913 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-14 02:31:56,913 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-14 02:31:56,913 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-14 02:31:56,913 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-14 02:31:56,914 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-14 02:31:56,914 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-14 02:31:56,914 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-14 02:31:56,914 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-14 02:31:56,915 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-14 02:31:56,915 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-14 02:31:56,915 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-14 02:31:56,915 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-14 02:31:56,915 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-14 02:31:56,916 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-14 02:31:56,916 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-14 02:31:56,916 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-14 02:31:56,916 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-14 02:31:56,916 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-14 02:31:56,917 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-14 02:31:56,917 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-14 02:31:56,917 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-14 02:31:56,917 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-14 02:31:56,918 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-14 02:31:56,918 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=WIDESTAMONGSMALL;tolerance=0.4;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=WIDESTAMONGSMALL;tolerance=0.4;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=WIDESTAMONGSMALL;tolerance=0.4;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=WIDESTAMONGSMALL;tolerance=0.4;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=WIDESTAMONGSMALL;tolerance=0.4;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=WIDESTAMONGSMALL;tolerance=0.4;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=WIDESTAMONGSMALL;tolerance=0.4;log-additional-information=true;unknown-allowed=true; [2020-10-14 02:31:57,200 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-14 02:31:57,220 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-14 02:31:57,224 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-14 02:31:57,226 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-14 02:31:57,226 INFO L275 PluginConnector]: CDTParser initialized [2020-10-14 02:31:57,227 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-14 02:31:57,302 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/56dc887e2/b0b3adb46de2427391a2594e9a6eab8d/FLAG86814c291 [2020-10-14 02:31:57,866 INFO L306 CDTParser]: Found 1 translation units. [2020-10-14 02:31:57,866 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/eca-rers2012/Problem10_label55.c [2020-10-14 02:31:57,878 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/56dc887e2/b0b3adb46de2427391a2594e9a6eab8d/FLAG86814c291 [2020-10-14 02:31:58,166 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/56dc887e2/b0b3adb46de2427391a2594e9a6eab8d [2020-10-14 02:31:58,177 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-14 02:31:58,179 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-14 02:31:58,180 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-14 02:31:58,180 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-14 02:31:58,184 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-14 02:31:58,186 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:31:58" (1/1) ... [2020-10-14 02:31:58,189 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ce6acaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:31:58, skipping insertion in model container [2020-10-14 02:31:58,189 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:31:58" (1/1) ... [2020-10-14 02:31:58,200 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-14 02:31:58,267 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-14 02:31:58,777 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-14 02:31:58,787 INFO L203 MainTranslator]: Completed pre-run [2020-10-14 02:31:59,086 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-14 02:31:59,113 INFO L208 MainTranslator]: Completed translation [2020-10-14 02:31:59,115 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:31:59 WrapperNode [2020-10-14 02:31:59,115 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-14 02:31:59,116 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-14 02:31:59,122 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-14 02:31:59,122 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-14 02:31:59,133 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:31:59" (1/1) ... [2020-10-14 02:31:59,134 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:31:59" (1/1) ... [2020-10-14 02:31:59,154 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:31:59" (1/1) ... [2020-10-14 02:31:59,155 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:31:59" (1/1) ... [2020-10-14 02:31:59,191 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:31:59" (1/1) ... [2020-10-14 02:31:59,208 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:31:59" (1/1) ... [2020-10-14 02:31:59,214 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:31:59" (1/1) ... [2020-10-14 02:31:59,221 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-14 02:31:59,222 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-14 02:31:59,222 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-14 02:31:59,222 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-14 02:31:59,223 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:31:59" (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-14 02:31:59,315 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-14 02:31:59,316 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-14 02:31:59,316 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2020-10-14 02:31:59,316 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-14 02:31:59,316 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2020-10-14 02:31:59,316 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-10-14 02:31:59,316 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-14 02:31:59,317 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-10-14 02:31:59,318 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-14 02:31:59,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-14 02:31:59,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-14 02:32:00,561 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-14 02:32:00,562 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-10-14 02:32:00,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:32:00 BoogieIcfgContainer [2020-10-14 02:32:00,568 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-14 02:32:00,571 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-14 02:32:00,571 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-14 02:32:00,574 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-14 02:32:00,574 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 02:31:58" (1/3) ... [2020-10-14 02:32:00,575 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7758c980 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:32:00, skipping insertion in model container [2020-10-14 02:32:00,576 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:31:59" (2/3) ... [2020-10-14 02:32:00,577 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7758c980 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:32:00, skipping insertion in model container [2020-10-14 02:32:00,577 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:32:00" (3/3) ... [2020-10-14 02:32:00,583 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem10_label55.c [2020-10-14 02:32:00,594 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-14 02:32:00,607 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-14 02:32:00,621 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-14 02:32:00,653 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-14 02:32:00,654 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-14 02:32:00,654 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-14 02:32:00,654 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-14 02:32:00,654 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-14 02:32:00,654 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-14 02:32:00,654 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-14 02:32:00,655 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-14 02:32:00,675 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states. [2020-10-14 02:32:00,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-14 02:32:00,682 INFO L414 BasicCegarLoop]: Found error trace [2020-10-14 02:32:00,683 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-14 02:32:00,683 INFO L427 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-14 02:32:00,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-14 02:32:00,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1305395761, now seen corresponding path program 1 times [2020-10-14 02:32:00,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-14 02:32:00,697 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1950593570] [2020-10-14 02:32:00,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-14 02:32:00,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:32:00,860 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:32:01,208 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:32:01,208 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 32 [2020-10-14 02:32:01,208 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:32:01,209 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 387 [2020-10-14 02:32:01,211 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:32:01,211 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:32:01,211 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-10-14 02:32:01,212 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 5 [2020-10-14 02:32:01,215 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 26 [2020-10-14 02:32:01,215 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 6 [2020-10-14 02:32:01,341 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-14 02:32:01,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:32:01,349 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:32:01,356 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:32:01,356 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-14 02:32:01,357 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:32:01,357 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 8 [2020-10-14 02:32:01,357 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:32:01,357 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:32:01,357 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-14 02:32:01,358 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 02:32:01,358 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 2 [2020-10-14 02:32:01,358 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 02:32:01,368 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-14 02:32:01,369 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1950593570] [2020-10-14 02:32:01,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-14 02:32:01,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-14 02:32:01,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921891506] [2020-10-14 02:32:01,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-14 02:32:01,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-14 02:32:01,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-14 02:32:01,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-14 02:32:01,396 INFO L87 Difference]: Start difference. First operand 215 states. Second operand 4 states. [2020-10-14 02:32:02,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-14 02:32:02,876 INFO L93 Difference]: Finished difference Result 581 states and 1007 transitions. [2020-10-14 02:32:02,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-14 02:32:02,878 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-10-14 02:32:02,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-14 02:32:02,895 INFO L225 Difference]: With dead ends: 581 [2020-10-14 02:32:02,895 INFO L226 Difference]: Without dead ends: 302 [2020-10-14 02:32:02,906 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-14 02:32:02,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2020-10-14 02:32:02,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 296. [2020-10-14 02:32:02,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2020-10-14 02:32:02,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 423 transitions. [2020-10-14 02:32:02,990 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 423 transitions. Word has length 24 [2020-10-14 02:32:02,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-14 02:32:02,990 INFO L479 AbstractCegarLoop]: Abstraction has 296 states and 423 transitions. [2020-10-14 02:32:02,990 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-14 02:32:02,991 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 423 transitions. [2020-10-14 02:32:02,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-10-14 02:32:02,996 INFO L414 BasicCegarLoop]: Found error trace [2020-10-14 02:32:02,996 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-14 02:32:02,996 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-14 02:32:02,997 INFO L427 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-14 02:32:02,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-14 02:32:02,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1317266958, now seen corresponding path program 1 times [2020-10-14 02:32:02,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-14 02:32:02,998 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [667208701] [2020-10-14 02:32:02,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-14 02:32:03,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:32:03,063 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:32:03,213 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:32:03,644 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:32:03,731 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:32:03,731 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 106 [2020-10-14 02:32:03,732 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 3 [2020-10-14 02:32:03,732 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 690 [2020-10-14 02:32:03,733 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:32:03,733 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:32:03,734 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-14 02:32:03,734 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 82 [2020-10-14 02:32:03,734 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 23 [2020-10-14 02:32:03,734 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 2 [2020-10-14 02:32:03,787 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-14 02:32:03,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:32:03,790 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:32:03,794 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:32:03,795 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-14 02:32:03,795 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:32:03,795 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 4 [2020-10-14 02:32:03,795 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:32:03,796 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:32:03,796 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-14 02:32:03,796 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 02:32:03,796 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-14 02:32:03,797 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 02:32:03,809 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-14 02:32:03,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:32:03,832 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:32:03,881 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:32:03,881 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 73 [2020-10-14 02:32:03,882 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:32:03,882 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 58 [2020-10-14 02:32:03,882 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:32:03,882 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:32:03,882 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-14 02:32:03,883 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 02:32:03,883 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 67 [2020-10-14 02:32:03,883 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 02:32:03,926 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-14 02:32:03,926 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [667208701] [2020-10-14 02:32:03,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-14 02:32:03,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-10-14 02:32:03,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147638142] [2020-10-14 02:32:03,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-14 02:32:03,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-14 02:32:03,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-14 02:32:03,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-14 02:32:03,930 INFO L87 Difference]: Start difference. First operand 296 states and 423 transitions. Second operand 6 states. [2020-10-14 02:32:05,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-14 02:32:05,686 INFO L93 Difference]: Finished difference Result 882 states and 1309 transitions. [2020-10-14 02:32:05,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-14 02:32:05,688 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2020-10-14 02:32:05,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-14 02:32:05,695 INFO L225 Difference]: With dead ends: 882 [2020-10-14 02:32:05,695 INFO L226 Difference]: Without dead ends: 592 [2020-10-14 02:32:05,697 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-14 02:32:05,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2020-10-14 02:32:05,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 588. [2020-10-14 02:32:05,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2020-10-14 02:32:05,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 829 transitions. [2020-10-14 02:32:05,739 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 829 transitions. Word has length 96 [2020-10-14 02:32:05,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-14 02:32:05,740 INFO L479 AbstractCegarLoop]: Abstraction has 588 states and 829 transitions. [2020-10-14 02:32:05,740 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-14 02:32:05,740 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 829 transitions. [2020-10-14 02:32:05,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2020-10-14 02:32:05,744 INFO L414 BasicCegarLoop]: Found error trace [2020-10-14 02:32:05,745 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-14 02:32:05,746 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-14 02:32:05,746 INFO L427 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-14 02:32:05,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-14 02:32:05,746 INFO L82 PathProgramCache]: Analyzing trace with hash -689374291, now seen corresponding path program 1 times [2020-10-14 02:32:05,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-14 02:32:05,747 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [658340985] [2020-10-14 02:32:05,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-14 02:32:05,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:32:05,811 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:32:06,031 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:32:06,032 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 113 [2020-10-14 02:32:06,032 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:32:06,032 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 243 [2020-10-14 02:32:06,032 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:32:06,033 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:32:06,033 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-14 02:32:06,033 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 89 [2020-10-14 02:32:06,033 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 23 [2020-10-14 02:32:06,034 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 02:32:06,089 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-14 02:32:06,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:32:06,092 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:32:06,094 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:32:06,095 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-14 02:32:06,095 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:32:06,095 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 3 [2020-10-14 02:32:06,096 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:32:06,096 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:32:06,096 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-14 02:32:06,096 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 02:32:06,096 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-14 02:32:06,097 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 02:32:06,109 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-14 02:32:06,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:32:06,140 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:32:06,207 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:32:06,208 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 80 [2020-10-14 02:32:06,208 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:32:06,208 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 80 [2020-10-14 02:32:06,208 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:32:06,208 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:32:06,209 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-14 02:32:06,209 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 02:32:06,209 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 74 [2020-10-14 02:32:06,209 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 02:32:06,251 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-14 02:32:06,252 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [658340985] [2020-10-14 02:32:06,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-14 02:32:06,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-10-14 02:32:06,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292197093] [2020-10-14 02:32:06,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-14 02:32:06,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-14 02:32:06,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-14 02:32:06,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-14 02:32:06,254 INFO L87 Difference]: Start difference. First operand 588 states and 829 transitions. Second operand 5 states. [2020-10-14 02:32:07,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-14 02:32:07,450 INFO L93 Difference]: Finished difference Result 1609 states and 2348 transitions. [2020-10-14 02:32:07,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-14 02:32:07,452 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2020-10-14 02:32:07,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-14 02:32:07,459 INFO L225 Difference]: With dead ends: 1609 [2020-10-14 02:32:07,459 INFO L226 Difference]: Without dead ends: 1027 [2020-10-14 02:32:07,461 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-14 02:32:07,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1027 states. [2020-10-14 02:32:07,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1027 to 880. [2020-10-14 02:32:07,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 880 states. [2020-10-14 02:32:07,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 1211 transitions. [2020-10-14 02:32:07,513 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 1211 transitions. Word has length 103 [2020-10-14 02:32:07,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-14 02:32:07,513 INFO L479 AbstractCegarLoop]: Abstraction has 880 states and 1211 transitions. [2020-10-14 02:32:07,513 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-14 02:32:07,514 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1211 transitions. [2020-10-14 02:32:07,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2020-10-14 02:32:07,519 INFO L414 BasicCegarLoop]: Found error trace [2020-10-14 02:32:07,519 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-14 02:32:07,519 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-14 02:32:07,520 INFO L427 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-14 02:32:07,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-14 02:32:07,520 INFO L82 PathProgramCache]: Analyzing trace with hash -761339506, now seen corresponding path program 1 times [2020-10-14 02:32:07,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-14 02:32:07,521 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [502213443] [2020-10-14 02:32:07,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-14 02:32:07,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:32:07,608 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:32:07,946 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:32:08,794 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:32:08,794 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 170 [2020-10-14 02:32:08,794 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-14 02:32:08,795 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1221 [2020-10-14 02:32:08,795 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:32:08,795 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:32:08,795 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-14 02:32:08,795 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 146 [2020-10-14 02:32:08,796 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 23 [2020-10-14 02:32:08,804 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 9 [2020-10-14 02:32:08,881 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-14 02:32:08,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:32:08,884 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:32:08,886 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:32:08,886 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-14 02:32:08,886 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:32:08,886 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 2 [2020-10-14 02:32:08,886 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:32:08,887 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:32:08,887 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-14 02:32:08,887 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 02:32:08,888 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-14 02:32:08,888 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 02:32:08,899 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-14 02:32:08,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:32:08,945 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:32:09,037 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:32:09,037 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 137 [2020-10-14 02:32:09,037 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:32:09,037 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 109 [2020-10-14 02:32:09,038 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:32:09,038 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:32:09,038 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-14 02:32:09,038 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 02:32:09,038 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 131 [2020-10-14 02:32:09,039 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-14 02:32:09,103 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-14 02:32:09,104 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [502213443] [2020-10-14 02:32:09,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-14 02:32:09,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-10-14 02:32:09,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373925722] [2020-10-14 02:32:09,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-14 02:32:09,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-14 02:32:09,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-14 02:32:09,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-14 02:32:09,108 INFO L87 Difference]: Start difference. First operand 880 states and 1211 transitions. Second operand 5 states. [2020-10-14 02:32:10,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-14 02:32:10,251 INFO L93 Difference]: Finished difference Result 2193 states and 3116 transitions. [2020-10-14 02:32:10,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-14 02:32:10,252 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 160 [2020-10-14 02:32:10,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-14 02:32:10,260 INFO L225 Difference]: With dead ends: 2193 [2020-10-14 02:32:10,260 INFO L226 Difference]: Without dead ends: 1319 [2020-10-14 02:32:10,263 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-14 02:32:10,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1319 states. [2020-10-14 02:32:10,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1319 to 1029. [2020-10-14 02:32:10,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1029 states. [2020-10-14 02:32:10,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 1387 transitions. [2020-10-14 02:32:10,306 INFO L78 Accepts]: Start accepts. Automaton has 1029 states and 1387 transitions. Word has length 160 [2020-10-14 02:32:10,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-14 02:32:10,307 INFO L479 AbstractCegarLoop]: Abstraction has 1029 states and 1387 transitions. [2020-10-14 02:32:10,307 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-14 02:32:10,307 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 1387 transitions. [2020-10-14 02:32:10,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2020-10-14 02:32:10,313 INFO L414 BasicCegarLoop]: Found error trace [2020-10-14 02:32:10,313 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-14 02:32:10,313 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-14 02:32:10,313 INFO L427 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-14 02:32:10,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-14 02:32:10,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1270361455, now seen corresponding path program 1 times [2020-10-14 02:32:10,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-14 02:32:10,314 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [787089558] [2020-10-14 02:32:10,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-14 02:32:10,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:32:10,381 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:32:10,595 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:32:11,623 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:32:11,624 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 175 [2020-10-14 02:32:11,624 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-14 02:32:11,624 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1267 [2020-10-14 02:32:11,624 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:32:11,625 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:32:11,625 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-10-14 02:32:11,625 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 5 [2020-10-14 02:32:11,625 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 147 [2020-10-14 02:32:11,626 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 02:32:11,684 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-14 02:32:11,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:32:11,689 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:32:11,694 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:32:11,694 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-14 02:32:11,694 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:32:11,694 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 6 [2020-10-14 02:32:11,695 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:32:11,695 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:32:11,695 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-14 02:32:11,695 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 02:32:11,696 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 2 [2020-10-14 02:32:11,696 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 02:32:11,716 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-14 02:32:11,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:32:11,757 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:32:11,974 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:32:11,975 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 142 [2020-10-14 02:32:11,975 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:32:11,975 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 233 [2020-10-14 02:32:11,975 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:32:11,976 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:32:11,976 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-14 02:32:11,976 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-14 02:32:11,976 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 142 [2020-10-14 02:32:11,976 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 02:32:12,165 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-14 02:32:12,165 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [787089558] [2020-10-14 02:32:12,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-14 02:32:12,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-14 02:32:12,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157584018] [2020-10-14 02:32:12,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-14 02:32:12,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-14 02:32:12,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-14 02:32:12,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-14 02:32:12,168 INFO L87 Difference]: Start difference. First operand 1029 states and 1387 transitions. Second operand 8 states. [2020-10-14 02:32:13,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-14 02:32:13,933 INFO L93 Difference]: Finished difference Result 2533 states and 3486 transitions. [2020-10-14 02:32:13,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-14 02:32:13,935 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 165 [2020-10-14 02:32:13,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-14 02:32:13,948 INFO L225 Difference]: With dead ends: 2533 [2020-10-14 02:32:13,948 INFO L226 Difference]: Without dead ends: 1510 [2020-10-14 02:32:13,953 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2020-10-14 02:32:13,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2020-10-14 02:32:13,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 1490. [2020-10-14 02:32:13,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1490 states. [2020-10-14 02:32:14,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1490 states to 1490 states and 1860 transitions. [2020-10-14 02:32:14,001 INFO L78 Accepts]: Start accepts. Automaton has 1490 states and 1860 transitions. Word has length 165 [2020-10-14 02:32:14,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-14 02:32:14,002 INFO L479 AbstractCegarLoop]: Abstraction has 1490 states and 1860 transitions. [2020-10-14 02:32:14,002 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-14 02:32:14,002 INFO L276 IsEmpty]: Start isEmpty. Operand 1490 states and 1860 transitions. [2020-10-14 02:32:14,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2020-10-14 02:32:14,005 INFO L414 BasicCegarLoop]: Found error trace [2020-10-14 02:32:14,006 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, 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-14 02:32:14,006 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-14 02:32:14,006 INFO L427 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-14 02:32:14,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-14 02:32:14,006 INFO L82 PathProgramCache]: Analyzing trace with hash 328846220, now seen corresponding path program 1 times [2020-10-14 02:32:14,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-14 02:32:14,007 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2147387849] [2020-10-14 02:32:14,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-14 02:32:14,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:32:14,055 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:32:14,114 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:32:14,743 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:32:15,030 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:32:15,284 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:32:17,146 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:32:17,146 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 203 [2020-10-14 02:32:17,147 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 5 [2020-10-14 02:32:17,147 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 3109 [2020-10-14 02:32:17,147 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:32:17,147 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:32:17,148 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-14 02:32:17,148 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 87 [2020-10-14 02:32:17,148 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 93 [2020-10-14 02:32:17,148 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 02:32:17,196 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-14 02:32:17,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:32:17,198 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:32:17,202 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:32:17,202 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-14 02:32:17,202 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:32:17,202 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 3 [2020-10-14 02:32:17,203 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:32:17,203 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:32:17,203 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-14 02:32:17,203 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 02:32:17,203 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-14 02:32:17,204 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-14 02:32:17,214 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-14 02:32:17,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:32:17,235 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:32:17,284 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:32:17,284 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 78 [2020-10-14 02:32:17,284 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:32:17,285 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 56 [2020-10-14 02:32:17,285 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:32:17,285 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:32:17,285 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-14 02:32:17,285 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 02:32:17,286 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 72 [2020-10-14 02:32:17,286 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-14 02:32:17,306 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2020-10-14 02:32:17,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:32:17,332 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:32:17,451 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:32:17,452 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 91 [2020-10-14 02:32:17,452 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:32:17,452 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 128 [2020-10-14 02:32:17,452 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:32:17,453 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:32:17,453 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-14 02:32:17,453 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-14 02:32:17,453 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 91 [2020-10-14 02:32:17,453 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 02:32:17,529 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 108 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-14 02:32:17,529 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2147387849] [2020-10-14 02:32:17,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-14 02:32:17,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-14 02:32:17,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409057807] [2020-10-14 02:32:17,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-14 02:32:17,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-14 02:32:17,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-14 02:32:17,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-14 02:32:17,533 INFO L87 Difference]: Start difference. First operand 1490 states and 1860 transitions. Second operand 7 states. [2020-10-14 02:32:19,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-14 02:32:19,030 INFO L93 Difference]: Finished difference Result 3288 states and 4189 transitions. [2020-10-14 02:32:19,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-14 02:32:19,031 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 191 [2020-10-14 02:32:19,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-14 02:32:19,041 INFO L225 Difference]: With dead ends: 3288 [2020-10-14 02:32:19,041 INFO L226 Difference]: Without dead ends: 1804 [2020-10-14 02:32:19,045 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-10-14 02:32:19,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1804 states. [2020-10-14 02:32:19,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1804 to 1645. [2020-10-14 02:32:19,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1645 states. [2020-10-14 02:32:19,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1645 states to 1645 states and 2048 transitions. [2020-10-14 02:32:19,093 INFO L78 Accepts]: Start accepts. Automaton has 1645 states and 2048 transitions. Word has length 191 [2020-10-14 02:32:19,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-14 02:32:19,094 INFO L479 AbstractCegarLoop]: Abstraction has 1645 states and 2048 transitions. [2020-10-14 02:32:19,094 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-14 02:32:19,094 INFO L276 IsEmpty]: Start isEmpty. Operand 1645 states and 2048 transitions. [2020-10-14 02:32:19,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2020-10-14 02:32:19,097 INFO L414 BasicCegarLoop]: Found error trace [2020-10-14 02:32:19,098 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-14 02:32:19,098 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-14 02:32:19,098 INFO L427 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-14 02:32:19,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-14 02:32:19,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1133923432, now seen corresponding path program 1 times [2020-10-14 02:32:19,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-14 02:32:19,099 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [70100208] [2020-10-14 02:32:19,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-14 02:32:19,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:32:19,146 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:32:19,233 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:32:20,146 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:32:20,455 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:32:22,116 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:32:22,116 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 213 [2020-10-14 02:32:22,117 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 4 [2020-10-14 02:32:22,117 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 2986 [2020-10-14 02:32:22,117 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:32:22,118 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:32:22,118 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-14 02:32:22,118 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 97 [2020-10-14 02:32:22,118 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 93 [2020-10-14 02:32:22,118 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-14 02:32:22,186 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-14 02:32:22,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:32:22,188 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:32:22,193 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:32:22,193 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-14 02:32:22,193 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:32:22,194 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 5 [2020-10-14 02:32:22,194 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:32:22,194 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:32:22,194 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-14 02:32:22,194 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 02:32:22,195 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-14 02:32:22,195 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 02:32:22,206 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-14 02:32:22,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:32:22,240 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:32:22,349 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:32:22,349 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 88 [2020-10-14 02:32:22,349 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:32:22,350 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 123 [2020-10-14 02:32:22,350 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:32:22,350 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:32:22,350 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-14 02:32:22,350 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 02:32:22,351 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 82 [2020-10-14 02:32:22,351 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-14 02:32:22,380 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2020-10-14 02:32:22,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:32:22,408 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:32:22,497 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:32:22,497 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 91 [2020-10-14 02:32:22,497 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:32:22,498 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 100 [2020-10-14 02:32:22,498 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:32:22,498 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:32:22,498 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-14 02:32:22,498 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-14 02:32:22,499 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 91 [2020-10-14 02:32:22,499 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-14 02:32:22,571 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 118 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-14 02:32:22,572 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [70100208] [2020-10-14 02:32:22,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-14 02:32:22,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-14 02:32:22,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762620843] [2020-10-14 02:32:22,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-14 02:32:22,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-14 02:32:22,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-14 02:32:22,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-14 02:32:22,574 INFO L87 Difference]: Start difference. First operand 1645 states and 2048 transitions. Second operand 7 states. [2020-10-14 02:32:24,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-14 02:32:24,249 INFO L93 Difference]: Finished difference Result 4319 states and 5393 transitions. [2020-10-14 02:32:24,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-14 02:32:24,253 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 201 [2020-10-14 02:32:24,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-14 02:32:24,267 INFO L225 Difference]: With dead ends: 4319 [2020-10-14 02:32:24,267 INFO L226 Difference]: Without dead ends: 2680 [2020-10-14 02:32:24,275 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2020-10-14 02:32:24,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2680 states. [2020-10-14 02:32:24,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2680 to 2376. [2020-10-14 02:32:24,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2376 states. [2020-10-14 02:32:24,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2376 states to 2376 states and 2863 transitions. [2020-10-14 02:32:24,348 INFO L78 Accepts]: Start accepts. Automaton has 2376 states and 2863 transitions. Word has length 201 [2020-10-14 02:32:24,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-14 02:32:24,349 INFO L479 AbstractCegarLoop]: Abstraction has 2376 states and 2863 transitions. [2020-10-14 02:32:24,349 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-14 02:32:24,349 INFO L276 IsEmpty]: Start isEmpty. Operand 2376 states and 2863 transitions. [2020-10-14 02:32:24,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2020-10-14 02:32:24,354 INFO L414 BasicCegarLoop]: Found error trace [2020-10-14 02:32:24,354 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-14 02:32:24,354 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-14 02:32:24,354 INFO L427 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-14 02:32:24,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-14 02:32:24,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1136439961, now seen corresponding path program 1 times [2020-10-14 02:32:24,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-14 02:32:24,355 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [722496131] [2020-10-14 02:32:24,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-14 02:32:24,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:32:24,403 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:32:24,471 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:32:24,525 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:32:25,184 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:32:26,924 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:32:28,920 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:32:28,920 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 222 [2020-10-14 02:32:28,920 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 5 [2020-10-14 02:32:28,920 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 4534 [2020-10-14 02:32:28,921 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:32:28,921 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:32:28,921 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-14 02:32:28,921 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 106 [2020-10-14 02:32:28,921 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 93 [2020-10-14 02:32:28,922 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-14 02:32:28,980 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-14 02:32:28,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:32:28,982 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:32:28,984 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:32:28,984 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-14 02:32:28,984 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:32:28,984 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 2 [2020-10-14 02:32:28,985 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:32:28,985 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:32:28,985 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-14 02:32:28,985 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 02:32:28,985 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-14 02:32:28,986 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-14 02:32:28,995 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-14 02:32:29,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:32:29,021 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:32:29,093 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:32:29,094 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 97 [2020-10-14 02:32:29,094 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:32:29,095 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 83 [2020-10-14 02:32:29,095 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:32:29,095 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:32:29,096 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-14 02:32:29,096 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 02:32:29,096 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 91 [2020-10-14 02:32:29,097 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 02:32:29,134 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2020-10-14 02:32:29,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:32:29,166 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:32:29,275 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:32:29,276 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 91 [2020-10-14 02:32:29,276 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:32:29,276 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 122 [2020-10-14 02:32:29,277 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:32:29,277 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:32:29,277 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-14 02:32:29,278 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-14 02:32:29,278 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 91 [2020-10-14 02:32:29,278 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 02:32:29,469 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 121 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-14 02:32:29,469 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [722496131] [2020-10-14 02:32:29,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-14 02:32:29,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-14 02:32:29,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288411413] [2020-10-14 02:32:29,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-14 02:32:29,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-14 02:32:29,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-14 02:32:29,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-14 02:32:29,473 INFO L87 Difference]: Start difference. First operand 2376 states and 2863 transitions. Second operand 7 states. [2020-10-14 02:32:31,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-14 02:32:31,164 INFO L93 Difference]: Finished difference Result 5769 states and 6978 transitions. [2020-10-14 02:32:31,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-14 02:32:31,165 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 210 [2020-10-14 02:32:31,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-14 02:32:31,182 INFO L225 Difference]: With dead ends: 5769 [2020-10-14 02:32:31,182 INFO L226 Difference]: Without dead ends: 3399 [2020-10-14 02:32:31,189 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 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-14 02:32:31,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3399 states. [2020-10-14 02:32:31,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3399 to 3109. [2020-10-14 02:32:31,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3109 states. [2020-10-14 02:32:31,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3109 states to 3109 states and 3760 transitions. [2020-10-14 02:32:31,282 INFO L78 Accepts]: Start accepts. Automaton has 3109 states and 3760 transitions. Word has length 210 [2020-10-14 02:32:31,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-14 02:32:31,282 INFO L479 AbstractCegarLoop]: Abstraction has 3109 states and 3760 transitions. [2020-10-14 02:32:31,283 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-14 02:32:31,283 INFO L276 IsEmpty]: Start isEmpty. Operand 3109 states and 3760 transitions. [2020-10-14 02:32:31,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2020-10-14 02:32:31,290 INFO L414 BasicCegarLoop]: Found error trace [2020-10-14 02:32:31,290 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-14 02:32:31,291 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-14 02:32:31,291 INFO L427 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-14 02:32:31,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-14 02:32:31,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1066694831, now seen corresponding path program 1 times [2020-10-14 02:32:31,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-14 02:32:31,292 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1198914532] [2020-10-14 02:32:31,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-14 02:32:31,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:32:31,353 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:32:31,517 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:32:31,743 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:32:31,887 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:32:32,194 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:32:32,194 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 242 [2020-10-14 02:32:32,195 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 4 [2020-10-14 02:32:32,195 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 865 [2020-10-14 02:32:32,195 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:32:32,195 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:32:32,196 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-14 02:32:32,196 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 89 [2020-10-14 02:32:32,196 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 130 [2020-10-14 02:32:32,196 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 02:32:32,265 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-14 02:32:32,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:32:32,268 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:32:32,270 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:32:32,271 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-14 02:32:32,271 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:32:32,272 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 2 [2020-10-14 02:32:32,272 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:32:32,272 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:32:32,273 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-14 02:32:32,273 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 02:32:32,273 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-14 02:32:32,273 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 02:32:32,288 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-14 02:32:32,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:32:32,316 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:32:32,369 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:32:32,369 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 80 [2020-10-14 02:32:32,370 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:32:32,370 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 63 [2020-10-14 02:32:32,370 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:32:32,371 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:32:32,371 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-14 02:32:32,371 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 02:32:32,371 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 74 [2020-10-14 02:32:32,372 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 02:32:32,390 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-10-14 02:32:32,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:32:32,441 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:32:32,630 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:32:32,630 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 128 [2020-10-14 02:32:32,631 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:32:32,631 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 210 [2020-10-14 02:32:32,631 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:32:32,632 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:32:32,632 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-14 02:32:32,632 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-14 02:32:32,633 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 128 [2020-10-14 02:32:32,633 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 02:32:32,820 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-14 02:32:32,821 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1198914532] [2020-10-14 02:32:32,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-14 02:32:32,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-14 02:32:32,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696271850] [2020-10-14 02:32:32,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-14 02:32:32,823 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-14 02:32:32,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-14 02:32:32,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-14 02:32:32,823 INFO L87 Difference]: Start difference. First operand 3109 states and 3760 transitions. Second operand 7 states. [2020-10-14 02:32:34,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-14 02:32:34,628 INFO L93 Difference]: Finished difference Result 6564 states and 8048 transitions. [2020-10-14 02:32:34,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-14 02:32:34,634 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 230 [2020-10-14 02:32:34,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-14 02:32:34,646 INFO L225 Difference]: With dead ends: 6564 [2020-10-14 02:32:34,646 INFO L226 Difference]: Without dead ends: 2573 [2020-10-14 02:32:34,656 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 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-14 02:32:34,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2573 states. [2020-10-14 02:32:34,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2573 to 2368. [2020-10-14 02:32:34,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2368 states. [2020-10-14 02:32:34,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2368 states to 2368 states and 2662 transitions. [2020-10-14 02:32:34,717 INFO L78 Accepts]: Start accepts. Automaton has 2368 states and 2662 transitions. Word has length 230 [2020-10-14 02:32:34,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-14 02:32:34,717 INFO L479 AbstractCegarLoop]: Abstraction has 2368 states and 2662 transitions. [2020-10-14 02:32:34,717 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-14 02:32:34,718 INFO L276 IsEmpty]: Start isEmpty. Operand 2368 states and 2662 transitions. [2020-10-14 02:32:34,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2020-10-14 02:32:34,724 INFO L414 BasicCegarLoop]: Found error trace [2020-10-14 02:32:34,724 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-14 02:32:34,725 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-14 02:32:34,725 INFO L427 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-14 02:32:34,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-14 02:32:34,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1637300869, now seen corresponding path program 1 times [2020-10-14 02:32:34,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-14 02:32:34,726 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1579116985] [2020-10-14 02:32:34,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-14 02:32:34,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-14 02:32:34,790 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-10-14 02:32:34,790 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-14 02:32:34,796 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-14 02:32:34,854 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 02:32:34 BoogieIcfgContainer [2020-10-14 02:32:34,854 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-14 02:32:34,857 INFO L168 Benchmark]: Toolchain (without parser) took 36678.34 ms. Allocated memory was 147.3 MB in the beginning and 731.4 MB in the end (delta: 584.1 MB). Free memory was 102.2 MB in the beginning and 129.3 MB in the end (delta: -27.2 MB). Peak memory consumption was 556.9 MB. Max. memory is 7.1 GB. [2020-10-14 02:32:34,858 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 147.3 MB. Free memory was 121.9 MB in the beginning and 121.5 MB in the end (delta: 419.6 kB). Peak memory consumption was 419.6 kB. Max. memory is 7.1 GB. [2020-10-14 02:32:34,859 INFO L168 Benchmark]: CACSL2BoogieTranslator took 935.69 ms. Allocated memory was 147.3 MB in the beginning and 207.1 MB in the end (delta: 59.8 MB). Free memory was 102.2 MB in the beginning and 173.2 MB in the end (delta: -71.0 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2020-10-14 02:32:34,860 INFO L168 Benchmark]: Boogie Preprocessor took 105.66 ms. Allocated memory is still 207.1 MB. Free memory was 173.2 MB in the beginning and 168.2 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 7.1 GB. [2020-10-14 02:32:34,861 INFO L168 Benchmark]: RCFGBuilder took 1347.11 ms. Allocated memory was 207.1 MB in the beginning and 235.4 MB in the end (delta: 28.3 MB). Free memory was 168.2 MB in the beginning and 177.5 MB in the end (delta: -9.3 MB). Peak memory consumption was 79.8 MB. Max. memory is 7.1 GB. [2020-10-14 02:32:34,861 INFO L168 Benchmark]: TraceAbstraction took 34284.07 ms. Allocated memory was 235.4 MB in the beginning and 731.4 MB in the end (delta: 496.0 MB). Free memory was 175.9 MB in the beginning and 129.3 MB in the end (delta: 46.5 MB). Peak memory consumption was 542.5 MB. Max. memory is 7.1 GB. [2020-10-14 02:32:34,865 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.17 ms. Allocated memory is still 147.3 MB. Free memory was 121.9 MB in the beginning and 121.5 MB in the end (delta: 419.6 kB). Peak memory consumption was 419.6 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 935.69 ms. Allocated memory was 147.3 MB in the beginning and 207.1 MB in the end (delta: 59.8 MB). Free memory was 102.2 MB in the beginning and 173.2 MB in the end (delta: -71.0 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 105.66 ms. Allocated memory is still 207.1 MB. Free memory was 173.2 MB in the beginning and 168.2 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1347.11 ms. Allocated memory was 207.1 MB in the beginning and 235.4 MB in the end (delta: 28.3 MB). Free memory was 168.2 MB in the beginning and 177.5 MB in the end (delta: -9.3 MB). Peak memory consumption was 79.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 34284.07 ms. Allocated memory was 235.4 MB in the beginning and 731.4 MB in the end (delta: 496.0 MB). Free memory was 175.9 MB in the beginning and 129.3 MB in the end (delta: 46.5 MB). Peak memory consumption was 542.5 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: 34.1s, OverallIterations: 10, TraceHistogramMax: 3, AutomataDifference: 14.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 252 SDtfs, 4353 SDslu, 322 SDs, 0 SdLazy, 8325 SolverSat, 1198 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 122 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3109occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 9 MinimizatonAttempts, 1425 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 18.4s InterpolantComputationTime, 1660 NumberOfCodeBlocks, 1660 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1371 ConstructedInterpolants, 0 QuantifiedInterpolants, 628969 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 2 PerfectInterpolantSequences, 526/537 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...