/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=SHALLOWEST --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_label55.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-0f64333 [2020-10-26 22:33:45,350 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-26 22:33:45,353 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-26 22:33:45,406 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-26 22:33:45,407 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-26 22:33:45,413 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-26 22:33:45,415 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-26 22:33:45,420 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-26 22:33:45,424 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-26 22:33:45,430 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-26 22:33:45,431 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-26 22:33:45,432 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-26 22:33:45,433 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-26 22:33:45,436 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-26 22:33:45,439 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-26 22:33:45,441 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-26 22:33:45,442 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-26 22:33:45,445 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-26 22:33:45,452 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-26 22:33:45,459 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-26 22:33:45,469 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-26 22:33:45,470 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-26 22:33:45,472 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-26 22:33:45,474 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-26 22:33:45,482 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-26 22:33:45,482 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-26 22:33:45,483 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-26 22:33:45,484 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-26 22:33:45,485 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-26 22:33:45,486 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-26 22:33:45,486 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-26 22:33:45,487 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-26 22:33:45,489 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-26 22:33:45,489 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-26 22:33:45,490 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-26 22:33:45,491 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-26 22:33:45,491 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-26 22:33:45,492 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-26 22:33:45,492 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-26 22:33:45,493 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-26 22:33:45,493 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-26 22:33:45,500 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-26 22:33:45,550 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-26 22:33:45,550 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-26 22:33:45,554 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-26 22:33:45,554 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-26 22:33:45,554 INFO L138 SettingsManager]: * Use SBE=true [2020-10-26 22:33:45,555 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-26 22:33:45,555 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-26 22:33:45,555 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-26 22:33:45,555 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-26 22:33:45,556 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-26 22:33:45,557 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-26 22:33:45,557 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-26 22:33:45,557 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-26 22:33:45,557 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-26 22:33:45,557 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-26 22:33:45,557 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-26 22:33:45,558 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-26 22:33:45,558 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-26 22:33:45,558 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-26 22:33:45,558 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-26 22:33:45,558 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-26 22:33:45,559 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-26 22:33:45,559 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-26 22:33:45,559 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-26 22:33:45,559 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-26 22:33:45,559 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-26 22:33:45,560 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-26 22:33:45,560 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-26 22:33:45,560 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-26 22:33:45,560 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=SHALLOWEST;log-additional-information=true;unknown-allowed=true; [2020-10-26 22:33:45,991 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-26 22:33:46,014 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-26 22:33:46,017 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-26 22:33:46,018 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-26 22:33:46,019 INFO L275 PluginConnector]: CDTParser initialized [2020-10-26 22:33:46,020 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label55.c [2020-10-26 22:33:46,092 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/b0afc6e0f/4c13f5c667fe4f2c9c5af076da9c0b55/FLAG4ef02d53d [2020-10-26 22:33:46,873 INFO L306 CDTParser]: Found 1 translation units. [2020-10-26 22:33:46,874 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/eca-rers2012/Problem10_label55.c [2020-10-26 22:33:46,892 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/b0afc6e0f/4c13f5c667fe4f2c9c5af076da9c0b55/FLAG4ef02d53d [2020-10-26 22:33:47,118 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/b0afc6e0f/4c13f5c667fe4f2c9c5af076da9c0b55 [2020-10-26 22:33:47,122 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-26 22:33:47,129 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-26 22:33:47,131 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-26 22:33:47,131 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-26 22:33:47,136 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-26 22:33:47,136 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 10:33:47" (1/1) ... [2020-10-26 22:33:47,141 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d0561c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:33:47, skipping insertion in model container [2020-10-26 22:33:47,141 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 10:33:47" (1/1) ... [2020-10-26 22:33:47,150 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-26 22:33:47,219 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-26 22:33:47,628 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 22:33:47,643 INFO L203 MainTranslator]: Completed pre-run [2020-10-26 22:33:47,724 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 22:33:47,740 INFO L208 MainTranslator]: Completed translation [2020-10-26 22:33:47,741 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:33:47 WrapperNode [2020-10-26 22:33:47,741 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-26 22:33:47,742 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-26 22:33:47,743 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-26 22:33:47,743 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-26 22:33:47,756 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:33:47" (1/1) ... [2020-10-26 22:33:47,756 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:33:47" (1/1) ... [2020-10-26 22:33:47,782 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:33:47" (1/1) ... [2020-10-26 22:33:47,783 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:33:47" (1/1) ... [2020-10-26 22:33:47,854 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:33:47" (1/1) ... [2020-10-26 22:33:47,877 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:33:47" (1/1) ... [2020-10-26 22:33:47,887 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:33:47" (1/1) ... [2020-10-26 22:33:47,900 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-26 22:33:47,901 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-26 22:33:47,901 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-26 22:33:47,901 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-26 22:33:47,904 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:33:47" (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-26 22:33:47,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-26 22:33:47,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-26 22:33:47,991 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-26 22:33:47,991 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2020-10-26 22:33:47,992 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-26 22:33:47,992 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2020-10-26 22:33:47,992 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-26 22:33:47,993 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-26 22:33:47,993 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-26 22:33:47,993 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-26 22:33:47,994 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-26 22:33:47,994 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-10-26 22:33:47,994 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-26 22:33:47,995 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-26 22:33:47,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-26 22:33:47,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-26 22:33:47,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-26 22:33:47,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-26 22:33:47,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-26 22:33:49,402 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-26 22:33:49,403 INFO L298 CfgBuilder]: Removed 1 assume(true) statements. [2020-10-26 22:33:49,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 10:33:49 BoogieIcfgContainer [2020-10-26 22:33:49,405 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-26 22:33:49,407 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-26 22:33:49,407 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-26 22:33:49,411 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-26 22:33:49,411 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 10:33:47" (1/3) ... [2020-10-26 22:33:49,412 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@149f884e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 10:33:49, skipping insertion in model container [2020-10-26 22:33:49,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:33:47" (2/3) ... [2020-10-26 22:33:49,413 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@149f884e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 10:33:49, skipping insertion in model container [2020-10-26 22:33:49,413 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 10:33:49" (3/3) ... [2020-10-26 22:33:49,414 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem10_label55.c [2020-10-26 22:33:49,427 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-26 22:33:49,432 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-26 22:33:49,452 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-26 22:33:49,483 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-26 22:33:49,483 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-26 22:33:49,484 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-26 22:33:49,484 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-26 22:33:49,484 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-26 22:33:49,484 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-26 22:33:49,484 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-26 22:33:49,484 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-26 22:33:49,508 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states. [2020-10-26 22:33:49,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-26 22:33:49,515 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 22:33:49,515 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 22:33:49,516 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 22:33:49,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 22:33:49,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1481450178, now seen corresponding path program 1 times [2020-10-26 22:33:49,532 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-26 22:33:49,532 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1912159077] [2020-10-26 22:33:49,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 22:33:49,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:49,724 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:50,215 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:50,216 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 35 [2020-10-26 22:33:50,216 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:33:50,217 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 532 [2020-10-26 22:33:50,218 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:50,219 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-10-26 22:33:50,219 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 5 [2020-10-26 22:33:50,219 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 26 [2020-10-26 22:33:50,219 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 2 [2020-10-26 22:33:50,355 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 22:33:50,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:50,370 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:50,388 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:50,388 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-26 22:33:50,388 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:33:50,389 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 22 [2020-10-26 22:33:50,389 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:50,389 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-26 22:33:50,389 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:33:50,390 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 2 [2020-10-26 22:33:50,390 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:50,405 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-26 22:33:50,406 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1912159077] [2020-10-26 22:33:50,408 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 22:33:50,408 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 22:33:50,409 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021229808] [2020-10-26 22:33:50,413 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-26 22:33:50,414 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-26 22:33:50,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 22:33:50,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-26 22:33:50,431 INFO L87 Difference]: Start difference. First operand 219 states. Second operand 4 states. [2020-10-26 22:33:52,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 22:33:52,128 INFO L93 Difference]: Finished difference Result 586 states and 1012 transitions. [2020-10-26 22:33:52,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-26 22:33:52,130 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2020-10-26 22:33:52,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 22:33:52,145 INFO L225 Difference]: With dead ends: 586 [2020-10-26 22:33:52,145 INFO L226 Difference]: Without dead ends: 303 [2020-10-26 22:33:52,152 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-26 22:33:52,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2020-10-26 22:33:52,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 299. [2020-10-26 22:33:52,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2020-10-26 22:33:52,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 396 transitions. [2020-10-26 22:33:52,239 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 396 transitions. Word has length 25 [2020-10-26 22:33:52,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 22:33:52,240 INFO L481 AbstractCegarLoop]: Abstraction has 299 states and 396 transitions. [2020-10-26 22:33:52,240 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-26 22:33:52,240 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 396 transitions. [2020-10-26 22:33:52,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2020-10-26 22:33:52,244 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 22:33:52,245 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 22:33:52,245 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-26 22:33:52,245 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 22:33:52,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 22:33:52,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1963812639, now seen corresponding path program 1 times [2020-10-26 22:33:52,247 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-26 22:33:52,247 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1423224440] [2020-10-26 22:33:52,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 22:33:52,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:52,309 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:52,394 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:53,047 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:53,048 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 107 [2020-10-26 22:33:53,049 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-26 22:33:53,049 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 760 [2020-10-26 22:33:53,051 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:53,051 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 8 [2020-10-26 22:33:53,052 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 5 [2020-10-26 22:33:53,052 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 98 [2020-10-26 22:33:53,052 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-26 22:33:53,159 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 22:33:53,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:53,171 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:53,192 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:53,193 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-26 22:33:53,194 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:33:53,195 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 24 [2020-10-26 22:33:53,198 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:53,198 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-26 22:33:53,198 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:33:53,198 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 2 [2020-10-26 22:33:53,198 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:53,218 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-26 22:33:53,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:53,257 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:53,335 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:53,416 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:53,416 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 71 [2020-10-26 22:33:53,423 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-26 22:33:53,424 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 171 [2020-10-26 22:33:53,424 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:53,424 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-26 22:33:53,424 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-26 22:33:53,424 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 71 [2020-10-26 22:33:53,425 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:53,551 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-26 22:33:53,551 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1423224440] [2020-10-26 22:33:53,551 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-26 22:33:53,552 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-10-26 22:33:53,552 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059190452] [2020-10-26 22:33:53,554 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-26 22:33:53,554 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-26 22:33:53,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-26 22:33:53,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-26 22:33:53,560 INFO L87 Difference]: Start difference. First operand 299 states and 396 transitions. Second operand 6 states. [2020-10-26 22:33:55,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 22:33:55,136 INFO L93 Difference]: Finished difference Result 890 states and 1204 transitions. [2020-10-26 22:33:55,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-26 22:33:55,138 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2020-10-26 22:33:55,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 22:33:55,144 INFO L225 Difference]: With dead ends: 890 [2020-10-26 22:33:55,144 INFO L226 Difference]: Without dead ends: 597 [2020-10-26 22:33:55,145 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2020-10-26 22:33:55,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2020-10-26 22:33:55,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 591. [2020-10-26 22:33:55,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2020-10-26 22:33:55,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 760 transitions. [2020-10-26 22:33:55,191 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 760 transitions. Word has length 95 [2020-10-26 22:33:55,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 22:33:55,192 INFO L481 AbstractCegarLoop]: Abstraction has 591 states and 760 transitions. [2020-10-26 22:33:55,192 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-26 22:33:55,192 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 760 transitions. [2020-10-26 22:33:55,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2020-10-26 22:33:55,195 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 22:33:55,195 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 22:33:55,195 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-26 22:33:55,195 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 22:33:55,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 22:33:55,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1711452285, now seen corresponding path program 1 times [2020-10-26 22:33:55,196 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-26 22:33:55,197 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2022510577] [2020-10-26 22:33:55,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 22:33:55,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:55,255 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:55,499 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:55,499 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 116 [2020-10-26 22:33:55,499 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:33:55,499 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 266 [2020-10-26 22:33:55,500 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:55,500 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-26 22:33:55,500 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 89 [2020-10-26 22:33:55,500 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 23 [2020-10-26 22:33:55,500 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:55,593 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 22:33:55,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:55,599 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:55,608 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:55,608 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-26 22:33:55,608 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:33:55,609 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 11 [2020-10-26 22:33:55,609 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:55,609 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-26 22:33:55,609 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:33:55,609 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-26 22:33:55,609 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:55,624 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-26 22:33:55,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:55,666 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:55,743 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:55,743 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 80 [2020-10-26 22:33:55,744 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:33:55,744 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 92 [2020-10-26 22:33:55,744 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:55,744 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-26 22:33:55,744 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:33:55,744 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 74 [2020-10-26 22:33:55,745 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:55,800 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 22:33:55,800 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2022510577] [2020-10-26 22:33:55,801 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-26 22:33:55,801 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-10-26 22:33:55,801 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282805603] [2020-10-26 22:33:55,802 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-26 22:33:55,802 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-26 22:33:55,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-26 22:33:55,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-26 22:33:55,804 INFO L87 Difference]: Start difference. First operand 591 states and 760 transitions. Second operand 5 states. [2020-10-26 22:33:57,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 22:33:57,382 INFO L93 Difference]: Finished difference Result 1472 states and 1975 transitions. [2020-10-26 22:33:57,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-26 22:33:57,383 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2020-10-26 22:33:57,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 22:33:57,398 INFO L225 Difference]: With dead ends: 1472 [2020-10-26 22:33:57,399 INFO L226 Difference]: Without dead ends: 887 [2020-10-26 22:33:57,400 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-26 22:33:57,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2020-10-26 22:33:57,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 881. [2020-10-26 22:33:57,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 881 states. [2020-10-26 22:33:57,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1137 transitions. [2020-10-26 22:33:57,442 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1137 transitions. Word has length 104 [2020-10-26 22:33:57,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 22:33:57,442 INFO L481 AbstractCegarLoop]: Abstraction has 881 states and 1137 transitions. [2020-10-26 22:33:57,443 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-26 22:33:57,443 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1137 transitions. [2020-10-26 22:33:57,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-10-26 22:33:57,448 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 22:33:57,448 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 22:33:57,448 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-26 22:33:57,448 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 22:33:57,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 22:33:57,449 INFO L82 PathProgramCache]: Analyzing trace with hash 528916950, now seen corresponding path program 1 times [2020-10-26 22:33:57,449 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-26 22:33:57,450 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [902633051] [2020-10-26 22:33:57,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 22:33:57,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:57,567 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:57,791 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:58,000 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:58,239 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:59,194 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:59,194 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 191 [2020-10-26 22:33:59,194 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 4 [2020-10-26 22:33:59,195 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1659 [2020-10-26 22:33:59,195 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:59,195 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-26 22:33:59,195 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 89 [2020-10-26 22:33:59,195 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 76 [2020-10-26 22:33:59,195 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:59,308 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 22:33:59,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:59,313 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:59,326 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:59,326 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-26 22:33:59,327 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:33:59,327 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 13 [2020-10-26 22:33:59,327 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:59,327 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-26 22:33:59,327 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:33:59,328 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-26 22:33:59,328 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:59,360 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-26 22:33:59,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:59,394 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:59,450 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:59,451 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 80 [2020-10-26 22:33:59,451 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:33:59,451 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 67 [2020-10-26 22:33:59,451 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:59,451 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-26 22:33:59,451 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:33:59,452 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 74 [2020-10-26 22:33:59,452 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:59,477 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-10-26 22:33:59,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:59,510 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:59,623 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:59,624 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 74 [2020-10-26 22:33:59,624 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:33:59,624 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 123 [2020-10-26 22:33:59,624 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:59,624 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-26 22:33:59,624 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-26 22:33:59,625 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 74 [2020-10-26 22:33:59,625 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:59,756 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 104 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-26 22:33:59,757 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [902633051] [2020-10-26 22:33:59,757 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-26 22:33:59,757 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-26 22:33:59,757 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603928407] [2020-10-26 22:33:59,760 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-26 22:33:59,760 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-26 22:33:59,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-26 22:33:59,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-26 22:33:59,761 INFO L87 Difference]: Start difference. First operand 881 states and 1137 transitions. Second operand 7 states. [2020-10-26 22:34:01,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 22:34:01,840 INFO L93 Difference]: Finished difference Result 2223 states and 2950 transitions. [2020-10-26 22:34:01,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-26 22:34:01,841 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 177 [2020-10-26 22:34:01,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 22:34:01,849 INFO L225 Difference]: With dead ends: 2223 [2020-10-26 22:34:01,849 INFO L226 Difference]: Without dead ends: 1058 [2020-10-26 22:34:01,853 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-10-26 22:34:01,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1058 states. [2020-10-26 22:34:01,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1058 to 1040. [2020-10-26 22:34:01,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1040 states. [2020-10-26 22:34:01,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1040 states to 1040 states and 1288 transitions. [2020-10-26 22:34:01,895 INFO L78 Accepts]: Start accepts. Automaton has 1040 states and 1288 transitions. Word has length 177 [2020-10-26 22:34:01,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 22:34:01,895 INFO L481 AbstractCegarLoop]: Abstraction has 1040 states and 1288 transitions. [2020-10-26 22:34:01,895 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-26 22:34:01,895 INFO L276 IsEmpty]: Start isEmpty. Operand 1040 states and 1288 transitions. [2020-10-26 22:34:01,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2020-10-26 22:34:01,898 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 22:34:01,899 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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-26 22:34:01,899 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-26 22:34:01,899 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 22:34:01,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 22:34:01,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1576973084, now seen corresponding path program 1 times [2020-10-26 22:34:01,900 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-26 22:34:01,900 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [29387874] [2020-10-26 22:34:01,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 22:34:01,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:01,980 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:02,230 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:02,492 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:02,965 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:03,238 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:03,239 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 199 [2020-10-26 22:34:03,239 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 4 [2020-10-26 22:34:03,239 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1288 [2020-10-26 22:34:03,239 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:03,239 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-10-26 22:34:03,240 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 80 [2020-10-26 22:34:03,240 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 115 [2020-10-26 22:34:03,240 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:03,349 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 22:34:03,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:03,356 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:03,361 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:03,361 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-26 22:34:03,361 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:34:03,361 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 6 [2020-10-26 22:34:03,362 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:03,362 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-26 22:34:03,362 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:34:03,362 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-26 22:34:03,363 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:03,378 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-26 22:34:03,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:03,401 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:03,448 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:03,449 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 71 [2020-10-26 22:34:03,449 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:34:03,449 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 56 [2020-10-26 22:34:03,449 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:03,449 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-26 22:34:03,449 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:34:03,450 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 65 [2020-10-26 22:34:03,450 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:03,471 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2020-10-26 22:34:03,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:03,503 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:03,563 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:03,675 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:03,675 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 91 [2020-10-26 22:34:03,675 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-26 22:34:03,676 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 185 [2020-10-26 22:34:03,676 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:03,676 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-26 22:34:03,676 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-26 22:34:03,676 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 91 [2020-10-26 22:34:03,677 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:03,792 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 82 proven. 17 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-26 22:34:03,792 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [29387874] [2020-10-26 22:34:03,793 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-26 22:34:03,793 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-10-26 22:34:03,793 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479427429] [2020-10-26 22:34:03,794 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-26 22:34:03,794 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-26 22:34:03,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-26 22:34:03,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-26 22:34:03,795 INFO L87 Difference]: Start difference. First operand 1040 states and 1288 transitions. Second operand 6 states. [2020-10-26 22:34:05,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 22:34:05,204 INFO L93 Difference]: Finished difference Result 2537 states and 3233 transitions. [2020-10-26 22:34:05,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-26 22:34:05,205 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 185 [2020-10-26 22:34:05,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 22:34:05,214 INFO L225 Difference]: With dead ends: 2537 [2020-10-26 22:34:05,214 INFO L226 Difference]: Without dead ends: 1356 [2020-10-26 22:34:05,216 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-10-26 22:34:05,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356 states. [2020-10-26 22:34:05,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356 to 1342. [2020-10-26 22:34:05,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1342 states. [2020-10-26 22:34:05,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1342 states and 1699 transitions. [2020-10-26 22:34:05,267 INFO L78 Accepts]: Start accepts. Automaton has 1342 states and 1699 transitions. Word has length 185 [2020-10-26 22:34:05,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 22:34:05,268 INFO L481 AbstractCegarLoop]: Abstraction has 1342 states and 1699 transitions. [2020-10-26 22:34:05,268 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-26 22:34:05,268 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 1699 transitions. [2020-10-26 22:34:05,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2020-10-26 22:34:05,271 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 22:34:05,272 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-26 22:34:05,272 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-26 22:34:05,272 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 22:34:05,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 22:34:05,273 INFO L82 PathProgramCache]: Analyzing trace with hash 2114815486, now seen corresponding path program 1 times [2020-10-26 22:34:05,273 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-26 22:34:05,273 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1960173227] [2020-10-26 22:34:05,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 22:34:05,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:05,328 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:05,404 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:06,218 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:06,475 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:06,856 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:09,819 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:09,820 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 206 [2020-10-26 22:34:09,820 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 5 [2020-10-26 22:34:09,820 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 4511 [2020-10-26 22:34:09,820 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:09,820 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-10-26 22:34:09,820 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 5 [2020-10-26 22:34:09,821 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 83 [2020-10-26 22:34:09,821 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:09,926 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 22:34:09,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:09,936 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:09,945 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:09,946 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-26 22:34:09,946 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:34:09,946 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 11 [2020-10-26 22:34:09,946 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:09,946 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-26 22:34:09,946 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:34:09,947 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 2 [2020-10-26 22:34:09,947 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:09,963 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-26 22:34:09,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:09,990 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:10,102 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:10,103 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 78 [2020-10-26 22:34:10,103 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:34:10,103 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 123 [2020-10-26 22:34:10,103 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:10,103 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-26 22:34:10,104 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-26 22:34:10,104 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 78 [2020-10-26 22:34:10,104 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:10,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2020-10-26 22:34:10,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:10,199 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:10,232 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:10,232 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 91 [2020-10-26 22:34:10,233 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:34:10,233 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 44 [2020-10-26 22:34:10,233 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:10,233 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-26 22:34:10,233 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 88 [2020-10-26 22:34:10,233 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-26 22:34:10,233 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:10,314 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 34 proven. 72 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-26 22:34:10,314 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1960173227] [2020-10-26 22:34:10,315 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-26 22:34:10,315 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-26 22:34:10,315 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894457182] [2020-10-26 22:34:10,316 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-26 22:34:10,316 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-26 22:34:10,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-26 22:34:10,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-26 22:34:10,317 INFO L87 Difference]: Start difference. First operand 1342 states and 1699 transitions. Second operand 7 states. [2020-10-26 22:34:11,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 22:34:11,990 INFO L93 Difference]: Finished difference Result 2986 states and 3757 transitions. [2020-10-26 22:34:11,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-26 22:34:11,991 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 192 [2020-10-26 22:34:11,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 22:34:12,002 INFO L225 Difference]: With dead ends: 2986 [2020-10-26 22:34:12,002 INFO L226 Difference]: Without dead ends: 1650 [2020-10-26 22:34:12,005 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-10-26 22:34:12,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1650 states. [2020-10-26 22:34:12,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1650 to 1640. [2020-10-26 22:34:12,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1640 states. [2020-10-26 22:34:12,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1640 states to 1640 states and 2028 transitions. [2020-10-26 22:34:12,073 INFO L78 Accepts]: Start accepts. Automaton has 1640 states and 2028 transitions. Word has length 192 [2020-10-26 22:34:12,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 22:34:12,073 INFO L481 AbstractCegarLoop]: Abstraction has 1640 states and 2028 transitions. [2020-10-26 22:34:12,073 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-26 22:34:12,073 INFO L276 IsEmpty]: Start isEmpty. Operand 1640 states and 2028 transitions. [2020-10-26 22:34:12,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2020-10-26 22:34:12,078 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 22:34:12,078 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 22:34:12,079 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-26 22:34:12,079 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 22:34:12,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 22:34:12,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1095852028, now seen corresponding path program 1 times [2020-10-26 22:34:12,080 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-26 22:34:12,080 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1247218755] [2020-10-26 22:34:12,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 22:34:12,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:12,177 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:12,290 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:13,643 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:13,643 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 250 [2020-10-26 22:34:13,643 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-26 22:34:13,643 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1502 [2020-10-26 22:34:13,644 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:13,644 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 11 [2020-10-26 22:34:13,644 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 80 [2020-10-26 22:34:13,644 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 143 [2020-10-26 22:34:13,644 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:13,835 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 22:34:13,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:13,840 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:13,844 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:13,845 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-26 22:34:13,845 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:34:13,845 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 5 [2020-10-26 22:34:13,845 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:13,845 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-26 22:34:13,846 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:34:13,846 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-26 22:34:13,846 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:13,892 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-26 22:34:13,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:13,918 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:13,960 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:13,960 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 71 [2020-10-26 22:34:13,961 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:34:13,961 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 50 [2020-10-26 22:34:13,962 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:13,962 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-26 22:34:13,962 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:34:13,962 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 65 [2020-10-26 22:34:13,962 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:13,986 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2020-10-26 22:34:14,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:14,041 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:14,163 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:14,784 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:14,785 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 142 [2020-10-26 22:34:14,785 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-26 22:34:14,785 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 764 [2020-10-26 22:34:14,785 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:14,785 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-26 22:34:14,786 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-26 22:34:14,786 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 142 [2020-10-26 22:34:14,786 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:15,068 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 101 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-26 22:34:15,069 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1247218755] [2020-10-26 22:34:15,069 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-26 22:34:15,069 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-10-26 22:34:15,069 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702164546] [2020-10-26 22:34:15,070 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-26 22:34:15,070 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-26 22:34:15,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-26 22:34:15,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-10-26 22:34:15,072 INFO L87 Difference]: Start difference. First operand 1640 states and 2028 transitions. Second operand 8 states. [2020-10-26 22:34:17,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 22:34:17,137 INFO L93 Difference]: Finished difference Result 3320 states and 4234 transitions. [2020-10-26 22:34:17,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-26 22:34:17,138 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 236 [2020-10-26 22:34:17,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 22:34:17,150 INFO L225 Difference]: With dead ends: 3320 [2020-10-26 22:34:17,151 INFO L226 Difference]: Without dead ends: 1829 [2020-10-26 22:34:17,156 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2020-10-26 22:34:17,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1829 states. [2020-10-26 22:34:17,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1829 to 1791. [2020-10-26 22:34:17,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1791 states. [2020-10-26 22:34:17,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1791 states to 1791 states and 2192 transitions. [2020-10-26 22:34:17,221 INFO L78 Accepts]: Start accepts. Automaton has 1791 states and 2192 transitions. Word has length 236 [2020-10-26 22:34:17,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 22:34:17,221 INFO L481 AbstractCegarLoop]: Abstraction has 1791 states and 2192 transitions. [2020-10-26 22:34:17,221 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-26 22:34:17,222 INFO L276 IsEmpty]: Start isEmpty. Operand 1791 states and 2192 transitions. [2020-10-26 22:34:17,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2020-10-26 22:34:17,227 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 22:34:17,227 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 22:34:17,228 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-26 22:34:17,228 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 22:34:17,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 22:34:17,228 INFO L82 PathProgramCache]: Analyzing trace with hash -291438442, now seen corresponding path program 1 times [2020-10-26 22:34:17,229 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-26 22:34:17,230 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1555283326] [2020-10-26 22:34:17,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 22:34:17,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 22:34:17,344 INFO L173 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-10-26 22:34:17,345 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-26 22:34:17,359 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-26 22:34:17,411 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 10:34:17 BoogieIcfgContainer [2020-10-26 22:34:17,411 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-26 22:34:17,413 INFO L168 Benchmark]: Toolchain (without parser) took 30288.11 ms. Allocated memory was 151.0 MB in the beginning and 544.2 MB in the end (delta: 393.2 MB). Free memory was 125.3 MB in the beginning and 335.9 MB in the end (delta: -210.6 MB). Peak memory consumption was 183.0 MB. Max. memory is 8.0 GB. [2020-10-26 22:34:17,414 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 151.0 MB. Free memory was 123.2 MB in the beginning and 123.1 MB in the end (delta: 105.7 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-10-26 22:34:17,415 INFO L168 Benchmark]: CACSL2BoogieTranslator took 610.98 ms. Allocated memory is still 151.0 MB. Free memory was 124.7 MB in the beginning and 98.0 MB in the end (delta: 26.7 MB). Peak memory consumption was 27.3 MB. Max. memory is 8.0 GB. [2020-10-26 22:34:17,416 INFO L168 Benchmark]: Boogie Preprocessor took 157.83 ms. Allocated memory is still 151.0 MB. Free memory was 98.0 MB in the beginning and 130.1 MB in the end (delta: -32.1 MB). Peak memory consumption was 6.6 MB. Max. memory is 8.0 GB. [2020-10-26 22:34:17,417 INFO L168 Benchmark]: RCFGBuilder took 1504.12 ms. Allocated memory was 151.0 MB in the beginning and 181.4 MB in the end (delta: 30.4 MB). Free memory was 130.1 MB in the beginning and 140.9 MB in the end (delta: -10.8 MB). Peak memory consumption was 83.9 MB. Max. memory is 8.0 GB. [2020-10-26 22:34:17,418 INFO L168 Benchmark]: TraceAbstraction took 28003.78 ms. Allocated memory was 181.4 MB in the beginning and 544.2 MB in the end (delta: 362.8 MB). Free memory was 140.3 MB in the beginning and 335.9 MB in the end (delta: -195.5 MB). Peak memory consumption was 167.3 MB. Max. memory is 8.0 GB. [2020-10-26 22:34:17,421 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.17 ms. Allocated memory is still 151.0 MB. Free memory was 123.2 MB in the beginning and 123.1 MB in the end (delta: 105.7 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 610.98 ms. Allocated memory is still 151.0 MB. Free memory was 124.7 MB in the beginning and 98.0 MB in the end (delta: 26.7 MB). Peak memory consumption was 27.3 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 157.83 ms. Allocated memory is still 151.0 MB. Free memory was 98.0 MB in the beginning and 130.1 MB in the end (delta: -32.1 MB). Peak memory consumption was 6.6 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1504.12 ms. Allocated memory was 151.0 MB in the beginning and 181.4 MB in the end (delta: 30.4 MB). Free memory was 130.1 MB in the beginning and 140.9 MB in the end (delta: -10.8 MB). Peak memory consumption was 83.9 MB. Max. memory is 8.0 GB. * TraceAbstraction took 28003.78 ms. Allocated memory was 181.4 MB in the beginning and 544.2 MB in the end (delta: 362.8 MB). Free memory was 140.3 MB in the beginning and 335.9 MB in the end (delta: -195.5 MB). Peak memory consumption was 167.3 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 TRUE ((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0)) [L428] a1 = ((((a1 / 5) * 5) / 5) + 505228) [L429] a10 = 1 [L431] return 25; [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 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 FALSE !(((a4==14) && ((a19==9) && ((a12==0) && (((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)))))) [L531] COND FALSE !(((a19==9) && (((a10==1) && ((a12==0) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )))) && (a4==14)))) [L536] COND FALSE !(((a19==9) && ((a4==14) && ((a10==1) && (((input == 5) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a12==0)))))) [L542] COND FALSE !(((a12==0) && (((((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a19==9)) && (a4==14)) && (a10==0)))) [L547] COND FALSE !(((a4==14) && (((a12==0) && ((a19==9) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )))) && (a10==4)))) [L550] COND FALSE !(((((( ((38 < a1) && (218 >= a1)) && (input == 3)) && (a10==1)) && (a12==0)) && (a4==14)) && (a19==10))) [L556] COND FALSE !((((a4==14) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 4)) && (a12==0)) && (a19==9))) && (a10==2))) [L559] COND TRUE ((a12==0) && ((( 218 < a1 && ((a19==9) && (input == 5))) && (a10==1)) && (a4==14))) [L560] a1 = ((((a1 * 9)/ 10) + 58620) - 603783) [L561] a10 = 4 [L562] a19 = 8 [L564] 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 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 TRUE (((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8)) [L60] CALL reach_error() [L4] __assert_fail("0", "Problem10_label55.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: 27.8s, OverallIterations: 8, TraceHistogramMax: 3, AutomataDifference: 12.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 173 SDtfs, 2920 SDslu, 187 SDs, 0 SdLazy, 5428 SolverSat, 888 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 99 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1791occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 7 MinimizatonAttempts, 96 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 14.2s InterpolantComputationTime, 1295 NumberOfCodeBlocks, 1295 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1007 ConstructedInterpolants, 0 QuantifiedInterpolants, 674162 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 365/460 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...