/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.smt.solver Internal_SMTInterpol --traceabstraction.compute.trace.for.counterexample.result false --rcfgbuilder.size.of.a.code.block SequenceOfStatements --traceabstraction.use.minimal.unsat.core.enumeration true --traceabstraction.additional.smt.options produce-proofs=true --traceabstraction.additional.smt.options produce-unsat-cores=true --traceabstraction.additional.smt.options enumeration-timeout=5000 --traceabstraction.additional.smt.options interpolation-heuristic=BIGGEST --traceabstraction.additional.smt.options log-additional-information=true --traceabstraction.additional.smt.options unknown-allowed=true -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem10_label48.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-adbd35c [2020-10-12 13:06:27,433 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-12 13:06:27,436 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-12 13:06:27,478 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-12 13:06:27,479 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-12 13:06:27,486 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-12 13:06:27,488 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-12 13:06:27,492 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-12 13:06:27,494 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-12 13:06:27,497 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-12 13:06:27,498 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-12 13:06:27,499 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-12 13:06:27,500 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-12 13:06:27,502 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-12 13:06:27,505 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-12 13:06:27,506 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-12 13:06:27,508 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-12 13:06:27,509 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-12 13:06:27,511 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-12 13:06:27,519 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-12 13:06:27,522 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-12 13:06:27,523 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-12 13:06:27,524 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-12 13:06:27,525 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-12 13:06:27,540 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-12 13:06:27,541 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-12 13:06:27,541 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-12 13:06:27,542 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-12 13:06:27,546 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-12 13:06:27,547 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-12 13:06:27,547 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-12 13:06:27,548 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-12 13:06:27,551 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-12 13:06:27,552 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-12 13:06:27,553 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-12 13:06:27,556 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-12 13:06:27,557 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-12 13:06:27,557 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-12 13:06:27,557 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-12 13:06:27,558 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-12 13:06:27,560 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-12 13:06:27,561 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-12 13:06:27,583 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-12 13:06:27,583 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-12 13:06:27,585 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-12 13:06:27,585 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-12 13:06:27,585 INFO L138 SettingsManager]: * Use SBE=true [2020-10-12 13:06:27,585 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-12 13:06:27,585 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-12 13:06:27,586 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-12 13:06:27,586 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-12 13:06:27,586 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-12 13:06:27,586 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-12 13:06:27,586 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-12 13:06:27,587 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-12 13:06:27,587 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-12 13:06:27,587 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-12 13:06:27,587 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-12 13:06:27,587 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-12 13:06:27,588 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-12 13:06:27,588 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-12 13:06:27,588 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-12 13:06:27,588 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-12 13:06:27,588 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-12 13:06:27,589 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-12 13:06:27,589 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-12 13:06:27,589 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-12 13:06:27,589 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-12 13:06:27,589 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-12 13:06:27,590 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-12 13:06:27,590 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-12 13:06:27,590 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> Internal_SMTInterpol Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute trace for counterexample result -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> SequenceOfStatements Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use minimal unsat core enumeration -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> produce-proofs=true;produce-unsat-cores=true;enumeration-timeout=5000;interpolation-heuristic=BIGGEST;log-additional-information=true;unknown-allowed=true; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> produce-proofs=true;produce-unsat-cores=true;enumeration-timeout=5000;interpolation-heuristic=BIGGEST;log-additional-information=true;unknown-allowed=true; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> produce-proofs=true;produce-unsat-cores=true;enumeration-timeout=5000;interpolation-heuristic=BIGGEST;log-additional-information=true;unknown-allowed=true; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> produce-proofs=true;produce-unsat-cores=true;enumeration-timeout=5000;interpolation-heuristic=BIGGEST;log-additional-information=true;unknown-allowed=true; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> produce-proofs=true;produce-unsat-cores=true;enumeration-timeout=5000;interpolation-heuristic=BIGGEST;log-additional-information=true;unknown-allowed=true; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> produce-proofs=true;produce-unsat-cores=true;enumeration-timeout=5000;interpolation-heuristic=BIGGEST;log-additional-information=true;unknown-allowed=true; [2020-10-12 13:06:27,950 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-12 13:06:27,963 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-12 13:06:27,966 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-12 13:06:27,968 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-12 13:06:27,969 INFO L275 PluginConnector]: CDTParser initialized [2020-10-12 13:06:27,969 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label48.c [2020-10-12 13:06:28,032 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/cab45054c/7a75e207f5a640b8a1b7a622a7a54260/FLAGb13646732 [2020-10-12 13:06:28,574 INFO L306 CDTParser]: Found 1 translation units. [2020-10-12 13:06:28,574 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/eca-rers2012/Problem10_label48.c [2020-10-12 13:06:28,592 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/cab45054c/7a75e207f5a640b8a1b7a622a7a54260/FLAGb13646732 [2020-10-12 13:06:28,821 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/cab45054c/7a75e207f5a640b8a1b7a622a7a54260 [2020-10-12 13:06:28,832 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-12 13:06:28,834 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-12 13:06:28,839 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-12 13:06:28,839 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-12 13:06:28,843 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-12 13:06:28,844 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 01:06:28" (1/1) ... [2020-10-12 13:06:28,847 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@156d188 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:06:28, skipping insertion in model container [2020-10-12 13:06:28,848 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 01:06:28" (1/1) ... [2020-10-12 13:06:28,857 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-12 13:06:28,927 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-12 13:06:29,427 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-12 13:06:29,432 INFO L203 MainTranslator]: Completed pre-run [2020-10-12 13:06:29,662 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-12 13:06:29,691 INFO L208 MainTranslator]: Completed translation [2020-10-12 13:06:29,693 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:06:29 WrapperNode [2020-10-12 13:06:29,693 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-12 13:06:29,694 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-12 13:06:29,694 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-12 13:06:29,695 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-12 13:06:29,711 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:06:29" (1/1) ... [2020-10-12 13:06:29,714 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:06:29" (1/1) ... [2020-10-12 13:06:29,759 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:06:29" (1/1) ... [2020-10-12 13:06:29,759 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:06:29" (1/1) ... [2020-10-12 13:06:29,812 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:06:29" (1/1) ... [2020-10-12 13:06:29,829 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:06:29" (1/1) ... [2020-10-12 13:06:29,837 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:06:29" (1/1) ... [2020-10-12 13:06:29,848 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-12 13:06:29,849 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-12 13:06:29,849 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-12 13:06:29,849 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-12 13:06:29,850 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:06:29" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-12 13:06:29,934 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-12 13:06:29,934 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-12 13:06:29,934 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2020-10-12 13:06:29,934 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-12 13:06:29,935 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2020-10-12 13:06:29,935 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-10-12 13:06:29,935 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-12 13:06:29,935 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-10-12 13:06:29,935 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-12 13:06:29,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-12 13:06:29,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-12 13:06:31,238 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-12 13:06:31,238 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-10-12 13:06:31,249 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 01:06:31 BoogieIcfgContainer [2020-10-12 13:06:31,250 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-12 13:06:31,254 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-12 13:06:31,254 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-12 13:06:31,258 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-12 13:06:31,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 01:06:28" (1/3) ... [2020-10-12 13:06:31,260 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11bab22a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 01:06:31, skipping insertion in model container [2020-10-12 13:06:31,260 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:06:29" (2/3) ... [2020-10-12 13:06:31,262 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11bab22a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 01:06:31, skipping insertion in model container [2020-10-12 13:06:31,262 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 01:06:31" (3/3) ... [2020-10-12 13:06:31,264 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem10_label48.c [2020-10-12 13:06:31,278 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-12 13:06:31,289 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-12 13:06:31,307 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-12 13:06:31,344 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-12 13:06:31,345 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-12 13:06:31,345 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-12 13:06:31,345 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-12 13:06:31,345 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-12 13:06:31,345 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-12 13:06:31,345 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-12 13:06:31,346 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-12 13:06:31,373 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states. [2020-10-12 13:06:31,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-12 13:06:31,382 INFO L414 BasicCegarLoop]: Found error trace [2020-10-12 13:06:31,383 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-12 13:06:31,384 INFO L427 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-12 13:06:31,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-12 13:06:31,391 INFO L82 PathProgramCache]: Analyzing trace with hash 54045006, now seen corresponding path program 1 times [2020-10-12 13:06:31,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-12 13:06:31,401 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [289989858] [2020-10-12 13:06:31,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-12 13:06:31,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:06:31,609 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:06:31,863 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:06:31,863 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 21 [2020-10-12 13:06:31,864 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-12 13:06:31,864 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 308 [2020-10-12 13:06:31,866 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:06:31,866 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-10-12 13:06:31,866 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 5 [2020-10-12 13:06:31,866 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 15 [2020-10-12 13:06:31,867 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 2 [2020-10-12 13:06:31,942 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-12 13:06:31,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:06:31,950 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:06:31,962 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:06:31,962 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-12 13:06:31,962 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-12 13:06:31,962 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 14 [2020-10-12 13:06:31,963 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:06:31,963 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-12 13:06:31,963 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-12 13:06:31,963 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 2 [2020-10-12 13:06:31,964 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-12 13:06:31,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-12 13:06:31,973 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [289989858] [2020-10-12 13:06:31,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-12 13:06:31,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-12 13:06:31,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039032953] [2020-10-12 13:06:31,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-12 13:06:31,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-12 13:06:31,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-12 13:06:31,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-12 13:06:31,999 INFO L87 Difference]: Start difference. First operand 215 states. Second operand 4 states. [2020-10-12 13:06:33,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-12 13:06:33,488 INFO L93 Difference]: Finished difference Result 581 states and 1007 transitions. [2020-10-12 13:06:33,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-12 13:06:33,490 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-10-12 13:06:33,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-12 13:06:33,506 INFO L225 Difference]: With dead ends: 581 [2020-10-12 13:06:33,507 INFO L226 Difference]: Without dead ends: 302 [2020-10-12 13:06:33,514 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-12 13:06:33,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2020-10-12 13:06:33,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 296. [2020-10-12 13:06:33,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2020-10-12 13:06:33,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 448 transitions. [2020-10-12 13:06:33,596 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 448 transitions. Word has length 13 [2020-10-12 13:06:33,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-12 13:06:33,597 INFO L479 AbstractCegarLoop]: Abstraction has 296 states and 448 transitions. [2020-10-12 13:06:33,597 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-12 13:06:33,597 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 448 transitions. [2020-10-12 13:06:33,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-10-12 13:06:33,602 INFO L414 BasicCegarLoop]: Found error trace [2020-10-12 13:06:33,602 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-10-12 13:06:33,603 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-12 13:06:33,603 INFO L427 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-12 13:06:33,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-12 13:06:33,604 INFO L82 PathProgramCache]: Analyzing trace with hash 58156773, now seen corresponding path program 1 times [2020-10-12 13:06:33,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-12 13:06:33,604 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [591601249] [2020-10-12 13:06:33,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-12 13:06:33,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:06:33,762 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:06:34,157 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:06:34,157 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 96 [2020-10-12 13:06:34,157 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-12 13:06:34,158 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 450 [2020-10-12 13:06:34,158 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:06:34,158 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-10-12 13:06:34,158 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 5 [2020-10-12 13:06:34,159 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 79 [2020-10-12 13:06:34,159 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-12 13:06:34,209 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-12 13:06:34,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:06:34,215 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:06:34,222 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:06:34,222 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-12 13:06:34,223 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-12 13:06:34,223 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 8 [2020-10-12 13:06:34,223 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:06:34,223 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-12 13:06:34,224 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-12 13:06:34,224 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 2 [2020-10-12 13:06:34,224 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-12 13:06:34,236 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-12 13:06:34,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:06:34,263 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:06:34,375 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:06:34,376 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 74 [2020-10-12 13:06:34,376 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-12 13:06:34,376 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 123 [2020-10-12 13:06:34,377 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:06:34,377 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-12 13:06:34,377 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-12 13:06:34,377 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 74 [2020-10-12 13:06:34,377 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-12 13:06:34,458 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-12 13:06:34,459 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [591601249] [2020-10-12 13:06:34,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-12 13:06:34,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-12 13:06:34,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890476626] [2020-10-12 13:06:34,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-12 13:06:34,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-12 13:06:34,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-12 13:06:34,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-12 13:06:34,463 INFO L87 Difference]: Start difference. First operand 296 states and 448 transitions. Second operand 7 states. [2020-10-12 13:06:35,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-12 13:06:35,966 INFO L93 Difference]: Finished difference Result 749 states and 1150 transitions. [2020-10-12 13:06:35,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-12 13:06:35,967 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 86 [2020-10-12 13:06:35,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-12 13:06:35,975 INFO L225 Difference]: With dead ends: 749 [2020-10-12 13:06:35,976 INFO L226 Difference]: Without dead ends: 459 [2020-10-12 13:06:35,978 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-10-12 13:06:35,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2020-10-12 13:06:36,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 445. [2020-10-12 13:06:36,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2020-10-12 13:06:36,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 626 transitions. [2020-10-12 13:06:36,051 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 626 transitions. Word has length 86 [2020-10-12 13:06:36,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-12 13:06:36,053 INFO L479 AbstractCegarLoop]: Abstraction has 445 states and 626 transitions. [2020-10-12 13:06:36,053 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-12 13:06:36,054 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 626 transitions. [2020-10-12 13:06:36,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-10-12 13:06:36,060 INFO L414 BasicCegarLoop]: Found error trace [2020-10-12 13:06:36,061 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-10-12 13:06:36,061 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-12 13:06:36,061 INFO L427 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-12 13:06:36,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-12 13:06:36,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1907689263, now seen corresponding path program 1 times [2020-10-12 13:06:36,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-12 13:06:36,063 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1364090616] [2020-10-12 13:06:36,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-12 13:06:36,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:06:36,120 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:06:36,352 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:06:36,353 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 102 [2020-10-12 13:06:36,354 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-12 13:06:36,354 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 251 [2020-10-12 13:06:36,354 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:06:36,355 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-12 13:06:36,355 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 89 [2020-10-12 13:06:36,355 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 12 [2020-10-12 13:06:36,356 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-12 13:06:36,430 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-12 13:06:36,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:06:36,434 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:06:36,438 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:06:36,438 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-12 13:06:36,438 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-12 13:06:36,438 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 3 [2020-10-12 13:06:36,439 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:06:36,439 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-12 13:06:36,439 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-12 13:06:36,439 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-12 13:06:36,440 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-12 13:06:36,450 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-12 13:06:36,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:06:36,480 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:06:36,548 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:06:36,548 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 80 [2020-10-12 13:06:36,549 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-12 13:06:36,549 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 80 [2020-10-12 13:06:36,549 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:06:36,549 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-12 13:06:36,550 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-12 13:06:36,550 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 74 [2020-10-12 13:06:36,550 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-12 13:06:36,586 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-12 13:06:36,587 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1364090616] [2020-10-12 13:06:36,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-12 13:06:36,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-10-12 13:06:36,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044658276] [2020-10-12 13:06:36,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-12 13:06:36,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-12 13:06:36,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-12 13:06:36,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-12 13:06:36,589 INFO L87 Difference]: Start difference. First operand 445 states and 626 transitions. Second operand 5 states. [2020-10-12 13:06:39,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-12 13:06:39,936 INFO L93 Difference]: Finished difference Result 1337 states and 1930 transitions. [2020-10-12 13:06:39,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-12 13:06:39,937 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2020-10-12 13:06:39,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-12 13:06:39,944 INFO L225 Difference]: With dead ends: 1337 [2020-10-12 13:06:39,945 INFO L226 Difference]: Without dead ends: 898 [2020-10-12 13:06:39,946 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-12 13:06:39,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2020-10-12 13:06:39,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 888. [2020-10-12 13:06:39,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 888 states. [2020-10-12 13:06:39,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1164 transitions. [2020-10-12 13:06:39,993 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1164 transitions. Word has length 92 [2020-10-12 13:06:39,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-12 13:06:39,994 INFO L479 AbstractCegarLoop]: Abstraction has 888 states and 1164 transitions. [2020-10-12 13:06:39,994 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-12 13:06:39,994 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1164 transitions. [2020-10-12 13:06:39,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2020-10-12 13:06:39,997 INFO L414 BasicCegarLoop]: Found error trace [2020-10-12 13:06:39,998 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-10-12 13:06:39,998 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-12 13:06:39,998 INFO L427 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-12 13:06:39,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-12 13:06:39,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1492328462, now seen corresponding path program 1 times [2020-10-12 13:06:39,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-12 13:06:39,999 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1186550265] [2020-10-12 13:06:39,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-12 13:06:40,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:06:40,047 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:06:40,217 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:06:40,658 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:06:40,769 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:06:40,769 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 113 [2020-10-12 13:06:40,769 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 3 [2020-10-12 13:06:40,770 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 740 [2020-10-12 13:06:40,770 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:06:40,771 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 8 [2020-10-12 13:06:40,771 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 5 [2020-10-12 13:06:40,771 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 107 [2020-10-12 13:06:40,771 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-12 13:06:40,843 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-12 13:06:40,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:06:40,849 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:06:40,857 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:06:40,858 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-12 13:06:40,858 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-12 13:06:40,858 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 10 [2020-10-12 13:06:40,858 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:06:40,859 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-12 13:06:40,859 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-12 13:06:40,859 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 2 [2020-10-12 13:06:40,859 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-12 13:06:40,871 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-12 13:06:40,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:06:40,919 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:06:41,036 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:06:41,285 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:06:41,285 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 91 [2020-10-12 13:06:41,285 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-12 13:06:41,286 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 386 [2020-10-12 13:06:41,287 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:06:41,287 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-12 13:06:41,287 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-12 13:06:41,287 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 91 [2020-10-12 13:06:41,287 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-12 13:06:41,366 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-12 13:06:41,366 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1186550265] [2020-10-12 13:06:41,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-12 13:06:41,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-10-12 13:06:41,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948888061] [2020-10-12 13:06:41,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-12 13:06:41,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-12 13:06:41,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-12 13:06:41,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-12 13:06:41,369 INFO L87 Difference]: Start difference. First operand 888 states and 1164 transitions. Second operand 6 states. [2020-10-12 13:06:42,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-12 13:06:42,735 INFO L93 Difference]: Finished difference Result 2086 states and 2821 transitions. [2020-10-12 13:06:42,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-12 13:06:42,738 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 103 [2020-10-12 13:06:42,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-12 13:06:42,746 INFO L225 Difference]: With dead ends: 2086 [2020-10-12 13:06:42,746 INFO L226 Difference]: Without dead ends: 1204 [2020-10-12 13:06:42,749 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-10-12 13:06:42,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1204 states. [2020-10-12 13:06:42,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1204 to 1043. [2020-10-12 13:06:42,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1043 states. [2020-10-12 13:06:42,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 1279 transitions. [2020-10-12 13:06:42,825 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 1279 transitions. Word has length 103 [2020-10-12 13:06:42,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-12 13:06:42,826 INFO L479 AbstractCegarLoop]: Abstraction has 1043 states and 1279 transitions. [2020-10-12 13:06:42,826 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-12 13:06:42,826 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1279 transitions. [2020-10-12 13:06:42,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2020-10-12 13:06:42,832 INFO L414 BasicCegarLoop]: Found error trace [2020-10-12 13:06:42,832 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-12 13:06:42,832 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-12 13:06:42,833 INFO L427 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-12 13:06:42,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-12 13:06:42,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1989322578, now seen corresponding path program 1 times [2020-10-12 13:06:42,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-12 13:06:42,834 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1323243968] [2020-10-12 13:06:42,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-12 13:06:42,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:06:42,910 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:06:43,095 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:06:43,620 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:06:43,647 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:06:43,649 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 185 [2020-10-12 13:06:43,649 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 3 [2020-10-12 13:06:43,650 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 766 [2020-10-12 13:06:43,650 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:06:43,650 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-10-12 13:06:43,650 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 80 [2020-10-12 13:06:43,650 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 104 [2020-10-12 13:06:43,651 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-12 13:06:43,722 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-12 13:06:43,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:06:43,725 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:06:43,729 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:06:43,730 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-12 13:06:43,730 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-12 13:06:43,730 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 4 [2020-10-12 13:06:43,730 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:06:43,731 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-12 13:06:43,731 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-12 13:06:43,731 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-12 13:06:43,731 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-12 13:06:43,743 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-12 13:06:43,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:06:43,764 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:06:43,858 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:06:43,859 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 71 [2020-10-12 13:06:43,862 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-12 13:06:43,862 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 101 [2020-10-12 13:06:43,863 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:06:43,863 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-12 13:06:43,863 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-12 13:06:43,863 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 65 [2020-10-12 13:06:43,864 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-12 13:06:43,884 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2020-10-12 13:06:43,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:06:43,909 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:06:43,962 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:06:44,091 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:06:44,091 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 91 [2020-10-12 13:06:44,092 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-12 13:06:44,092 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 192 [2020-10-12 13:06:44,092 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:06:44,092 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-12 13:06:44,093 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-12 13:06:44,093 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 91 [2020-10-12 13:06:44,093 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-12 13:06:44,165 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 71 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-12 13:06:44,165 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1323243968] [2020-10-12 13:06:44,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-12 13:06:44,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-10-12 13:06:44,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509952575] [2020-10-12 13:06:44,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-12 13:06:44,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-12 13:06:44,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-12 13:06:44,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-12 13:06:44,167 INFO L87 Difference]: Start difference. First operand 1043 states and 1279 transitions. Second operand 6 states. [2020-10-12 13:06:45,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-12 13:06:45,935 INFO L93 Difference]: Finished difference Result 2970 states and 3735 transitions. [2020-10-12 13:06:45,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-12 13:06:45,936 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 173 [2020-10-12 13:06:45,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-12 13:06:45,950 INFO L225 Difference]: With dead ends: 2970 [2020-10-12 13:06:45,950 INFO L226 Difference]: Without dead ends: 1933 [2020-10-12 13:06:45,955 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-12 13:06:45,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1933 states. [2020-10-12 13:06:46,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1933 to 1780. [2020-10-12 13:06:46,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1780 states. [2020-10-12 13:06:46,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1780 states to 1780 states and 2118 transitions. [2020-10-12 13:06:46,038 INFO L78 Accepts]: Start accepts. Automaton has 1780 states and 2118 transitions. Word has length 173 [2020-10-12 13:06:46,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-12 13:06:46,040 INFO L479 AbstractCegarLoop]: Abstraction has 1780 states and 2118 transitions. [2020-10-12 13:06:46,042 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-12 13:06:46,042 INFO L276 IsEmpty]: Start isEmpty. Operand 1780 states and 2118 transitions. [2020-10-12 13:06:46,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2020-10-12 13:06:46,047 INFO L414 BasicCegarLoop]: Found error trace [2020-10-12 13:06:46,048 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-12 13:06:46,048 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-12 13:06:46,048 INFO L427 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-12 13:06:46,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-12 13:06:46,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1800636911, now seen corresponding path program 1 times [2020-10-12 13:06:46,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-12 13:06:46,049 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [760291391] [2020-10-12 13:06:46,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-12 13:06:46,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:06:46,099 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:06:46,158 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:06:46,977 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:06:47,105 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:06:48,855 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:06:48,856 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 192 [2020-10-12 13:06:48,856 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 4 [2020-10-12 13:06:48,856 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 2775 [2020-10-12 13:06:48,856 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:06:48,857 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-10-12 13:06:48,857 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 5 [2020-10-12 13:06:48,857 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 83 [2020-10-12 13:06:48,857 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-12 13:06:48,903 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-12 13:06:48,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:06:48,906 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:06:48,910 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:06:48,910 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-12 13:06:48,911 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-12 13:06:48,911 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 4 [2020-10-12 13:06:48,911 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:06:48,911 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-12 13:06:48,911 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-12 13:06:48,912 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 2 [2020-10-12 13:06:48,912 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-12 13:06:48,923 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-12 13:06:48,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:06:48,946 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:06:49,032 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:06:49,032 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 78 [2020-10-12 13:06:49,032 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-12 13:06:49,033 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 94 [2020-10-12 13:06:49,033 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:06:49,033 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-12 13:06:49,033 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-12 13:06:49,033 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 78 [2020-10-12 13:06:49,034 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-12 13:06:49,080 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2020-10-12 13:06:49,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:06:49,107 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:06:49,176 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:06:49,177 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 91 [2020-10-12 13:06:49,177 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-12 13:06:49,177 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 79 [2020-10-12 13:06:49,177 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:06:49,177 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-12 13:06:49,178 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 88 [2020-10-12 13:06:49,178 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-12 13:06:49,178 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-12 13:06:49,236 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 12 proven. 72 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-12 13:06:49,237 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [760291391] [2020-10-12 13:06:49,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-12 13:06:49,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-12 13:06:49,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207579978] [2020-10-12 13:06:49,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-12 13:06:49,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-12 13:06:49,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-12 13:06:49,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-12 13:06:49,239 INFO L87 Difference]: Start difference. First operand 1780 states and 2118 transitions. Second operand 7 states. [2020-10-12 13:06:50,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-12 13:06:50,816 INFO L93 Difference]: Finished difference Result 3727 states and 4440 transitions. [2020-10-12 13:06:50,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-12 13:06:50,817 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 180 [2020-10-12 13:06:50,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-12 13:06:50,828 INFO L225 Difference]: With dead ends: 3727 [2020-10-12 13:06:50,829 INFO L226 Difference]: Without dead ends: 1953 [2020-10-12 13:06:50,834 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2020-10-12 13:06:50,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1953 states. [2020-10-12 13:06:50,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1953 to 1792. [2020-10-12 13:06:50,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1792 states. [2020-10-12 13:06:50,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1792 states to 1792 states and 2117 transitions. [2020-10-12 13:06:50,897 INFO L78 Accepts]: Start accepts. Automaton has 1792 states and 2117 transitions. Word has length 180 [2020-10-12 13:06:50,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-12 13:06:50,897 INFO L479 AbstractCegarLoop]: Abstraction has 1792 states and 2117 transitions. [2020-10-12 13:06:50,897 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-12 13:06:50,897 INFO L276 IsEmpty]: Start isEmpty. Operand 1792 states and 2117 transitions. [2020-10-12 13:06:50,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2020-10-12 13:06:50,902 INFO L414 BasicCegarLoop]: Found error trace [2020-10-12 13:06:50,902 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-12 13:06:50,902 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-12 13:06:50,903 INFO L427 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-12 13:06:50,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-12 13:06:50,903 INFO L82 PathProgramCache]: Analyzing trace with hash 636307045, now seen corresponding path program 1 times [2020-10-12 13:06:50,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-12 13:06:50,904 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1152496278] [2020-10-12 13:06:50,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-12 13:06:50,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:06:50,980 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:06:51,079 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:06:51,898 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:06:51,898 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 214 [2020-10-12 13:06:51,899 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-12 13:06:51,899 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 948 [2020-10-12 13:06:51,899 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:06:51,899 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-12 13:06:51,900 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 201 [2020-10-12 13:06:51,900 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 12 [2020-10-12 13:06:51,900 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-12 13:06:51,958 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-12 13:06:51,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:06:51,961 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:06:51,970 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:06:51,970 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-12 13:06:51,970 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-12 13:06:51,971 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 9 [2020-10-12 13:06:51,971 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:06:51,971 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-12 13:06:51,971 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-12 13:06:51,971 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-12 13:06:51,972 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-12 13:06:51,993 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-12 13:06:51,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:06:51,999 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:06:52,015 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:06:52,016 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 71 [2020-10-12 13:06:52,016 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-12 13:06:52,016 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 16 [2020-10-12 13:06:52,017 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:06:52,017 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-12 13:06:52,017 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-12 13:06:52,018 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-12 13:06:52,018 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-12 13:06:52,038 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2020-10-12 13:06:52,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:06:52,072 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:06:52,147 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:06:52,147 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 120 [2020-10-12 13:06:52,148 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-12 13:06:52,148 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 88 [2020-10-12 13:06:52,148 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:06:52,148 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-12 13:06:52,148 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-12 13:06:52,149 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 114 [2020-10-12 13:06:52,149 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-12 13:06:52,217 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2020-10-12 13:06:52,217 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1152496278] [2020-10-12 13:06:52,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-12 13:06:52,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-10-12 13:06:52,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596125880] [2020-10-12 13:06:52,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-12 13:06:52,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-12 13:06:52,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-12 13:06:52,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-12 13:06:52,220 INFO L87 Difference]: Start difference. First operand 1792 states and 2117 transitions. Second operand 6 states. [2020-10-12 13:06:54,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-12 13:06:54,115 INFO L93 Difference]: Finished difference Result 3878 states and 4720 transitions. [2020-10-12 13:06:54,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-12 13:06:54,116 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 202 [2020-10-12 13:06:54,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-12 13:06:54,127 INFO L225 Difference]: With dead ends: 3878 [2020-10-12 13:06:54,127 INFO L226 Difference]: Without dead ends: 2235 [2020-10-12 13:06:54,131 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 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-10-12 13:06:54,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2235 states. [2020-10-12 13:06:54,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2235 to 2084. [2020-10-12 13:06:54,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2084 states. [2020-10-12 13:06:54,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2084 states to 2084 states and 2464 transitions. [2020-10-12 13:06:54,188 INFO L78 Accepts]: Start accepts. Automaton has 2084 states and 2464 transitions. Word has length 202 [2020-10-12 13:06:54,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-12 13:06:54,189 INFO L479 AbstractCegarLoop]: Abstraction has 2084 states and 2464 transitions. [2020-10-12 13:06:54,189 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-12 13:06:54,189 INFO L276 IsEmpty]: Start isEmpty. Operand 2084 states and 2464 transitions. [2020-10-12 13:06:54,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2020-10-12 13:06:54,194 INFO L414 BasicCegarLoop]: Found error trace [2020-10-12 13:06:54,194 INFO L422 BasicCegarLoop]: trace histogram [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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-12 13:06:54,194 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-12 13:06:54,195 INFO L427 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-12 13:06:54,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-12 13:06:54,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1770550306, now seen corresponding path program 1 times [2020-10-12 13:06:54,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-12 13:06:54,196 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [485060649] [2020-10-12 13:06:54,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-12 13:06:54,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:06:54,253 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:06:54,389 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:06:54,478 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:06:54,669 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:06:55,284 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:06:55,285 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 251 [2020-10-12 13:06:55,285 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 4 [2020-10-12 13:06:55,285 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1054 [2020-10-12 13:06:55,285 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:06:55,286 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-10-12 13:06:55,286 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 89 [2020-10-12 13:06:55,286 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 150 [2020-10-12 13:06:55,286 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-12 13:06:55,365 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-12 13:06:55,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:06:55,367 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:06:55,370 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:06:55,370 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-12 13:06:55,370 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-12 13:06:55,370 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 2 [2020-10-12 13:06:55,371 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:06:55,371 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-12 13:06:55,371 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-12 13:06:55,371 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-12 13:06:55,371 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-12 13:06:55,382 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-12 13:06:55,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:06:55,404 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:06:55,446 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:06:55,446 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 80 [2020-10-12 13:06:55,447 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-12 13:06:55,447 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 50 [2020-10-12 13:06:55,447 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:06:55,447 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-12 13:06:55,448 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-12 13:06:55,448 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 74 [2020-10-12 13:06:55,448 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-12 13:06:55,477 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-10-12 13:06:55,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:06:55,496 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:06:55,557 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:06:55,558 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 73 [2020-10-12 13:06:55,558 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-12 13:06:55,558 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 68 [2020-10-12 13:06:55,558 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:06:55,558 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-12 13:06:55,559 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-12 13:06:55,559 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 73 [2020-10-12 13:06:55,559 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-12 13:06:55,627 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2020-10-12 13:06:55,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:06:55,651 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:06:55,744 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:06:55,744 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 74 [2020-10-12 13:06:55,745 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-12 13:06:55,745 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 103 [2020-10-12 13:06:55,745 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:06:55,745 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-12 13:06:55,745 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-12 13:06:55,746 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 74 [2020-10-12 13:06:55,746 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-12 13:06:56,014 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 157 proven. 6 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2020-10-12 13:06:56,015 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [485060649] [2020-10-12 13:06:56,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-12 13:06:56,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-10-12 13:06:56,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176836471] [2020-10-12 13:06:56,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-12 13:06:56,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-12 13:06:56,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-12 13:06:56,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-12 13:06:56,017 INFO L87 Difference]: Start difference. First operand 2084 states and 2464 transitions. Second operand 8 states. [2020-10-12 13:06:58,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-12 13:06:58,712 INFO L93 Difference]: Finished difference Result 4635 states and 5618 transitions. [2020-10-12 13:06:58,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-12 13:06:58,714 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 237 [2020-10-12 13:06:58,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-12 13:06:58,726 INFO L225 Difference]: With dead ends: 4635 [2020-10-12 13:06:58,727 INFO L226 Difference]: Without dead ends: 2700 [2020-10-12 13:06:58,732 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2020-10-12 13:06:58,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2700 states. [2020-10-12 13:06:58,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2700 to 2684. [2020-10-12 13:06:58,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2684 states. [2020-10-12 13:06:58,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2684 states to 2684 states and 3155 transitions. [2020-10-12 13:06:58,816 INFO L78 Accepts]: Start accepts. Automaton has 2684 states and 3155 transitions. Word has length 237 [2020-10-12 13:06:58,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-12 13:06:58,817 INFO L479 AbstractCegarLoop]: Abstraction has 2684 states and 3155 transitions. [2020-10-12 13:06:58,817 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-12 13:06:58,817 INFO L276 IsEmpty]: Start isEmpty. Operand 2684 states and 3155 transitions. [2020-10-12 13:06:58,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2020-10-12 13:06:58,822 INFO L414 BasicCegarLoop]: Found error trace [2020-10-12 13:06:58,823 INFO L422 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-12 13:06:58,823 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-12 13:06:58,823 INFO L427 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-12 13:06:58,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-12 13:06:58,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1923835239, now seen corresponding path program 1 times [2020-10-12 13:06:58,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-12 13:06:58,824 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1573753739] [2020-10-12 13:06:58,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-12 13:06:58,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:06:58,877 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:06:59,014 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:06:59,130 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:06:59,868 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:06:59,869 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 264 [2020-10-12 13:06:59,869 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 3 [2020-10-12 13:06:59,869 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1010 [2020-10-12 13:06:59,870 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:06:59,870 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-12 13:06:59,870 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 89 [2020-10-12 13:06:59,871 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 26 [2020-10-12 13:06:59,871 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-12 13:06:59,955 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-12 13:06:59,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:06:59,958 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:06:59,960 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:06:59,961 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-12 13:06:59,961 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-12 13:06:59,961 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 3 [2020-10-12 13:06:59,962 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:06:59,962 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-12 13:06:59,963 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-12 13:06:59,963 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-12 13:06:59,963 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-12 13:06:59,979 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-12 13:06:59,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:07:00,005 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:07:00,063 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:07:00,064 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 80 [2020-10-12 13:07:00,064 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-12 13:07:00,065 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 70 [2020-10-12 13:07:00,065 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:07:00,065 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-12 13:07:00,066 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-12 13:07:00,066 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 74 [2020-10-12 13:07:00,066 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-12 13:07:00,095 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-10-12 13:07:00,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:07:00,119 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:07:00,162 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:07:00,242 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:07:00,242 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 86 [2020-10-12 13:07:00,243 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-12 13:07:00,243 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 133 [2020-10-12 13:07:00,243 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:07:00,243 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-12 13:07:00,244 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-12 13:07:00,244 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 86 [2020-10-12 13:07:00,244 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-12 13:07:00,294 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2020-10-12 13:07:00,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:07:00,320 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:07:00,345 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:07:00,345 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 74 [2020-10-12 13:07:00,345 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-12 13:07:00,345 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 35 [2020-10-12 13:07:00,346 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:07:00,346 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-12 13:07:00,346 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 71 [2020-10-12 13:07:00,346 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-12 13:07:00,346 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-12 13:07:00,420 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 98 proven. 72 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2020-10-12 13:07:00,425 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1573753739] [2020-10-12 13:07:00,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-12 13:07:00,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-12 13:07:00,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595123328] [2020-10-12 13:07:00,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-12 13:07:00,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-12 13:07:00,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-12 13:07:00,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-12 13:07:00,429 INFO L87 Difference]: Start difference. First operand 2684 states and 3155 transitions. Second operand 7 states. [2020-10-12 13:07:01,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-12 13:07:01,808 INFO L93 Difference]: Finished difference Result 5292 states and 6385 transitions. [2020-10-12 13:07:01,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-12 13:07:01,813 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 250 [2020-10-12 13:07:01,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-12 13:07:01,827 INFO L225 Difference]: With dead ends: 5292 [2020-10-12 13:07:01,827 INFO L226 Difference]: Without dead ends: 2734 [2020-10-12 13:07:01,834 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2020-10-12 13:07:01,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2734 states. [2020-10-12 13:07:01,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2734 to 2684. [2020-10-12 13:07:01,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2684 states. [2020-10-12 13:07:01,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2684 states to 2684 states and 3150 transitions. [2020-10-12 13:07:01,910 INFO L78 Accepts]: Start accepts. Automaton has 2684 states and 3150 transitions. Word has length 250 [2020-10-12 13:07:01,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-12 13:07:01,911 INFO L479 AbstractCegarLoop]: Abstraction has 2684 states and 3150 transitions. [2020-10-12 13:07:01,911 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-12 13:07:01,911 INFO L276 IsEmpty]: Start isEmpty. Operand 2684 states and 3150 transitions. [2020-10-12 13:07:01,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2020-10-12 13:07:01,917 INFO L414 BasicCegarLoop]: Found error trace [2020-10-12 13:07:01,917 INFO L422 BasicCegarLoop]: trace histogram [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, 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] [2020-10-12 13:07:01,917 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-12 13:07:01,918 INFO L427 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-12 13:07:01,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-12 13:07:01,918 INFO L82 PathProgramCache]: Analyzing trace with hash 423621477, now seen corresponding path program 1 times [2020-10-12 13:07:01,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-12 13:07:01,919 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1191177708] [2020-10-12 13:07:01,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-12 13:07:02,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:07:02,051 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:07:02,111 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:07:03,355 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:07:03,356 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 272 [2020-10-12 13:07:03,356 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-12 13:07:03,356 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1342 [2020-10-12 13:07:03,356 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:07:03,357 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-12 13:07:03,357 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 259 [2020-10-12 13:07:03,357 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 12 [2020-10-12 13:07:03,357 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-12 13:07:03,415 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-12 13:07:03,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:07:03,418 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:07:03,421 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:07:03,421 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-12 13:07:03,421 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-12 13:07:03,421 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 3 [2020-10-12 13:07:03,422 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:07:03,422 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-12 13:07:03,422 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-12 13:07:03,422 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-12 13:07:03,422 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-12 13:07:03,433 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-12 13:07:03,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:07:03,439 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:07:03,451 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:07:03,451 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 71 [2020-10-12 13:07:03,452 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-12 13:07:03,452 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 14 [2020-10-12 13:07:03,452 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:07:03,452 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-12 13:07:03,453 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-12 13:07:03,453 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-12 13:07:03,453 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-12 13:07:03,466 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2020-10-12 13:07:03,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:07:03,471 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:07:03,487 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:07:03,487 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 78 [2020-10-12 13:07:03,488 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-12 13:07:03,488 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 17 [2020-10-12 13:07:03,488 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:07:03,488 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-12 13:07:03,489 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-12 13:07:03,489 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-12 13:07:03,489 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-12 13:07:03,503 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2020-10-12 13:07:03,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:07:03,535 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:07:03,603 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:07:03,604 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 99 [2020-10-12 13:07:03,604 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-12 13:07:03,604 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 80 [2020-10-12 13:07:03,604 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:07:03,605 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-12 13:07:03,605 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-12 13:07:03,605 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 93 [2020-10-12 13:07:03,605 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-12 13:07:03,712 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 21 proven. 3 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2020-10-12 13:07:03,712 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1191177708] [2020-10-12 13:07:03,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-12 13:07:03,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-10-12 13:07:03,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365426089] [2020-10-12 13:07:03,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-12 13:07:03,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-12 13:07:03,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-12 13:07:03,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-12 13:07:03,714 INFO L87 Difference]: Start difference. First operand 2684 states and 3150 transitions. Second operand 5 states. [2020-10-12 13:07:05,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-12 13:07:05,030 INFO L93 Difference]: Finished difference Result 5801 states and 6892 transitions. [2020-10-12 13:07:05,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-12 13:07:05,031 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 258 [2020-10-12 13:07:05,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-12 13:07:05,042 INFO L225 Difference]: With dead ends: 5801 [2020-10-12 13:07:05,042 INFO L226 Difference]: Without dead ends: 2537 [2020-10-12 13:07:05,049 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-12 13:07:05,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2537 states. [2020-10-12 13:07:05,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2537 to 2533. [2020-10-12 13:07:05,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2533 states. [2020-10-12 13:07:05,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2533 states to 2533 states and 2964 transitions. [2020-10-12 13:07:05,115 INFO L78 Accepts]: Start accepts. Automaton has 2533 states and 2964 transitions. Word has length 258 [2020-10-12 13:07:05,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-12 13:07:05,116 INFO L479 AbstractCegarLoop]: Abstraction has 2533 states and 2964 transitions. [2020-10-12 13:07:05,116 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-12 13:07:05,117 INFO L276 IsEmpty]: Start isEmpty. Operand 2533 states and 2964 transitions. [2020-10-12 13:07:05,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2020-10-12 13:07:05,126 INFO L414 BasicCegarLoop]: Found error trace [2020-10-12 13:07:05,126 INFO L422 BasicCegarLoop]: trace histogram [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, 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] [2020-10-12 13:07:05,126 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-12 13:07:05,126 INFO L427 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-12 13:07:05,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-12 13:07:05,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1681862689, now seen corresponding path program 1 times [2020-10-12 13:07:05,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-12 13:07:05,127 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1417759788] [2020-10-12 13:07:05,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-12 13:07:05,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:07:05,272 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:07:05,632 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:07:05,632 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 300 [2020-10-12 13:07:05,632 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-12 13:07:05,633 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 404 [2020-10-12 13:07:05,633 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:07:05,633 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-12 13:07:05,633 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 212 [2020-10-12 13:07:05,634 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 76 [2020-10-12 13:07:05,634 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-12 13:07:05,703 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-12 13:07:05,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:07:05,706 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:07:05,707 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:07:05,708 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-12 13:07:05,708 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-12 13:07:05,709 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 2 [2020-10-12 13:07:05,709 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:07:05,709 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-12 13:07:05,709 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-12 13:07:05,710 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-12 13:07:05,710 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-12 13:07:05,721 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-12 13:07:05,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:07:05,728 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:07:05,754 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:07:05,755 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 116 [2020-10-12 13:07:05,755 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-12 13:07:05,755 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 27 [2020-10-12 13:07:05,755 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:07:05,755 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-12 13:07:05,756 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-12 13:07:05,756 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-12 13:07:05,756 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-12 13:07:05,784 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2020-10-12 13:07:05,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:07:05,806 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:07:05,852 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:07:05,852 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 86 [2020-10-12 13:07:05,853 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-12 13:07:05,853 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 54 [2020-10-12 13:07:05,853 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:07:05,853 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-12 13:07:05,853 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-12 13:07:05,854 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 80 [2020-10-12 13:07:05,854 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-12 13:07:05,880 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2020-10-12 13:07:05,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:07:05,905 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:07:05,986 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:07:05,987 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 74 [2020-10-12 13:07:05,987 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-12 13:07:05,987 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 92 [2020-10-12 13:07:05,987 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:07:05,987 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-12 13:07:05,988 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-12 13:07:05,988 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 74 [2020-10-12 13:07:05,988 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-12 13:07:06,166 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 163 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2020-10-12 13:07:06,166 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1417759788] [2020-10-12 13:07:06,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-12 13:07:06,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-12 13:07:06,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544714880] [2020-10-12 13:07:06,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-12 13:07:06,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-12 13:07:06,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-12 13:07:06,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-12 13:07:06,168 INFO L87 Difference]: Start difference. First operand 2533 states and 2964 transitions. Second operand 7 states. [2020-10-12 13:07:07,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-12 13:07:07,872 INFO L93 Difference]: Finished difference Result 5221 states and 6169 transitions. [2020-10-12 13:07:07,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-12 13:07:07,880 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 286 [2020-10-12 13:07:07,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-12 13:07:07,891 INFO L225 Difference]: With dead ends: 5221 [2020-10-12 13:07:07,891 INFO L226 Difference]: Without dead ends: 2837 [2020-10-12 13:07:07,896 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2020-10-12 13:07:07,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2837 states. [2020-10-12 13:07:07,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2837 to 2827. [2020-10-12 13:07:07,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2827 states. [2020-10-12 13:07:07,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2827 states to 2827 states and 3313 transitions. [2020-10-12 13:07:07,955 INFO L78 Accepts]: Start accepts. Automaton has 2827 states and 3313 transitions. Word has length 286 [2020-10-12 13:07:07,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-12 13:07:07,956 INFO L479 AbstractCegarLoop]: Abstraction has 2827 states and 3313 transitions. [2020-10-12 13:07:07,956 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-12 13:07:07,956 INFO L276 IsEmpty]: Start isEmpty. Operand 2827 states and 3313 transitions. [2020-10-12 13:07:07,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2020-10-12 13:07:07,964 INFO L414 BasicCegarLoop]: Found error trace [2020-10-12 13:07:07,964 INFO L422 BasicCegarLoop]: trace histogram [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, 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] [2020-10-12 13:07:07,964 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-12 13:07:07,965 INFO L427 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-12 13:07:07,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-12 13:07:07,965 INFO L82 PathProgramCache]: Analyzing trace with hash 833908213, now seen corresponding path program 1 times [2020-10-12 13:07:07,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-12 13:07:07,966 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [410627224] [2020-10-12 13:07:07,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-12 13:07:08,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:07:08,062 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:07:08,360 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:07:08,361 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 318 [2020-10-12 13:07:08,361 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-12 13:07:08,361 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 335 [2020-10-12 13:07:08,361 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:07:08,362 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-12 13:07:08,362 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 230 [2020-10-12 13:07:08,362 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 76 [2020-10-12 13:07:08,362 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-12 13:07:08,458 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-12 13:07:08,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:07:08,461 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:07:08,467 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:07:08,468 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-12 13:07:08,468 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-12 13:07:08,468 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 6 [2020-10-12 13:07:08,468 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:07:08,469 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-12 13:07:08,469 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-12 13:07:08,469 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-12 13:07:08,470 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-12 13:07:08,484 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-12 13:07:08,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:07:08,497 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:07:08,548 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:07:08,549 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 138 [2020-10-12 13:07:08,549 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-12 13:07:08,550 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 53 [2020-10-12 13:07:08,550 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:07:08,550 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-12 13:07:08,551 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-12 13:07:08,551 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-12 13:07:08,552 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-12 13:07:08,645 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2020-10-12 13:07:08,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:07:08,670 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:07:08,718 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:07:08,718 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 82 [2020-10-12 13:07:08,718 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-12 13:07:08,719 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 58 [2020-10-12 13:07:08,719 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:07:08,719 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-12 13:07:08,719 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-12 13:07:08,719 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 76 [2020-10-12 13:07:08,720 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-12 13:07:08,737 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2020-10-12 13:07:08,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:07:08,754 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:07:08,820 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:07:08,820 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 74 [2020-10-12 13:07:08,821 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-12 13:07:08,821 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 72 [2020-10-12 13:07:08,821 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:07:08,821 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-12 13:07:08,822 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-12 13:07:08,822 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 74 [2020-10-12 13:07:08,822 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-12 13:07:09,171 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 163 proven. 2 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2020-10-12 13:07:09,172 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [410627224] [2020-10-12 13:07:09,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-12 13:07:09,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-12 13:07:09,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598583690] [2020-10-12 13:07:09,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-12 13:07:09,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-12 13:07:09,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-12 13:07:09,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-12 13:07:09,178 INFO L87 Difference]: Start difference. First operand 2827 states and 3313 transitions. Second operand 7 states. [2020-10-12 13:07:11,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-12 13:07:11,035 INFO L93 Difference]: Finished difference Result 5658 states and 6651 transitions. [2020-10-12 13:07:11,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-12 13:07:11,036 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 304 [2020-10-12 13:07:11,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-12 13:07:11,056 INFO L225 Difference]: With dead ends: 5658 [2020-10-12 13:07:11,056 INFO L226 Difference]: Without dead ends: 2980 [2020-10-12 13:07:11,062 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-10-12 13:07:11,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2980 states. [2020-10-12 13:07:11,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2980 to 2970. [2020-10-12 13:07:11,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2970 states. [2020-10-12 13:07:11,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2970 states to 2970 states and 3463 transitions. [2020-10-12 13:07:11,124 INFO L78 Accepts]: Start accepts. Automaton has 2970 states and 3463 transitions. Word has length 304 [2020-10-12 13:07:11,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-12 13:07:11,125 INFO L479 AbstractCegarLoop]: Abstraction has 2970 states and 3463 transitions. [2020-10-12 13:07:11,125 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-12 13:07:11,125 INFO L276 IsEmpty]: Start isEmpty. Operand 2970 states and 3463 transitions. [2020-10-12 13:07:11,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2020-10-12 13:07:11,134 INFO L414 BasicCegarLoop]: Found error trace [2020-10-12 13:07:11,135 INFO L422 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 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] [2020-10-12 13:07:11,135 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-12 13:07:11,135 INFO L427 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-12 13:07:11,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-12 13:07:11,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1083571854, now seen corresponding path program 1 times [2020-10-12 13:07:11,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-12 13:07:11,136 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [359043586] [2020-10-12 13:07:11,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-12 13:07:11,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-12 13:07:11,225 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-10-12 13:07:11,225 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-12 13:07:11,230 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-12 13:07:11,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 01:07:11 BoogieIcfgContainer [2020-10-12 13:07:11,279 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-12 13:07:11,282 INFO L168 Benchmark]: Toolchain (without parser) took 42447.12 ms. Allocated memory was 146.8 MB in the beginning and 729.8 MB in the end (delta: 583.0 MB). Free memory was 100.6 MB in the beginning and 130.4 MB in the end (delta: -29.8 MB). Peak memory consumption was 553.2 MB. Max. memory is 7.1 GB. [2020-10-12 13:07:11,282 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 146.8 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-10-12 13:07:11,283 INFO L168 Benchmark]: CACSL2BoogieTranslator took 854.99 ms. Allocated memory was 146.8 MB in the beginning and 205.0 MB in the end (delta: 58.2 MB). Free memory was 100.4 MB in the beginning and 171.7 MB in the end (delta: -71.3 MB). Peak memory consumption was 31.4 MB. Max. memory is 7.1 GB. [2020-10-12 13:07:11,284 INFO L168 Benchmark]: Boogie Preprocessor took 154.46 ms. Allocated memory is still 205.0 MB. Free memory was 171.7 MB in the beginning and 166.7 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 7.1 GB. [2020-10-12 13:07:11,284 INFO L168 Benchmark]: RCFGBuilder took 1401.66 ms. Allocated memory was 205.0 MB in the beginning and 238.6 MB in the end (delta: 33.6 MB). Free memory was 166.7 MB in the beginning and 183.7 MB in the end (delta: -16.9 MB). Peak memory consumption was 82.9 MB. Max. memory is 7.1 GB. [2020-10-12 13:07:11,285 INFO L168 Benchmark]: TraceAbstraction took 40025.06 ms. Allocated memory was 238.6 MB in the beginning and 729.8 MB in the end (delta: 491.3 MB). Free memory was 182.2 MB in the beginning and 130.4 MB in the end (delta: 51.8 MB). Peak memory consumption was 543.1 MB. Max. memory is 7.1 GB. [2020-10-12 13:07:11,289 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 146.8 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 854.99 ms. Allocated memory was 146.8 MB in the beginning and 205.0 MB in the end (delta: 58.2 MB). Free memory was 100.4 MB in the beginning and 171.7 MB in the end (delta: -71.3 MB). Peak memory consumption was 31.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 154.46 ms. Allocated memory is still 205.0 MB. Free memory was 171.7 MB in the beginning and 166.7 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1401.66 ms. Allocated memory was 205.0 MB in the beginning and 238.6 MB in the end (delta: 33.6 MB). Free memory was 166.7 MB in the beginning and 183.7 MB in the end (delta: -16.9 MB). Peak memory consumption was 82.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 40025.06 ms. Allocated memory was 238.6 MB in the beginning and 729.8 MB in the end (delta: 491.3 MB). Free memory was 182.2 MB in the beginning and 130.4 MB in the end (delta: 51.8 MB). Peak memory consumption was 543.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 25]: 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 FALSE !(((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0))) [L430] COND FALSE !((((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 6)) && (a19==10))) && (a12==0))) [L436] COND FALSE !(((a19==9) && ((((input == 4) && (( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 ))) && (a12==0)) && (a4==14)))) [L442] COND FALSE !((((a19==10) && ((a12==0) && ((((a10==1) && a1 <= -13 ) || (( ((38 < a1) && (218 >= a1)) && (a10==0)) || ((a10==0) && 218 < a1 ))) && (input == 3)))) && (a4==14))) [L448] COND FALSE !(((a19==9) && (((a4==14) && ((((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4))) && (input == 5))) && (a12==0)))) [L454] COND FALSE !((((a12==0) && ((((input == 5) && (a19==10)) && ((38 < a1) && (218 >= a1)) ) && (a4==14))) && (a10==1))) [L460] COND FALSE !(((a19==9) && ((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3)) && (a10==1)) && (a12==0))))) [L465] COND FALSE !(((a10==0) && ((a12==0) && ((((input == 5) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a4==14))))) [L471] COND FALSE !(( 218 < a1 && (((((input == 3) && (a10==1)) && (a12==0)) && (a4==14)) && (a19==10)))) [L476] COND FALSE !((((a12==0) && ((a19==9) && (((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a4==14)))) && (a10==3))) [L481] COND FALSE !((((((a4==14) && ( ((38 < a1) && (218 >= a1)) && (input == 2))) && (a12==0)) && (a10==1)) && (a19==10))) [L487] COND FALSE !((((a19==10) && ((a10==1) && ((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (input == 5))))) && (a4==14))) [L493] COND FALSE !(((((a10==1) && (((input == 5) && 218 < a1 ) && (a4==14))) && (a19==10)) && (a12==0))) [L499] COND FALSE !((((a4==14) && ((a19==9) && ((input == 2) && (((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 ))))) && (a12==0))) [L504] COND FALSE !((((a4==14) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 2))) && (a12==0))) && (a10==4))) [L509] COND FALSE !(((a4==14) && (((a19==9) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 6)) && (a10==3))) && (a12==0)))) [L514] COND FALSE !((((a4==14) && ((((input == 6) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a12==0))) && (a10==0))) [L517] COND FALSE !(((a12==0) && ((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 2)) && (a19==10))))) [L523] COND FALSE !((((a12==0) && ((a19==9) && ((a10==2) && ((input == 6) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))))) && (a4==14))) [L526] COND FALSE !(((a4==14) && ((a19==9) && ((a12==0) && (((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)))))) [L529] COND FALSE !(((a19==9) && (((a10==1) && ((a12==0) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )))) && (a4==14)))) [L534] COND FALSE !(((a19==9) && ((a4==14) && ((a10==1) && (((input == 5) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a12==0)))))) [L540] COND TRUE ((a12==0) && (((((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a19==9)) && (a4==14)) && (a10==0))) [L541] a1 = (((((a1 + -272193) - -47605) - -570122) % 89)+ 110) [L542] a10 = 1 [L544] 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 TRUE ((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)))))) [L361] a1 = ((((a1 - 46038) + -455425) * 10)/ 9) [L362] a19 = 10 [L364] return 24; [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 TRUE ((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0))) [L226] a1 = (((((a1 - 0) * 9)/ 10) % 25)- -12) [L227] a10 = 2 [L228] a19 = 8 [L230] 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 TRUE (((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8)) [L25] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 215 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 39.8s, OverallIterations: 13, TraceHistogramMax: 4, AutomataDifference: 22.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 340 SDtfs, 4303 SDslu, 382 SDs, 0 SdLazy, 10618 SolverSat, 1392 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 16.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 192 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2970occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 12 MinimizatonAttempts, 746 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 15.0s InterpolantComputationTime, 2509 NumberOfCodeBlocks, 2509 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2172 ConstructedInterpolants, 0 QuantifiedInterpolants, 1673789 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 2 PerfectInterpolantSequences, 1309/1478 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...