/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=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_label15.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-c90d42b [2020-09-25 05:38:22,654 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-25 05:38:22,658 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-25 05:38:22,685 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-25 05:38:22,686 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-25 05:38:22,687 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-25 05:38:22,689 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-25 05:38:22,693 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-25 05:38:22,701 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-25 05:38:22,703 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-25 05:38:22,704 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-25 05:38:22,708 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-25 05:38:22,708 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-25 05:38:22,711 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-25 05:38:22,714 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-25 05:38:22,717 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-25 05:38:22,718 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-25 05:38:22,719 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-25 05:38:22,724 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-25 05:38:22,726 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-25 05:38:22,730 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-25 05:38:22,732 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-25 05:38:22,734 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-25 05:38:22,735 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-25 05:38:22,743 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-25 05:38:22,743 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-25 05:38:22,743 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-25 05:38:22,748 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-25 05:38:22,749 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-25 05:38:22,751 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-25 05:38:22,751 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-25 05:38:22,752 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-25 05:38:22,761 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-25 05:38:22,762 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-25 05:38:22,763 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-25 05:38:22,764 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-25 05:38:22,765 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-25 05:38:22,767 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-25 05:38:22,767 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-25 05:38:22,768 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-25 05:38:22,769 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-25 05:38:22,771 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 05:38:22,822 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-25 05:38:22,822 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-25 05:38:22,824 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-09-25 05:38:22,825 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-09-25 05:38:22,825 INFO L138 SettingsManager]: * Use SBE=true [2020-09-25 05:38:22,825 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-25 05:38:22,826 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-25 05:38:22,826 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-25 05:38:22,826 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-25 05:38:22,826 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-25 05:38:22,827 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-25 05:38:22,828 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-25 05:38:22,828 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-25 05:38:22,828 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-25 05:38:22,829 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-25 05:38:22,829 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-25 05:38:22,829 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-25 05:38:22,829 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-25 05:38:22,829 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-09-25 05:38:22,830 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-25 05:38:22,830 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-25 05:38:22,830 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-25 05:38:22,830 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-25 05:38:22,830 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-09-25 05:38:22,831 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-09-25 05:38:22,831 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-09-25 05:38:22,831 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-09-25 05:38:22,831 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-25 05:38:22,831 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-09-25 05:38:22,832 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=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=WIDESTAMONGSMALL;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=WIDESTAMONGSMALL;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=WIDESTAMONGSMALL;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=WIDESTAMONGSMALL;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=WIDESTAMONGSMALL;tolerance=0.4;log-additional-information=true; [2020-09-25 05:38:23,268 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-25 05:38:23,296 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-25 05:38:23,301 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-25 05:38:23,303 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-25 05:38:23,304 INFO L275 PluginConnector]: CDTParser initialized [2020-09-25 05:38:23,305 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label15.c [2020-09-25 05:38:23,401 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/94eedbba8/53be0e2e574846b38fb0f4ff01347d28/FLAG97f49ff54 [2020-09-25 05:38:24,024 INFO L306 CDTParser]: Found 1 translation units. [2020-09-25 05:38:24,025 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/eca-rers2012/Problem10_label15.c [2020-09-25 05:38:24,039 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/94eedbba8/53be0e2e574846b38fb0f4ff01347d28/FLAG97f49ff54 [2020-09-25 05:38:24,279 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/94eedbba8/53be0e2e574846b38fb0f4ff01347d28 [2020-09-25 05:38:24,292 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-25 05:38:24,298 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-25 05:38:24,299 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-25 05:38:24,299 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-25 05:38:24,303 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-25 05:38:24,304 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 05:38:24" (1/1) ... [2020-09-25 05:38:24,311 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cbac012 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 05:38:24, skipping insertion in model container [2020-09-25 05:38:24,311 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 05:38:24" (1/1) ... [2020-09-25 05:38:24,320 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-25 05:38:24,399 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-25 05:38:25,022 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-25 05:38:25,028 INFO L203 MainTranslator]: Completed pre-run [2020-09-25 05:38:25,116 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-25 05:38:25,135 INFO L208 MainTranslator]: Completed translation [2020-09-25 05:38:25,136 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 05:38:25 WrapperNode [2020-09-25 05:38:25,136 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-25 05:38:25,137 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-25 05:38:25,137 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-25 05:38:25,137 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-25 05:38:25,155 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 05:38:25" (1/1) ... [2020-09-25 05:38:25,156 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 05:38:25" (1/1) ... [2020-09-25 05:38:25,176 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 05:38:25" (1/1) ... [2020-09-25 05:38:25,177 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 05:38:25" (1/1) ... [2020-09-25 05:38:25,220 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 05:38:25" (1/1) ... [2020-09-25 05:38:25,243 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 05:38:25" (1/1) ... [2020-09-25 05:38:25,248 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 05:38:25" (1/1) ... [2020-09-25 05:38:25,256 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-25 05:38:25,257 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-25 05:38:25,257 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-25 05:38:25,257 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-25 05:38:25,259 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 05:38:25" (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 05:38:25,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-25 05:38:25,357 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-25 05:38:25,357 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2020-09-25 05:38:25,357 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-25 05:38:25,357 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2020-09-25 05:38:25,358 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-25 05:38:25,358 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-25 05:38:25,359 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-09-25 05:38:25,360 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-25 05:38:25,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-25 05:38:25,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-25 05:38:26,815 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-25 05:38:26,816 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-09-25 05:38:26,824 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 05:38:26 BoogieIcfgContainer [2020-09-25 05:38:26,825 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-25 05:38:26,826 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-25 05:38:26,826 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-25 05:38:26,831 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-25 05:38:26,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.09 05:38:24" (1/3) ... [2020-09-25 05:38:26,833 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60447c24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 05:38:26, skipping insertion in model container [2020-09-25 05:38:26,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 05:38:25" (2/3) ... [2020-09-25 05:38:26,834 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60447c24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 05:38:26, skipping insertion in model container [2020-09-25 05:38:26,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 05:38:26" (3/3) ... [2020-09-25 05:38:26,837 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem10_label15.c [2020-09-25 05:38:26,851 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-25 05:38:26,864 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-25 05:38:26,891 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-25 05:38:26,925 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-25 05:38:26,926 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-25 05:38:26,926 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-25 05:38:26,926 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-25 05:38:26,926 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-25 05:38:26,926 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-25 05:38:26,927 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-25 05:38:26,927 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-25 05:38:26,958 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states. [2020-09-25 05:38:26,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-09-25 05:38:26,966 INFO L414 BasicCegarLoop]: Found error trace [2020-09-25 05:38:26,968 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] [2020-09-25 05:38:26,968 INFO L427 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-25 05:38:26,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-25 05:38:26,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1814812065, now seen corresponding path program 1 times [2020-09-25 05:38:26,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-25 05:38:26,988 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [982380634] [2020-09-25 05:38:26,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-25 05:38:27,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 05:38:27,189 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:38:27,418 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:38:27,454 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:38:27,665 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 05:38:27,665 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 38 [2020-09-25 05:38:27,665 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 3 [2020-09-25 05:38:27,666 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 512 [2020-09-25 05:38:27,670 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 05:38:27,670 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-09-25 05:38:27,670 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-09-25 05:38:27,670 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 11 [2020-09-25 05:38:27,671 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 26 [2020-09-25 05:38:27,671 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 4 [2020-09-25 05:38:27,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-25 05:38:27,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 05:38:27,785 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:38:27,803 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 05:38:27,803 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 18 [2020-09-25 05:38:27,804 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 05:38:27,804 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 20 [2020-09-25 05:38:27,804 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 05:38:27,805 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-09-25 05:38:27,805 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-25 05:38:27,805 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-25 05:38:27,806 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 7 [2020-09-25 05:38:27,806 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 05:38:27,829 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 05:38:27,830 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [982380634] [2020-09-25 05:38:27,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-25 05:38:27,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-09-25 05:38:27,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939126868] [2020-09-25 05:38:27,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-09-25 05:38:27,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-25 05:38:27,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-09-25 05:38:27,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-09-25 05:38:27,861 INFO L87 Difference]: Start difference. First operand 456 states. Second operand 4 states. [2020-09-25 05:38:30,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-25 05:38:30,106 INFO L93 Difference]: Finished difference Result 1104 states and 1521 transitions. [2020-09-25 05:38:30,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-25 05:38:30,113 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2020-09-25 05:38:30,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-25 05:38:30,141 INFO L225 Difference]: With dead ends: 1104 [2020-09-25 05:38:30,141 INFO L226 Difference]: Without dead ends: 578 [2020-09-25 05:38:30,152 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 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 05:38:30,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2020-09-25 05:38:30,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 544. [2020-09-25 05:38:30,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2020-09-25 05:38:30,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 655 transitions. [2020-09-25 05:38:30,265 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 655 transitions. Word has length 29 [2020-09-25 05:38:30,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-25 05:38:30,266 INFO L479 AbstractCegarLoop]: Abstraction has 544 states and 655 transitions. [2020-09-25 05:38:30,266 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-09-25 05:38:30,266 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 655 transitions. [2020-09-25 05:38:30,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2020-09-25 05:38:30,272 INFO L414 BasicCegarLoop]: Found error trace [2020-09-25 05:38:30,272 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-09-25 05:38:30,272 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-25 05:38:30,273 INFO L427 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-25 05:38:30,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-25 05:38:30,273 INFO L82 PathProgramCache]: Analyzing trace with hash -908534672, now seen corresponding path program 1 times [2020-09-25 05:38:30,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-25 05:38:30,274 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [963946306] [2020-09-25 05:38:30,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-25 05:38:30,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 05:38:30,348 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:38:30,584 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:38:30,745 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:38:30,950 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:38:31,319 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:38:33,363 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 05:38:33,363 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 119 [2020-09-25 05:38:33,364 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 5 [2020-09-25 05:38:33,364 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 3046 [2020-09-25 05:38:33,365 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 05:38:33,365 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-09-25 05:38:33,365 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-25 05:38:33,366 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 94 [2020-09-25 05:38:33,366 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 24 [2020-09-25 05:38:33,367 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 2 [2020-09-25 05:38:33,478 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-25 05:38:33,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 05:38:33,484 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:38:33,492 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 05:38:33,493 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 18 [2020-09-25 05:38:33,493 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 05:38:33,493 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 10 [2020-09-25 05:38:33,494 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 05:38:33,494 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-09-25 05:38:33,495 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-09-25 05:38:33,495 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-25 05:38:33,495 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-09-25 05:38:33,496 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 2 [2020-09-25 05:38:33,511 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-25 05:38:33,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 05:38:33,550 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:38:33,634 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 05:38:33,634 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 75 [2020-09-25 05:38:33,642 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 05:38:33,643 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 98 [2020-09-25 05:38:33,643 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 05:38:33,643 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-09-25 05:38:33,643 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-25 05:38:33,644 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-25 05:38:33,644 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 65 [2020-09-25 05:38:33,644 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 05:38:33,699 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-25 05:38:33,699 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [963946306] [2020-09-25 05:38:33,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-25 05:38:33,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-09-25 05:38:33,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626987606] [2020-09-25 05:38:33,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-25 05:38:33,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-25 05:38:33,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-25 05:38:33,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-25 05:38:33,705 INFO L87 Difference]: Start difference. First operand 544 states and 655 transitions. Second operand 5 states. [2020-09-25 05:38:35,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-25 05:38:35,506 INFO L93 Difference]: Finished difference Result 1224 states and 1530 transitions. [2020-09-25 05:38:35,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-25 05:38:35,507 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 108 [2020-09-25 05:38:35,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-25 05:38:35,512 INFO L225 Difference]: With dead ends: 1224 [2020-09-25 05:38:35,513 INFO L226 Difference]: Without dead ends: 695 [2020-09-25 05:38:35,515 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 05:38:35,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2020-09-25 05:38:35,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 695. [2020-09-25 05:38:35,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 695 states. [2020-09-25 05:38:35,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 850 transitions. [2020-09-25 05:38:35,544 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 850 transitions. Word has length 108 [2020-09-25 05:38:35,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-25 05:38:35,545 INFO L479 AbstractCegarLoop]: Abstraction has 695 states and 850 transitions. [2020-09-25 05:38:35,545 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-25 05:38:35,545 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 850 transitions. [2020-09-25 05:38:35,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2020-09-25 05:38:35,550 INFO L414 BasicCegarLoop]: Found error trace [2020-09-25 05:38:35,551 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-09-25 05:38:35,551 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-25 05:38:35,551 INFO L427 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-25 05:38:35,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-25 05:38:35,552 INFO L82 PathProgramCache]: Analyzing trace with hash -162546798, now seen corresponding path program 1 times [2020-09-25 05:38:35,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-25 05:38:35,552 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [172744384] [2020-09-25 05:38:35,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-25 05:38:35,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 05:38:35,631 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:38:35,740 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:38:35,840 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:38:35,995 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:38:36,378 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:38:38,710 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 05:38:38,710 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 129 [2020-09-25 05:38:38,711 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 5 [2020-09-25 05:38:38,711 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 3114 [2020-09-25 05:38:38,711 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 05:38:38,711 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-09-25 05:38:38,712 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 5 [2020-09-25 05:38:38,712 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 103 [2020-09-25 05:38:38,712 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 25 [2020-09-25 05:38:38,712 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 05:38:38,788 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-25 05:38:38,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 05:38:38,796 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:38:38,803 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 05:38:38,803 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 18 [2020-09-25 05:38:38,803 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 05:38:38,803 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 12 [2020-09-25 05:38:38,804 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 05:38:38,804 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-09-25 05:38:38,804 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-09-25 05:38:38,804 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-25 05:38:38,804 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-09-25 05:38:38,804 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-25 05:38:38,821 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-25 05:38:38,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 05:38:38,857 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:38:38,972 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 05:38:38,972 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 85 [2020-09-25 05:38:38,972 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 05:38:38,973 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 130 [2020-09-25 05:38:38,973 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 05:38:38,973 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-09-25 05:38:38,973 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 3 [2020-09-25 05:38:38,973 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-25 05:38:38,974 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 75 [2020-09-25 05:38:38,974 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 05:38:39,035 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-25 05:38:39,036 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [172744384] [2020-09-25 05:38:39,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-25 05:38:39,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-09-25 05:38:39,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847818217] [2020-09-25 05:38:39,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-25 05:38:39,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-25 05:38:39,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-25 05:38:39,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-09-25 05:38:39,039 INFO L87 Difference]: Start difference. First operand 695 states and 850 transitions. Second operand 6 states. [2020-09-25 05:38:41,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-25 05:38:41,911 INFO L93 Difference]: Finished difference Result 1905 states and 2481 transitions. [2020-09-25 05:38:41,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-25 05:38:41,912 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 118 [2020-09-25 05:38:41,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-25 05:38:41,922 INFO L225 Difference]: With dead ends: 1905 [2020-09-25 05:38:41,922 INFO L226 Difference]: Without dead ends: 1375 [2020-09-25 05:38:41,924 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-09-25 05:38:41,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1375 states. [2020-09-25 05:38:41,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1375 to 1319. [2020-09-25 05:38:41,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1319 states. [2020-09-25 05:38:41,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1319 states to 1319 states and 1695 transitions. [2020-09-25 05:38:41,969 INFO L78 Accepts]: Start accepts. Automaton has 1319 states and 1695 transitions. Word has length 118 [2020-09-25 05:38:41,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-25 05:38:41,970 INFO L479 AbstractCegarLoop]: Abstraction has 1319 states and 1695 transitions. [2020-09-25 05:38:41,970 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-25 05:38:41,970 INFO L276 IsEmpty]: Start isEmpty. Operand 1319 states and 1695 transitions. [2020-09-25 05:38:41,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2020-09-25 05:38:41,974 INFO L414 BasicCegarLoop]: Found error trace [2020-09-25 05:38:41,974 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-09-25 05:38:41,974 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-25 05:38:41,975 INFO L427 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-25 05:38:41,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-25 05:38:41,975 INFO L82 PathProgramCache]: Analyzing trace with hash -878375990, now seen corresponding path program 1 times [2020-09-25 05:38:41,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-25 05:38:41,976 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1433855056] [2020-09-25 05:38:41,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-25 05:38:42,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 05:38:42,030 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:38:42,271 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:38:42,340 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:38:43,419 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 05:38:43,420 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 131 [2020-09-25 05:38:43,420 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 3 [2020-09-25 05:38:43,421 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1415 [2020-09-25 05:38:43,421 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 05:38:43,421 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-09-25 05:38:43,422 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-25 05:38:43,422 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 107 [2020-09-25 05:38:43,422 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 23 [2020-09-25 05:38:43,422 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 05:38:43,477 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-25 05:38:43,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 05:38:43,480 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:38:43,488 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 05:38:43,488 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 18 [2020-09-25 05:38:43,488 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 05:38:43,488 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 8 [2020-09-25 05:38:43,489 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 05:38:43,489 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-09-25 05:38:43,489 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-09-25 05:38:43,489 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-25 05:38:43,490 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-09-25 05:38:43,490 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 05:38:43,503 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-25 05:38:43,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 05:38:43,532 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:38:43,606 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 05:38:43,607 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 87 [2020-09-25 05:38:43,607 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 05:38:43,607 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 88 [2020-09-25 05:38:43,608 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 05:38:43,608 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-09-25 05:38:43,608 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-25 05:38:43,608 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-25 05:38:43,608 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 78 [2020-09-25 05:38:43,609 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 05:38:43,645 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-25 05:38:43,646 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1433855056] [2020-09-25 05:38:43,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-25 05:38:43,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-09-25 05:38:43,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920563966] [2020-09-25 05:38:43,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-25 05:38:43,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-25 05:38:43,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-25 05:38:43,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-25 05:38:43,648 INFO L87 Difference]: Start difference. First operand 1319 states and 1695 transitions. Second operand 5 states. [2020-09-25 05:38:45,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-25 05:38:45,436 INFO L93 Difference]: Finished difference Result 3253 states and 4342 transitions. [2020-09-25 05:38:45,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-25 05:38:45,439 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2020-09-25 05:38:45,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-25 05:38:45,451 INFO L225 Difference]: With dead ends: 3253 [2020-09-25 05:38:45,452 INFO L226 Difference]: Without dead ends: 2099 [2020-09-25 05:38:45,457 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 05:38:45,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2099 states. [2020-09-25 05:38:45,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2099 to 1779. [2020-09-25 05:38:45,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1779 states. [2020-09-25 05:38:45,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1779 states to 1779 states and 2205 transitions. [2020-09-25 05:38:45,520 INFO L78 Accepts]: Start accepts. Automaton has 1779 states and 2205 transitions. Word has length 120 [2020-09-25 05:38:45,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-25 05:38:45,522 INFO L479 AbstractCegarLoop]: Abstraction has 1779 states and 2205 transitions. [2020-09-25 05:38:45,522 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-25 05:38:45,522 INFO L276 IsEmpty]: Start isEmpty. Operand 1779 states and 2205 transitions. [2020-09-25 05:38:45,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2020-09-25 05:38:45,536 INFO L414 BasicCegarLoop]: Found error trace [2020-09-25 05:38:45,536 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:38:45,536 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-25 05:38:45,537 INFO L427 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-25 05:38:45,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-25 05:38:45,537 INFO L82 PathProgramCache]: Analyzing trace with hash -656468272, now seen corresponding path program 1 times [2020-09-25 05:38:45,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-25 05:38:45,538 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [811500856] [2020-09-25 05:38:45,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-25 05:38:45,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 05:38:45,636 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:38:45,731 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:38:45,886 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:38:47,114 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:38:47,536 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:38:48,413 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:38:50,214 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 05:38:50,214 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 232 [2020-09-25 05:38:50,215 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 6 [2020-09-25 05:38:50,215 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 4619 [2020-09-25 05:38:50,215 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 05:38:50,216 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-09-25 05:38:50,251 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 5 [2020-09-25 05:38:50,252 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 94 [2020-09-25 05:38:50,252 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 114 [2020-09-25 05:38:50,253 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 37 [2020-09-25 05:38:50,318 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-25 05:38:50,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 05:38:50,323 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:38:50,331 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 05:38:50,331 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 18 [2020-09-25 05:38:50,331 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 05:38:50,331 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 10 [2020-09-25 05:38:50,332 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 05:38:50,332 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-09-25 05:38:50,332 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-09-25 05:38:50,332 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-25 05:38:50,332 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-09-25 05:38:50,333 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 05:38:50,344 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-25 05:38:50,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 05:38:50,370 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:38:50,466 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 05:38:50,466 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 75 [2020-09-25 05:38:50,467 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 05:38:50,467 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 108 [2020-09-25 05:38:50,467 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 05:38:50,467 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-09-25 05:38:50,473 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 3 [2020-09-25 05:38:50,474 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-25 05:38:50,474 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 66 [2020-09-25 05:38:50,474 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 7 [2020-09-25 05:38:50,523 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2020-09-25 05:38:50,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 05:38:50,571 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:38:50,742 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 05:38:50,742 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 107 [2020-09-25 05:38:50,742 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 05:38:50,742 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 192 [2020-09-25 05:38:50,743 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 05:38:50,743 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-09-25 05:38:50,743 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-25 05:38:50,743 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-09-25 05:38:50,744 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 106 [2020-09-25 05:38:50,744 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 05:38:50,863 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 99 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-25 05:38:50,864 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [811500856] [2020-09-25 05:38:50,864 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-25 05:38:50,864 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-09-25 05:38:50,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620473820] [2020-09-25 05:38:50,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-25 05:38:50,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-25 05:38:50,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-25 05:38:50,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-09-25 05:38:50,868 INFO L87 Difference]: Start difference. First operand 1779 states and 2205 transitions. Second operand 8 states. [2020-09-25 05:38:54,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-25 05:38:54,566 INFO L93 Difference]: Finished difference Result 4557 states and 5938 transitions. [2020-09-25 05:38:54,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-09-25 05:38:54,566 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 219 [2020-09-25 05:38:54,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-25 05:38:54,584 INFO L225 Difference]: With dead ends: 4557 [2020-09-25 05:38:54,584 INFO L226 Difference]: Without dead ends: 2943 [2020-09-25 05:38:54,591 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2020-09-25 05:38:54,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2943 states. [2020-09-25 05:38:54,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2943 to 2892. [2020-09-25 05:38:54,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2892 states. [2020-09-25 05:38:54,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2892 states to 2892 states and 3698 transitions. [2020-09-25 05:38:54,700 INFO L78 Accepts]: Start accepts. Automaton has 2892 states and 3698 transitions. Word has length 219 [2020-09-25 05:38:54,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-25 05:38:54,700 INFO L479 AbstractCegarLoop]: Abstraction has 2892 states and 3698 transitions. [2020-09-25 05:38:54,700 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-25 05:38:54,701 INFO L276 IsEmpty]: Start isEmpty. Operand 2892 states and 3698 transitions. [2020-09-25 05:38:54,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2020-09-25 05:38:54,706 INFO L414 BasicCegarLoop]: Found error trace [2020-09-25 05:38:54,706 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:38:54,706 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-25 05:38:54,707 INFO L427 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-25 05:38:54,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-25 05:38:54,707 INFO L82 PathProgramCache]: Analyzing trace with hash 2145286015, now seen corresponding path program 1 times [2020-09-25 05:38:54,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-25 05:38:54,708 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1157534826] [2020-09-25 05:38:54,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-25 05:38:54,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 05:38:54,815 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:38:54,978 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:38:55,068 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:38:55,232 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:38:55,541 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:38:57,045 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:38:59,787 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 05:38:59,787 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 233 [2020-09-25 05:38:59,787 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 6 [2020-09-25 05:38:59,787 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 5016 [2020-09-25 05:38:59,788 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 05:38:59,788 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-09-25 05:38:59,788 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-25 05:38:59,788 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 106 [2020-09-25 05:38:59,788 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 104 [2020-09-25 05:38:59,788 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-25 05:38:59,859 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-25 05:38:59,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 05:38:59,863 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:38:59,870 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 05:38:59,871 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 18 [2020-09-25 05:38:59,871 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 05:38:59,871 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 9 [2020-09-25 05:38:59,871 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 05:38:59,871 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-09-25 05:38:59,872 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-09-25 05:38:59,872 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-25 05:38:59,872 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-09-25 05:38:59,872 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-25 05:38:59,890 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-25 05:38:59,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 05:38:59,919 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:38:59,993 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 05:38:59,994 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 85 [2020-09-25 05:38:59,994 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 05:38:59,995 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 88 [2020-09-25 05:38:59,995 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 05:38:59,995 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-09-25 05:38:59,996 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-25 05:38:59,996 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-25 05:38:59,996 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 77 [2020-09-25 05:38:59,996 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 05:39:00,028 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2020-09-25 05:39:00,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 05:39:00,069 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:39:00,244 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 05:39:00,245 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 98 [2020-09-25 05:39:00,245 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 05:39:00,245 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 196 [2020-09-25 05:39:00,245 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 05:39:00,246 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-09-25 05:39:00,246 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-25 05:39:00,246 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-09-25 05:39:00,246 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 97 [2020-09-25 05:39:00,247 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 05:39:00,417 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 108 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-25 05:39:00,417 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1157534826] [2020-09-25 05:39:00,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-25 05:39:00,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-25 05:39:00,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088258361] [2020-09-25 05:39:00,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-25 05:39:00,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-25 05:39:00,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-25 05:39:00,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-25 05:39:00,420 INFO L87 Difference]: Start difference. First operand 2892 states and 3698 transitions. Second operand 7 states. [2020-09-25 05:39:02,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-25 05:39:02,871 INFO L93 Difference]: Finished difference Result 6793 states and 9037 transitions. [2020-09-25 05:39:02,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-25 05:39:02,874 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 220 [2020-09-25 05:39:02,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-25 05:39:02,895 INFO L225 Difference]: With dead ends: 6793 [2020-09-25 05:39:02,895 INFO L226 Difference]: Without dead ends: 3092 [2020-09-25 05:39:02,911 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-09-25 05:39:02,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3092 states. [2020-09-25 05:39:02,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3092 to 2856. [2020-09-25 05:39:02,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2856 states. [2020-09-25 05:39:03,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2856 states to 2856 states and 3525 transitions. [2020-09-25 05:39:03,000 INFO L78 Accepts]: Start accepts. Automaton has 2856 states and 3525 transitions. Word has length 220 [2020-09-25 05:39:03,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-25 05:39:03,001 INFO L479 AbstractCegarLoop]: Abstraction has 2856 states and 3525 transitions. [2020-09-25 05:39:03,001 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-25 05:39:03,001 INFO L276 IsEmpty]: Start isEmpty. Operand 2856 states and 3525 transitions. [2020-09-25 05:39:03,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2020-09-25 05:39:03,008 INFO L414 BasicCegarLoop]: Found error trace [2020-09-25 05:39:03,008 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:39:03,008 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-25 05:39:03,009 INFO L427 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-25 05:39:03,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-25 05:39:03,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1265665838, now seen corresponding path program 1 times [2020-09-25 05:39:03,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-25 05:39:03,010 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1702577358] [2020-09-25 05:39:03,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-25 05:39:03,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 05:39:03,114 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:39:03,584 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:39:03,811 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:39:04,970 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 05:39:04,970 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 299 [2020-09-25 05:39:04,970 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 3 [2020-09-25 05:39:04,970 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1911 [2020-09-25 05:39:04,971 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 05:39:04,971 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-09-25 05:39:04,971 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-25 05:39:04,971 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 274 [2020-09-25 05:39:04,971 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 24 [2020-09-25 05:39:04,972 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 05:39:05,049 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-25 05:39:05,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 05:39:05,053 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:39:05,061 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 05:39:05,061 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 18 [2020-09-25 05:39:05,061 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 05:39:05,061 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 9 [2020-09-25 05:39:05,062 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 05:39:05,062 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-09-25 05:39:05,062 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-09-25 05:39:05,062 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-25 05:39:05,062 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-09-25 05:39:05,063 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 05:39:05,075 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-25 05:39:05,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 05:39:05,089 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:39:05,115 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 05:39:05,116 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 142 [2020-09-25 05:39:05,116 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 05:39:05,116 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 33 [2020-09-25 05:39:05,116 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 05:39:05,116 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-09-25 05:39:05,117 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-09-25 05:39:05,117 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-25 05:39:05,117 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-09-25 05:39:05,117 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-25 05:39:05,154 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2020-09-25 05:39:05,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 05:39:05,193 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:39:05,277 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 05:39:05,277 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 107 [2020-09-25 05:39:05,278 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 05:39:05,278 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 102 [2020-09-25 05:39:05,278 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 05:39:05,278 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-09-25 05:39:05,278 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-25 05:39:05,279 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-25 05:39:05,279 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 97 [2020-09-25 05:39:05,279 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 05:39:05,396 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 29 proven. 2 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2020-09-25 05:39:05,397 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1702577358] [2020-09-25 05:39:05,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-25 05:39:05,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-09-25 05:39:05,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081826636] [2020-09-25 05:39:05,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-25 05:39:05,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-25 05:39:05,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-25 05:39:05,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-25 05:39:05,399 INFO L87 Difference]: Start difference. First operand 2856 states and 3525 transitions. Second operand 5 states. [2020-09-25 05:39:07,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-25 05:39:07,173 INFO L93 Difference]: Finished difference Result 6324 states and 7947 transitions. [2020-09-25 05:39:07,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-25 05:39:07,174 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 286 [2020-09-25 05:39:07,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-25 05:39:07,191 INFO L225 Difference]: With dead ends: 6324 [2020-09-25 05:39:07,191 INFO L226 Difference]: Without dead ends: 3633 [2020-09-25 05:39:07,200 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-09-25 05:39:07,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3633 states. [2020-09-25 05:39:07,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3633 to 3163. [2020-09-25 05:39:07,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3163 states. [2020-09-25 05:39:07,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3163 states to 3163 states and 3650 transitions. [2020-09-25 05:39:07,279 INFO L78 Accepts]: Start accepts. Automaton has 3163 states and 3650 transitions. Word has length 286 [2020-09-25 05:39:07,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-25 05:39:07,280 INFO L479 AbstractCegarLoop]: Abstraction has 3163 states and 3650 transitions. [2020-09-25 05:39:07,280 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-25 05:39:07,280 INFO L276 IsEmpty]: Start isEmpty. Operand 3163 states and 3650 transitions. [2020-09-25 05:39:07,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2020-09-25 05:39:07,289 INFO L414 BasicCegarLoop]: Found error trace [2020-09-25 05:39:07,289 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-25 05:39:07,289 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-25 05:39:07,289 INFO L427 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-25 05:39:07,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-25 05:39:07,290 INFO L82 PathProgramCache]: Analyzing trace with hash -711589098, now seen corresponding path program 1 times [2020-09-25 05:39:07,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-25 05:39:07,291 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [845095802] [2020-09-25 05:39:07,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-25 05:39:07,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 05:39:07,433 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:39:07,970 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 05:39:07,971 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 317 [2020-09-25 05:39:07,971 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 05:39:07,971 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 608 [2020-09-25 05:39:07,971 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 05:39:07,972 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-09-25 05:39:07,972 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-25 05:39:07,972 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 294 [2020-09-25 05:39:07,972 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 22 [2020-09-25 05:39:07,972 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-25 05:39:08,060 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-25 05:39:08,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 05:39:08,063 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:39:08,071 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 05:39:08,072 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 18 [2020-09-25 05:39:08,072 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 05:39:08,072 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 9 [2020-09-25 05:39:08,072 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 05:39:08,073 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-09-25 05:39:08,073 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-09-25 05:39:08,073 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-25 05:39:08,073 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-09-25 05:39:08,074 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 05:39:08,094 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-25 05:39:08,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 05:39:08,106 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:39:08,132 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 05:39:08,132 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 120 [2020-09-25 05:39:08,132 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 05:39:08,132 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 31 [2020-09-25 05:39:08,133 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 05:39:08,133 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-09-25 05:39:08,133 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-09-25 05:39:08,133 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-25 05:39:08,133 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-09-25 05:39:08,133 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-25 05:39:08,168 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2020-09-25 05:39:08,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 05:39:08,228 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 05:39:08,315 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 05:39:08,315 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 147 [2020-09-25 05:39:08,315 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 05:39:08,316 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 114 [2020-09-25 05:39:08,316 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 05:39:08,316 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-09-25 05:39:08,316 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-25 05:39:08,317 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-25 05:39:08,317 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 139 [2020-09-25 05:39:08,317 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 05:39:08,482 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 29 proven. 2 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2020-09-25 05:39:08,482 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [845095802] [2020-09-25 05:39:08,483 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-25 05:39:08,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-09-25 05:39:08,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971196428] [2020-09-25 05:39:08,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-25 05:39:08,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-25 05:39:08,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-25 05:39:08,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-25 05:39:08,485 INFO L87 Difference]: Start difference. First operand 3163 states and 3650 transitions. Second operand 5 states. [2020-09-25 05:39:09,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-25 05:39:09,965 INFO L93 Difference]: Finished difference Result 3315 states and 3802 transitions. [2020-09-25 05:39:09,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-25 05:39:09,966 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 304 [2020-09-25 05:39:09,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-25 05:39:09,979 INFO L225 Difference]: With dead ends: 3315 [2020-09-25 05:39:09,980 INFO L226 Difference]: Without dead ends: 3151 [2020-09-25 05:39:09,982 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-09-25 05:39:09,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3151 states. [2020-09-25 05:39:10,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3151 to 3151. [2020-09-25 05:39:10,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3151 states. [2020-09-25 05:39:10,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3151 states to 3151 states and 3612 transitions. [2020-09-25 05:39:10,052 INFO L78 Accepts]: Start accepts. Automaton has 3151 states and 3612 transitions. Word has length 304 [2020-09-25 05:39:10,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-25 05:39:10,053 INFO L479 AbstractCegarLoop]: Abstraction has 3151 states and 3612 transitions. [2020-09-25 05:39:10,053 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-25 05:39:10,053 INFO L276 IsEmpty]: Start isEmpty. Operand 3151 states and 3612 transitions. [2020-09-25 05:39:10,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2020-09-25 05:39:10,066 INFO L414 BasicCegarLoop]: Found error trace [2020-09-25 05:39:10,066 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:39:10,066 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-25 05:39:10,067 INFO L427 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-25 05:39:10,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-25 05:39:10,067 INFO L82 PathProgramCache]: Analyzing trace with hash 460101446, now seen corresponding path program 1 times [2020-09-25 05:39:10,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-25 05:39:10,068 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [516341358] [2020-09-25 05:39:10,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-25 05:39:10,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-25 05:39:10,170 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-09-25 05:39:10,171 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-25 05:39:10,177 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-25 05:39:10,230 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.09 05:39:10 BoogieIcfgContainer [2020-09-25 05:39:10,231 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-25 05:39:10,235 INFO L168 Benchmark]: Toolchain (without parser) took 45938.96 ms. Allocated memory was 140.0 MB in the beginning and 700.4 MB in the end (delta: 560.5 MB). Free memory was 100.3 MB in the beginning and 261.8 MB in the end (delta: -161.5 MB). Peak memory consumption was 399.0 MB. Max. memory is 7.1 GB. [2020-09-25 05:39:10,235 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 140.0 MB. Free memory was 120.2 MB in the beginning and 120.0 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-09-25 05:39:10,236 INFO L168 Benchmark]: CACSL2BoogieTranslator took 837.60 ms. Allocated memory was 140.0 MB in the beginning and 205.5 MB in the end (delta: 65.5 MB). Free memory was 99.7 MB in the beginning and 171.2 MB in the end (delta: -71.6 MB). Peak memory consumption was 33.1 MB. Max. memory is 7.1 GB. [2020-09-25 05:39:10,237 INFO L168 Benchmark]: Boogie Preprocessor took 119.71 ms. Allocated memory is still 205.5 MB. Free memory was 171.2 MB in the beginning and 167.1 MB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 7.1 GB. [2020-09-25 05:39:10,238 INFO L168 Benchmark]: RCFGBuilder took 1568.01 ms. Allocated memory was 205.5 MB in the beginning and 238.0 MB in the end (delta: 32.5 MB). Free memory was 166.4 MB in the beginning and 163.5 MB in the end (delta: 3.0 MB). Peak memory consumption was 81.5 MB. Max. memory is 7.1 GB. [2020-09-25 05:39:10,241 INFO L168 Benchmark]: TraceAbstraction took 43404.47 ms. Allocated memory was 238.0 MB in the beginning and 700.4 MB in the end (delta: 462.4 MB). Free memory was 163.5 MB in the beginning and 261.8 MB in the end (delta: -98.3 MB). Peak memory consumption was 364.1 MB. Max. memory is 7.1 GB. [2020-09-25 05:39:10,248 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.19 ms. Allocated memory is still 140.0 MB. Free memory was 120.2 MB in the beginning and 120.0 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 837.60 ms. Allocated memory was 140.0 MB in the beginning and 205.5 MB in the end (delta: 65.5 MB). Free memory was 99.7 MB in the beginning and 171.2 MB in the end (delta: -71.6 MB). Peak memory consumption was 33.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 119.71 ms. Allocated memory is still 205.5 MB. Free memory was 171.2 MB in the beginning and 167.1 MB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1568.01 ms. Allocated memory was 205.5 MB in the beginning and 238.0 MB in the end (delta: 32.5 MB). Free memory was 166.4 MB in the beginning and 163.5 MB in the end (delta: 3.0 MB). Peak memory consumption was 81.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 43404.47 ms. Allocated memory was 238.0 MB in the beginning and 700.4 MB in the end (delta: 462.4 MB). Free memory was 163.5 MB in the beginning and 261.8 MB in the end (delta: -98.3 MB). Peak memory consumption was 364.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 34]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int inputC = 3; [L8] int inputD = 4; [L9] int inputE = 5; [L10] int inputF = 6; [L11] int inputB = 2; [L14] int a1 = 23; [L15] int a19 = 9; [L16] int a10 = 0; [L17] int a12 = 0; [L18] int a4 = 14; [L579] int output = -1; [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL, EXPR calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) [L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) [L225] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) [L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) [L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) [L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) [L244] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) [L249] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) [L254] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) [L260] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) [L265] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) [L271] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) [L277] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) [L283] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) [L286] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) [L291] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) [L296] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) [L301] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) [L306] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) [L312] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) [L317] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) [L320] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) [L323] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) [L326] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) [L329] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) [L335] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) [L340] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) [L345] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) [L351] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) [L354] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) [L357] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) [L360] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) [L365] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0))))) [L370] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) [L375] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) [L378] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) [L383] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) [L388] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0))))) [L393] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) [L398] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) [L403] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14))) [L408] COND FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))) [L414] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14))) [L419] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10)))))) [L425] COND TRUE ((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0)) [L426] a1 = ((((a1 / 5) * 5) / 5) + 505228) [L427] a10 = 1 [L429] return 25; [L590] RET, EXPR calculate_output(input) [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL, EXPR calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) [L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) [L225] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) [L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) [L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) [L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) [L244] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) [L249] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) [L254] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) [L260] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) [L265] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) [L271] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) [L277] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) [L283] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) [L286] COND TRUE ((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 ))) [L287] a1 = ((((((a1 % 89)+ 74) - -21) * 5) % 89)- -118) [L288] a19 = 10 [L290] return 25; [L590] RET, EXPR calculate_output(input) [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL, EXPR calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) [L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) [L225] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) [L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) [L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) [L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) [L244] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) [L249] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) [L254] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) [L260] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) [L265] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) [L271] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) [L277] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) [L283] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) [L286] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) [L291] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) [L296] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) [L301] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) [L306] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) [L312] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) [L317] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) [L320] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) [L323] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) [L326] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) [L329] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) [L335] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) [L340] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) [L345] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) [L351] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) [L354] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) [L357] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) [L360] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) [L365] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0))))) [L370] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) [L375] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) [L378] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) [L383] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) [L388] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0))))) [L393] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) [L398] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) [L403] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14))) [L408] COND FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))) [L414] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14))) [L419] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10)))))) [L425] COND FALSE !(((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0))) [L430] COND FALSE !((((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 6)) && (a19==10))) && (a12==0))) [L436] COND FALSE !(((a19==9) && ((((input == 4) && (( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 ))) && (a12==0)) && (a4==14)))) [L442] COND FALSE !((((a19==10) && ((a12==0) && ((((a10==1) && a1 <= -13 ) || (( ((38 < a1) && (218 >= a1)) && (a10==0)) || ((a10==0) && 218 < a1 ))) && (input == 3)))) && (a4==14))) [L448] COND FALSE !(((a19==9) && (((a4==14) && ((((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4))) && (input == 5))) && (a12==0)))) [L454] COND FALSE !((((a12==0) && ((((input == 5) && (a19==10)) && ((38 < a1) && (218 >= a1)) ) && (a4==14))) && (a10==1))) [L460] COND FALSE !(((a19==9) && ((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3)) && (a10==1)) && (a12==0))))) [L465] COND FALSE !(((a10==0) && ((a12==0) && ((((input == 5) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a4==14))))) [L471] COND FALSE !(( 218 < a1 && (((((input == 3) && (a10==1)) && (a12==0)) && (a4==14)) && (a19==10)))) [L476] COND FALSE !((((a12==0) && ((a19==9) && (((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a4==14)))) && (a10==3))) [L481] COND TRUE (((((a4==14) && ( ((38 < a1) && (218 >= a1)) && (input == 2))) && (a12==0)) && (a10==1)) && (a19==10)) [L482] a1 = ((((a1 * 10)/ -9) * 5) - 333686) [L483] a10 = 4 [L484] a19 = 6 [L486] 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 TRUE (((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6)) [L34] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 456 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 43.2s, OverallIterations: 9, TraceHistogramMax: 4, AutomataDifference: 18.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1611 SDtfs, 5323 SDslu, 2089 SDs, 0 SdLazy, 9943 SolverSat, 1094 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 109 GetRequests, 59 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3163occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 8 MinimizatonAttempts, 1167 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 23.2s InterpolantComputationTime, 1786 NumberOfCodeBlocks, 1786 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1396 ConstructedInterpolants, 0 QuantifiedInterpolants, 515291 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 1 PerfectInterpolantSequences, 522/533 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...