/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_label12.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-0f64333 [2020-10-26 22:30:26,187 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-26 22:30:26,192 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-26 22:30:26,254 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-26 22:30:26,255 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-26 22:30:26,256 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-26 22:30:26,258 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-26 22:30:26,261 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-26 22:30:26,263 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-26 22:30:26,265 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-26 22:30:26,266 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-26 22:30:26,268 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-26 22:30:26,268 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-26 22:30:26,270 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-26 22:30:26,271 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-26 22:30:26,273 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-26 22:30:26,274 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-26 22:30:26,275 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-26 22:30:26,278 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-26 22:30:26,300 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-26 22:30:26,303 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-26 22:30:26,312 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-26 22:30:26,313 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-26 22:30:26,318 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-26 22:30:26,334 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-26 22:30:26,335 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-26 22:30:26,335 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-26 22:30:26,340 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-26 22:30:26,344 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-26 22:30:26,345 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-26 22:30:26,346 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-26 22:30:26,347 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-26 22:30:26,350 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-26 22:30:26,351 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-26 22:30:26,353 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-26 22:30:26,353 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-26 22:30:26,354 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-26 22:30:26,355 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-26 22:30:26,355 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-26 22:30:26,356 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-26 22:30:26,357 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-26 22:30:26,359 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:30:26,387 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-26 22:30:26,387 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-26 22:30:26,389 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-26 22:30:26,389 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-26 22:30:26,389 INFO L138 SettingsManager]: * Use SBE=true [2020-10-26 22:30:26,390 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-26 22:30:26,390 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-26 22:30:26,390 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-26 22:30:26,391 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-26 22:30:26,391 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-26 22:30:26,391 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-26 22:30:26,391 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-26 22:30:26,392 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-26 22:30:26,392 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-26 22:30:26,392 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-26 22:30:26,392 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-26 22:30:26,392 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-26 22:30:26,393 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-26 22:30:26,393 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-26 22:30:26,393 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-26 22:30:26,393 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-26 22:30:26,394 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-26 22:30:26,394 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-26 22:30:26,394 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-26 22:30:26,394 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-26 22:30:26,395 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-26 22:30:26,395 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-26 22:30:26,395 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-26 22:30:26,395 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-26 22:30:26,395 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:30:26,821 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-26 22:30:26,848 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-26 22:30:26,851 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-26 22:30:26,853 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-26 22:30:26,854 INFO L275 PluginConnector]: CDTParser initialized [2020-10-26 22:30:26,855 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label12.c [2020-10-26 22:30:26,948 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/e8f2b3fe6/7c63e2d3d47d4042a4caa0eeceb4b2fd/FLAG20b91e612 [2020-10-26 22:30:27,802 INFO L306 CDTParser]: Found 1 translation units. [2020-10-26 22:30:27,806 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/eca-rers2012/Problem10_label12.c [2020-10-26 22:30:27,840 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/e8f2b3fe6/7c63e2d3d47d4042a4caa0eeceb4b2fd/FLAG20b91e612 [2020-10-26 22:30:27,865 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/e8f2b3fe6/7c63e2d3d47d4042a4caa0eeceb4b2fd [2020-10-26 22:30:27,870 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-26 22:30:27,878 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-26 22:30:27,882 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-26 22:30:27,882 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-26 22:30:27,887 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-26 22:30:27,887 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 10:30:27" (1/1) ... [2020-10-26 22:30:27,891 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6de25a40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:30:27, skipping insertion in model container [2020-10-26 22:30:27,892 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 10:30:27" (1/1) ... [2020-10-26 22:30:27,905 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-26 22:30:27,966 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-26 22:30:28,396 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 22:30:28,407 INFO L203 MainTranslator]: Completed pre-run [2020-10-26 22:30:28,590 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 22:30:28,609 INFO L208 MainTranslator]: Completed translation [2020-10-26 22:30:28,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:30:28 WrapperNode [2020-10-26 22:30:28,610 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-26 22:30:28,611 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-26 22:30:28,611 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-26 22:30:28,611 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-26 22:30:28,626 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:30:28" (1/1) ... [2020-10-26 22:30:28,627 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:30:28" (1/1) ... [2020-10-26 22:30:28,649 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:30:28" (1/1) ... [2020-10-26 22:30:28,650 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:30:28" (1/1) ... [2020-10-26 22:30:28,688 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:30:28" (1/1) ... [2020-10-26 22:30:28,704 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:30:28" (1/1) ... [2020-10-26 22:30:28,712 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:30:28" (1/1) ... [2020-10-26 22:30:28,721 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-26 22:30:28,723 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-26 22:30:28,723 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-26 22:30:28,723 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-26 22:30:28,727 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:30:28" (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:30:28,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-26 22:30:28,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-26 22:30:28,820 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-26 22:30:28,820 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2020-10-26 22:30:28,821 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-26 22:30:28,821 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2020-10-26 22:30:28,821 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-26 22:30:28,821 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-26 22:30:28,822 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-26 22:30:28,822 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-26 22:30:28,823 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-26 22:30:28,823 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-10-26 22:30:28,823 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-26 22:30:28,824 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-26 22:30:28,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-26 22:30:28,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-26 22:30:28,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-26 22:30:28,825 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-26 22:30:28,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-26 22:30:30,305 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-26 22:30:30,305 INFO L298 CfgBuilder]: Removed 1 assume(true) statements. [2020-10-26 22:30:30,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 10:30:30 BoogieIcfgContainer [2020-10-26 22:30:30,308 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-26 22:30:30,310 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-26 22:30:30,310 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-26 22:30:30,314 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-26 22:30:30,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 10:30:27" (1/3) ... [2020-10-26 22:30:30,315 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37d562d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 10:30:30, skipping insertion in model container [2020-10-26 22:30:30,315 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:30:28" (2/3) ... [2020-10-26 22:30:30,316 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37d562d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 10:30:30, skipping insertion in model container [2020-10-26 22:30:30,316 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 10:30:30" (3/3) ... [2020-10-26 22:30:30,318 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem10_label12.c [2020-10-26 22:30:30,331 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-26 22:30:30,337 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-26 22:30:30,351 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-26 22:30:30,383 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-26 22:30:30,383 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-26 22:30:30,383 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-26 22:30:30,383 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-26 22:30:30,383 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-26 22:30:30,384 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-26 22:30:30,384 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-26 22:30:30,384 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-26 22:30:30,410 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states. [2020-10-26 22:30:30,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-26 22:30:30,421 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 22:30:30,422 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 22:30:30,423 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 22:30:30,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 22:30:30,430 INFO L82 PathProgramCache]: Analyzing trace with hash -2066663958, now seen corresponding path program 1 times [2020-10-26 22:30:30,440 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-26 22:30:30,441 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1553791362] [2020-10-26 22:30:30,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 22:30:30,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:30:30,696 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:30:31,115 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:30:31,116 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 29 [2020-10-26 22:30:31,118 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:30:31,118 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 499 [2020-10-26 22:30:31,120 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:30:31,120 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-10-26 22:30:31,120 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 5 [2020-10-26 22:30:31,121 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 20 [2020-10-26 22:30:31,121 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 2 [2020-10-26 22:30:31,292 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 22:30:31,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:30:31,325 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:30:31,368 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:30:31,368 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-26 22:30:31,368 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:30:31,369 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 55 [2020-10-26 22:30:31,369 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:30:31,370 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-26 22:30:31,370 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:30:31,370 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 2 [2020-10-26 22:30:31,371 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-26 22:30:31,395 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:30:31,396 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1553791362] [2020-10-26 22:30:31,398 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 22:30:31,398 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 22:30:31,400 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731882328] [2020-10-26 22:30:31,408 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-26 22:30:31,408 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-26 22:30:31,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 22:30:31,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-26 22:30:31,432 INFO L87 Difference]: Start difference. First operand 219 states. Second operand 4 states. [2020-10-26 22:30:33,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 22:30:33,448 INFO L93 Difference]: Finished difference Result 586 states and 1013 transitions. [2020-10-26 22:30:33,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-26 22:30:33,451 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2020-10-26 22:30:33,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 22:30:33,480 INFO L225 Difference]: With dead ends: 586 [2020-10-26 22:30:33,480 INFO L226 Difference]: Without dead ends: 303 [2020-10-26 22:30:33,493 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:30:33,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2020-10-26 22:30:33,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 297. [2020-10-26 22:30:33,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2020-10-26 22:30:33,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 424 transitions. [2020-10-26 22:30:33,584 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 424 transitions. Word has length 19 [2020-10-26 22:30:33,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 22:30:33,585 INFO L481 AbstractCegarLoop]: Abstraction has 297 states and 424 transitions. [2020-10-26 22:30:33,585 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-26 22:30:33,585 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 424 transitions. [2020-10-26 22:30:33,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-10-26 22:30:33,589 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 22:30:33,590 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 22:30:33,590 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-26 22:30:33,590 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 22:30:33,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 22:30:33,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1489360533, now seen corresponding path program 1 times [2020-10-26 22:30:33,591 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-26 22:30:33,591 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [199068496] [2020-10-26 22:30:33,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 22:30:33,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:30:33,654 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:30:33,880 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:30:34,657 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:30:34,971 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:30:34,971 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 103 [2020-10-26 22:30:34,972 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 3 [2020-10-26 22:30:34,972 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1341 [2020-10-26 22:30:34,973 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:30:34,973 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-10-26 22:30:34,973 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 5 [2020-10-26 22:30:34,973 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 78 [2020-10-26 22:30:34,974 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-26 22:30:35,065 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 22:30:35,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:30:35,075 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:30:35,087 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:30:35,087 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-26 22:30:35,088 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:30:35,088 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 14 [2020-10-26 22:30:35,088 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:30:35,088 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-26 22:30:35,088 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:30:35,089 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 2 [2020-10-26 22:30:35,089 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:30:35,106 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-26 22:30:35,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:30:35,132 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:30:35,216 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:30:35,217 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 73 [2020-10-26 22:30:35,217 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:30:35,217 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 94 [2020-10-26 22:30:35,217 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:30:35,218 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-26 22:30:35,218 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-26 22:30:35,218 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 73 [2020-10-26 22:30:35,218 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:30:35,288 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 22:30:35,289 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [199068496] [2020-10-26 22:30:35,289 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 22:30:35,289 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-26 22:30:35,290 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811801502] [2020-10-26 22:30:35,291 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-26 22:30:35,292 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-26 22:30:35,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-26 22:30:35,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-26 22:30:35,293 INFO L87 Difference]: Start difference. First operand 297 states and 424 transitions. Second operand 7 states. [2020-10-26 22:30:37,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 22:30:37,409 INFO L93 Difference]: Finished difference Result 914 states and 1340 transitions. [2020-10-26 22:30:37,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-26 22:30:37,410 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2020-10-26 22:30:37,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 22:30:37,416 INFO L225 Difference]: With dead ends: 914 [2020-10-26 22:30:37,416 INFO L226 Difference]: Without dead ends: 623 [2020-10-26 22:30:37,418 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-10-26 22:30:37,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2020-10-26 22:30:37,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 597. [2020-10-26 22:30:37,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 597 states. [2020-10-26 22:30:37,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 767 transitions. [2020-10-26 22:30:37,515 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 767 transitions. Word has length 91 [2020-10-26 22:30:37,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 22:30:37,516 INFO L481 AbstractCegarLoop]: Abstraction has 597 states and 767 transitions. [2020-10-26 22:30:37,516 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-26 22:30:37,516 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 767 transitions. [2020-10-26 22:30:37,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-10-26 22:30:37,520 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 22:30:37,520 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 22:30:37,520 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-26 22:30:37,521 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 22:30:37,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 22:30:37,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1000520635, now seen corresponding path program 1 times [2020-10-26 22:30:37,521 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-26 22:30:37,522 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1855491628] [2020-10-26 22:30:37,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 22:30:37,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:30:37,589 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:30:37,817 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:30:37,817 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 110 [2020-10-26 22:30:37,817 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:30:37,817 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 257 [2020-10-26 22:30:37,818 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:30:37,818 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-26 22:30:37,818 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 89 [2020-10-26 22:30:37,818 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 17 [2020-10-26 22:30:37,818 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:30:37,915 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 22:30:37,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:30:37,920 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:30:37,925 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:30:37,925 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-26 22:30:37,926 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:30:37,926 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 6 [2020-10-26 22:30:37,926 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:30:37,926 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-26 22:30:37,926 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:30:37,927 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-26 22:30:37,927 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:30:37,942 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-26 22:30:37,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:30:37,981 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:30:38,049 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:30:38,050 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 80 [2020-10-26 22:30:38,050 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:30:38,050 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 82 [2020-10-26 22:30:38,050 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:30:38,050 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-26 22:30:38,051 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:30:38,051 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 74 [2020-10-26 22:30:38,051 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:30:38,106 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 22:30:38,106 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1855491628] [2020-10-26 22:30:38,106 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-26 22:30:38,107 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-10-26 22:30:38,107 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365218959] [2020-10-26 22:30:38,109 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-26 22:30:38,110 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-26 22:30:38,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-26 22:30:38,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-26 22:30:38,112 INFO L87 Difference]: Start difference. First operand 597 states and 767 transitions. Second operand 5 states. [2020-10-26 22:30:39,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 22:30:39,837 INFO L93 Difference]: Finished difference Result 1486 states and 2000 transitions. [2020-10-26 22:30:39,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-26 22:30:39,841 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2020-10-26 22:30:39,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 22:30:39,848 INFO L225 Difference]: With dead ends: 1486 [2020-10-26 22:30:39,848 INFO L226 Difference]: Without dead ends: 895 [2020-10-26 22:30:39,851 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:30:39,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2020-10-26 22:30:39,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 891. [2020-10-26 22:30:39,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 891 states. [2020-10-26 22:30:39,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 1156 transitions. [2020-10-26 22:30:39,923 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 1156 transitions. Word has length 98 [2020-10-26 22:30:39,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 22:30:39,926 INFO L481 AbstractCegarLoop]: Abstraction has 891 states and 1156 transitions. [2020-10-26 22:30:39,926 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-26 22:30:39,927 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1156 transitions. [2020-10-26 22:30:39,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2020-10-26 22:30:39,943 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 22:30:39,944 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 22:30:39,944 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-26 22:30:39,944 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 22:30:39,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 22:30:39,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1400977410, now seen corresponding path program 1 times [2020-10-26 22:30:39,946 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-26 22:30:39,946 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [980768967] [2020-10-26 22:30:39,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 22:30:40,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:30:40,059 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:30:40,243 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:30:40,419 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:30:40,652 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:30:41,653 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:30:41,654 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 185 [2020-10-26 22:30:41,654 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 4 [2020-10-26 22:30:41,654 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1632 [2020-10-26 22:30:41,654 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:30:41,654 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-26 22:30:41,655 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 89 [2020-10-26 22:30:41,662 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 26 [2020-10-26 22:30:41,662 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 8 [2020-10-26 22:30:41,801 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 22:30:41,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:30:41,808 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:30:41,814 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:30:41,814 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-26 22:30:41,814 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:30:41,814 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 7 [2020-10-26 22:30:41,814 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:30:41,815 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-26 22:30:41,815 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:30:41,815 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-26 22:30:41,815 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:30:41,838 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-26 22:30:41,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:30:41,878 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:30:41,954 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:30:41,955 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 80 [2020-10-26 22:30:41,955 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:30:41,955 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 91 [2020-10-26 22:30:41,955 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:30:41,955 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-26 22:30:41,955 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:30:41,956 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 74 [2020-10-26 22:30:41,956 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:30:41,996 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-10-26 22:30:42,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:30:42,031 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:30:42,104 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:30:42,223 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:30:42,224 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 74 [2020-10-26 22:30:42,224 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-26 22:30:42,224 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 206 [2020-10-26 22:30:42,224 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:30:42,224 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-26 22:30:42,224 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-26 22:30:42,225 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 74 [2020-10-26 22:30:42,229 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 4 [2020-10-26 22:30:42,348 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 92 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-26 22:30:42,349 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [980768967] [2020-10-26 22:30:42,349 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-26 22:30:42,349 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-26 22:30:42,349 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672096706] [2020-10-26 22:30:42,351 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-26 22:30:42,352 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-26 22:30:42,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-26 22:30:42,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-26 22:30:42,353 INFO L87 Difference]: Start difference. First operand 891 states and 1156 transitions. Second operand 7 states. [2020-10-26 22:30:43,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 22:30:43,828 INFO L93 Difference]: Finished difference Result 1835 states and 2422 transitions. [2020-10-26 22:30:43,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-26 22:30:43,833 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 171 [2020-10-26 22:30:43,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 22:30:43,842 INFO L225 Difference]: With dead ends: 1835 [2020-10-26 22:30:43,842 INFO L226 Difference]: Without dead ends: 927 [2020-10-26 22:30:43,846 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2020-10-26 22:30:43,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2020-10-26 22:30:43,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 907. [2020-10-26 22:30:43,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 907 states. [2020-10-26 22:30:43,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1169 transitions. [2020-10-26 22:30:43,892 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1169 transitions. Word has length 171 [2020-10-26 22:30:43,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 22:30:43,893 INFO L481 AbstractCegarLoop]: Abstraction has 907 states and 1169 transitions. [2020-10-26 22:30:43,893 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-26 22:30:43,893 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1169 transitions. [2020-10-26 22:30:43,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2020-10-26 22:30:43,897 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 22:30:43,900 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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:30:43,900 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-26 22:30:43,901 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 22:30:43,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 22:30:43,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1107541812, now seen corresponding path program 1 times [2020-10-26 22:30:43,902 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-26 22:30:43,902 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [966317803] [2020-10-26 22:30:43,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 22:30:43,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:30:43,982 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:30:44,191 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:30:44,753 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:30:45,012 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:30:45,012 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 193 [2020-10-26 22:30:45,013 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 3 [2020-10-26 22:30:45,013 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1061 [2020-10-26 22:30:45,013 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:30:45,013 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-10-26 22:30:45,013 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 80 [2020-10-26 22:30:45,014 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 109 [2020-10-26 22:30:45,014 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:30:45,123 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 22:30:45,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:30:45,127 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:30:45,135 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:30:45,136 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-26 22:30:45,136 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:30:45,136 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 8 [2020-10-26 22:30:45,136 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:30:45,136 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-26 22:30:45,136 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:30:45,137 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-26 22:30:45,137 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:30:45,153 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-26 22:30:45,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:30:45,177 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:30:45,227 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:30:45,227 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 71 [2020-10-26 22:30:45,227 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:30:45,227 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 60 [2020-10-26 22:30:45,228 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:30:45,228 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-26 22:30:45,228 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:30:45,228 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 65 [2020-10-26 22:30:45,228 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:30:45,251 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2020-10-26 22:30:45,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:30:45,286 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:30:45,363 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:30:45,472 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:30:45,472 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 91 [2020-10-26 22:30:45,473 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-26 22:30:45,473 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 199 [2020-10-26 22:30:45,473 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:30:45,473 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-26 22:30:45,473 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-26 22:30:45,474 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 91 [2020-10-26 22:30:45,474 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:30:45,751 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 83 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-26 22:30:45,753 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [966317803] [2020-10-26 22:30:45,753 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-26 22:30:45,754 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-10-26 22:30:45,754 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256694428] [2020-10-26 22:30:45,755 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-26 22:30:45,756 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-26 22:30:45,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-26 22:30:45,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-26 22:30:45,757 INFO L87 Difference]: Start difference. First operand 907 states and 1169 transitions. Second operand 6 states. [2020-10-26 22:30:47,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 22:30:47,457 INFO L93 Difference]: Finished difference Result 2138 states and 2903 transitions. [2020-10-26 22:30:47,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-26 22:30:47,458 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 179 [2020-10-26 22:30:47,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 22:30:47,468 INFO L225 Difference]: With dead ends: 2138 [2020-10-26 22:30:47,468 INFO L226 Difference]: Without dead ends: 1237 [2020-10-26 22:30:47,472 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 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:30:47,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1237 states. [2020-10-26 22:30:47,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1237 to 1062. [2020-10-26 22:30:47,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1062 states. [2020-10-26 22:30:47,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1062 states to 1062 states and 1350 transitions. [2020-10-26 22:30:47,522 INFO L78 Accepts]: Start accepts. Automaton has 1062 states and 1350 transitions. Word has length 179 [2020-10-26 22:30:47,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 22:30:47,523 INFO L481 AbstractCegarLoop]: Abstraction has 1062 states and 1350 transitions. [2020-10-26 22:30:47,523 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-26 22:30:47,523 INFO L276 IsEmpty]: Start isEmpty. Operand 1062 states and 1350 transitions. [2020-10-26 22:30:47,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2020-10-26 22:30:47,527 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 22:30:47,528 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 22:30:47,528 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-26 22:30:47,528 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 22:30:47,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 22:30:47,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1442538970, now seen corresponding path program 1 times [2020-10-26 22:30:47,529 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-26 22:30:47,530 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1263706918] [2020-10-26 22:30:47,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 22:30:47,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:30:47,589 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:30:47,647 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:30:48,439 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:30:50,461 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:30:50,462 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 200 [2020-10-26 22:30:50,462 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 3 [2020-10-26 22:30:50,462 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 2894 [2020-10-26 22:30:50,462 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:30:50,462 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-10-26 22:30:50,463 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 5 [2020-10-26 22:30:50,463 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 83 [2020-10-26 22:30:50,463 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:30:50,558 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 22:30:50,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:30:50,569 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:30:50,584 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:30:50,584 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-26 22:30:50,584 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:30:50,585 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 17 [2020-10-26 22:30:50,585 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:30:50,585 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-26 22:30:50,585 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:30:50,585 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 2 [2020-10-26 22:30:50,585 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:30:50,602 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-26 22:30:50,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:30:50,630 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:30:50,763 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:30:50,763 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 78 [2020-10-26 22:30:50,763 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:30:50,763 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 145 [2020-10-26 22:30:50,764 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:30:50,764 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-26 22:30:50,764 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-26 22:30:50,764 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 78 [2020-10-26 22:30:50,764 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:30:50,838 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2020-10-26 22:30:50,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:30:50,864 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:30:50,895 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:30:50,895 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 91 [2020-10-26 22:30:50,895 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:30:50,895 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 41 [2020-10-26 22:30:50,896 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:30:50,896 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-26 22:30:50,896 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 88 [2020-10-26 22:30:50,896 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-26 22:30:50,896 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:30:50,987 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 22 proven. 72 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-26 22:30:50,987 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1263706918] [2020-10-26 22:30:50,987 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-26 22:30:50,988 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-26 22:30:50,988 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979771415] [2020-10-26 22:30:50,988 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-26 22:30:50,989 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-26 22:30:50,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-26 22:30:50,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-26 22:30:50,990 INFO L87 Difference]: Start difference. First operand 1062 states and 1350 transitions. Second operand 7 states. [2020-10-26 22:30:52,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 22:30:52,719 INFO L93 Difference]: Finished difference Result 2428 states and 3062 transitions. [2020-10-26 22:30:52,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-26 22:30:52,721 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 186 [2020-10-26 22:30:52,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 22:30:52,729 INFO L225 Difference]: With dead ends: 2428 [2020-10-26 22:30:52,729 INFO L226 Difference]: Without dead ends: 1372 [2020-10-26 22:30:52,733 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2020-10-26 22:30:52,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2020-10-26 22:30:52,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 1356. [2020-10-26 22:30:52,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1356 states. [2020-10-26 22:30:52,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1356 states to 1356 states and 1671 transitions. [2020-10-26 22:30:52,795 INFO L78 Accepts]: Start accepts. Automaton has 1356 states and 1671 transitions. Word has length 186 [2020-10-26 22:30:52,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 22:30:52,796 INFO L481 AbstractCegarLoop]: Abstraction has 1356 states and 1671 transitions. [2020-10-26 22:30:52,796 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-26 22:30:52,796 INFO L276 IsEmpty]: Start isEmpty. Operand 1356 states and 1671 transitions. [2020-10-26 22:30:52,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2020-10-26 22:30:52,802 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 22:30:52,802 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:30:52,802 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-26 22:30:52,803 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 22:30:52,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 22:30:52,804 INFO L82 PathProgramCache]: Analyzing trace with hash -98834754, now seen corresponding path program 1 times [2020-10-26 22:30:52,804 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-26 22:30:52,804 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [149773491] [2020-10-26 22:30:52,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 22:30:52,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:30:52,997 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:30:53,466 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:30:53,467 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 289 [2020-10-26 22:30:53,467 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:30:53,467 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 527 [2020-10-26 22:30:53,467 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:30:53,468 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-26 22:30:53,468 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 268 [2020-10-26 22:30:53,468 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 17 [2020-10-26 22:30:53,468 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:30:53,604 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 22:30:53,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:30:53,608 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:30:53,612 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:30:53,612 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-26 22:30:53,612 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:30:53,613 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 4 [2020-10-26 22:30:53,613 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:30:53,613 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-26 22:30:53,613 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:30:53,613 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-26 22:30:53,613 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:30:53,628 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-26 22:30:53,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:30:53,638 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:30:53,668 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:30:53,668 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 116 [2020-10-26 22:30:53,669 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:30:53,669 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 31 [2020-10-26 22:30:53,669 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:30:53,669 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-26 22:30:53,669 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:30:53,669 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-26 22:30:53,670 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:30:53,709 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2020-10-26 22:30:53,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:30:53,766 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:30:53,880 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:30:53,880 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 142 [2020-10-26 22:30:53,881 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:30:53,881 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 136 [2020-10-26 22:30:53,881 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:30:53,881 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-26 22:30:53,881 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:30:53,882 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 136 [2020-10-26 22:30:53,882 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:30:54,022 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 23 proven. 2 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2020-10-26 22:30:54,023 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [149773491] [2020-10-26 22:30:54,023 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-26 22:30:54,023 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-10-26 22:30:54,023 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760714639] [2020-10-26 22:30:54,024 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-26 22:30:54,024 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-26 22:30:54,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-26 22:30:54,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-26 22:30:54,026 INFO L87 Difference]: Start difference. First operand 1356 states and 1671 transitions. Second operand 6 states. [2020-10-26 22:30:56,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 22:30:56,485 INFO L93 Difference]: Finished difference Result 2859 states and 3678 transitions. [2020-10-26 22:30:56,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-26 22:30:56,489 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 275 [2020-10-26 22:30:56,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 22:30:56,500 INFO L225 Difference]: With dead ends: 2859 [2020-10-26 22:30:56,500 INFO L226 Difference]: Without dead ends: 1652 [2020-10-26 22:30:56,505 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-10-26 22:30:56,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1652 states. [2020-10-26 22:30:56,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1652 to 1499. [2020-10-26 22:30:56,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1499 states. [2020-10-26 22:30:56,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1499 states to 1499 states and 1839 transitions. [2020-10-26 22:30:56,566 INFO L78 Accepts]: Start accepts. Automaton has 1499 states and 1839 transitions. Word has length 275 [2020-10-26 22:30:56,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 22:30:56,567 INFO L481 AbstractCegarLoop]: Abstraction has 1499 states and 1839 transitions. [2020-10-26 22:30:56,567 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-26 22:30:56,567 INFO L276 IsEmpty]: Start isEmpty. Operand 1499 states and 1839 transitions. [2020-10-26 22:30:56,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2020-10-26 22:30:56,575 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 22:30:56,575 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 22:30:56,576 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-26 22:30:56,576 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 22:30:56,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 22:30:56,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1990132543, now seen corresponding path program 1 times [2020-10-26 22:30:56,577 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-26 22:30:56,578 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [168933441] [2020-10-26 22:30:56,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 22:30:56,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:30:56,725 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:30:56,902 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:30:58,542 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:30:58,542 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 346 [2020-10-26 22:30:58,543 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-26 22:30:58,545 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1865 [2020-10-26 22:30:58,545 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:30:58,545 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-26 22:30:58,545 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 125 [2020-10-26 22:30:58,545 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 80 [2020-10-26 22:30:58,546 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:30:58,658 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 22:30:58,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:30:58,663 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:30:58,669 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:30:58,670 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-26 22:30:58,670 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:30:58,670 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 8 [2020-10-26 22:30:58,670 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:30:58,671 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-26 22:30:58,671 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:30:58,671 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-26 22:30:58,671 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:30:58,689 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-26 22:30:58,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:30:58,735 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:30:58,860 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:30:58,860 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 116 [2020-10-26 22:30:58,860 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:30:58,860 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 142 [2020-10-26 22:30:58,861 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:30:58,861 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-26 22:30:58,861 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:30:58,861 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 110 [2020-10-26 22:30:58,861 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:30:58,903 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2020-10-26 22:30:58,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:30:58,927 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:30:59,022 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:30:59,023 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 78 [2020-10-26 22:30:59,023 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:30:59,023 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 104 [2020-10-26 22:30:59,023 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:30:59,023 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-26 22:30:59,023 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-26 22:30:59,024 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 78 [2020-10-26 22:30:59,024 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:30:59,106 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2020-10-26 22:30:59,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:30:59,148 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:30:59,193 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:30:59,193 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 120 [2020-10-26 22:30:59,193 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:30:59,193 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 60 [2020-10-26 22:30:59,193 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:30:59,194 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-26 22:30:59,194 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 117 [2020-10-26 22:30:59,194 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-26 22:30:59,194 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:30:59,454 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 111 proven. 76 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2020-10-26 22:30:59,454 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [168933441] [2020-10-26 22:30:59,455 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-26 22:30:59,455 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-26 22:30:59,455 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277555695] [2020-10-26 22:30:59,457 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-26 22:30:59,457 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-26 22:30:59,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-26 22:30:59,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-26 22:30:59,458 INFO L87 Difference]: Start difference. First operand 1499 states and 1839 transitions. Second operand 7 states. [2020-10-26 22:31:01,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 22:31:01,822 INFO L93 Difference]: Finished difference Result 3598 states and 4513 transitions. [2020-10-26 22:31:01,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-26 22:31:01,824 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 330 [2020-10-26 22:31:01,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 22:31:01,836 INFO L225 Difference]: With dead ends: 3598 [2020-10-26 22:31:01,836 INFO L226 Difference]: Without dead ends: 2248 [2020-10-26 22:31:01,841 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2020-10-26 22:31:01,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2248 states. [2020-10-26 22:31:01,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2248 to 2240. [2020-10-26 22:31:01,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2240 states. [2020-10-26 22:31:01,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2240 states to 2240 states and 2678 transitions. [2020-10-26 22:31:01,919 INFO L78 Accepts]: Start accepts. Automaton has 2240 states and 2678 transitions. Word has length 330 [2020-10-26 22:31:01,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 22:31:01,920 INFO L481 AbstractCegarLoop]: Abstraction has 2240 states and 2678 transitions. [2020-10-26 22:31:01,920 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-26 22:31:01,920 INFO L276 IsEmpty]: Start isEmpty. Operand 2240 states and 2678 transitions. [2020-10-26 22:31:01,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2020-10-26 22:31:01,930 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 22:31:01,931 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 22:31:01,931 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-26 22:31:01,932 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 22:31:01,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 22:31:01,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1132206555, now seen corresponding path program 1 times [2020-10-26 22:31:01,933 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-26 22:31:01,933 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1158369647] [2020-10-26 22:31:01,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 22:31:02,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:31:02,056 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:31:02,628 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:31:02,628 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 365 [2020-10-26 22:31:02,629 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:31:02,629 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 620 [2020-10-26 22:31:02,629 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:31:02,629 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-26 22:31:02,629 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 223 [2020-10-26 22:31:02,630 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 122 [2020-10-26 22:31:02,630 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:31:02,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 22:31:02,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:31:02,764 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:31:02,768 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:31:02,768 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-26 22:31:02,768 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:31:02,769 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 5 [2020-10-26 22:31:02,769 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:31:02,770 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-26 22:31:02,770 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:31:02,770 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-26 22:31:02,771 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-26 22:31:02,794 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-26 22:31:02,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:31:02,813 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:31:02,867 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:31:02,867 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 135 [2020-10-26 22:31:02,867 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:31:02,868 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 55 [2020-10-26 22:31:02,868 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:31:02,868 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-26 22:31:02,868 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:31:02,869 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-26 22:31:02,869 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-26 22:31:02,928 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2020-10-26 22:31:02,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:31:02,964 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:31:03,036 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:31:03,037 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 78 [2020-10-26 22:31:03,037 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:31:03,037 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 86 [2020-10-26 22:31:03,038 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:31:03,038 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-26 22:31:03,038 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:31:03,038 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 72 [2020-10-26 22:31:03,039 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-26 22:31:03,087 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2020-10-26 22:31:03,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:31:03,144 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:31:03,375 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:31:03,376 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 120 [2020-10-26 22:31:03,376 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:31:03,376 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 249 [2020-10-26 22:31:03,376 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:31:03,377 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-26 22:31:03,377 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-26 22:31:03,377 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 120 [2020-10-26 22:31:03,377 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:31:03,933 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 228 proven. 2 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2020-10-26 22:31:03,933 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1158369647] [2020-10-26 22:31:03,934 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-26 22:31:03,934 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-26 22:31:03,935 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405324303] [2020-10-26 22:31:03,937 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-26 22:31:03,941 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-26 22:31:03,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-26 22:31:03,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-26 22:31:03,943 INFO L87 Difference]: Start difference. First operand 2240 states and 2678 transitions. Second operand 7 states. [2020-10-26 22:31:06,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 22:31:06,216 INFO L93 Difference]: Finished difference Result 4488 states and 5444 transitions. [2020-10-26 22:31:06,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-26 22:31:06,216 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 349 [2020-10-26 22:31:06,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 22:31:06,229 INFO L225 Difference]: With dead ends: 4488 [2020-10-26 22:31:06,229 INFO L226 Difference]: Without dead ends: 2397 [2020-10-26 22:31:06,235 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-10-26 22:31:06,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2397 states. [2020-10-26 22:31:06,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2397 to 2389. [2020-10-26 22:31:06,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2389 states. [2020-10-26 22:31:06,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2389 states to 2389 states and 2847 transitions. [2020-10-26 22:31:06,308 INFO L78 Accepts]: Start accepts. Automaton has 2389 states and 2847 transitions. Word has length 349 [2020-10-26 22:31:06,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 22:31:06,309 INFO L481 AbstractCegarLoop]: Abstraction has 2389 states and 2847 transitions. [2020-10-26 22:31:06,309 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-26 22:31:06,309 INFO L276 IsEmpty]: Start isEmpty. Operand 2389 states and 2847 transitions. [2020-10-26 22:31:06,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2020-10-26 22:31:06,319 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 22:31:06,319 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 22:31:06,319 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-26 22:31:06,320 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 22:31:06,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 22:31:06,320 INFO L82 PathProgramCache]: Analyzing trace with hash -630089401, now seen corresponding path program 1 times [2020-10-26 22:31:06,320 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-26 22:31:06,321 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1133523825] [2020-10-26 22:31:06,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 22:31:06,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 22:31:06,433 INFO L173 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-10-26 22:31:06,433 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-26 22:31:06,439 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-26 22:31:06,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 10:31:06 BoogieIcfgContainer [2020-10-26 22:31:06,488 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-26 22:31:06,491 INFO L168 Benchmark]: Toolchain (without parser) took 38616.51 ms. Allocated memory was 151.0 MB in the beginning and 596.6 MB in the end (delta: 445.6 MB). Free memory was 129.5 MB in the beginning and 398.3 MB in the end (delta: -268.8 MB). Peak memory consumption was 177.1 MB. Max. memory is 8.0 GB. [2020-10-26 22:31:06,492 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 151.0 MB. Free memory is still 123.1 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-10-26 22:31:06,493 INFO L168 Benchmark]: CACSL2BoogieTranslator took 727.92 ms. Allocated memory is still 151.0 MB. Free memory was 128.8 MB in the beginning and 123.8 MB in the end (delta: 5.0 MB). Peak memory consumption was 20.7 MB. Max. memory is 8.0 GB. [2020-10-26 22:31:06,493 INFO L168 Benchmark]: Boogie Preprocessor took 109.90 ms. Allocated memory is still 151.0 MB. Free memory was 123.8 MB in the beginning and 119.6 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. [2020-10-26 22:31:06,497 INFO L168 Benchmark]: RCFGBuilder took 1584.96 ms. Allocated memory is still 151.0 MB. Free memory was 119.6 MB in the beginning and 66.7 MB in the end (delta: 52.9 MB). Peak memory consumption was 53.9 MB. Max. memory is 8.0 GB. [2020-10-26 22:31:06,498 INFO L168 Benchmark]: TraceAbstraction took 36177.62 ms. Allocated memory was 151.0 MB in the beginning and 596.6 MB in the end (delta: 445.6 MB). Free memory was 66.2 MB in the beginning and 398.3 MB in the end (delta: -332.1 MB). Peak memory consumption was 114.1 MB. Max. memory is 8.0 GB. [2020-10-26 22:31:06,503 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.25 ms. Allocated memory is still 151.0 MB. Free memory is still 123.1 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 727.92 ms. Allocated memory is still 151.0 MB. Free memory was 128.8 MB in the beginning and 123.8 MB in the end (delta: 5.0 MB). Peak memory consumption was 20.7 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 109.90 ms. Allocated memory is still 151.0 MB. Free memory was 123.8 MB in the beginning and 119.6 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1584.96 ms. Allocated memory is still 151.0 MB. Free memory was 119.6 MB in the beginning and 66.7 MB in the end (delta: 52.9 MB). Peak memory consumption was 53.9 MB. Max. memory is 8.0 GB. * TraceAbstraction took 36177.62 ms. Allocated memory was 151.0 MB in the beginning and 596.6 MB in the end (delta: 445.6 MB). Free memory was 66.2 MB in the beginning and 398.3 MB in the end (delta: -332.1 MB). Peak memory consumption was 114.1 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L9] int inputC = 3; [L10] int inputD = 4; [L11] int inputE = 5; [L12] int inputF = 6; [L13] int inputB = 2; [L16] int a1 = 23; [L17] int a19 = 9; [L18] int a10 = 0; [L19] int a12 = 0; [L20] int a4 = 14; [L581] int output = -1; [L584] COND TRUE 1 [L587] int input; [L588] input = __VERIFIER_nondet_int() [L589] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L592] CALL, EXPR calculate_output(input) [L23] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L26] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L29] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L32] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L35] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L38] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L41] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L44] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L47] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L50] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L53] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L56] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L59] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L62] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L65] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L68] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L71] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L74] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L77] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L80] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L83] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L86] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L89] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L92] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L95] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L98] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L101] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L104] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L107] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L110] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L113] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L116] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L119] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L122] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L125] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L128] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L131] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L134] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L137] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L140] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L143] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L146] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L149] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L152] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L155] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L158] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L161] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L164] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L167] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L170] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L173] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L176] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L179] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L182] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L185] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L188] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L191] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L194] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L197] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L200] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L203] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L207] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L212] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) [L217] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) [L222] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) [L227] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) [L233] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) [L238] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) [L241] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) [L246] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) [L251] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) [L256] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) [L262] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) [L267] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) [L273] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) [L279] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) [L285] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) [L288] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) [L293] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) [L298] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) [L303] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) [L308] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) [L314] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) [L319] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) [L322] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) [L325] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) [L328] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) [L331] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) [L337] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) [L342] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) [L347] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) [L353] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) [L356] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) [L359] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) [L362] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) [L367] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0))))) [L372] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) [L377] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) [L380] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) [L385] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) [L390] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0))))) [L395] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) [L400] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) [L405] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14))) [L410] COND FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))) [L416] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14))) [L421] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10)))))) [L427] COND FALSE !(((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0))) [L432] COND FALSE !((((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 6)) && (a19==10))) && (a12==0))) [L438] COND FALSE !(((a19==9) && ((((input == 4) && (( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 ))) && (a12==0)) && (a4==14)))) [L444] COND FALSE !((((a19==10) && ((a12==0) && ((((a10==1) && a1 <= -13 ) || (( ((38 < a1) && (218 >= a1)) && (a10==0)) || ((a10==0) && 218 < a1 ))) && (input == 3)))) && (a4==14))) [L450] COND FALSE !(((a19==9) && (((a4==14) && ((((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4))) && (input == 5))) && (a12==0)))) [L456] COND FALSE !((((a12==0) && ((((input == 5) && (a19==10)) && ((38 < a1) && (218 >= a1)) ) && (a4==14))) && (a10==1))) [L462] COND FALSE !(((a19==9) && ((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3)) && (a10==1)) && (a12==0))))) [L467] COND FALSE !(((a10==0) && ((a12==0) && ((((input == 5) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a4==14))))) [L473] COND FALSE !(( 218 < a1 && (((((input == 3) && (a10==1)) && (a12==0)) && (a4==14)) && (a19==10)))) [L478] COND FALSE !((((a12==0) && ((a19==9) && (((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a4==14)))) && (a10==3))) [L483] COND FALSE !((((((a4==14) && ( ((38 < a1) && (218 >= a1)) && (input == 2))) && (a12==0)) && (a10==1)) && (a19==10))) [L489] COND FALSE !((((a19==10) && ((a10==1) && ((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (input == 5))))) && (a4==14))) [L495] COND FALSE !(((((a10==1) && (((input == 5) && 218 < a1 ) && (a4==14))) && (a19==10)) && (a12==0))) [L501] COND FALSE !((((a4==14) && ((a19==9) && ((input == 2) && (((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 ))))) && (a12==0))) [L506] COND FALSE !((((a4==14) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 2))) && (a12==0))) && (a10==4))) [L511] COND FALSE !(((a4==14) && (((a19==9) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 6)) && (a10==3))) && (a12==0)))) [L516] COND FALSE !((((a4==14) && ((((input == 6) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a12==0))) && (a10==0))) [L519] COND FALSE !(((a12==0) && ((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 2)) && (a19==10))))) [L525] COND FALSE !((((a12==0) && ((a19==9) && ((a10==2) && ((input == 6) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))))) && (a4==14))) [L528] COND TRUE ((a4==14) && ((a19==9) && ((a12==0) && (((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0))))) [L529] a1 = (((a1 * 5) + 278443) - -239546) [L530] return 26; [L592] RET, EXPR calculate_output(input) [L592] output = calculate_output(input) [L584] COND TRUE 1 [L587] int input; [L588] input = __VERIFIER_nondet_int() [L589] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L592] CALL, EXPR calculate_output(input) [L23] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L26] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L29] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L32] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L35] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L38] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L41] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L44] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L47] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L50] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L53] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L56] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L59] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L62] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L65] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L68] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L71] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L74] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L77] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L80] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L83] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L86] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L89] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L92] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L95] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L98] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L101] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L104] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L107] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L110] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L113] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L116] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L119] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L122] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L125] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L128] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L131] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L134] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L137] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L140] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L143] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L146] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L149] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L152] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L155] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L158] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L161] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L164] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L167] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L170] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L173] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L176] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L179] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L182] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L185] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L188] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L191] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L194] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L197] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L200] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L203] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L207] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L212] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) [L217] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) [L222] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) [L227] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) [L233] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) [L238] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) [L241] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) [L246] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) [L251] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) [L256] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) [L262] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) [L267] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) [L273] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) [L279] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) [L285] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) [L288] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) [L293] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) [L298] COND TRUE ((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14)) [L299] a1 = ((((((a1 * 9)/ 10) % 299993)+ -300005) / 5) + -75819) [L300] a10 = 4 [L302] return 26; [L592] RET, EXPR calculate_output(input) [L592] output = calculate_output(input) [L584] COND TRUE 1 [L587] int input; [L588] input = __VERIFIER_nondet_int() [L589] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L592] CALL, EXPR calculate_output(input) [L23] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L26] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L29] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L32] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L35] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L38] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L41] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L44] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L47] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L50] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L53] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L56] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L59] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L62] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L65] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L68] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L71] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L74] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L77] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L80] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L83] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L86] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L89] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L92] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L95] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L98] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L101] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L104] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L107] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L110] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L113] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L116] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L119] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L122] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L125] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L128] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L131] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L134] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L137] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L140] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L143] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L146] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L149] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L152] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L155] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L158] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L161] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L164] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L167] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L170] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L173] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L176] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L179] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L182] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L185] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L188] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L191] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L194] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L197] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L200] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L203] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L207] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L212] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) [L217] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) [L222] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) [L227] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) [L233] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) [L238] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) [L241] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) [L246] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) [L251] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) [L256] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) [L262] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) [L267] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) [L273] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) [L279] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) [L285] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) [L288] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) [L293] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) [L298] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) [L303] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) [L308] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) [L314] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) [L319] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) [L322] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) [L325] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) [L328] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) [L331] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) [L337] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) [L342] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) [L347] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) [L353] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) [L356] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) [L359] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) [L362] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) [L367] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0))))) [L372] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) [L377] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) [L380] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) [L385] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) [L390] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0))))) [L395] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) [L400] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) [L405] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14))) [L410] COND FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))) [L416] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14))) [L421] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10)))))) [L427] COND FALSE !(((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0))) [L432] COND FALSE !((((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 6)) && (a19==10))) && (a12==0))) [L438] COND FALSE !(((a19==9) && ((((input == 4) && (( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 ))) && (a12==0)) && (a4==14)))) [L444] COND FALSE !((((a19==10) && ((a12==0) && ((((a10==1) && a1 <= -13 ) || (( ((38 < a1) && (218 >= a1)) && (a10==0)) || ((a10==0) && 218 < a1 ))) && (input == 3)))) && (a4==14))) [L450] COND TRUE ((a19==9) && (((a4==14) && ((((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4))) && (input == 5))) && (a12==0))) [L451] a1 = ((((((a1 % 25)- -12) - 0) * 5) % 25)- -13) [L452] a10 = 3 [L453] a19 = 6 [L455] return -1; [L592] RET, EXPR calculate_output(input) [L592] output = calculate_output(input) [L584] COND TRUE 1 [L587] int input; [L588] input = __VERIFIER_nondet_int() [L589] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L592] CALL calculate_output(input) [L23] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L26] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L29] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L32] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L35] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L38] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L41] COND TRUE (((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6)) [L42] CALL reach_error() [L4] __assert_fail("0", "Problem10_label12.c", 4, "reach_error") - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 219 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 36.0s, OverallIterations: 10, TraceHistogramMax: 4, AutomataDifference: 18.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 246 SDtfs, 3836 SDslu, 295 SDs, 0 SdLazy, 7748 SolverSat, 1097 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 133 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2389occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 9 MinimizatonAttempts, 416 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 15.4s InterpolantComputationTime, 2057 NumberOfCodeBlocks, 2057 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1689 ConstructedInterpolants, 0 QuantifiedInterpolants, 1493333 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 2 PerfectInterpolantSequences, 894/1053 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...