/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.smt.solver Internal_SMTInterpol --traceabstraction.compute.trace.for.counterexample.result false --rcfgbuilder.size.of.a.code.block SingleStatement --traceabstraction.use.minimal.unsat.core.enumeration true --traceabstraction.additional.smt.options produce-proofs=true --traceabstraction.additional.smt.options produce-unsat-cores=true --traceabstraction.additional.smt.options enumeration-timeout=5000 --traceabstraction.additional.smt.options interpolation-heuristic=WIDESTAMONGSMALL --traceabstraction.additional.smt.options tolerance=1.0 --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 09:06:07,546 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-25 09:06:07,551 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-25 09:06:07,596 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-25 09:06:07,597 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-25 09:06:07,608 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-25 09:06:07,610 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-25 09:06:07,614 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-25 09:06:07,616 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-25 09:06:07,620 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-25 09:06:07,621 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-25 09:06:07,622 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-25 09:06:07,622 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-25 09:06:07,625 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-25 09:06:07,628 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-25 09:06:07,630 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-25 09:06:07,632 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-25 09:06:07,633 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-25 09:06:07,634 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-25 09:06:07,642 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-25 09:06:07,645 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-25 09:06:07,646 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-25 09:06:07,647 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-25 09:06:07,648 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-25 09:06:07,653 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-25 09:06:07,653 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-25 09:06:07,653 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-25 09:06:07,656 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-25 09:06:07,657 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-25 09:06:07,658 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-25 09:06:07,658 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-25 09:06:07,659 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-25 09:06:07,660 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-25 09:06:07,660 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-25 09:06:07,662 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-25 09:06:07,662 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-25 09:06:07,663 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-25 09:06:07,663 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-25 09:06:07,663 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-25 09:06:07,664 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-25 09:06:07,666 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-25 09:06:07,666 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 09:06:07,712 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-25 09:06:07,712 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-25 09:06:07,715 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-09-25 09:06:07,715 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-09-25 09:06:07,715 INFO L138 SettingsManager]: * Use SBE=true [2020-09-25 09:06:07,715 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-25 09:06:07,716 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-25 09:06:07,716 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-25 09:06:07,716 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-25 09:06:07,717 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-25 09:06:07,718 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-25 09:06:07,718 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-25 09:06:07,718 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-25 09:06:07,719 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-25 09:06:07,719 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-25 09:06:07,719 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-25 09:06:07,719 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-25 09:06:07,720 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-25 09:06:07,720 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-09-25 09:06:07,720 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-25 09:06:07,720 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-25 09:06:07,720 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-25 09:06:07,721 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-25 09:06:07,721 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-09-25 09:06:07,721 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-09-25 09:06:07,721 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-09-25 09:06:07,721 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-09-25 09:06:07,722 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-25 09:06:07,722 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-09-25 09:06:07,722 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> Internal_SMTInterpol Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute trace for counterexample result -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> SingleStatement Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use minimal unsat core enumeration -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> produce-proofs=true;produce-unsat-cores=true;enumeration-timeout=5000;interpolation-heuristic=WIDESTAMONGSMALL;tolerance=1.0;log-additional-information=true; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> produce-proofs=true;produce-unsat-cores=true;enumeration-timeout=5000;interpolation-heuristic=WIDESTAMONGSMALL;tolerance=1.0;log-additional-information=true; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> produce-proofs=true;produce-unsat-cores=true;enumeration-timeout=5000;interpolation-heuristic=WIDESTAMONGSMALL;tolerance=1.0;log-additional-information=true; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> produce-proofs=true;produce-unsat-cores=true;enumeration-timeout=5000;interpolation-heuristic=WIDESTAMONGSMALL;tolerance=1.0;log-additional-information=true; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> produce-proofs=true;produce-unsat-cores=true;enumeration-timeout=5000;interpolation-heuristic=WIDESTAMONGSMALL;tolerance=1.0;log-additional-information=true; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> produce-proofs=true;produce-unsat-cores=true;enumeration-timeout=5000;interpolation-heuristic=WIDESTAMONGSMALL;tolerance=1.0;log-additional-information=true; [2020-09-25 09:06:08,192 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-25 09:06:08,220 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-25 09:06:08,225 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-25 09:06:08,227 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-25 09:06:08,228 INFO L275 PluginConnector]: CDTParser initialized [2020-09-25 09:06:08,229 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 09:06:08,325 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/c150ebd12/234d2a5e6e774afcbe0d562f5c8f2fd8/FLAGe763bf383 [2020-09-25 09:06:09,004 INFO L306 CDTParser]: Found 1 translation units. [2020-09-25 09:06:09,005 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/eca-rers2012/Problem10_label42.c [2020-09-25 09:06:09,020 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/c150ebd12/234d2a5e6e774afcbe0d562f5c8f2fd8/FLAGe763bf383 [2020-09-25 09:06:09,208 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/c150ebd12/234d2a5e6e774afcbe0d562f5c8f2fd8 [2020-09-25 09:06:09,223 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-25 09:06:09,230 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-25 09:06:09,234 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-25 09:06:09,234 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-25 09:06:09,239 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-25 09:06:09,240 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 09:06:09" (1/1) ... [2020-09-25 09:06:09,248 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47211fe2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 09:06:09, skipping insertion in model container [2020-09-25 09:06:09,248 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 09:06:09" (1/1) ... [2020-09-25 09:06:09,258 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-25 09:06:09,337 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-25 09:06:09,890 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-25 09:06:09,898 INFO L203 MainTranslator]: Completed pre-run [2020-09-25 09:06:10,126 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-25 09:06:10,148 INFO L208 MainTranslator]: Completed translation [2020-09-25 09:06:10,150 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 09:06:10 WrapperNode [2020-09-25 09:06:10,150 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-25 09:06:10,151 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-25 09:06:10,151 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-25 09:06:10,151 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-25 09:06:10,165 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 09:06:10" (1/1) ... [2020-09-25 09:06:10,167 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 09:06:10" (1/1) ... [2020-09-25 09:06:10,189 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 09:06:10" (1/1) ... [2020-09-25 09:06:10,191 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 09:06:10" (1/1) ... [2020-09-25 09:06:10,228 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 09:06:10" (1/1) ... [2020-09-25 09:06:10,244 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 09:06:10" (1/1) ... [2020-09-25 09:06:10,254 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 09:06:10" (1/1) ... [2020-09-25 09:06:10,276 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-25 09:06:10,277 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-25 09:06:10,278 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-25 09:06:10,278 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-25 09:06:10,279 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 09:06:10" (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 09:06:10,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-25 09:06:10,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-25 09:06:10,379 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2020-09-25 09:06:10,379 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-25 09:06:10,380 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2020-09-25 09:06:10,380 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-25 09:06:10,380 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-25 09:06:10,381 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-09-25 09:06:10,381 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-25 09:06:10,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-25 09:06:10,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-25 09:06:11,871 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-25 09:06:11,871 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-09-25 09:06:11,888 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 09:06:11 BoogieIcfgContainer [2020-09-25 09:06:11,889 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-25 09:06:11,892 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-25 09:06:11,892 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-25 09:06:11,896 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-25 09:06:11,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.09 09:06:09" (1/3) ... [2020-09-25 09:06:11,898 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4381e4cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 09:06:11, skipping insertion in model container [2020-09-25 09:06:11,899 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 09:06:10" (2/3) ... [2020-09-25 09:06:11,899 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4381e4cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 09:06:11, skipping insertion in model container [2020-09-25 09:06:11,900 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 09:06:11" (3/3) ... [2020-09-25 09:06:11,903 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem10_label42.c [2020-09-25 09:06:11,917 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-25 09:06:11,931 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-25 09:06:11,958 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-25 09:06:12,004 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-25 09:06:12,005 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-25 09:06:12,005 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-25 09:06:12,005 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-25 09:06:12,006 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-25 09:06:12,006 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-25 09:06:12,006 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-25 09:06:12,006 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-25 09:06:12,043 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states. [2020-09-25 09:06:12,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-09-25 09:06:12,051 INFO L414 BasicCegarLoop]: Found error trace [2020-09-25 09:06:12,052 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 09:06:12,052 INFO L427 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-25 09:06:12,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-25 09:06:12,059 INFO L82 PathProgramCache]: Analyzing trace with hash 969247631, now seen corresponding path program 1 times [2020-09-25 09:06:12,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-25 09:06:12,069 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1895732269] [2020-09-25 09:06:12,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-25 09:06:12,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 09:06:12,324 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 09:06:12,512 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 09:06:12,926 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 09:06:12,926 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 45 [2020-09-25 09:06:12,926 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-09-25 09:06:12,927 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 690 [2020-09-25 09:06:12,931 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 09:06:12,931 FATAL L256 erpolLogProxyWrapper]: Tolerance: 1.0 [2020-09-25 09:06:12,931 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-09-25 09:06:12,932 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 11 [2020-09-25 09:06:12,932 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 33 [2020-09-25 09:06:12,932 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 5 [2020-09-25 09:06:13,034 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-25 09:06:13,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 09:06:13,045 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 09:06:13,064 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 09:06:13,064 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 18 [2020-09-25 09:06:13,064 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 09:06:13,065 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 22 [2020-09-25 09:06:13,065 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 09:06:13,065 FATAL L256 erpolLogProxyWrapper]: Tolerance: 1.0 [2020-09-25 09:06:13,066 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-25 09:06:13,066 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-25 09:06:13,066 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 7 [2020-09-25 09:06:13,067 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 09:06:13,107 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 09:06:13,108 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1895732269] [2020-09-25 09:06:13,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-25 09:06:13,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-09-25 09:06:13,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772499799] [2020-09-25 09:06:13,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-09-25 09:06:13,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-25 09:06:13,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-09-25 09:06:13,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-09-25 09:06:13,143 INFO L87 Difference]: Start difference. First operand 456 states. Second operand 4 states. [2020-09-25 09:06:15,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-25 09:06:15,199 INFO L93 Difference]: Finished difference Result 1104 states and 1521 transitions. [2020-09-25 09:06:15,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-25 09:06:15,202 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2020-09-25 09:06:15,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-25 09:06:15,228 INFO L225 Difference]: With dead ends: 1104 [2020-09-25 09:06:15,228 INFO L226 Difference]: Without dead ends: 578 [2020-09-25 09:06:15,238 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-09-25 09:06:15,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2020-09-25 09:06:15,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 544. [2020-09-25 09:06:15,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2020-09-25 09:06:15,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 655 transitions. [2020-09-25 09:06:15,330 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 655 transitions. Word has length 36 [2020-09-25 09:06:15,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-25 09:06:15,330 INFO L479 AbstractCegarLoop]: Abstraction has 544 states and 655 transitions. [2020-09-25 09:06:15,330 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-09-25 09:06:15,331 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 655 transitions. [2020-09-25 09:06:15,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2020-09-25 09:06:15,337 INFO L414 BasicCegarLoop]: Found error trace [2020-09-25 09:06:15,337 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-25 09:06:15,338 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-25 09:06:15,338 INFO L427 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-25 09:06:15,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-25 09:06:15,339 INFO L82 PathProgramCache]: Analyzing trace with hash -2117330465, now seen corresponding path program 1 times [2020-09-25 09:06:15,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-25 09:06:15,339 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2046212191] [2020-09-25 09:06:15,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-25 09:06:15,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 09:06:15,414 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 09:06:15,493 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 09:06:15,611 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 09:06:15,691 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 09:06:15,882 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 09:06:16,592 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 09:06:16,890 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 09:06:20,385 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 09:06:20,387 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 126 [2020-09-25 09:06:20,387 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 7 [2020-09-25 09:06:20,387 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 5001 [2020-09-25 09:06:20,388 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 09:06:20,388 FATAL L256 erpolLogProxyWrapper]: Tolerance: 1.0 [2020-09-25 09:06:20,389 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 8 [2020-09-25 09:06:20,389 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 12 [2020-09-25 09:06:20,389 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 113 [2020-09-25 09:06:20,390 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 2 [2020-09-25 09:06:20,465 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-25 09:06:20,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 09:06:20,475 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 09:06:20,491 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 09:06:20,491 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 18 [2020-09-25 09:06:20,491 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 09:06:20,492 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 19 [2020-09-25 09:06:20,492 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 09:06:20,492 FATAL L256 erpolLogProxyWrapper]: Tolerance: 1.0 [2020-09-25 09:06:20,492 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-25 09:06:20,493 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-25 09:06:20,493 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 8 [2020-09-25 09:06:20,493 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 09:06:20,510 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-25 09:06:20,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 09:06:20,543 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 09:06:20,601 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 09:06:20,724 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 09:06:20,725 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 75 [2020-09-25 09:06:20,725 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-09-25 09:06:20,726 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 196 [2020-09-25 09:06:20,726 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 09:06:20,726 FATAL L256 erpolLogProxyWrapper]: Tolerance: 1.0 [2020-09-25 09:06:20,727 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-25 09:06:20,727 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-09-25 09:06:20,728 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 74 [2020-09-25 09:06:20,728 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 2 [2020-09-25 09:06:20,824 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-09-25 09:06:20,825 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2046212191] [2020-09-25 09:06:20,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-25 09:06:20,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-09-25 09:06:20,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8563463] [2020-09-25 09:06:20,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-25 09:06:20,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-25 09:06:20,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-25 09:06:20,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-09-25 09:06:20,830 INFO L87 Difference]: Start difference. First operand 544 states and 655 transitions. Second operand 6 states. [2020-09-25 09:06:22,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-25 09:06:22,779 INFO L93 Difference]: Finished difference Result 710 states and 906 transitions. [2020-09-25 09:06:22,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-25 09:06:22,780 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 115 [2020-09-25 09:06:22,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-25 09:06:22,786 INFO L225 Difference]: With dead ends: 710 [2020-09-25 09:06:22,787 INFO L226 Difference]: Without dead ends: 708 [2020-09-25 09:06:22,788 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-09-25 09:06:22,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2020-09-25 09:06:22,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 696. [2020-09-25 09:06:22,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 696 states. [2020-09-25 09:06:22,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 886 transitions. [2020-09-25 09:06:22,830 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 886 transitions. Word has length 115 [2020-09-25 09:06:22,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-25 09:06:22,831 INFO L479 AbstractCegarLoop]: Abstraction has 696 states and 886 transitions. [2020-09-25 09:06:22,831 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-25 09:06:22,831 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 886 transitions. [2020-09-25 09:06:22,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2020-09-25 09:06:22,837 INFO L414 BasicCegarLoop]: Found error trace [2020-09-25 09:06:22,837 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 09:06:22,838 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-25 09:06:22,838 INFO L427 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-25 09:06:22,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-25 09:06:22,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1359994051, now seen corresponding path program 1 times [2020-09-25 09:06:22,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-25 09:06:22,839 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1288949109] [2020-09-25 09:06:22,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-25 09:06:22,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 09:06:22,904 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 09:06:23,139 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 09:06:23,139 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 136 [2020-09-25 09:06:23,139 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 09:06:23,140 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 263 [2020-09-25 09:06:23,140 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 09:06:23,140 FATAL L256 erpolLogProxyWrapper]: Tolerance: 1.0 [2020-09-25 09:06:23,140 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-25 09:06:23,141 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 105 [2020-09-25 09:06:23,141 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 30 [2020-09-25 09:06:23,141 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 09:06:23,202 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-25 09:06:23,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 09:06:23,207 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 09:06:23,215 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 09:06:23,215 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 18 [2020-09-25 09:06:23,216 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 09:06:23,216 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 10 [2020-09-25 09:06:23,216 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 09:06:23,216 FATAL L256 erpolLogProxyWrapper]: Tolerance: 1.0 [2020-09-25 09:06:23,217 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-09-25 09:06:23,217 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-25 09:06:23,217 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-09-25 09:06:23,217 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 09:06:23,236 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-25 09:06:23,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 09:06:23,269 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 09:06:23,412 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 09:06:23,413 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 85 [2020-09-25 09:06:23,413 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 09:06:23,413 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 158 [2020-09-25 09:06:23,413 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 09:06:23,414 FATAL L256 erpolLogProxyWrapper]: Tolerance: 1.0 [2020-09-25 09:06:23,414 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-25 09:06:23,414 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-25 09:06:23,414 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 76 [2020-09-25 09:06:23,415 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 09:06:23,466 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 09:06:23,466 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1288949109] [2020-09-25 09:06:23,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-25 09:06:23,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-09-25 09:06:23,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641885193] [2020-09-25 09:06:23,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-25 09:06:23,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-25 09:06:23,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-25 09:06:23,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-25 09:06:23,469 INFO L87 Difference]: Start difference. First operand 696 states and 886 transitions. Second operand 5 states. [2020-09-25 09:06:25,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-25 09:06:25,524 INFO L93 Difference]: Finished difference Result 1700 states and 2254 transitions. [2020-09-25 09:06:25,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-25 09:06:25,529 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 125 [2020-09-25 09:06:25,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-25 09:06:25,537 INFO L225 Difference]: With dead ends: 1700 [2020-09-25 09:06:25,538 INFO L226 Difference]: Without dead ends: 1170 [2020-09-25 09:06:25,540 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 09:06:25,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2020-09-25 09:06:25,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 1150. [2020-09-25 09:06:25,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1150 states. [2020-09-25 09:06:25,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 1514 transitions. [2020-09-25 09:06:25,606 INFO L78 Accepts]: Start accepts. Automaton has 1150 states and 1514 transitions. Word has length 125 [2020-09-25 09:06:25,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-25 09:06:25,609 INFO L479 AbstractCegarLoop]: Abstraction has 1150 states and 1514 transitions. [2020-09-25 09:06:25,609 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-25 09:06:25,609 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 1514 transitions. [2020-09-25 09:06:25,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2020-09-25 09:06:25,630 INFO L414 BasicCegarLoop]: Found error trace [2020-09-25 09:06:25,631 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 09:06:25,631 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-25 09:06:25,631 INFO L427 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-25 09:06:25,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-25 09:06:25,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1182078239, now seen corresponding path program 1 times [2020-09-25 09:06:25,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-25 09:06:25,634 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [820363712] [2020-09-25 09:06:25,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-25 09:06:25,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 09:06:25,721 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 09:06:26,164 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 09:06:26,165 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 169 [2020-09-25 09:06:26,165 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 09:06:26,165 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 478 [2020-09-25 09:06:26,174 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 09:06:26,174 FATAL L256 erpolLogProxyWrapper]: Tolerance: 1.0 [2020-09-25 09:06:26,175 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-09-25 09:06:26,175 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 13 [2020-09-25 09:06:26,175 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 124 [2020-09-25 09:06:26,175 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 09:06:26,242 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-25 09:06:26,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 09:06:26,248 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 09:06:26,263 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 09:06:26,263 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 18 [2020-09-25 09:06:26,263 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 09:06:26,263 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 16 [2020-09-25 09:06:26,263 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 09:06:26,264 FATAL L256 erpolLogProxyWrapper]: Tolerance: 1.0 [2020-09-25 09:06:26,264 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-25 09:06:26,264 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-25 09:06:26,265 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 9 [2020-09-25 09:06:26,265 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 09:06:26,281 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-25 09:06:26,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 09:06:26,328 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 09:06:26,592 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 09:06:26,593 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 118 [2020-09-25 09:06:26,593 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 09:06:26,593 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 285 [2020-09-25 09:06:26,594 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 09:06:26,594 FATAL L256 erpolLogProxyWrapper]: Tolerance: 1.0 [2020-09-25 09:06:26,594 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-25 09:06:26,594 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-09-25 09:06:26,594 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 117 [2020-09-25 09:06:26,595 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 09:06:26,768 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 09:06:26,769 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [820363712] [2020-09-25 09:06:26,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-25 09:06:26,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-25 09:06:26,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670288408] [2020-09-25 09:06:26,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-25 09:06:26,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-25 09:06:26,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-25 09:06:26,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-25 09:06:26,771 INFO L87 Difference]: Start difference. First operand 1150 states and 1514 transitions. Second operand 7 states. [2020-09-25 09:06:28,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-25 09:06:28,775 INFO L93 Difference]: Finished difference Result 2038 states and 2730 transitions. [2020-09-25 09:06:28,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-25 09:06:28,775 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 158 [2020-09-25 09:06:28,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-25 09:06:28,784 INFO L225 Difference]: With dead ends: 2038 [2020-09-25 09:06:28,784 INFO L226 Difference]: Without dead ends: 1053 [2020-09-25 09:06:28,791 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 09:06:28,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2020-09-25 09:06:28,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 855. [2020-09-25 09:06:28,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 855 states. [2020-09-25 09:06:28,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 976 transitions. [2020-09-25 09:06:28,832 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 976 transitions. Word has length 158 [2020-09-25 09:06:28,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-25 09:06:28,833 INFO L479 AbstractCegarLoop]: Abstraction has 855 states and 976 transitions. [2020-09-25 09:06:28,833 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-25 09:06:28,833 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 976 transitions. [2020-09-25 09:06:28,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2020-09-25 09:06:28,843 INFO L414 BasicCegarLoop]: Found error trace [2020-09-25 09:06:28,843 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 09:06:28,843 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-25 09:06:28,844 INFO L427 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-25 09:06:28,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-25 09:06:28,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1776525167, now seen corresponding path program 1 times [2020-09-25 09:06:28,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-25 09:06:28,844 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2077825256] [2020-09-25 09:06:28,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-25 09:06:28,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-25 09:06:28,911 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-09-25 09:06:28,912 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-25 09:06:28,920 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-25 09:06:28,978 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.09 09:06:28 BoogieIcfgContainer [2020-09-25 09:06:28,979 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-25 09:06:28,982 INFO L168 Benchmark]: Toolchain (without parser) took 19755.75 ms. Allocated memory was 145.8 MB in the beginning and 425.7 MB in the end (delta: 280.0 MB). Free memory was 103.8 MB in the beginning and 114.1 MB in the end (delta: -10.2 MB). Peak memory consumption was 269.7 MB. Max. memory is 7.1 GB. [2020-09-25 09:06:28,984 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 145.8 MB. Free memory was 123.7 MB in the beginning and 123.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-09-25 09:06:28,985 INFO L168 Benchmark]: CACSL2BoogieTranslator took 916.04 ms. Allocated memory was 145.8 MB in the beginning and 206.6 MB in the end (delta: 60.8 MB). Free memory was 103.2 MB in the beginning and 173.5 MB in the end (delta: -70.3 MB). Peak memory consumption was 32.5 MB. Max. memory is 7.1 GB. [2020-09-25 09:06:28,987 INFO L168 Benchmark]: Boogie Preprocessor took 125.71 ms. Allocated memory is still 206.6 MB. Free memory was 173.5 MB in the beginning and 168.8 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.7 MB. Max. memory is 7.1 GB. [2020-09-25 09:06:28,993 INFO L168 Benchmark]: RCFGBuilder took 1613.32 ms. Allocated memory was 206.6 MB in the beginning and 234.9 MB in the end (delta: 28.3 MB). Free memory was 168.8 MB in the beginning and 157.5 MB in the end (delta: 11.3 MB). Peak memory consumption was 79.2 MB. Max. memory is 7.1 GB. [2020-09-25 09:06:28,994 INFO L168 Benchmark]: TraceAbstraction took 17087.23 ms. Allocated memory was 234.9 MB in the beginning and 425.7 MB in the end (delta: 190.8 MB). Free memory was 157.5 MB in the beginning and 114.1 MB in the end (delta: 43.4 MB). Peak memory consumption was 234.3 MB. Max. memory is 7.1 GB. [2020-09-25 09:06:29,008 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.20 ms. Allocated memory is still 145.8 MB. Free memory was 123.7 MB in the beginning and 123.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 916.04 ms. Allocated memory was 145.8 MB in the beginning and 206.6 MB in the end (delta: 60.8 MB). Free memory was 103.2 MB in the beginning and 173.5 MB in the end (delta: -70.3 MB). Peak memory consumption was 32.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 125.71 ms. Allocated memory is still 206.6 MB. Free memory was 173.5 MB in the beginning and 168.8 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1613.32 ms. Allocated memory was 206.6 MB in the beginning and 234.9 MB in the end (delta: 28.3 MB). Free memory was 168.8 MB in the beginning and 157.5 MB in the end (delta: 11.3 MB). Peak memory consumption was 79.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17087.23 ms. Allocated memory was 234.9 MB in the beginning and 425.7 MB in the end (delta: 190.8 MB). Free memory was 157.5 MB in the beginning and 114.1 MB in the end (delta: 43.4 MB). Peak memory consumption was 234.3 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.9s, OverallIterations: 5, TraceHistogramMax: 3, AutomataDifference: 8.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 820 SDtfs, 3038 SDslu, 950 SDs, 0 SdLazy, 4078 SolverSat, 679 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1150occurred 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, 264 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 7.8s InterpolantComputationTime, 671 NumberOfCodeBlocks, 671 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 430 ConstructedInterpolants, 0 QuantifiedInterpolants, 142233 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 46/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...