/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=SMALLESTAMONGWIDE --traceabstraction.additional.smt.options tolerance=0.2 --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_label41.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-adbd35c [2020-10-14 20:53:46,443 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-14 20:53:46,446 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-14 20:53:46,489 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-14 20:53:46,489 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-14 20:53:46,497 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-14 20:53:46,499 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-14 20:53:46,503 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-14 20:53:46,505 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-14 20:53:46,509 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-14 20:53:46,510 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-14 20:53:46,511 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-14 20:53:46,511 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-14 20:53:46,514 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-14 20:53:46,517 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-14 20:53:46,518 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-14 20:53:46,520 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-14 20:53:46,521 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-14 20:53:46,522 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-14 20:53:46,532 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-14 20:53:46,534 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-14 20:53:46,535 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-14 20:53:46,536 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-14 20:53:46,537 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-14 20:53:46,548 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-14 20:53:46,549 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-14 20:53:46,552 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-14 20:53:46,553 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-14 20:53:46,554 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-14 20:53:46,558 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-14 20:53:46,558 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-14 20:53:46,559 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-14 20:53:46,559 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-14 20:53:46,563 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-14 20:53:46,564 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-14 20:53:46,565 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-14 20:53:46,565 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-14 20:53:46,566 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-14 20:53:46,568 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-14 20:53:46,569 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-14 20:53:46,570 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-14 20:53:46,570 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-14 20:53:46,614 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-14 20:53:46,614 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-14 20:53:46,615 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-14 20:53:46,616 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-14 20:53:46,616 INFO L138 SettingsManager]: * Use SBE=true [2020-10-14 20:53:46,616 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-14 20:53:46,616 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-14 20:53:46,616 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-14 20:53:46,617 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-14 20:53:46,617 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-14 20:53:46,618 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-14 20:53:46,619 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-14 20:53:46,619 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-14 20:53:46,619 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-14 20:53:46,620 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-14 20:53:46,620 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-14 20:53:46,620 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-14 20:53:46,620 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-14 20:53:46,621 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-14 20:53:46,621 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-14 20:53:46,621 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-14 20:53:46,622 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-14 20:53:46,622 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-14 20:53:46,622 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-14 20:53:46,622 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-14 20:53:46,622 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-14 20:53:46,623 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-14 20:53:46,623 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-14 20:53:46,623 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-14 20:53:46,623 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=SMALLESTAMONGWIDE;tolerance=0.2;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=SMALLESTAMONGWIDE;tolerance=0.2;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=SMALLESTAMONGWIDE;tolerance=0.2;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=SMALLESTAMONGWIDE;tolerance=0.2;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=SMALLESTAMONGWIDE;tolerance=0.2;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=SMALLESTAMONGWIDE;tolerance=0.2;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=SMALLESTAMONGWIDE;tolerance=0.2;log-additional-information=true;unknown-allowed=true; [2020-10-14 20:53:46,928 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-14 20:53:46,951 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-14 20:53:46,958 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-14 20:53:46,960 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-14 20:53:46,960 INFO L275 PluginConnector]: CDTParser initialized [2020-10-14 20:53:46,961 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label41.c [2020-10-14 20:53:47,029 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/5acf9b6ca/cd48a879d5594d48b01ca1c68916ad6f/FLAG2d2bd546b [2020-10-14 20:53:47,608 INFO L306 CDTParser]: Found 1 translation units. [2020-10-14 20:53:47,609 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/eca-rers2012/Problem10_label41.c [2020-10-14 20:53:47,628 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/5acf9b6ca/cd48a879d5594d48b01ca1c68916ad6f/FLAG2d2bd546b [2020-10-14 20:53:47,879 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/5acf9b6ca/cd48a879d5594d48b01ca1c68916ad6f [2020-10-14 20:53:47,889 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-14 20:53:47,892 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-14 20:53:47,893 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-14 20:53:47,893 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-14 20:53:47,897 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-14 20:53:47,898 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 08:53:47" (1/1) ... [2020-10-14 20:53:47,901 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@693e2903 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:53:47, skipping insertion in model container [2020-10-14 20:53:47,901 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 08:53:47" (1/1) ... [2020-10-14 20:53:47,909 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-14 20:53:47,957 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-14 20:53:48,390 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-14 20:53:48,399 INFO L203 MainTranslator]: Completed pre-run [2020-10-14 20:53:48,627 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-14 20:53:48,646 INFO L208 MainTranslator]: Completed translation [2020-10-14 20:53:48,646 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:53:48 WrapperNode [2020-10-14 20:53:48,647 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-14 20:53:48,647 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-14 20:53:48,648 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-14 20:53:48,648 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-14 20:53:48,662 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:53:48" (1/1) ... [2020-10-14 20:53:48,662 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:53:48" (1/1) ... [2020-10-14 20:53:48,681 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:53:48" (1/1) ... [2020-10-14 20:53:48,682 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:53:48" (1/1) ... [2020-10-14 20:53:48,721 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:53:48" (1/1) ... [2020-10-14 20:53:48,738 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:53:48" (1/1) ... [2020-10-14 20:53:48,746 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:53:48" (1/1) ... [2020-10-14 20:53:48,759 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-14 20:53:48,760 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-14 20:53:48,760 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-14 20:53:48,760 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-14 20:53:48,761 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:53:48" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-14 20:53:48,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-14 20:53:48,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-14 20:53:48,860 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2020-10-14 20:53:48,860 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-14 20:53:48,860 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2020-10-14 20:53:48,860 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-10-14 20:53:48,860 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-14 20:53:48,861 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-10-14 20:53:48,861 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-14 20:53:48,861 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-14 20:53:48,861 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-14 20:53:50,239 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-14 20:53:50,239 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-10-14 20:53:50,245 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:53:50 BoogieIcfgContainer [2020-10-14 20:53:50,246 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-14 20:53:50,247 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-14 20:53:50,248 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-14 20:53:50,251 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-14 20:53:50,251 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 08:53:47" (1/3) ... [2020-10-14 20:53:50,252 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bdc90dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 08:53:50, skipping insertion in model container [2020-10-14 20:53:50,252 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:53:48" (2/3) ... [2020-10-14 20:53:50,253 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bdc90dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 08:53:50, skipping insertion in model container [2020-10-14 20:53:50,253 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:53:50" (3/3) ... [2020-10-14 20:53:50,255 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem10_label41.c [2020-10-14 20:53:50,267 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-14 20:53:50,275 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-14 20:53:50,291 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-14 20:53:50,318 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-14 20:53:50,319 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-14 20:53:50,319 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-14 20:53:50,319 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-14 20:53:50,319 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-14 20:53:50,320 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-14 20:53:50,320 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-14 20:53:50,320 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-14 20:53:50,345 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states. [2020-10-14 20:53:50,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-14 20:53:50,353 INFO L414 BasicCegarLoop]: Found error trace [2020-10-14 20:53:50,355 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-14 20:53:50,355 INFO L427 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-14 20:53:50,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-14 20:53:50,363 INFO L82 PathProgramCache]: Analyzing trace with hash -354743369, now seen corresponding path program 1 times [2020-10-14 20:53:50,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-14 20:53:50,373 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [696651499] [2020-10-14 20:53:50,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-14 20:53:50,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:53:50,606 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:53:50,860 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:53:50,860 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 34 [2020-10-14 20:53:50,860 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 20:53:50,861 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 329 [2020-10-14 20:53:50,863 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:53:50,864 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:53:50,864 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-10-14 20:53:50,864 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 5 [2020-10-14 20:53:50,864 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 28 [2020-10-14 20:53:50,865 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 3 [2020-10-14 20:53:50,994 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-14 20:53:51,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:53:51,010 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:53:51,028 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:53:51,028 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-14 20:53:51,029 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 20:53:51,029 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 20 [2020-10-14 20:53:51,029 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:53:51,029 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:53:51,030 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-14 20:53:51,030 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 20:53:51,030 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 2 [2020-10-14 20:53:51,030 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 20:53:51,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-14 20:53:51,045 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [696651499] [2020-10-14 20:53:51,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-14 20:53:51,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-14 20:53:51,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886202356] [2020-10-14 20:53:51,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-14 20:53:51,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-14 20:53:51,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-14 20:53:51,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-14 20:53:51,072 INFO L87 Difference]: Start difference. First operand 215 states. Second operand 4 states. [2020-10-14 20:53:52,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-14 20:53:52,572 INFO L93 Difference]: Finished difference Result 581 states and 1007 transitions. [2020-10-14 20:53:52,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-14 20:53:52,574 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2020-10-14 20:53:52,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-14 20:53:52,592 INFO L225 Difference]: With dead ends: 581 [2020-10-14 20:53:52,592 INFO L226 Difference]: Without dead ends: 302 [2020-10-14 20:53:52,600 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-14 20:53:52,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2020-10-14 20:53:52,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 296. [2020-10-14 20:53:52,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2020-10-14 20:53:52,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 423 transitions. [2020-10-14 20:53:52,685 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 423 transitions. Word has length 26 [2020-10-14 20:53:52,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-14 20:53:52,686 INFO L479 AbstractCegarLoop]: Abstraction has 296 states and 423 transitions. [2020-10-14 20:53:52,686 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-14 20:53:52,687 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 423 transitions. [2020-10-14 20:53:52,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-10-14 20:53:52,691 INFO L414 BasicCegarLoop]: Found error trace [2020-10-14 20:53:52,692 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-14 20:53:52,692 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-14 20:53:52,692 INFO L427 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-14 20:53:52,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-14 20:53:52,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1197426710, now seen corresponding path program 1 times [2020-10-14 20:53:52,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-14 20:53:52,694 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [906418080] [2020-10-14 20:53:52,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-14 20:53:52,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:53:52,759 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:53:53,010 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:53:53,426 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:53:53,511 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:53:53,512 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 108 [2020-10-14 20:53:53,512 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 3 [2020-10-14 20:53:53,512 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 775 [2020-10-14 20:53:53,513 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:53:53,514 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:53:53,514 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 8 [2020-10-14 20:53:53,515 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 5 [2020-10-14 20:53:53,515 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 102 [2020-10-14 20:53:53,515 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 2 [2020-10-14 20:53:53,585 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-14 20:53:53,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:53:53,592 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:53:53,600 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:53:53,601 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-14 20:53:53,601 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 20:53:53,601 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 9 [2020-10-14 20:53:53,602 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:53:53,602 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:53:53,602 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-14 20:53:53,602 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 20:53:53,603 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 2 [2020-10-14 20:53:53,603 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 20:53:53,616 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-14 20:53:53,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:53:53,650 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:53:53,679 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:53:53,832 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:53:53,832 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 73 [2020-10-14 20:53:53,833 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-14 20:53:53,833 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 195 [2020-10-14 20:53:53,833 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:53:53,834 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:53:53,834 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-14 20:53:53,834 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-14 20:53:53,834 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 73 [2020-10-14 20:53:53,835 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 20:53:53,902 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-14 20:53:53,903 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [906418080] [2020-10-14 20:53:53,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-14 20:53:53,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-10-14 20:53:53,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142904098] [2020-10-14 20:53:53,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-14 20:53:53,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-14 20:53:53,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-14 20:53:53,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-14 20:53:53,908 INFO L87 Difference]: Start difference. First operand 296 states and 423 transitions. Second operand 6 states. [2020-10-14 20:53:55,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-14 20:53:55,175 INFO L93 Difference]: Finished difference Result 886 states and 1290 transitions. [2020-10-14 20:53:55,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-14 20:53:55,175 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2020-10-14 20:53:55,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-14 20:53:55,181 INFO L225 Difference]: With dead ends: 886 [2020-10-14 20:53:55,181 INFO L226 Difference]: Without dead ends: 596 [2020-10-14 20:53:55,183 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-14 20:53:55,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2020-10-14 20:53:55,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 590. [2020-10-14 20:53:55,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2020-10-14 20:53:55,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 824 transitions. [2020-10-14 20:53:55,224 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 824 transitions. Word has length 98 [2020-10-14 20:53:55,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-14 20:53:55,225 INFO L479 AbstractCegarLoop]: Abstraction has 590 states and 824 transitions. [2020-10-14 20:53:55,225 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-14 20:53:55,226 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 824 transitions. [2020-10-14 20:53:55,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-10-14 20:53:55,230 INFO L414 BasicCegarLoop]: Found error trace [2020-10-14 20:53:55,230 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-14 20:53:55,231 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-14 20:53:55,231 INFO L427 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-14 20:53:55,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-14 20:53:55,231 INFO L82 PathProgramCache]: Analyzing trace with hash -361920971, now seen corresponding path program 1 times [2020-10-14 20:53:55,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-14 20:53:55,232 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2082157227] [2020-10-14 20:53:55,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-14 20:53:55,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:53:55,289 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:53:55,605 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:53:55,606 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 115 [2020-10-14 20:53:55,606 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 20:53:55,606 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 337 [2020-10-14 20:53:55,607 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:53:55,607 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:53:55,607 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-14 20:53:55,608 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 89 [2020-10-14 20:53:55,608 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 25 [2020-10-14 20:53:55,608 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 20:53:55,694 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-14 20:53:55,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:53:55,697 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:53:55,699 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:53:55,700 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-14 20:53:55,700 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 20:53:55,700 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 3 [2020-10-14 20:53:55,700 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:53:55,701 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:53:55,701 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-14 20:53:55,702 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 20:53:55,703 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-14 20:53:55,703 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 2 [2020-10-14 20:53:55,716 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-14 20:53:55,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:53:55,749 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:53:55,827 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:53:55,827 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 80 [2020-10-14 20:53:55,828 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 20:53:55,828 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 91 [2020-10-14 20:53:55,828 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:53:55,828 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:53:55,829 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-14 20:53:55,829 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 20:53:55,829 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 74 [2020-10-14 20:53:55,829 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 20:53:55,884 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-14 20:53:55,885 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2082157227] [2020-10-14 20:53:55,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-14 20:53:55,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-10-14 20:53:55,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35431970] [2020-10-14 20:53:55,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-14 20:53:55,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-14 20:53:55,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-14 20:53:55,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-14 20:53:55,888 INFO L87 Difference]: Start difference. First operand 590 states and 824 transitions. Second operand 5 states. [2020-10-14 20:53:57,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-14 20:53:57,183 INFO L93 Difference]: Finished difference Result 1762 states and 2524 transitions. [2020-10-14 20:53:57,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-14 20:53:57,187 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2020-10-14 20:53:57,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-14 20:53:57,195 INFO L225 Difference]: With dead ends: 1762 [2020-10-14 20:53:57,196 INFO L226 Difference]: Without dead ends: 1178 [2020-10-14 20:53:57,198 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-14 20:53:57,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2020-10-14 20:53:57,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 1174. [2020-10-14 20:53:57,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1174 states. [2020-10-14 20:53:57,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 1174 states and 1534 transitions. [2020-10-14 20:53:57,262 INFO L78 Accepts]: Start accepts. Automaton has 1174 states and 1534 transitions. Word has length 105 [2020-10-14 20:53:57,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-14 20:53:57,262 INFO L479 AbstractCegarLoop]: Abstraction has 1174 states and 1534 transitions. [2020-10-14 20:53:57,263 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-14 20:53:57,263 INFO L276 IsEmpty]: Start isEmpty. Operand 1174 states and 1534 transitions. [2020-10-14 20:53:57,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2020-10-14 20:53:57,276 INFO L414 BasicCegarLoop]: Found error trace [2020-10-14 20:53:57,276 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-14 20:53:57,279 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-14 20:53:57,280 INFO L427 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-14 20:53:57,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-14 20:53:57,281 INFO L82 PathProgramCache]: Analyzing trace with hash -497207486, now seen corresponding path program 1 times [2020-10-14 20:53:57,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-14 20:53:57,281 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1154541339] [2020-10-14 20:53:57,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-14 20:53:57,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:53:57,357 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:53:57,557 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:53:57,687 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:53:58,265 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:53:58,266 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 134 [2020-10-14 20:53:58,266 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 3 [2020-10-14 20:53:58,266 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 936 [2020-10-14 20:53:58,266 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:53:58,267 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:53:58,267 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-10-14 20:53:58,267 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 5 [2020-10-14 20:53:58,267 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 104 [2020-10-14 20:53:58,268 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 20:53:58,331 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-14 20:53:58,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:53:58,336 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:53:58,340 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:53:58,340 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-14 20:53:58,340 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 20:53:58,341 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 5 [2020-10-14 20:53:58,341 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:53:58,341 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:53:58,341 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-14 20:53:58,342 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 20:53:58,342 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 2 [2020-10-14 20:53:58,342 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 20:53:58,357 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-14 20:53:58,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:53:58,392 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:53:58,524 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:53:58,525 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 99 [2020-10-14 20:53:58,525 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 20:53:58,525 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 145 [2020-10-14 20:53:58,526 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:53:58,526 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:53:58,526 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-14 20:53:58,526 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-14 20:53:58,527 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 99 [2020-10-14 20:53:58,527 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 20:53:58,719 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-14 20:53:58,721 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1154541339] [2020-10-14 20:53:58,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-14 20:53:58,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-14 20:53:58,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026234212] [2020-10-14 20:53:58,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-14 20:53:58,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-14 20:53:58,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-14 20:53:58,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-14 20:53:58,728 INFO L87 Difference]: Start difference. First operand 1174 states and 1534 transitions. Second operand 7 states. [2020-10-14 20:54:00,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-14 20:54:00,180 INFO L93 Difference]: Finished difference Result 2956 states and 4064 transitions. [2020-10-14 20:54:00,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-14 20:54:00,183 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 124 [2020-10-14 20:54:00,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-14 20:54:00,196 INFO L225 Difference]: With dead ends: 2956 [2020-10-14 20:54:00,196 INFO L226 Difference]: Without dead ends: 1788 [2020-10-14 20:54:00,200 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-10-14 20:54:00,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1788 states. [2020-10-14 20:54:00,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1788 to 1625. [2020-10-14 20:54:00,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1625 states. [2020-10-14 20:54:00,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1625 states to 1625 states and 2086 transitions. [2020-10-14 20:54:00,271 INFO L78 Accepts]: Start accepts. Automaton has 1625 states and 2086 transitions. Word has length 124 [2020-10-14 20:54:00,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-14 20:54:00,272 INFO L479 AbstractCegarLoop]: Abstraction has 1625 states and 2086 transitions. [2020-10-14 20:54:00,272 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-14 20:54:00,273 INFO L276 IsEmpty]: Start isEmpty. Operand 1625 states and 2086 transitions. [2020-10-14 20:54:00,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2020-10-14 20:54:00,276 INFO L414 BasicCegarLoop]: Found error trace [2020-10-14 20:54:00,276 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-14 20:54:00,277 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-14 20:54:00,277 INFO L427 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-14 20:54:00,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-14 20:54:00,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1343129801, now seen corresponding path program 1 times [2020-10-14 20:54:00,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-14 20:54:00,278 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1598816863] [2020-10-14 20:54:00,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-14 20:54:00,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:54:00,383 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:54:00,849 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:54:00,850 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 153 [2020-10-14 20:54:00,850 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 20:54:00,850 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 522 [2020-10-14 20:54:00,850 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:54:00,851 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:54:00,851 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-10-14 20:54:00,851 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 5 [2020-10-14 20:54:00,851 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 123 [2020-10-14 20:54:00,852 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 20:54:00,916 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-14 20:54:00,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:54:00,921 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:54:00,934 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:54:00,935 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-14 20:54:00,935 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 20:54:00,935 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 14 [2020-10-14 20:54:00,935 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:54:00,936 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:54:00,936 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-14 20:54:00,936 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 20:54:00,936 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 2 [2020-10-14 20:54:00,937 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 20:54:00,952 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-14 20:54:00,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:54:01,012 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:54:01,202 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:54:01,203 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 118 [2020-10-14 20:54:01,203 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 20:54:01,203 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 211 [2020-10-14 20:54:01,204 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:54:01,204 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:54:01,204 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-14 20:54:01,205 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-14 20:54:01,205 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 118 [2020-10-14 20:54:01,205 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 20:54:01,322 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-14 20:54:01,322 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1598816863] [2020-10-14 20:54:01,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-14 20:54:01,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-14 20:54:01,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361900710] [2020-10-14 20:54:01,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-14 20:54:01,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-14 20:54:01,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-14 20:54:01,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-14 20:54:01,327 INFO L87 Difference]: Start difference. First operand 1625 states and 2086 transitions. Second operand 7 states. [2020-10-14 20:54:02,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-14 20:54:02,634 INFO L93 Difference]: Finished difference Result 3409 states and 4381 transitions. [2020-10-14 20:54:02,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-14 20:54:02,635 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 143 [2020-10-14 20:54:02,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-14 20:54:02,644 INFO L225 Difference]: With dead ends: 3409 [2020-10-14 20:54:02,644 INFO L226 Difference]: Without dead ends: 1790 [2020-10-14 20:54:02,648 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2020-10-14 20:54:02,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1790 states. [2020-10-14 20:54:02,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1790 to 1786. [2020-10-14 20:54:02,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1786 states. [2020-10-14 20:54:02,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1786 states to 1786 states and 2283 transitions. [2020-10-14 20:54:02,699 INFO L78 Accepts]: Start accepts. Automaton has 1786 states and 2283 transitions. Word has length 143 [2020-10-14 20:54:02,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-14 20:54:02,700 INFO L479 AbstractCegarLoop]: Abstraction has 1786 states and 2283 transitions. [2020-10-14 20:54:02,700 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-14 20:54:02,700 INFO L276 IsEmpty]: Start isEmpty. Operand 1786 states and 2283 transitions. [2020-10-14 20:54:02,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2020-10-14 20:54:02,703 INFO L414 BasicCegarLoop]: Found error trace [2020-10-14 20:54:02,704 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-14 20:54:02,704 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-14 20:54:02,704 INFO L427 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-14 20:54:02,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-14 20:54:02,705 INFO L82 PathProgramCache]: Analyzing trace with hash 2012326051, now seen corresponding path program 1 times [2020-10-14 20:54:02,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-14 20:54:02,705 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1790623512] [2020-10-14 20:54:02,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-14 20:54:02,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:54:02,770 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:54:02,864 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:54:03,130 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:54:03,383 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:54:03,898 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:54:03,898 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 190 [2020-10-14 20:54:03,898 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 4 [2020-10-14 20:54:03,898 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1157 [2020-10-14 20:54:03,899 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:54:03,899 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:54:03,899 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-14 20:54:03,899 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 89 [2020-10-14 20:54:03,900 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 76 [2020-10-14 20:54:03,900 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 20:54:03,953 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-14 20:54:03,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:54:03,956 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:54:03,958 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:54:03,958 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-14 20:54:03,958 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 20:54:03,959 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 2 [2020-10-14 20:54:03,959 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:54:03,959 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:54:03,959 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-14 20:54:03,959 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 20:54:03,960 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-14 20:54:03,960 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-14 20:54:03,971 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-14 20:54:03,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:54:03,996 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:54:04,042 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:54:04,042 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 80 [2020-10-14 20:54:04,042 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 20:54:04,042 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 54 [2020-10-14 20:54:04,043 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:54:04,043 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:54:04,043 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-14 20:54:04,043 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 20:54:04,043 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 74 [2020-10-14 20:54:04,044 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 20:54:04,066 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-10-14 20:54:04,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:54:04,093 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:54:04,216 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:54:04,216 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 74 [2020-10-14 20:54:04,217 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 20:54:04,217 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 132 [2020-10-14 20:54:04,217 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:54:04,217 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:54:04,218 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-14 20:54:04,218 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-14 20:54:04,218 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 74 [2020-10-14 20:54:04,218 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 20:54:04,301 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 108 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-14 20:54:04,301 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1790623512] [2020-10-14 20:54:04,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-14 20:54:04,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-14 20:54:04,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163673899] [2020-10-14 20:54:04,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-14 20:54:04,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-14 20:54:04,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-14 20:54:04,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-14 20:54:04,305 INFO L87 Difference]: Start difference. First operand 1786 states and 2283 transitions. Second operand 7 states. [2020-10-14 20:54:05,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-14 20:54:05,995 INFO L93 Difference]: Finished difference Result 4169 states and 6166 transitions. [2020-10-14 20:54:05,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-14 20:54:05,995 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 178 [2020-10-14 20:54:05,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-14 20:54:06,016 INFO L225 Difference]: With dead ends: 4169 [2020-10-14 20:54:06,016 INFO L226 Difference]: Without dead ends: 2224 [2020-10-14 20:54:06,025 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2020-10-14 20:54:06,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2224 states. [2020-10-14 20:54:06,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2224 to 1943. [2020-10-14 20:54:06,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1943 states. [2020-10-14 20:54:06,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1943 states to 1943 states and 2416 transitions. [2020-10-14 20:54:06,113 INFO L78 Accepts]: Start accepts. Automaton has 1943 states and 2416 transitions. Word has length 178 [2020-10-14 20:54:06,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-14 20:54:06,114 INFO L479 AbstractCegarLoop]: Abstraction has 1943 states and 2416 transitions. [2020-10-14 20:54:06,114 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-14 20:54:06,114 INFO L276 IsEmpty]: Start isEmpty. Operand 1943 states and 2416 transitions. [2020-10-14 20:54:06,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2020-10-14 20:54:06,117 INFO L414 BasicCegarLoop]: Found error trace [2020-10-14 20:54:06,117 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-14 20:54:06,118 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-14 20:54:06,118 INFO L427 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-14 20:54:06,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-14 20:54:06,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1476301307, now seen corresponding path program 1 times [2020-10-14 20:54:06,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-14 20:54:06,119 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [103783077] [2020-10-14 20:54:06,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-14 20:54:06,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:54:06,189 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:54:06,348 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:54:06,633 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:54:06,981 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:54:06,981 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 206 [2020-10-14 20:54:06,981 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 3 [2020-10-14 20:54:06,981 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 819 [2020-10-14 20:54:06,982 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:54:06,982 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:54:06,982 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-14 20:54:06,982 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 80 [2020-10-14 20:54:06,982 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 101 [2020-10-14 20:54:06,983 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 20:54:07,029 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-14 20:54:07,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:54:07,031 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:54:07,034 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:54:07,034 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-14 20:54:07,034 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 20:54:07,034 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 2 [2020-10-14 20:54:07,034 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:54:07,035 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:54:07,035 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-14 20:54:07,035 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 20:54:07,035 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-14 20:54:07,035 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 20:54:07,046 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-14 20:54:07,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:54:07,064 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:54:07,100 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:54:07,100 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 71 [2020-10-14 20:54:07,101 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 20:54:07,101 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 42 [2020-10-14 20:54:07,101 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:54:07,101 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:54:07,101 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-14 20:54:07,102 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 20:54:07,102 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 65 [2020-10-14 20:54:07,102 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-14 20:54:07,119 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2020-10-14 20:54:07,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:54:07,145 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:54:07,246 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:54:07,247 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 99 [2020-10-14 20:54:07,247 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 20:54:07,247 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 112 [2020-10-14 20:54:07,247 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:54:07,248 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:54:07,248 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-14 20:54:07,248 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-14 20:54:07,248 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 99 [2020-10-14 20:54:07,248 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-14 20:54:07,389 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 105 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-14 20:54:07,390 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [103783077] [2020-10-14 20:54:07,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-14 20:54:07,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-14 20:54:07,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566819573] [2020-10-14 20:54:07,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-14 20:54:07,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-14 20:54:07,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-14 20:54:07,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-14 20:54:07,392 INFO L87 Difference]: Start difference. First operand 1943 states and 2416 transitions. Second operand 7 states. [2020-10-14 20:54:08,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-14 20:54:09,001 INFO L93 Difference]: Finished difference Result 4472 states and 5763 transitions. [2020-10-14 20:54:09,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-14 20:54:09,002 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 194 [2020-10-14 20:54:09,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-14 20:54:09,020 INFO L225 Difference]: With dead ends: 4472 [2020-10-14 20:54:09,020 INFO L226 Difference]: Without dead ends: 2531 [2020-10-14 20:54:09,030 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2020-10-14 20:54:09,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2531 states. [2020-10-14 20:54:09,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2531 to 2090. [2020-10-14 20:54:09,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2090 states. [2020-10-14 20:54:09,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2090 states to 2090 states and 2576 transitions. [2020-10-14 20:54:09,110 INFO L78 Accepts]: Start accepts. Automaton has 2090 states and 2576 transitions. Word has length 194 [2020-10-14 20:54:09,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-14 20:54:09,111 INFO L479 AbstractCegarLoop]: Abstraction has 2090 states and 2576 transitions. [2020-10-14 20:54:09,111 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-14 20:54:09,111 INFO L276 IsEmpty]: Start isEmpty. Operand 2090 states and 2576 transitions. [2020-10-14 20:54:09,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2020-10-14 20:54:09,114 INFO L414 BasicCegarLoop]: Found error trace [2020-10-14 20:54:09,114 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-14 20:54:09,115 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-14 20:54:09,115 INFO L427 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-14 20:54:09,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-14 20:54:09,115 INFO L82 PathProgramCache]: Analyzing trace with hash -498295095, now seen corresponding path program 1 times [2020-10-14 20:54:09,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-14 20:54:09,116 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [910868248] [2020-10-14 20:54:09,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-14 20:54:09,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:54:09,192 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:54:09,393 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:54:09,692 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:54:09,693 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 220 [2020-10-14 20:54:09,694 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-14 20:54:09,694 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 532 [2020-10-14 20:54:09,694 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:54:09,694 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:54:09,694 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-14 20:54:09,695 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 194 [2020-10-14 20:54:09,695 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 25 [2020-10-14 20:54:09,695 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 20:54:09,764 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-14 20:54:09,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:54:09,767 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:54:09,770 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:54:09,770 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-14 20:54:09,770 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 20:54:09,771 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 3 [2020-10-14 20:54:09,771 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:54:09,771 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:54:09,771 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-14 20:54:09,771 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 20:54:09,772 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-14 20:54:09,772 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 20:54:09,783 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-14 20:54:09,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:54:09,788 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:54:09,801 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:54:09,801 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 71 [2020-10-14 20:54:09,802 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 20:54:09,802 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 13 [2020-10-14 20:54:09,802 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:54:09,802 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:54:09,802 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-14 20:54:09,803 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 20:54:09,803 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-14 20:54:09,803 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-14 20:54:09,818 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2020-10-14 20:54:09,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:54:09,854 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:54:09,921 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:54:09,921 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 113 [2020-10-14 20:54:09,922 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 20:54:09,922 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 82 [2020-10-14 20:54:09,922 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:54:09,922 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:54:09,922 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-14 20:54:09,923 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 20:54:09,923 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 107 [2020-10-14 20:54:09,923 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-14 20:54:10,041 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 39 proven. 2 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2020-10-14 20:54:10,042 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [910868248] [2020-10-14 20:54:10,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-14 20:54:10,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-10-14 20:54:10,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367668918] [2020-10-14 20:54:10,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-14 20:54:10,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-14 20:54:10,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-14 20:54:10,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-14 20:54:10,044 INFO L87 Difference]: Start difference. First operand 2090 states and 2576 transitions. Second operand 5 states. [2020-10-14 20:54:11,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-14 20:54:11,452 INFO L93 Difference]: Finished difference Result 4903 states and 6079 transitions. [2020-10-14 20:54:11,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-14 20:54:11,453 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 208 [2020-10-14 20:54:11,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-14 20:54:11,468 INFO L225 Difference]: With dead ends: 4903 [2020-10-14 20:54:11,468 INFO L226 Difference]: Without dead ends: 2815 [2020-10-14 20:54:11,474 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-14 20:54:11,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2815 states. [2020-10-14 20:54:11,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2815 to 2813. [2020-10-14 20:54:11,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2813 states. [2020-10-14 20:54:11,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2813 states to 2813 states and 3412 transitions. [2020-10-14 20:54:11,553 INFO L78 Accepts]: Start accepts. Automaton has 2813 states and 3412 transitions. Word has length 208 [2020-10-14 20:54:11,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-14 20:54:11,553 INFO L479 AbstractCegarLoop]: Abstraction has 2813 states and 3412 transitions. [2020-10-14 20:54:11,554 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-14 20:54:11,554 INFO L276 IsEmpty]: Start isEmpty. Operand 2813 states and 3412 transitions. [2020-10-14 20:54:11,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2020-10-14 20:54:11,559 INFO L414 BasicCegarLoop]: Found error trace [2020-10-14 20:54:11,560 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-10-14 20:54:11,560 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-14 20:54:11,560 INFO L427 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-14 20:54:11,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-14 20:54:11,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1063407853, now seen corresponding path program 1 times [2020-10-14 20:54:11,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-14 20:54:11,561 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1009663536] [2020-10-14 20:54:11,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-14 20:54:11,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:54:11,692 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:54:12,056 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:54:12,057 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 270 [2020-10-14 20:54:12,057 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 20:54:12,057 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 429 [2020-10-14 20:54:12,057 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:54:12,057 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:54:12,058 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-14 20:54:12,058 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 125 [2020-10-14 20:54:12,058 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 120 [2020-10-14 20:54:12,058 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-14 20:54:12,135 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-14 20:54:12,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:54:12,137 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:54:12,139 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:54:12,139 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-14 20:54:12,140 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 20:54:12,140 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 2 [2020-10-14 20:54:12,140 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:54:12,141 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:54:12,141 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-14 20:54:12,141 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 20:54:12,141 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-14 20:54:12,141 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 20:54:12,154 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-14 20:54:12,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:54:12,190 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:54:12,315 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:54:12,315 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 116 [2020-10-14 20:54:12,316 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 20:54:12,316 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 140 [2020-10-14 20:54:12,318 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:54:12,318 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:54:12,319 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-14 20:54:12,319 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 20:54:12,319 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 110 [2020-10-14 20:54:12,319 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 3 [2020-10-14 20:54:12,373 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2020-10-14 20:54:12,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:54:12,425 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:54:12,683 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:54:12,684 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 118 [2020-10-14 20:54:12,684 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 20:54:12,684 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 278 [2020-10-14 20:54:12,684 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:54:12,685 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:54:12,685 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-14 20:54:12,685 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-14 20:54:12,685 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 118 [2020-10-14 20:54:12,685 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 20:54:13,073 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 150 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-14 20:54:13,078 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1009663536] [2020-10-14 20:54:13,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-14 20:54:13,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-14 20:54:13,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991429383] [2020-10-14 20:54:13,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-14 20:54:13,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-14 20:54:13,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-14 20:54:13,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-14 20:54:13,081 INFO L87 Difference]: Start difference. First operand 2813 states and 3412 transitions. Second operand 7 states. [2020-10-14 20:54:14,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-14 20:54:14,976 INFO L93 Difference]: Finished difference Result 5777 states and 7022 transitions. [2020-10-14 20:54:14,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-14 20:54:14,977 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 258 [2020-10-14 20:54:14,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-14 20:54:14,995 INFO L225 Difference]: With dead ends: 5777 [2020-10-14 20:54:14,995 INFO L226 Difference]: Without dead ends: 3113 [2020-10-14 20:54:15,003 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-10-14 20:54:15,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3113 states. [2020-10-14 20:54:15,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3113 to 3113. [2020-10-14 20:54:15,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3113 states. [2020-10-14 20:54:15,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3113 states to 3113 states and 3746 transitions. [2020-10-14 20:54:15,097 INFO L78 Accepts]: Start accepts. Automaton has 3113 states and 3746 transitions. Word has length 258 [2020-10-14 20:54:15,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-14 20:54:15,097 INFO L479 AbstractCegarLoop]: Abstraction has 3113 states and 3746 transitions. [2020-10-14 20:54:15,098 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-14 20:54:15,098 INFO L276 IsEmpty]: Start isEmpty. Operand 3113 states and 3746 transitions. [2020-10-14 20:54:15,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2020-10-14 20:54:15,106 INFO L414 BasicCegarLoop]: Found error trace [2020-10-14 20:54:15,106 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-10-14 20:54:15,106 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-14 20:54:15,107 INFO L427 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-14 20:54:15,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-14 20:54:15,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1472655782, now seen corresponding path program 1 times [2020-10-14 20:54:15,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-14 20:54:15,108 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1807520456] [2020-10-14 20:54:15,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-14 20:54:15,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-14 20:54:15,205 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-10-14 20:54:15,205 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-14 20:54:15,210 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-14 20:54:15,251 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 08:54:15 BoogieIcfgContainer [2020-10-14 20:54:15,252 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-14 20:54:15,254 INFO L168 Benchmark]: Toolchain (without parser) took 27362.63 ms. Allocated memory was 147.3 MB in the beginning and 642.3 MB in the end (delta: 494.9 MB). Free memory was 100.5 MB in the beginning and 579.7 MB in the end (delta: -479.3 MB). Peak memory consumption was 457.7 MB. Max. memory is 7.1 GB. [2020-10-14 20:54:15,255 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 147.3 MB. Free memory was 120.6 MB in the beginning and 120.2 MB in the end (delta: 419.5 kB). Peak memory consumption was 419.5 kB. Max. memory is 7.1 GB. [2020-10-14 20:54:15,256 INFO L168 Benchmark]: CACSL2BoogieTranslator took 754.35 ms. Allocated memory was 147.3 MB in the beginning and 205.5 MB in the end (delta: 58.2 MB). Free memory was 100.0 MB in the beginning and 171.9 MB in the end (delta: -71.9 MB). Peak memory consumption was 31.1 MB. Max. memory is 7.1 GB. [2020-10-14 20:54:15,257 INFO L168 Benchmark]: Boogie Preprocessor took 112.31 ms. Allocated memory is still 205.5 MB. Free memory was 171.9 MB in the beginning and 166.9 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 7.1 GB. [2020-10-14 20:54:15,257 INFO L168 Benchmark]: RCFGBuilder took 1486.02 ms. Allocated memory was 205.5 MB in the beginning and 237.5 MB in the end (delta: 32.0 MB). Free memory was 166.9 MB in the beginning and 180.7 MB in the end (delta: -13.8 MB). Peak memory consumption was 80.5 MB. Max. memory is 7.1 GB. [2020-10-14 20:54:15,258 INFO L168 Benchmark]: TraceAbstraction took 25004.47 ms. Allocated memory was 237.5 MB in the beginning and 642.3 MB in the end (delta: 404.8 MB). Free memory was 179.0 MB in the beginning and 579.7 MB in the end (delta: -400.8 MB). Peak memory consumption was 446.0 MB. Max. memory is 7.1 GB. [2020-10-14 20:54:15,262 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.18 ms. Allocated memory is still 147.3 MB. Free memory was 120.6 MB in the beginning and 120.2 MB in the end (delta: 419.5 kB). Peak memory consumption was 419.5 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 754.35 ms. Allocated memory was 147.3 MB in the beginning and 205.5 MB in the end (delta: 58.2 MB). Free memory was 100.0 MB in the beginning and 171.9 MB in the end (delta: -71.9 MB). Peak memory consumption was 31.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 112.31 ms. Allocated memory is still 205.5 MB. Free memory was 171.9 MB in the beginning and 166.9 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1486.02 ms. Allocated memory was 205.5 MB in the beginning and 237.5 MB in the end (delta: 32.0 MB). Free memory was 166.9 MB in the beginning and 180.7 MB in the end (delta: -13.8 MB). Peak memory consumption was 80.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 25004.47 ms. Allocated memory was 237.5 MB in the beginning and 642.3 MB in the end (delta: 404.8 MB). Free memory was 179.0 MB in the beginning and 579.7 MB in the end (delta: -400.8 MB). Peak memory consumption was 446.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 64]: 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 TRUE ((a4==14) && ((a19==9) && ((a12==0) && (((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0))))) [L527] a1 = (((a1 * 5) + 278443) - -239546) [L528] return 26; [L590] RET, EXPR calculate_output(input) [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL, EXPR calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) [L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) [L225] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) [L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) [L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) [L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) [L244] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) [L249] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) [L254] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) [L260] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) [L265] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) [L271] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) [L277] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) [L283] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) [L286] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) [L291] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) [L296] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) [L301] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) [L306] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) [L312] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) [L317] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) [L320] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) [L323] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) [L326] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) [L329] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) [L335] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) [L340] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) [L345] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) [L351] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) [L354] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) [L357] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) [L360] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) [L365] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0))))) [L370] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) [L375] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) [L378] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) [L383] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) [L388] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0))))) [L393] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) [L398] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) [L403] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14))) [L408] COND FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))) [L414] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14))) [L419] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10)))))) [L425] COND FALSE !(((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0))) [L430] COND FALSE !((((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 6)) && (a19==10))) && (a12==0))) [L436] COND TRUE ((a19==9) && ((((input == 4) && (( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 ))) && (a12==0)) && (a4==14))) [L437] a1 = (((((a1 / 5) % 89)- -128) / 5) + 34) [L438] a10 = 0 [L439] a19 = 8 [L441] return -1; [L590] RET, EXPR calculate_output(input) [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND 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 TRUE (((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8)) [L64] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 215 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 24.8s, OverallIterations: 10, TraceHistogramMax: 3, AutomataDifference: 13.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 245 SDtfs, 3493 SDslu, 285 SDs, 0 SdLazy, 7810 SolverSat, 1004 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 120 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3113occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 9 MinimizatonAttempts, 907 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 9.2s InterpolantComputationTime, 1611 NumberOfCodeBlocks, 1611 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1325 ConstructedInterpolants, 0 QuantifiedInterpolants, 817371 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 3 PerfectInterpolantSequences, 531/556 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...