/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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=DEEPEST --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 language data_model -i ../../../trunk/examples/svcomp/eca-rers2012/Problem10_label12.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-0f64333 [2020-10-27 17:26:36,349 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-27 17:26:36,355 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-27 17:26:36,411 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-27 17:26:36,411 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-27 17:26:36,418 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-27 17:26:36,421 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-27 17:26:36,441 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-27 17:26:36,445 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-27 17:26:36,450 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-27 17:26:36,452 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-27 17:26:36,453 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-27 17:26:36,454 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-27 17:26:36,457 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-27 17:26:36,461 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-27 17:26:36,463 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-27 17:26:36,464 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-27 17:26:36,467 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-27 17:26:36,475 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-27 17:26:36,483 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-27 17:26:36,485 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-27 17:26:36,487 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-27 17:26:36,489 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-27 17:26:36,491 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-27 17:26:36,500 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-27 17:26:36,500 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-27 17:26:36,500 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-27 17:26:36,504 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-27 17:26:36,505 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-27 17:26:36,507 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-27 17:26:36,508 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-27 17:26:36,509 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-27 17:26:36,511 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-27 17:26:36,512 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-27 17:26:36,513 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-27 17:26:36,513 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-27 17:26:36,514 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-27 17:26:36,514 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-27 17:26:36,514 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-27 17:26:36,515 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-27 17:26:36,516 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-27 17:26:36,524 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-27 17:26:36,576 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-27 17:26:36,576 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-27 17:26:36,581 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-27 17:26:36,582 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-27 17:26:36,582 INFO L138 SettingsManager]: * Use SBE=true [2020-10-27 17:26:36,582 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-27 17:26:36,582 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-27 17:26:36,582 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-27 17:26:36,582 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-27 17:26:36,583 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-27 17:26:36,584 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-27 17:26:36,584 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-27 17:26:36,584 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-27 17:26:36,584 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-27 17:26:36,585 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-27 17:26:36,585 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-27 17:26:36,586 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-27 17:26:36,586 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-27 17:26:36,586 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-27 17:26:36,588 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-27 17:26:36,588 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-27 17:26:36,593 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-27 17:26:36,594 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-27 17:26:36,594 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-27 17:26:36,595 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-27 17:26:36,595 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-27 17:26:36,595 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-27 17:26:36,595 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-27 17:26:36,595 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-27 17:26:36,596 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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=DEEPEST;log-additional-information=true;unknown-allowed=true; [2020-10-27 17:26:36,995 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-27 17:26:37,022 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-27 17:26:37,025 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-27 17:26:37,027 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-27 17:26:37,028 INFO L275 PluginConnector]: CDTParser initialized [2020-10-27 17:26:37,029 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label12.c [2020-10-27 17:26:37,126 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/7a9528e0c/37bd494a32e04ea882a88a9dc0f31083/FLAGf687a0545 [2020-10-27 17:26:37,835 INFO L306 CDTParser]: Found 1 translation units. [2020-10-27 17:26:37,836 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/eca-rers2012/Problem10_label12.c [2020-10-27 17:26:37,849 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/7a9528e0c/37bd494a32e04ea882a88a9dc0f31083/FLAGf687a0545 [2020-10-27 17:26:38,124 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/7a9528e0c/37bd494a32e04ea882a88a9dc0f31083 [2020-10-27 17:26:38,131 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-27 17:26:38,144 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-27 17:26:38,147 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-27 17:26:38,148 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-27 17:26:38,152 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-27 17:26:38,153 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 05:26:38" (1/1) ... [2020-10-27 17:26:38,158 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c713bfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:26:38, skipping insertion in model container [2020-10-27 17:26:38,158 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 05:26:38" (1/1) ... [2020-10-27 17:26:38,167 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-27 17:26:38,239 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-27 17:26:38,647 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-27 17:26:38,661 INFO L203 MainTranslator]: Completed pre-run [2020-10-27 17:26:38,824 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-27 17:26:38,855 INFO L208 MainTranslator]: Completed translation [2020-10-27 17:26:38,857 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:26:38 WrapperNode [2020-10-27 17:26:38,857 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-27 17:26:38,859 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-27 17:26:38,859 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-27 17:26:38,859 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-27 17:26:38,873 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:26:38" (1/1) ... [2020-10-27 17:26:38,873 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:26:38" (1/1) ... [2020-10-27 17:26:38,918 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:26:38" (1/1) ... [2020-10-27 17:26:38,918 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:26:38" (1/1) ... [2020-10-27 17:26:38,958 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:26:38" (1/1) ... [2020-10-27 17:26:38,974 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:26:38" (1/1) ... [2020-10-27 17:26:38,984 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:26:38" (1/1) ... [2020-10-27 17:26:38,995 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-27 17:26:38,997 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-27 17:26:38,997 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-27 17:26:38,997 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-27 17:26:38,998 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:26:38" (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-27 17:26:39,084 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-27 17:26:39,084 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-27 17:26:39,084 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-27 17:26:39,084 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2020-10-27 17:26:39,085 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-27 17:26:39,085 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2020-10-27 17:26:39,085 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-27 17:26:39,085 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-27 17:26:39,085 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-27 17:26:39,085 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-27 17:26:39,086 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-27 17:26:39,086 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-10-27 17:26:39,086 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-27 17:26:39,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-27 17:26:39,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-27 17:26:39,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-27 17:26:39,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-27 17:26:39,087 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-27 17:26:39,087 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-27 17:26:40,764 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-27 17:26:40,764 INFO L298 CfgBuilder]: Removed 1 assume(true) statements. [2020-10-27 17:26:40,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 05:26:40 BoogieIcfgContainer [2020-10-27 17:26:40,767 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-27 17:26:40,769 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-27 17:26:40,769 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-27 17:26:40,772 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-27 17:26:40,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 05:26:38" (1/3) ... [2020-10-27 17:26:40,774 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44fb5de3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 05:26:40, skipping insertion in model container [2020-10-27 17:26:40,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:26:38" (2/3) ... [2020-10-27 17:26:40,774 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44fb5de3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 05:26:40, skipping insertion in model container [2020-10-27 17:26:40,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 05:26:40" (3/3) ... [2020-10-27 17:26:40,776 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem10_label12.c [2020-10-27 17:26:40,789 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-27 17:26:40,795 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-27 17:26:40,810 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-27 17:26:40,841 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-27 17:26:40,842 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-27 17:26:40,842 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-27 17:26:40,842 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-27 17:26:40,842 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-27 17:26:40,842 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-27 17:26:40,843 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-27 17:26:40,843 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-27 17:26:40,872 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states. [2020-10-27 17:26:40,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-27 17:26:40,879 INFO L414 BasicCegarLoop]: Found error trace [2020-10-27 17:26:40,879 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-27 17:26:40,880 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-27 17:26:40,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-27 17:26:40,887 INFO L82 PathProgramCache]: Analyzing trace with hash -2066663958, now seen corresponding path program 1 times [2020-10-27 17:26:40,897 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-27 17:26:40,898 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2136693094] [2020-10-27 17:26:40,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-27 17:26:41,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:26:41,093 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:26:41,533 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:26:41,534 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 29 [2020-10-27 17:26:41,534 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:26:41,534 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 480 [2020-10-27 17:26:41,536 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:26:41,536 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-10-27 17:26:41,537 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 5 [2020-10-27 17:26:41,537 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 20 [2020-10-27 17:26:41,537 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 2 [2020-10-27 17:26:41,695 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-27 17:26:41,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:26:41,712 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:26:41,734 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:26:41,735 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-27 17:26:41,735 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:26:41,735 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 27 [2020-10-27 17:26:41,735 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:26:41,736 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-27 17:26:41,736 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:26:41,736 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 2 [2020-10-27 17:26:41,736 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:26:41,752 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-27 17:26:41,753 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2136693094] [2020-10-27 17:26:41,755 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-27 17:26:41,756 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-27 17:26:41,757 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47317032] [2020-10-27 17:26:41,762 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-27 17:26:41,763 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-27 17:26:41,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-27 17:26:41,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-27 17:26:41,781 INFO L87 Difference]: Start difference. First operand 219 states. Second operand 4 states. [2020-10-27 17:26:44,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-27 17:26:44,684 INFO L93 Difference]: Finished difference Result 586 states and 1013 transitions. [2020-10-27 17:26:44,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-27 17:26:44,686 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2020-10-27 17:26:44,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-27 17:26:44,700 INFO L225 Difference]: With dead ends: 586 [2020-10-27 17:26:44,701 INFO L226 Difference]: Without dead ends: 303 [2020-10-27 17:26:44,710 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-27 17:26:44,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2020-10-27 17:26:44,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 297. [2020-10-27 17:26:44,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2020-10-27 17:26:44,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 424 transitions. [2020-10-27 17:26:44,798 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 424 transitions. Word has length 19 [2020-10-27 17:26:44,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-27 17:26:44,799 INFO L481 AbstractCegarLoop]: Abstraction has 297 states and 424 transitions. [2020-10-27 17:26:44,799 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-27 17:26:44,799 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 424 transitions. [2020-10-27 17:26:44,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-10-27 17:26:44,805 INFO L414 BasicCegarLoop]: Found error trace [2020-10-27 17:26:44,805 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-10-27 17:26:44,806 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-27 17:26:44,806 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-27 17:26:44,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-27 17:26:44,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1489360533, now seen corresponding path program 1 times [2020-10-27 17:26:44,807 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-27 17:26:44,808 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [645480414] [2020-10-27 17:26:44,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-27 17:26:44,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:26:44,877 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:26:45,094 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:26:45,607 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:26:45,873 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:26:45,873 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 103 [2020-10-27 17:26:45,874 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 3 [2020-10-27 17:26:45,874 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1020 [2020-10-27 17:26:45,875 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:26:45,875 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-27 17:26:45,876 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 82 [2020-10-27 17:26:45,876 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 17 [2020-10-27 17:26:45,877 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 2 [2020-10-27 17:26:46,016 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-27 17:26:46,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:26:46,022 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:26:46,028 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:26:46,028 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-27 17:26:46,029 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:26:46,029 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 7 [2020-10-27 17:26:46,029 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:26:46,029 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-27 17:26:46,029 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:26:46,030 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-27 17:26:46,030 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:26:46,053 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-27 17:26:46,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:26:46,079 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:26:46,127 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:26:46,128 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 73 [2020-10-27 17:26:46,128 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:26:46,128 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 58 [2020-10-27 17:26:46,128 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:26:46,129 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-27 17:26:46,129 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:26:46,129 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 67 [2020-10-27 17:26:46,129 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:26:46,192 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-27 17:26:46,193 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [645480414] [2020-10-27 17:26:46,193 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-27 17:26:46,193 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-10-27 17:26:46,194 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013366128] [2020-10-27 17:26:46,196 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-27 17:26:46,196 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-27 17:26:46,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-27 17:26:46,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-27 17:26:46,202 INFO L87 Difference]: Start difference. First operand 297 states and 424 transitions. Second operand 5 states. [2020-10-27 17:26:46,719 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2020-10-27 17:26:48,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-27 17:26:48,663 INFO L93 Difference]: Finished difference Result 888 states and 1298 transitions. [2020-10-27 17:26:48,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-27 17:26:48,664 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2020-10-27 17:26:48,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-27 17:26:48,671 INFO L225 Difference]: With dead ends: 888 [2020-10-27 17:26:48,672 INFO L226 Difference]: Without dead ends: 597 [2020-10-27 17:26:48,674 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-27 17:26:48,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2020-10-27 17:26:48,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 589. [2020-10-27 17:26:48,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2020-10-27 17:26:48,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 780 transitions. [2020-10-27 17:26:48,773 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 780 transitions. Word has length 91 [2020-10-27 17:26:48,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-27 17:26:48,774 INFO L481 AbstractCegarLoop]: Abstraction has 589 states and 780 transitions. [2020-10-27 17:26:48,774 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-27 17:26:48,777 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 780 transitions. [2020-10-27 17:26:48,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2020-10-27 17:26:48,784 INFO L414 BasicCegarLoop]: Found error trace [2020-10-27 17:26:48,784 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-10-27 17:26:48,785 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-27 17:26:48,788 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-27 17:26:48,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-27 17:26:48,789 INFO L82 PathProgramCache]: Analyzing trace with hash 238961417, now seen corresponding path program 1 times [2020-10-27 17:26:48,789 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-27 17:26:48,789 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [611579836] [2020-10-27 17:26:48,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-27 17:26:48,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:26:48,894 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:26:49,168 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:26:49,808 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:26:49,809 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 112 [2020-10-27 17:26:49,809 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-27 17:26:49,809 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 969 [2020-10-27 17:26:49,809 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:26:49,809 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-27 17:26:49,809 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 91 [2020-10-27 17:26:49,810 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 17 [2020-10-27 17:26:49,810 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:26:49,948 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-27 17:26:49,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:26:49,958 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:26:49,964 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:26:49,964 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-27 17:26:49,964 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:26:49,965 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 11 [2020-10-27 17:26:49,965 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:26:49,965 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-27 17:26:49,967 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:26:49,967 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-27 17:26:49,968 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 2 [2020-10-27 17:26:49,992 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-27 17:26:50,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:26:50,028 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:26:50,125 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:26:50,125 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 82 [2020-10-27 17:26:50,126 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:26:50,126 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 110 [2020-10-27 17:26:50,126 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:26:50,127 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-27 17:26:50,127 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:26:50,127 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 76 [2020-10-27 17:26:50,127 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:26:50,196 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-27 17:26:50,197 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [611579836] [2020-10-27 17:26:50,197 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-27 17:26:50,197 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-10-27 17:26:50,199 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173460077] [2020-10-27 17:26:50,200 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-27 17:26:50,200 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-27 17:26:50,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-27 17:26:50,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-27 17:26:50,203 INFO L87 Difference]: Start difference. First operand 589 states and 780 transitions. Second operand 5 states. [2020-10-27 17:26:50,354 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2020-10-27 17:26:52,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-27 17:26:52,544 INFO L93 Difference]: Finished difference Result 1466 states and 2014 transitions. [2020-10-27 17:26:52,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-27 17:26:52,545 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2020-10-27 17:26:52,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-27 17:26:52,557 INFO L225 Difference]: With dead ends: 1466 [2020-10-27 17:26:52,558 INFO L226 Difference]: Without dead ends: 883 [2020-10-27 17:26:52,560 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-27 17:26:52,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2020-10-27 17:26:52,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 879. [2020-10-27 17:26:52,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 879 states. [2020-10-27 17:26:52,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1115 transitions. [2020-10-27 17:26:52,607 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1115 transitions. Word has length 100 [2020-10-27 17:26:52,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-27 17:26:52,608 INFO L481 AbstractCegarLoop]: Abstraction has 879 states and 1115 transitions. [2020-10-27 17:26:52,608 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-27 17:26:52,608 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1115 transitions. [2020-10-27 17:26:52,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2020-10-27 17:26:52,614 INFO L414 BasicCegarLoop]: Found error trace [2020-10-27 17:26:52,615 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-27 17:26:52,615 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-27 17:26:52,615 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-27 17:26:52,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-27 17:26:52,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1400977410, now seen corresponding path program 1 times [2020-10-27 17:26:52,616 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-27 17:26:52,616 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [982485104] [2020-10-27 17:26:52,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-27 17:26:52,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:26:52,700 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:26:52,903 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:26:53,106 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:26:53,345 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:26:54,361 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:26:54,361 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 185 [2020-10-27 17:26:54,361 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 4 [2020-10-27 17:26:54,361 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1692 [2020-10-27 17:26:54,368 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:26:54,368 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-27 17:26:54,368 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 164 [2020-10-27 17:26:54,368 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 17 [2020-10-27 17:26:54,368 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:26:54,541 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2020-10-27 17:26:54,542 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-27 17:26:54,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:26:54,547 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:26:54,555 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:26:54,556 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-27 17:26:54,556 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:26:54,556 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 9 [2020-10-27 17:26:54,556 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:26:54,557 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-27 17:26:54,557 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:26:54,557 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-27 17:26:54,557 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:26:54,588 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-27 17:26:54,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:26:54,598 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:26:54,621 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:26:54,621 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 80 [2020-10-27 17:26:54,622 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:26:54,622 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 24 [2020-10-27 17:26:54,622 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:26:54,622 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-27 17:26:54,623 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:26:54,623 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-27 17:26:54,623 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:26:54,649 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-10-27 17:26:54,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:26:54,678 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:26:54,737 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:26:54,738 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 74 [2020-10-27 17:26:54,738 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:26:54,738 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 69 [2020-10-27 17:26:54,738 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:26:54,738 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-27 17:26:54,739 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:26:54,739 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 68 [2020-10-27 17:26:54,739 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:26:54,870 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 23 proven. 2 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2020-10-27 17:26:54,870 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [982485104] [2020-10-27 17:26:54,872 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-27 17:26:54,872 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-10-27 17:26:54,872 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704897952] [2020-10-27 17:26:54,874 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-27 17:26:54,875 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-27 17:26:54,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-27 17:26:54,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-27 17:26:54,876 INFO L87 Difference]: Start difference. First operand 879 states and 1115 transitions. Second operand 5 states. [2020-10-27 17:26:55,392 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2020-10-27 17:26:57,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-27 17:26:57,256 INFO L93 Difference]: Finished difference Result 2046 states and 2681 transitions. [2020-10-27 17:26:57,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-27 17:26:57,257 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 171 [2020-10-27 17:26:57,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-27 17:26:57,265 INFO L225 Difference]: With dead ends: 2046 [2020-10-27 17:26:57,265 INFO L226 Difference]: Without dead ends: 1173 [2020-10-27 17:26:57,268 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-27 17:26:57,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2020-10-27 17:26:57,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 1026. [2020-10-27 17:26:57,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1026 states. [2020-10-27 17:26:57,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 1026 states and 1282 transitions. [2020-10-27 17:26:57,312 INFO L78 Accepts]: Start accepts. Automaton has 1026 states and 1282 transitions. Word has length 171 [2020-10-27 17:26:57,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-27 17:26:57,313 INFO L481 AbstractCegarLoop]: Abstraction has 1026 states and 1282 transitions. [2020-10-27 17:26:57,313 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-27 17:26:57,313 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 1282 transitions. [2020-10-27 17:26:57,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2020-10-27 17:26:57,318 INFO L414 BasicCegarLoop]: Found error trace [2020-10-27 17:26:57,318 INFO L422 BasicCegarLoop]: trace histogram [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, 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-27 17:26:57,318 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-27 17:26:57,319 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-27 17:26:57,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-27 17:26:57,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1442538970, now seen corresponding path program 1 times [2020-10-27 17:26:57,319 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-27 17:26:57,320 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1535964593] [2020-10-27 17:26:57,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-27 17:26:57,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:26:57,370 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:26:57,437 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:26:58,200 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:27:00,313 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:27:00,313 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 200 [2020-10-27 17:27:00,314 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 3 [2020-10-27 17:27:00,314 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 2959 [2020-10-27 17:27:00,314 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:27:00,314 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-27 17:27:00,314 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 179 [2020-10-27 17:27:00,314 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 17 [2020-10-27 17:27:00,315 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:27:00,451 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-27 17:27:00,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:27:00,455 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:27:00,460 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:27:00,460 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-27 17:27:00,460 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:27:00,460 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 6 [2020-10-27 17:27:00,461 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:27:00,461 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-27 17:27:00,461 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:27:00,461 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-27 17:27:00,461 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:27:00,485 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-27 17:27:00,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:27:00,492 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:27:00,517 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:27:00,517 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 78 [2020-10-27 17:27:00,517 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:27:00,517 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 25 [2020-10-27 17:27:00,518 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:27:00,518 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-27 17:27:00,518 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:27:00,518 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-27 17:27:00,518 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:27:00,544 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2020-10-27 17:27:00,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:27:00,575 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:27:00,640 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:27:00,641 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 91 [2020-10-27 17:27:00,641 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:27:00,642 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 77 [2020-10-27 17:27:00,642 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:27:00,642 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-27 17:27:00,642 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:27:00,644 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 85 [2020-10-27 17:27:00,644 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 2 [2020-10-27 17:27:00,736 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 23 proven. 2 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2020-10-27 17:27:00,737 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1535964593] [2020-10-27 17:27:00,737 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-27 17:27:00,737 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-10-27 17:27:00,737 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198823709] [2020-10-27 17:27:00,738 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-27 17:27:00,739 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-27 17:27:00,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-27 17:27:00,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-27 17:27:00,740 INFO L87 Difference]: Start difference. First operand 1026 states and 1282 transitions. Second operand 5 states. [2020-10-27 17:27:03,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-27 17:27:03,171 INFO L93 Difference]: Finished difference Result 2340 states and 3029 transitions. [2020-10-27 17:27:03,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-27 17:27:03,177 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 186 [2020-10-27 17:27:03,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-27 17:27:03,188 INFO L225 Difference]: With dead ends: 2340 [2020-10-27 17:27:03,188 INFO L226 Difference]: Without dead ends: 1320 [2020-10-27 17:27:03,192 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-27 17:27:03,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1320 states. [2020-10-27 17:27:03,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1320 to 1316. [2020-10-27 17:27:03,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1316 states. [2020-10-27 17:27:03,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1316 states to 1316 states and 1626 transitions. [2020-10-27 17:27:03,242 INFO L78 Accepts]: Start accepts. Automaton has 1316 states and 1626 transitions. Word has length 186 [2020-10-27 17:27:03,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-27 17:27:03,243 INFO L481 AbstractCegarLoop]: Abstraction has 1316 states and 1626 transitions. [2020-10-27 17:27:03,243 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-27 17:27:03,243 INFO L276 IsEmpty]: Start isEmpty. Operand 1316 states and 1626 transitions. [2020-10-27 17:27:03,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2020-10-27 17:27:03,248 INFO L414 BasicCegarLoop]: Found error trace [2020-10-27 17:27:03,249 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 17:27:03,249 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-27 17:27:03,249 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-27 17:27:03,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-27 17:27:03,250 INFO L82 PathProgramCache]: Analyzing trace with hash 657143326, now seen corresponding path program 1 times [2020-10-27 17:27:03,250 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-27 17:27:03,250 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [392054446] [2020-10-27 17:27:03,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-27 17:27:03,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:27:03,331 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:27:03,639 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:27:04,509 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:27:04,509 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 229 [2020-10-27 17:27:04,509 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-27 17:27:04,509 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1195 [2020-10-27 17:27:04,509 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:27:04,510 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-27 17:27:04,510 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 87 [2020-10-27 17:27:04,510 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 122 [2020-10-27 17:27:04,510 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:27:04,653 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-27 17:27:04,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:27:04,657 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:27:04,661 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:27:04,661 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-27 17:27:04,661 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:27:04,661 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 5 [2020-10-27 17:27:04,661 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:27:04,662 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-27 17:27:04,662 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:27:04,662 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-27 17:27:04,662 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:27:04,693 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-27 17:27:04,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:27:04,723 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:27:04,782 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:27:04,782 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 78 [2020-10-27 17:27:04,782 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:27:04,783 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 70 [2020-10-27 17:27:04,783 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:27:04,783 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-27 17:27:04,783 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:27:04,783 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 72 [2020-10-27 17:27:04,783 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:27:04,809 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2020-10-27 17:27:04,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:27:04,863 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:27:05,058 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:27:05,058 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 120 [2020-10-27 17:27:05,058 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:27:05,059 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 216 [2020-10-27 17:27:05,059 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:27:05,059 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-27 17:27:05,059 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-27 17:27:05,059 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 120 [2020-10-27 17:27:05,060 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:27:05,297 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 96 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-27 17:27:05,298 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [392054446] [2020-10-27 17:27:05,298 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-27 17:27:05,298 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-27 17:27:05,299 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106658059] [2020-10-27 17:27:05,299 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-27 17:27:05,299 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-27 17:27:05,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-27 17:27:05,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-27 17:27:05,301 INFO L87 Difference]: Start difference. First operand 1316 states and 1626 transitions. Second operand 7 states. [2020-10-27 17:27:06,083 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2020-10-27 17:27:07,374 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2020-10-27 17:27:08,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-27 17:27:08,727 INFO L93 Difference]: Finished difference Result 3137 states and 4092 transitions. [2020-10-27 17:27:08,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-27 17:27:08,728 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 215 [2020-10-27 17:27:08,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-27 17:27:08,743 INFO L225 Difference]: With dead ends: 3137 [2020-10-27 17:27:08,744 INFO L226 Difference]: Without dead ends: 1827 [2020-10-27 17:27:08,747 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-10-27 17:27:08,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1827 states. [2020-10-27 17:27:08,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1827 to 1630. [2020-10-27 17:27:08,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1630 states. [2020-10-27 17:27:08,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1630 states to 1630 states and 2005 transitions. [2020-10-27 17:27:08,842 INFO L78 Accepts]: Start accepts. Automaton has 1630 states and 2005 transitions. Word has length 215 [2020-10-27 17:27:08,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-27 17:27:08,842 INFO L481 AbstractCegarLoop]: Abstraction has 1630 states and 2005 transitions. [2020-10-27 17:27:08,842 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-27 17:27:08,842 INFO L276 IsEmpty]: Start isEmpty. Operand 1630 states and 2005 transitions. [2020-10-27 17:27:08,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2020-10-27 17:27:08,851 INFO L414 BasicCegarLoop]: Found error trace [2020-10-27 17:27:08,852 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 17:27:08,852 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-27 17:27:08,852 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-27 17:27:08,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-27 17:27:08,853 INFO L82 PathProgramCache]: Analyzing trace with hash 717782474, now seen corresponding path program 1 times [2020-10-27 17:27:08,853 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-27 17:27:08,853 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [668376383] [2020-10-27 17:27:08,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-27 17:27:08,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:27:08,929 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:27:09,530 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:27:09,531 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 239 [2020-10-27 17:27:09,531 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:27:09,531 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 620 [2020-10-27 17:27:09,531 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:27:09,531 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-10-27 17:27:09,532 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 5 [2020-10-27 17:27:09,532 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 93 [2020-10-27 17:27:09,532 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:27:09,671 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-27 17:27:09,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:27:09,687 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:27:09,699 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:27:09,699 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-27 17:27:09,699 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:27:09,699 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 22 [2020-10-27 17:27:09,700 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:27:09,700 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-27 17:27:09,700 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:27:09,700 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 2 [2020-10-27 17:27:09,701 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:27:09,732 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-27 17:27:09,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:27:09,766 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:27:09,934 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:27:09,935 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 88 [2020-10-27 17:27:09,935 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:27:09,935 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 181 [2020-10-27 17:27:09,935 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:27:09,935 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-27 17:27:09,936 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-27 17:27:09,936 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 88 [2020-10-27 17:27:09,936 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:27:10,118 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2020-10-27 17:27:10,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:27:10,160 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:27:10,210 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:27:10,210 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 120 [2020-10-27 17:27:10,210 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:27:10,210 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 65 [2020-10-27 17:27:10,210 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:27:10,211 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-27 17:27:10,211 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 117 [2020-10-27 17:27:10,211 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-27 17:27:10,211 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:27:10,336 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 22 proven. 82 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-27 17:27:10,337 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [668376383] [2020-10-27 17:27:10,337 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-27 17:27:10,337 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-27 17:27:10,338 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682108315] [2020-10-27 17:27:10,340 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-27 17:27:10,340 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-27 17:27:10,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-27 17:27:10,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-27 17:27:10,341 INFO L87 Difference]: Start difference. First operand 1630 states and 2005 transitions. Second operand 7 states. [2020-10-27 17:27:10,485 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2020-10-27 17:27:11,943 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2020-10-27 17:27:12,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-27 17:27:12,910 INFO L93 Difference]: Finished difference Result 3409 states and 4187 transitions. [2020-10-27 17:27:12,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-27 17:27:12,911 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 225 [2020-10-27 17:27:12,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-27 17:27:12,920 INFO L225 Difference]: With dead ends: 3409 [2020-10-27 17:27:12,921 INFO L226 Difference]: Without dead ends: 1785 [2020-10-27 17:27:12,925 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-10-27 17:27:12,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1785 states. [2020-10-27 17:27:12,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1785 to 1781. [2020-10-27 17:27:12,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1781 states. [2020-10-27 17:27:12,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1781 states to 1781 states and 2172 transitions. [2020-10-27 17:27:12,987 INFO L78 Accepts]: Start accepts. Automaton has 1781 states and 2172 transitions. Word has length 225 [2020-10-27 17:27:12,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-27 17:27:12,988 INFO L481 AbstractCegarLoop]: Abstraction has 1781 states and 2172 transitions. [2020-10-27 17:27:12,988 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-27 17:27:12,988 INFO L276 IsEmpty]: Start isEmpty. Operand 1781 states and 2172 transitions. [2020-10-27 17:27:12,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2020-10-27 17:27:12,996 INFO L414 BasicCegarLoop]: Found error trace [2020-10-27 17:27:12,997 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-10-27 17:27:12,997 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-27 17:27:12,997 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-27 17:27:12,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-27 17:27:12,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1213216539, now seen corresponding path program 1 times [2020-10-27 17:27:12,998 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-27 17:27:12,999 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [175129986] [2020-10-27 17:27:12,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-27 17:27:13,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:27:13,089 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:27:13,215 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:27:13,770 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:27:14,942 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:27:14,943 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 320 [2020-10-27 17:27:14,943 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 3 [2020-10-27 17:27:14,944 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1888 [2020-10-27 17:27:14,945 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:27:14,945 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-10-27 17:27:14,945 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 89 [2020-10-27 17:27:14,945 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 211 [2020-10-27 17:27:14,945 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:27:15,116 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-27 17:27:15,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:27:15,120 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:27:15,126 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:27:15,126 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-27 17:27:15,126 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:27:15,126 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 6 [2020-10-27 17:27:15,127 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:27:15,127 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-27 17:27:15,127 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:27:15,127 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-27 17:27:15,127 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:27:15,148 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-27 17:27:15,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:27:15,175 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:27:15,226 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:27:15,227 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 80 [2020-10-27 17:27:15,227 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:27:15,227 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 63 [2020-10-27 17:27:15,227 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:27:15,227 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-27 17:27:15,228 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:27:15,228 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 74 [2020-10-27 17:27:15,228 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:27:15,247 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-10-27 17:27:15,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:27:15,277 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:27:15,398 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:27:15,434 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:27:15,434 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 88 [2020-10-27 17:27:15,434 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-27 17:27:15,435 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 168 [2020-10-27 17:27:15,435 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:27:15,435 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-27 17:27:15,436 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-27 17:27:15,436 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 88 [2020-10-27 17:27:15,436 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-27 17:27:15,671 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2020-10-27 17:27:15,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:27:15,751 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:27:15,974 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:27:15,974 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 120 [2020-10-27 17:27:15,975 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:27:15,975 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 271 [2020-10-27 17:27:15,975 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:27:15,975 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-27 17:27:15,975 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-27 17:27:15,975 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 120 [2020-10-27 17:27:15,976 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:27:16,394 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 265 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-10-27 17:27:16,394 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [175129986] [2020-10-27 17:27:16,395 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-27 17:27:16,395 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-10-27 17:27:16,395 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663080149] [2020-10-27 17:27:16,396 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-27 17:27:16,396 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-27 17:27:16,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-27 17:27:16,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-10-27 17:27:16,397 INFO L87 Difference]: Start difference. First operand 1781 states and 2172 transitions. Second operand 8 states. [2020-10-27 17:27:17,053 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2020-10-27 17:27:17,359 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2020-10-27 17:27:21,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-27 17:27:21,008 INFO L93 Difference]: Finished difference Result 4448 states and 5435 transitions. [2020-10-27 17:27:21,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-27 17:27:21,011 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 304 [2020-10-27 17:27:21,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-27 17:27:21,023 INFO L225 Difference]: With dead ends: 4448 [2020-10-27 17:27:21,023 INFO L226 Difference]: Without dead ends: 2228 [2020-10-27 17:27:21,029 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2020-10-27 17:27:21,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2228 states. [2020-10-27 17:27:21,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2228 to 1785. [2020-10-27 17:27:21,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1785 states. [2020-10-27 17:27:21,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1785 states to 1785 states and 2116 transitions. [2020-10-27 17:27:21,094 INFO L78 Accepts]: Start accepts. Automaton has 1785 states and 2116 transitions. Word has length 304 [2020-10-27 17:27:21,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-27 17:27:21,095 INFO L481 AbstractCegarLoop]: Abstraction has 1785 states and 2116 transitions. [2020-10-27 17:27:21,095 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-27 17:27:21,095 INFO L276 IsEmpty]: Start isEmpty. Operand 1785 states and 2116 transitions. [2020-10-27 17:27:21,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2020-10-27 17:27:21,104 INFO L414 BasicCegarLoop]: Found error trace [2020-10-27 17:27:21,104 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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-27 17:27:21,105 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-27 17:27:21,105 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-27 17:27:21,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-27 17:27:21,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1097034579, now seen corresponding path program 1 times [2020-10-27 17:27:21,106 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-27 17:27:21,106 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [369783756] [2020-10-27 17:27:21,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-27 17:27:21,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:27:21,254 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:27:21,875 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:27:21,875 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 356 [2020-10-27 17:27:21,875 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:27:21,875 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 676 [2020-10-27 17:27:21,875 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:27:21,876 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-27 17:27:21,876 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 125 [2020-10-27 17:27:21,876 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 90 [2020-10-27 17:27:21,876 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:27:22,039 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-27 17:27:22,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:27:22,044 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:27:22,049 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:27:22,049 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-27 17:27:22,049 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:27:22,050 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 5 [2020-10-27 17:27:22,050 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:27:22,050 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-27 17:27:22,050 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:27:22,050 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-27 17:27:22,050 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:27:22,076 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-27 17:27:22,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:27:22,126 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:27:22,256 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:27:22,256 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 116 [2020-10-27 17:27:22,257 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:27:22,257 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 148 [2020-10-27 17:27:22,257 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:27:22,257 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-27 17:27:22,257 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:27:22,257 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 110 [2020-10-27 17:27:22,258 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:27:22,301 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2020-10-27 17:27:22,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:27:22,335 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:27:22,475 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:27:22,476 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 88 [2020-10-27 17:27:22,476 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:27:22,476 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 155 [2020-10-27 17:27:22,476 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:27:22,476 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-27 17:27:22,477 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-27 17:27:22,477 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 88 [2020-10-27 17:27:22,477 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:27:22,591 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2020-10-27 17:27:22,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:27:22,638 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:27:22,694 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:27:22,695 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 120 [2020-10-27 17:27:22,695 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:27:22,695 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 75 [2020-10-27 17:27:22,695 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:27:22,695 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-27 17:27:22,696 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 117 [2020-10-27 17:27:22,696 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-27 17:27:22,696 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:27:22,913 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 121 proven. 86 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2020-10-27 17:27:22,914 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [369783756] [2020-10-27 17:27:22,915 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-27 17:27:22,915 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-27 17:27:22,916 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249258707] [2020-10-27 17:27:22,916 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-27 17:27:22,917 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-27 17:27:22,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-27 17:27:22,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-27 17:27:22,918 INFO L87 Difference]: Start difference. First operand 1785 states and 2116 transitions. Second operand 7 states. [2020-10-27 17:27:23,913 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2020-10-27 17:27:26,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-27 17:27:26,177 INFO L93 Difference]: Finished difference Result 4023 states and 4853 transitions. [2020-10-27 17:27:26,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-27 17:27:26,182 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 340 [2020-10-27 17:27:26,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-27 17:27:26,195 INFO L225 Difference]: With dead ends: 4023 [2020-10-27 17:27:26,196 INFO L226 Difference]: Without dead ends: 2387 [2020-10-27 17:27:26,200 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2020-10-27 17:27:26,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2387 states. [2020-10-27 17:27:26,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2387 to 2385. [2020-10-27 17:27:26,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2385 states. [2020-10-27 17:27:26,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2385 states to 2385 states and 2799 transitions. [2020-10-27 17:27:26,287 INFO L78 Accepts]: Start accepts. Automaton has 2385 states and 2799 transitions. Word has length 340 [2020-10-27 17:27:26,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-27 17:27:26,288 INFO L481 AbstractCegarLoop]: Abstraction has 2385 states and 2799 transitions. [2020-10-27 17:27:26,288 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-27 17:27:26,288 INFO L276 IsEmpty]: Start isEmpty. Operand 2385 states and 2799 transitions. [2020-10-27 17:27:26,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2020-10-27 17:27:26,298 INFO L414 BasicCegarLoop]: Found error trace [2020-10-27 17:27:26,299 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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-27 17:27:26,299 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-27 17:27:26,299 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-27 17:27:26,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-27 17:27:26,301 INFO L82 PathProgramCache]: Analyzing trace with hash -630089401, now seen corresponding path program 1 times [2020-10-27 17:27:26,301 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-27 17:27:26,301 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1459797378] [2020-10-27 17:27:26,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-27 17:27:26,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-27 17:27:26,411 INFO L173 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-10-27 17:27:26,411 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-27 17:27:26,420 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-27 17:27:26,502 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.10 05:27:26 BoogieIcfgContainer [2020-10-27 17:27:26,502 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-27 17:27:26,504 INFO L168 Benchmark]: Toolchain (without parser) took 48370.49 ms. Allocated memory was 163.6 MB in the beginning and 609.2 MB in the end (delta: 445.6 MB). Free memory was 136.8 MB in the beginning and 303.2 MB in the end (delta: -166.4 MB). Peak memory consumption was 279.5 MB. Max. memory is 8.0 GB. [2020-10-27 17:27:26,504 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 163.6 MB. Free memory is still 134.4 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-10-27 17:27:26,505 INFO L168 Benchmark]: CACSL2BoogieTranslator took 710.50 ms. Allocated memory is still 163.6 MB. Free memory was 136.2 MB in the beginning and 109.5 MB in the end (delta: 26.7 MB). Peak memory consumption was 26.2 MB. Max. memory is 8.0 GB. [2020-10-27 17:27:26,506 INFO L168 Benchmark]: Boogie Preprocessor took 136.79 ms. Allocated memory is still 163.6 MB. Free memory was 109.5 MB in the beginning and 141.5 MB in the end (delta: -32.0 MB). Peak memory consumption was 6.0 MB. Max. memory is 8.0 GB. [2020-10-27 17:27:26,507 INFO L168 Benchmark]: RCFGBuilder took 1770.13 ms. Allocated memory was 163.6 MB in the beginning and 200.3 MB in the end (delta: 36.7 MB). Free memory was 141.5 MB in the beginning and 164.6 MB in the end (delta: -23.1 MB). Peak memory consumption was 93.3 MB. Max. memory is 8.0 GB. [2020-10-27 17:27:26,507 INFO L168 Benchmark]: TraceAbstraction took 45733.48 ms. Allocated memory was 200.3 MB in the beginning and 609.2 MB in the end (delta: 408.9 MB). Free memory was 164.1 MB in the beginning and 303.2 MB in the end (delta: -139.1 MB). Peak memory consumption was 269.9 MB. Max. memory is 8.0 GB. [2020-10-27 17:27:26,511 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 163.6 MB. Free memory is still 134.4 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 710.50 ms. Allocated memory is still 163.6 MB. Free memory was 136.2 MB in the beginning and 109.5 MB in the end (delta: 26.7 MB). Peak memory consumption was 26.2 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 136.79 ms. Allocated memory is still 163.6 MB. Free memory was 109.5 MB in the beginning and 141.5 MB in the end (delta: -32.0 MB). Peak memory consumption was 6.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1770.13 ms. Allocated memory was 163.6 MB in the beginning and 200.3 MB in the end (delta: 36.7 MB). Free memory was 141.5 MB in the beginning and 164.6 MB in the end (delta: -23.1 MB). Peak memory consumption was 93.3 MB. Max. memory is 8.0 GB. * TraceAbstraction took 45733.48 ms. Allocated memory was 200.3 MB in the beginning and 609.2 MB in the end (delta: 408.9 MB). Free memory was 164.1 MB in the beginning and 303.2 MB in the end (delta: -139.1 MB). Peak memory consumption was 269.9 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L9] int inputC = 3; [L10] int inputD = 4; [L11] int inputE = 5; [L12] int inputF = 6; [L13] int inputB = 2; [L16] int a1 = 23; [L17] int a19 = 9; [L18] int a10 = 0; [L19] int a12 = 0; [L20] int a4 = 14; [L581] int output = -1; [L584] COND TRUE 1 [L587] int input; [L588] input = __VERIFIER_nondet_int() [L589] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L592] CALL, EXPR calculate_output(input) [L23] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L26] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L29] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L32] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L35] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L38] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L41] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L44] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L47] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L50] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L53] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L56] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L59] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L62] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L65] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L68] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L71] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L74] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L77] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L80] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L83] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L86] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L89] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L92] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L95] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L98] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L101] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L104] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L107] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L110] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L113] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L116] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L119] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L122] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L125] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L128] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L131] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L134] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L137] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L140] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L143] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L146] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L149] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L152] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L155] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L158] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L161] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L164] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L167] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L170] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L173] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L176] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L179] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L182] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L185] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L188] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L191] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L194] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L197] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L200] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L203] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L207] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L212] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) [L217] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) [L222] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) [L227] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) [L233] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) [L238] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) [L241] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) [L246] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) [L251] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) [L256] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) [L262] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) [L267] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) [L273] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) [L279] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) [L285] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) [L288] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) [L293] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) [L298] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) [L303] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) [L308] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) [L314] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) [L319] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) [L322] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) [L325] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) [L328] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) [L331] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) [L337] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) [L342] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) [L347] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) [L353] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) [L356] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) [L359] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) [L362] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) [L367] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0))))) [L372] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) [L377] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) [L380] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) [L385] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) [L390] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0))))) [L395] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) [L400] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) [L405] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14))) [L410] COND FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))) [L416] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14))) [L421] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10)))))) [L427] COND FALSE !(((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0))) [L432] COND FALSE !((((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 6)) && (a19==10))) && (a12==0))) [L438] COND FALSE !(((a19==9) && ((((input == 4) && (( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 ))) && (a12==0)) && (a4==14)))) [L444] COND FALSE !((((a19==10) && ((a12==0) && ((((a10==1) && a1 <= -13 ) || (( ((38 < a1) && (218 >= a1)) && (a10==0)) || ((a10==0) && 218 < a1 ))) && (input == 3)))) && (a4==14))) [L450] COND FALSE !(((a19==9) && (((a4==14) && ((((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4))) && (input == 5))) && (a12==0)))) [L456] COND FALSE !((((a12==0) && ((((input == 5) && (a19==10)) && ((38 < a1) && (218 >= a1)) ) && (a4==14))) && (a10==1))) [L462] COND FALSE !(((a19==9) && ((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3)) && (a10==1)) && (a12==0))))) [L467] COND FALSE !(((a10==0) && ((a12==0) && ((((input == 5) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a4==14))))) [L473] COND FALSE !(( 218 < a1 && (((((input == 3) && (a10==1)) && (a12==0)) && (a4==14)) && (a19==10)))) [L478] COND FALSE !((((a12==0) && ((a19==9) && (((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a4==14)))) && (a10==3))) [L483] COND FALSE !((((((a4==14) && ( ((38 < a1) && (218 >= a1)) && (input == 2))) && (a12==0)) && (a10==1)) && (a19==10))) [L489] COND FALSE !((((a19==10) && ((a10==1) && ((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (input == 5))))) && (a4==14))) [L495] COND FALSE !(((((a10==1) && (((input == 5) && 218 < a1 ) && (a4==14))) && (a19==10)) && (a12==0))) [L501] COND FALSE !((((a4==14) && ((a19==9) && ((input == 2) && (((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 ))))) && (a12==0))) [L506] COND FALSE !((((a4==14) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 2))) && (a12==0))) && (a10==4))) [L511] COND FALSE !(((a4==14) && (((a19==9) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 6)) && (a10==3))) && (a12==0)))) [L516] COND FALSE !((((a4==14) && ((((input == 6) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a12==0))) && (a10==0))) [L519] COND FALSE !(((a12==0) && ((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 2)) && (a19==10))))) [L525] COND FALSE !((((a12==0) && ((a19==9) && ((a10==2) && ((input == 6) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))))) && (a4==14))) [L528] COND TRUE ((a4==14) && ((a19==9) && ((a12==0) && (((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0))))) [L529] a1 = (((a1 * 5) + 278443) - -239546) [L530] return 26; [L592] RET, EXPR calculate_output(input) [L592] output = calculate_output(input) [L584] COND TRUE 1 [L587] int input; [L588] input = __VERIFIER_nondet_int() [L589] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L592] CALL, EXPR calculate_output(input) [L23] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L26] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L29] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L32] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L35] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L38] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L41] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L44] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L47] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L50] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L53] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L56] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L59] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L62] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L65] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L68] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L71] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L74] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L77] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L80] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L83] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L86] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L89] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L92] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L95] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L98] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L101] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L104] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L107] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L110] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L113] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L116] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L119] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L122] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L125] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L128] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L131] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L134] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L137] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L140] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L143] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L146] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L149] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L152] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L155] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L158] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L161] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L164] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L167] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L170] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L173] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L176] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L179] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L182] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L185] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L188] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L191] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L194] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L197] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L200] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L203] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L207] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L212] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) [L217] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) [L222] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) [L227] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) [L233] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) [L238] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) [L241] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) [L246] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) [L251] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) [L256] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) [L262] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) [L267] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) [L273] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) [L279] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) [L285] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) [L288] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) [L293] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) [L298] COND TRUE ((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14)) [L299] a1 = ((((((a1 * 9)/ 10) % 299993)+ -300005) / 5) + -75819) [L300] a10 = 4 [L302] return 26; [L592] RET, EXPR calculate_output(input) [L592] output = calculate_output(input) [L584] COND TRUE 1 [L587] int input; [L588] input = __VERIFIER_nondet_int() [L589] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L592] CALL, EXPR calculate_output(input) [L23] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L26] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L29] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L32] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L35] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L38] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L41] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L44] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L47] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L50] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L53] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L56] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L59] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L62] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L65] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L68] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L71] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L74] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L77] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L80] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L83] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L86] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L89] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L92] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L95] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L98] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L101] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L104] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L107] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L110] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L113] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L116] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L119] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L122] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L125] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L128] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L131] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L134] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L137] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L140] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L143] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L146] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L149] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L152] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L155] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L158] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L161] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L164] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L167] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L170] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L173] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L176] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L179] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L182] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L185] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L188] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L191] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L194] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L197] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L200] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L203] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L207] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L212] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) [L217] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) [L222] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) [L227] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) [L233] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) [L238] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) [L241] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) [L246] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) [L251] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) [L256] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) [L262] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) [L267] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) [L273] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) [L279] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) [L285] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) [L288] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) [L293] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) [L298] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) [L303] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) [L308] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) [L314] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) [L319] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) [L322] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) [L325] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) [L328] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) [L331] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) [L337] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) [L342] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) [L347] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) [L353] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) [L356] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) [L359] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) [L362] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) [L367] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0))))) [L372] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) [L377] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) [L380] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) [L385] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) [L390] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0))))) [L395] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) [L400] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) [L405] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14))) [L410] COND FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))) [L416] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14))) [L421] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10)))))) [L427] COND FALSE !(((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0))) [L432] COND FALSE !((((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 6)) && (a19==10))) && (a12==0))) [L438] COND FALSE !(((a19==9) && ((((input == 4) && (( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 ))) && (a12==0)) && (a4==14)))) [L444] COND FALSE !((((a19==10) && ((a12==0) && ((((a10==1) && a1 <= -13 ) || (( ((38 < a1) && (218 >= a1)) && (a10==0)) || ((a10==0) && 218 < a1 ))) && (input == 3)))) && (a4==14))) [L450] COND TRUE ((a19==9) && (((a4==14) && ((((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4))) && (input == 5))) && (a12==0))) [L451] a1 = ((((((a1 % 25)- -12) - 0) * 5) % 25)- -13) [L452] a10 = 3 [L453] a19 = 6 [L455] return -1; [L592] RET, EXPR calculate_output(input) [L592] output = calculate_output(input) [L584] COND TRUE 1 [L587] int input; [L588] input = __VERIFIER_nondet_int() [L589] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L592] CALL calculate_output(input) [L23] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L26] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L29] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L32] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L35] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L38] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L41] COND TRUE (((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6)) [L42] CALL reach_error() [L4] __assert_fail("0", "Problem10_label12.c", 4, "reach_error") - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 219 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 45.5s, OverallIterations: 10, TraceHistogramMax: 4, AutomataDifference: 26.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 243 SDtfs, 3219 SDslu, 243 SDs, 0 SdLazy, 8166 SolverSat, 1049 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 129 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2385occurred 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, 815 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 16.5s InterpolantComputationTime, 2010 NumberOfCodeBlocks, 2010 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1642 ConstructedInterpolants, 0 QuantifiedInterpolants, 1314893 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 1 PerfectInterpolantSequences, 842/1024 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...