/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.smt.solver Internal_SMTInterpol --traceabstraction.compute.trace.for.counterexample.result false --rcfgbuilder.size.of.a.code.block SingleStatement --traceabstraction.use.minimal.unsat.core.enumeration true --traceabstraction.additional.smt.options produce-proofs=true --traceabstraction.additional.smt.options produce-unsat-cores=true --traceabstraction.additional.smt.options enumeration-timeout=5000 --traceabstraction.additional.smt.options interpolation-heuristic=SMALLESTAMONGWIDE --traceabstraction.additional.smt.options tolerance=0.4 --traceabstraction.additional.smt.options log-additional-information=true -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem10_label42.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-c90d42b [2020-09-25 13:34:59,907 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-25 13:34:59,912 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-25 13:34:59,939 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-25 13:34:59,939 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-25 13:34:59,941 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-25 13:34:59,942 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-25 13:34:59,944 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-25 13:34:59,946 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-25 13:34:59,947 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-25 13:34:59,948 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-25 13:34:59,950 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-25 13:34:59,950 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-25 13:34:59,951 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-25 13:34:59,952 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-25 13:34:59,953 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-25 13:34:59,955 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-25 13:34:59,956 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-25 13:34:59,958 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-25 13:34:59,960 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-25 13:34:59,962 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-25 13:34:59,963 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-25 13:34:59,965 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-25 13:34:59,966 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-25 13:34:59,969 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-25 13:34:59,969 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-25 13:34:59,969 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-25 13:34:59,971 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-25 13:34:59,971 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-25 13:34:59,972 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-25 13:34:59,973 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-25 13:34:59,974 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-25 13:34:59,975 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-25 13:34:59,976 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-25 13:34:59,977 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-25 13:34:59,977 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-25 13:34:59,978 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-25 13:34:59,979 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-25 13:34:59,979 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-25 13:34:59,980 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-25 13:34:59,981 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-25 13:34:59,982 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-09-25 13:35:00,010 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-25 13:35:00,011 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-25 13:35:00,012 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-09-25 13:35:00,013 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-09-25 13:35:00,013 INFO L138 SettingsManager]: * Use SBE=true [2020-09-25 13:35:00,013 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-25 13:35:00,013 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-25 13:35:00,014 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-25 13:35:00,014 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-25 13:35:00,014 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-25 13:35:00,014 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-25 13:35:00,014 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-25 13:35:00,014 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-25 13:35:00,015 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-25 13:35:00,015 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-25 13:35:00,015 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-25 13:35:00,015 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-25 13:35:00,016 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-25 13:35:00,016 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-09-25 13:35:00,016 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-25 13:35:00,016 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-25 13:35:00,016 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-25 13:35:00,017 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-25 13:35:00,017 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-09-25 13:35:00,017 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-09-25 13:35:00,017 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-09-25 13:35:00,018 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-09-25 13:35:00,018 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-25 13:35:00,018 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-09-25 13:35:00,018 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> Internal_SMTInterpol Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute trace for counterexample result -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> SingleStatement Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use minimal unsat core enumeration -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> produce-proofs=true;produce-unsat-cores=true;enumeration-timeout=5000;interpolation-heuristic=SMALLESTAMONGWIDE;tolerance=0.4;log-additional-information=true; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> produce-proofs=true;produce-unsat-cores=true;enumeration-timeout=5000;interpolation-heuristic=SMALLESTAMONGWIDE;tolerance=0.4;log-additional-information=true; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> produce-proofs=true;produce-unsat-cores=true;enumeration-timeout=5000;interpolation-heuristic=SMALLESTAMONGWIDE;tolerance=0.4;log-additional-information=true; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> produce-proofs=true;produce-unsat-cores=true;enumeration-timeout=5000;interpolation-heuristic=SMALLESTAMONGWIDE;tolerance=0.4;log-additional-information=true; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> produce-proofs=true;produce-unsat-cores=true;enumeration-timeout=5000;interpolation-heuristic=SMALLESTAMONGWIDE;tolerance=0.4;log-additional-information=true; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> produce-proofs=true;produce-unsat-cores=true;enumeration-timeout=5000;interpolation-heuristic=SMALLESTAMONGWIDE;tolerance=0.4;log-additional-information=true; [2020-09-25 13:35:00,514 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-25 13:35:00,535 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-25 13:35:00,544 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-25 13:35:00,546 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-25 13:35:00,547 INFO L275 PluginConnector]: CDTParser initialized [2020-09-25 13:35:00,549 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label42.c [2020-09-25 13:35:00,640 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/5ae1c73e9/16041b62e7c94f25ad1b0da2ce7327bb/FLAG5d0d7e493 [2020-09-25 13:35:01,267 INFO L306 CDTParser]: Found 1 translation units. [2020-09-25 13:35:01,268 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/eca-rers2012/Problem10_label42.c [2020-09-25 13:35:01,286 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/5ae1c73e9/16041b62e7c94f25ad1b0da2ce7327bb/FLAG5d0d7e493 [2020-09-25 13:35:01,515 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/5ae1c73e9/16041b62e7c94f25ad1b0da2ce7327bb [2020-09-25 13:35:01,531 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-25 13:35:01,538 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-25 13:35:01,543 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-25 13:35:01,543 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-25 13:35:01,548 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-25 13:35:01,549 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 01:35:01" (1/1) ... [2020-09-25 13:35:01,555 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ad15a05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 01:35:01, skipping insertion in model container [2020-09-25 13:35:01,555 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 01:35:01" (1/1) ... [2020-09-25 13:35:01,566 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-25 13:35:01,643 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-25 13:35:02,123 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-25 13:35:02,129 INFO L203 MainTranslator]: Completed pre-run [2020-09-25 13:35:02,364 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-25 13:35:02,384 INFO L208 MainTranslator]: Completed translation [2020-09-25 13:35:02,384 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 01:35:02 WrapperNode [2020-09-25 13:35:02,384 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-25 13:35:02,385 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-25 13:35:02,386 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-25 13:35:02,386 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-25 13:35:02,415 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 01:35:02" (1/1) ... [2020-09-25 13:35:02,415 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 01:35:02" (1/1) ... [2020-09-25 13:35:02,435 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 01:35:02" (1/1) ... [2020-09-25 13:35:02,435 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 01:35:02" (1/1) ... [2020-09-25 13:35:02,481 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 01:35:02" (1/1) ... [2020-09-25 13:35:02,498 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 01:35:02" (1/1) ... [2020-09-25 13:35:02,503 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 01:35:02" (1/1) ... [2020-09-25 13:35:02,513 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-25 13:35:02,514 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-25 13:35:02,514 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-25 13:35:02,514 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-25 13:35:02,515 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 01:35:02" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-25 13:35:02,618 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-25 13:35:02,618 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-25 13:35:02,618 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2020-09-25 13:35:02,619 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-25 13:35:02,619 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2020-09-25 13:35:02,619 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-25 13:35:02,619 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-25 13:35:02,621 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-09-25 13:35:02,621 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-25 13:35:02,621 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-25 13:35:02,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-25 13:35:04,084 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-25 13:35:04,085 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-09-25 13:35:04,102 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 01:35:04 BoogieIcfgContainer [2020-09-25 13:35:04,102 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-25 13:35:04,104 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-25 13:35:04,105 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-25 13:35:04,108 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-25 13:35:04,109 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.09 01:35:01" (1/3) ... [2020-09-25 13:35:04,110 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b9dacaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 01:35:04, skipping insertion in model container [2020-09-25 13:35:04,111 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 01:35:02" (2/3) ... [2020-09-25 13:35:04,111 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b9dacaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 01:35:04, skipping insertion in model container [2020-09-25 13:35:04,112 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 01:35:04" (3/3) ... [2020-09-25 13:35:04,117 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem10_label42.c [2020-09-25 13:35:04,130 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-25 13:35:04,145 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-25 13:35:04,169 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-25 13:35:04,214 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-25 13:35:04,214 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-25 13:35:04,214 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-25 13:35:04,215 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-25 13:35:04,216 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-25 13:35:04,216 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-25 13:35:04,217 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-25 13:35:04,217 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-25 13:35:04,250 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states. [2020-09-25 13:35:04,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-09-25 13:35:04,259 INFO L414 BasicCegarLoop]: Found error trace [2020-09-25 13:35:04,261 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-25 13:35:04,262 INFO L427 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-25 13:35:04,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-25 13:35:04,270 INFO L82 PathProgramCache]: Analyzing trace with hash 969247631, now seen corresponding path program 1 times [2020-09-25 13:35:04,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-25 13:35:04,281 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1939204010] [2020-09-25 13:35:04,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-25 13:35:04,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 13:35:04,485 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 13:35:04,701 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 13:35:05,146 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 13:35:05,147 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 45 [2020-09-25 13:35:05,147 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-09-25 13:35:05,148 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 701 [2020-09-25 13:35:05,151 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-09-25 13:35:05,152 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-09-25 13:35:05,152 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-09-25 13:35:05,152 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 12 [2020-09-25 13:35:05,153 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 32 [2020-09-25 13:35:05,153 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 5 [2020-09-25 13:35:05,263 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-25 13:35:05,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 13:35:05,276 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 13:35:05,295 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 13:35:05,296 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 18 [2020-09-25 13:35:05,296 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 13:35:05,297 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 23 [2020-09-25 13:35:05,297 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-09-25 13:35:05,297 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-09-25 13:35:05,298 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-25 13:35:05,298 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-25 13:35:05,298 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 8 [2020-09-25 13:35:05,299 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 13:35:05,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-25 13:35:05,317 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1939204010] [2020-09-25 13:35:05,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-25 13:35:05,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-09-25 13:35:05,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633757787] [2020-09-25 13:35:05,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-09-25 13:35:05,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-25 13:35:05,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-09-25 13:35:05,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-09-25 13:35:05,351 INFO L87 Difference]: Start difference. First operand 456 states. Second operand 4 states. [2020-09-25 13:35:07,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-25 13:35:07,485 INFO L93 Difference]: Finished difference Result 1069 states and 1495 transitions. [2020-09-25 13:35:07,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-25 13:35:07,487 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2020-09-25 13:35:07,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-25 13:35:07,513 INFO L225 Difference]: With dead ends: 1069 [2020-09-25 13:35:07,514 INFO L226 Difference]: Without dead ends: 555 [2020-09-25 13:35:07,527 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-09-25 13:35:07,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2020-09-25 13:35:07,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 543. [2020-09-25 13:35:07,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543 states. [2020-09-25 13:35:07,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 695 transitions. [2020-09-25 13:35:07,627 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 695 transitions. Word has length 36 [2020-09-25 13:35:07,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-25 13:35:07,628 INFO L479 AbstractCegarLoop]: Abstraction has 543 states and 695 transitions. [2020-09-25 13:35:07,628 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-09-25 13:35:07,629 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 695 transitions. [2020-09-25 13:35:07,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2020-09-25 13:35:07,635 INFO L414 BasicCegarLoop]: Found error trace [2020-09-25 13:35:07,636 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-25 13:35:07,636 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-25 13:35:07,636 INFO L427 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-25 13:35:07,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-25 13:35:07,637 INFO L82 PathProgramCache]: Analyzing trace with hash -340660504, now seen corresponding path program 1 times [2020-09-25 13:35:07,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-25 13:35:07,637 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1170940230] [2020-09-25 13:35:07,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-25 13:35:07,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 13:35:07,735 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 13:35:07,922 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 13:35:08,414 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 13:35:08,482 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 13:35:09,253 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 13:35:09,362 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 13:35:11,773 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 13:35:11,774 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 130 [2020-09-25 13:35:11,774 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 6 [2020-09-25 13:35:11,775 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 4076 [2020-09-25 13:35:11,775 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-09-25 13:35:11,776 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-09-25 13:35:11,776 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-09-25 13:35:11,776 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 11 [2020-09-25 13:35:11,777 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 87 [2020-09-25 13:35:11,777 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 13:35:11,852 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-25 13:35:11,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 13:35:11,865 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 13:35:11,890 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 13:35:11,890 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 18 [2020-09-25 13:35:11,890 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 13:35:11,891 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 28 [2020-09-25 13:35:11,891 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-09-25 13:35:11,892 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-09-25 13:35:11,893 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-25 13:35:11,893 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-25 13:35:11,893 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 7 [2020-09-25 13:35:11,893 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 2 [2020-09-25 13:35:11,913 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-25 13:35:11,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 13:35:11,961 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 13:35:12,115 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 13:35:12,116 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 79 [2020-09-25 13:35:12,125 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 13:35:12,125 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 176 [2020-09-25 13:35:12,126 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-09-25 13:35:12,126 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-09-25 13:35:12,126 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-25 13:35:12,126 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-09-25 13:35:12,127 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 78 [2020-09-25 13:35:12,127 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 13:35:12,253 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-25 13:35:12,253 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1170940230] [2020-09-25 13:35:12,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-25 13:35:12,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-25 13:35:12,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533779310] [2020-09-25 13:35:12,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-25 13:35:12,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-25 13:35:12,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-25 13:35:12,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-09-25 13:35:12,258 INFO L87 Difference]: Start difference. First operand 543 states and 695 transitions. Second operand 7 states. [2020-09-25 13:35:14,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-25 13:35:14,485 INFO L93 Difference]: Finished difference Result 1268 states and 1657 transitions. [2020-09-25 13:35:14,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-25 13:35:14,488 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 119 [2020-09-25 13:35:14,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-25 13:35:14,500 INFO L225 Difference]: With dead ends: 1268 [2020-09-25 13:35:14,501 INFO L226 Difference]: Without dead ends: 740 [2020-09-25 13:35:14,503 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-09-25 13:35:14,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2020-09-25 13:35:14,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 698. [2020-09-25 13:35:14,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 698 states. [2020-09-25 13:35:14,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 889 transitions. [2020-09-25 13:35:14,545 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 889 transitions. Word has length 119 [2020-09-25 13:35:14,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-25 13:35:14,546 INFO L479 AbstractCegarLoop]: Abstraction has 698 states and 889 transitions. [2020-09-25 13:35:14,546 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-25 13:35:14,546 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 889 transitions. [2020-09-25 13:35:14,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2020-09-25 13:35:14,552 INFO L414 BasicCegarLoop]: Found error trace [2020-09-25 13:35:14,552 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-25 13:35:14,553 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-25 13:35:14,553 INFO L427 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-25 13:35:14,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-25 13:35:14,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1359994051, now seen corresponding path program 1 times [2020-09-25 13:35:14,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-25 13:35:14,554 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2045040175] [2020-09-25 13:35:14,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-25 13:35:14,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 13:35:14,613 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 13:35:14,845 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 13:35:14,846 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 136 [2020-09-25 13:35:14,846 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 13:35:14,846 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 259 [2020-09-25 13:35:14,847 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-09-25 13:35:14,847 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-09-25 13:35:14,847 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-25 13:35:14,847 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 105 [2020-09-25 13:35:14,848 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 30 [2020-09-25 13:35:14,848 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 13:35:14,909 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-25 13:35:14,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 13:35:14,913 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 13:35:14,921 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 13:35:14,922 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 18 [2020-09-25 13:35:14,922 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 13:35:14,922 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 9 [2020-09-25 13:35:14,922 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-09-25 13:35:14,923 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-09-25 13:35:14,923 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-09-25 13:35:14,923 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-25 13:35:14,923 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-09-25 13:35:14,923 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 13:35:14,936 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-25 13:35:14,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 13:35:14,968 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 13:35:15,048 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 13:35:15,048 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 85 [2020-09-25 13:35:15,048 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 13:35:15,049 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 95 [2020-09-25 13:35:15,049 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-09-25 13:35:15,049 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-09-25 13:35:15,050 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-25 13:35:15,050 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-25 13:35:15,050 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 76 [2020-09-25 13:35:15,050 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 13:35:15,135 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-25 13:35:15,136 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2045040175] [2020-09-25 13:35:15,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-25 13:35:15,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-09-25 13:35:15,136 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482513380] [2020-09-25 13:35:15,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-25 13:35:15,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-25 13:35:15,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-25 13:35:15,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-25 13:35:15,138 INFO L87 Difference]: Start difference. First operand 698 states and 889 transitions. Second operand 5 states. [2020-09-25 13:35:17,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-25 13:35:17,188 INFO L93 Difference]: Finished difference Result 1710 states and 2277 transitions. [2020-09-25 13:35:17,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-25 13:35:17,189 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 125 [2020-09-25 13:35:17,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-25 13:35:17,197 INFO L225 Difference]: With dead ends: 1710 [2020-09-25 13:35:17,197 INFO L226 Difference]: Without dead ends: 1178 [2020-09-25 13:35:17,200 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-09-25 13:35:17,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2020-09-25 13:35:17,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 1156. [2020-09-25 13:35:17,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1156 states. [2020-09-25 13:35:17,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1529 transitions. [2020-09-25 13:35:17,244 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1529 transitions. Word has length 125 [2020-09-25 13:35:17,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-25 13:35:17,245 INFO L479 AbstractCegarLoop]: Abstraction has 1156 states and 1529 transitions. [2020-09-25 13:35:17,245 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-25 13:35:17,245 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1529 transitions. [2020-09-25 13:35:17,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2020-09-25 13:35:17,252 INFO L414 BasicCegarLoop]: Found error trace [2020-09-25 13:35:17,252 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-25 13:35:17,253 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-25 13:35:17,253 INFO L427 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-25 13:35:17,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-25 13:35:17,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1182078239, now seen corresponding path program 1 times [2020-09-25 13:35:17,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-25 13:35:17,254 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [885957916] [2020-09-25 13:35:17,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-25 13:35:17,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 13:35:17,328 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 13:35:17,752 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 13:35:17,752 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 169 [2020-09-25 13:35:17,753 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 13:35:17,753 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 458 [2020-09-25 13:35:17,753 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-09-25 13:35:17,753 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-09-25 13:35:17,754 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-09-25 13:35:17,754 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 13 [2020-09-25 13:35:17,754 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 124 [2020-09-25 13:35:17,754 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 13:35:17,804 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-25 13:35:17,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 13:35:17,809 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 13:35:17,823 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 13:35:17,823 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 18 [2020-09-25 13:35:17,823 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 13:35:17,824 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 15 [2020-09-25 13:35:17,824 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-09-25 13:35:17,824 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-09-25 13:35:17,824 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-25 13:35:17,825 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-25 13:35:17,825 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 9 [2020-09-25 13:35:17,825 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 13:35:17,839 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-25 13:35:17,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 13:35:17,890 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 13:35:18,108 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 13:35:18,109 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 118 [2020-09-25 13:35:18,109 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 13:35:18,109 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 242 [2020-09-25 13:35:18,109 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-09-25 13:35:18,110 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-09-25 13:35:18,110 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-25 13:35:18,110 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-09-25 13:35:18,110 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 117 [2020-09-25 13:35:18,111 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 13:35:18,224 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-25 13:35:18,225 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [885957916] [2020-09-25 13:35:18,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-25 13:35:18,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-25 13:35:18,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419858332] [2020-09-25 13:35:18,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-25 13:35:18,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-25 13:35:18,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-25 13:35:18,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-25 13:35:18,227 INFO L87 Difference]: Start difference. First operand 1156 states and 1529 transitions. Second operand 7 states. [2020-09-25 13:35:20,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-25 13:35:20,618 INFO L93 Difference]: Finished difference Result 2054 states and 2776 transitions. [2020-09-25 13:35:20,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-25 13:35:20,619 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 158 [2020-09-25 13:35:20,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-25 13:35:20,627 INFO L225 Difference]: With dead ends: 2054 [2020-09-25 13:35:20,628 INFO L226 Difference]: Without dead ends: 1063 [2020-09-25 13:35:20,634 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-09-25 13:35:20,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1063 states. [2020-09-25 13:35:20,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1063 to 857. [2020-09-25 13:35:20,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 857 states. [2020-09-25 13:35:20,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 980 transitions. [2020-09-25 13:35:20,673 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 980 transitions. Word has length 158 [2020-09-25 13:35:20,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-25 13:35:20,674 INFO L479 AbstractCegarLoop]: Abstraction has 857 states and 980 transitions. [2020-09-25 13:35:20,674 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-25 13:35:20,674 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 980 transitions. [2020-09-25 13:35:20,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2020-09-25 13:35:20,679 INFO L414 BasicCegarLoop]: Found error trace [2020-09-25 13:35:20,679 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-25 13:35:20,679 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-25 13:35:20,680 INFO L427 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-25 13:35:20,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-25 13:35:20,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1776525167, now seen corresponding path program 1 times [2020-09-25 13:35:20,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-25 13:35:20,681 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [797151353] [2020-09-25 13:35:20,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-25 13:35:20,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-25 13:35:20,752 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-09-25 13:35:20,752 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-25 13:35:20,760 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-25 13:35:20,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.09 01:35:20 BoogieIcfgContainer [2020-09-25 13:35:20,806 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-25 13:35:20,810 INFO L168 Benchmark]: Toolchain (without parser) took 19275.32 ms. Allocated memory was 146.3 MB in the beginning and 399.5 MB in the end (delta: 253.2 MB). Free memory was 101.0 MB in the beginning and 87.9 MB in the end (delta: 13.1 MB). Peak memory consumption was 266.3 MB. Max. memory is 7.1 GB. [2020-09-25 13:35:20,811 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 146.3 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-09-25 13:35:20,812 INFO L168 Benchmark]: CACSL2BoogieTranslator took 842.34 ms. Allocated memory was 146.3 MB in the beginning and 205.0 MB in the end (delta: 58.7 MB). Free memory was 100.3 MB in the beginning and 171.7 MB in the end (delta: -71.3 MB). Peak memory consumption was 31.3 MB. Max. memory is 7.1 GB. [2020-09-25 13:35:20,813 INFO L168 Benchmark]: Boogie Preprocessor took 128.02 ms. Allocated memory is still 205.0 MB. Free memory was 171.7 MB in the beginning and 167.3 MB in the end (delta: 4.3 MB). Peak memory consumption was 4.3 MB. Max. memory is 7.1 GB. [2020-09-25 13:35:20,814 INFO L168 Benchmark]: RCFGBuilder took 1588.97 ms. Allocated memory was 205.0 MB in the beginning and 238.0 MB in the end (delta: 33.0 MB). Free memory was 167.3 MB in the beginning and 166.6 MB in the end (delta: 774.9 kB). Peak memory consumption was 84.0 MB. Max. memory is 7.1 GB. [2020-09-25 13:35:20,816 INFO L168 Benchmark]: TraceAbstraction took 16701.42 ms. Allocated memory was 238.0 MB in the beginning and 399.5 MB in the end (delta: 161.5 MB). Free memory was 165.1 MB in the beginning and 87.9 MB in the end (delta: 77.2 MB). Peak memory consumption was 238.6 MB. Max. memory is 7.1 GB. [2020-09-25 13:35:20,820 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.24 ms. Allocated memory is still 146.3 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 842.34 ms. Allocated memory was 146.3 MB in the beginning and 205.0 MB in the end (delta: 58.7 MB). Free memory was 100.3 MB in the beginning and 171.7 MB in the end (delta: -71.3 MB). Peak memory consumption was 31.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 128.02 ms. Allocated memory is still 205.0 MB. Free memory was 171.7 MB in the beginning and 167.3 MB in the end (delta: 4.3 MB). Peak memory consumption was 4.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1588.97 ms. Allocated memory was 205.0 MB in the beginning and 238.0 MB in the end (delta: 33.0 MB). Free memory was 167.3 MB in the beginning and 166.6 MB in the end (delta: 774.9 kB). Peak memory consumption was 84.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16701.42 ms. Allocated memory was 238.0 MB in the beginning and 399.5 MB in the end (delta: 161.5 MB). Free memory was 165.1 MB in the beginning and 87.9 MB in the end (delta: 77.2 MB). Peak memory consumption was 238.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 55]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int inputC = 3; [L8] int inputD = 4; [L9] int inputE = 5; [L10] int inputF = 6; [L11] int inputB = 2; [L14] int a1 = 23; [L15] int a19 = 9; [L16] int a10 = 0; [L17] int a12 = 0; [L18] int a4 = 14; [L579] int output = -1; [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL, EXPR calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L210] COND TRUE ((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0))) [L211] a1 = (((a1 + -15535) - 211896) / 5) [L212] a10 = 2 [L214] return 22; [L590] RET, EXPR calculate_output(input) [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL, EXPR calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) [L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) [L225] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) [L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) [L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) [L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) [L244] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) [L249] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) [L254] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) [L260] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) [L265] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) [L271] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) [L277] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) [L283] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) [L286] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) [L291] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) [L296] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) [L301] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) [L306] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) [L312] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) [L317] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) [L320] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) [L323] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) [L326] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) [L329] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) [L335] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) [L340] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) [L345] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) [L351] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) [L354] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) [L357] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) [L360] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) [L365] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0))))) [L370] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) [L375] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) [L378] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) [L383] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) [L388] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0))))) [L393] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) [L398] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) [L403] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14))) [L408] COND TRUE ((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2)))) [L409] a1 = ((((a1 % 299890)+ 300108) * 1) * 1) [L410] a10 = 0 [L411] a19 = 8 [L413] return -1; [L590] RET, EXPR calculate_output(input) [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND TRUE (((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8)) [L55] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 456 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 16.5s, OverallIterations: 5, TraceHistogramMax: 3, AutomataDifference: 8.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 827 SDtfs, 2669 SDslu, 1149 SDs, 0 SdLazy, 4606 SolverSat, 694 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1156occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 4 MinimizatonAttempts, 282 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 6.8s InterpolantComputationTime, 675 NumberOfCodeBlocks, 675 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 434 ConstructedInterpolants, 0 QuantifiedInterpolants, 171699 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 59/60 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...