/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.smt.solver Internal_SMTInterpol --traceabstraction.compute.trace.for.counterexample.result false --rcfgbuilder.size.of.a.code.block SequenceOfStatements --traceabstraction.use.minimal.unsat.core.enumeration true --traceabstraction.additional.smt.options produce-proofs=true --traceabstraction.additional.smt.options produce-unsat-cores=true --traceabstraction.additional.smt.options enumeration-timeout=5000 --traceabstraction.additional.smt.options interpolation-heuristic=DEEPEST --traceabstraction.additional.smt.options log-additional-information=true --traceabstraction.additional.smt.options unknown-allowed=true -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf language data_model -i ../../../trunk/examples/svcomp/eca-rers2012/Problem10_label50.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-0f64333 [2020-10-27 17:28:38,224 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-27 17:28:38,227 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-27 17:28:38,285 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-27 17:28:38,285 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-27 17:28:38,294 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-27 17:28:38,296 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-27 17:28:38,301 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-27 17:28:38,304 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-27 17:28:38,310 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-27 17:28:38,312 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-27 17:28:38,313 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-27 17:28:38,314 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-27 17:28:38,317 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-27 17:28:38,320 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-27 17:28:38,323 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-27 17:28:38,324 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-27 17:28:38,328 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-27 17:28:38,335 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-27 17:28:38,343 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-27 17:28:38,345 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-27 17:28:38,347 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-27 17:28:38,348 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-27 17:28:38,351 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-27 17:28:38,360 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-27 17:28:38,360 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-27 17:28:38,361 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-27 17:28:38,363 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-27 17:28:38,363 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-27 17:28:38,364 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-27 17:28:38,365 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-27 17:28:38,366 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-27 17:28:38,368 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-27 17:28:38,369 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-27 17:28:38,370 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-27 17:28:38,370 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-27 17:28:38,371 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-27 17:28:38,371 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-27 17:28:38,372 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-27 17:28:38,380 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-27 17:28:38,381 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-27 17:28:38,389 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-27 17:28:38,440 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-27 17:28:38,441 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-27 17:28:38,445 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-27 17:28:38,446 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-27 17:28:38,446 INFO L138 SettingsManager]: * Use SBE=true [2020-10-27 17:28:38,446 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-27 17:28:38,446 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-27 17:28:38,447 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-27 17:28:38,447 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-27 17:28:38,447 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-27 17:28:38,449 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-27 17:28:38,449 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-27 17:28:38,449 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-27 17:28:38,449 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-27 17:28:38,450 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-27 17:28:38,450 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-27 17:28:38,450 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-27 17:28:38,450 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-27 17:28:38,451 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-27 17:28:38,451 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-27 17:28:38,451 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-27 17:28:38,451 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-27 17:28:38,451 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-27 17:28:38,452 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-27 17:28:38,452 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-27 17:28:38,452 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-27 17:28:38,452 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-27 17:28:38,452 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-27 17:28:38,453 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-27 17:28:38,453 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> Internal_SMTInterpol Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute trace for counterexample result -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> SequenceOfStatements Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use minimal unsat core enumeration -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> produce-proofs=true;produce-unsat-cores=true;enumeration-timeout=5000;interpolation-heuristic=DEEPEST;log-additional-information=true;unknown-allowed=true; [2020-10-27 17:28:38,852 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-27 17:28:38,898 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-27 17:28:38,902 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-27 17:28:38,903 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-27 17:28:38,904 INFO L275 PluginConnector]: CDTParser initialized [2020-10-27 17:28:38,905 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label50.c [2020-10-27 17:28:39,005 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/e7ae852ec/cac5fae0f6e145efa1d7e52609e174f1/FLAG19db1bf93 [2020-10-27 17:28:39,791 INFO L306 CDTParser]: Found 1 translation units. [2020-10-27 17:28:39,793 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/eca-rers2012/Problem10_label50.c [2020-10-27 17:28:39,820 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/e7ae852ec/cac5fae0f6e145efa1d7e52609e174f1/FLAG19db1bf93 [2020-10-27 17:28:40,044 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/e7ae852ec/cac5fae0f6e145efa1d7e52609e174f1 [2020-10-27 17:28:40,050 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-27 17:28:40,059 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-27 17:28:40,063 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-27 17:28:40,064 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-27 17:28:40,068 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-27 17:28:40,069 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 05:28:40" (1/1) ... [2020-10-27 17:28:40,074 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47ad8976 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:28:40, skipping insertion in model container [2020-10-27 17:28:40,074 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 05:28:40" (1/1) ... [2020-10-27 17:28:40,083 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-27 17:28:40,156 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-27 17:28:40,620 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-27 17:28:40,632 INFO L203 MainTranslator]: Completed pre-run [2020-10-27 17:28:40,850 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-27 17:28:40,871 INFO L208 MainTranslator]: Completed translation [2020-10-27 17:28:40,872 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:28:40 WrapperNode [2020-10-27 17:28:40,872 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-27 17:28:40,873 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-27 17:28:40,873 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-27 17:28:40,874 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-27 17:28:40,892 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:28:40" (1/1) ... [2020-10-27 17:28:40,892 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:28:40" (1/1) ... [2020-10-27 17:28:40,916 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:28:40" (1/1) ... [2020-10-27 17:28:40,917 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:28:40" (1/1) ... [2020-10-27 17:28:40,972 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:28:40" (1/1) ... [2020-10-27 17:28:40,994 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:28:40" (1/1) ... [2020-10-27 17:28:41,012 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:28:40" (1/1) ... [2020-10-27 17:28:41,028 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-27 17:28:41,030 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-27 17:28:41,031 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-27 17:28:41,031 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-27 17:28:41,032 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:28:40" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-27 17:28:41,121 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-27 17:28:41,121 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-27 17:28:41,122 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-27 17:28:41,122 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2020-10-27 17:28:41,122 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-27 17:28:41,122 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2020-10-27 17:28:41,123 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-27 17:28:41,123 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-27 17:28:41,123 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-27 17:28:41,123 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-27 17:28:41,123 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-27 17:28:41,123 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-10-27 17:28:41,124 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-27 17:28:41,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-27 17:28:41,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-27 17:28:41,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-27 17:28:41,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-27 17:28:41,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-27 17:28:41,125 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-27 17:28:42,755 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-27 17:28:42,755 INFO L298 CfgBuilder]: Removed 1 assume(true) statements. [2020-10-27 17:28:42,757 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 05:28:42 BoogieIcfgContainer [2020-10-27 17:28:42,758 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-27 17:28:42,759 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-27 17:28:42,760 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-27 17:28:42,764 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-27 17:28:42,764 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 05:28:40" (1/3) ... [2020-10-27 17:28:42,765 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@388fe1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 05:28:42, skipping insertion in model container [2020-10-27 17:28:42,765 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:28:40" (2/3) ... [2020-10-27 17:28:42,765 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@388fe1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 05:28:42, skipping insertion in model container [2020-10-27 17:28:42,766 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 05:28:42" (3/3) ... [2020-10-27 17:28:42,767 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem10_label50.c [2020-10-27 17:28:42,780 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-27 17:28:42,785 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-27 17:28:42,799 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-27 17:28:42,829 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-27 17:28:42,830 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-27 17:28:42,830 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-27 17:28:42,830 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-27 17:28:42,830 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-27 17:28:42,830 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-27 17:28:42,830 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-27 17:28:42,831 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-27 17:28:42,855 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states. [2020-10-27 17:28:42,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-27 17:28:42,861 INFO L414 BasicCegarLoop]: Found error trace [2020-10-27 17:28:42,861 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-27 17:28:42,862 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-27 17:28:42,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-27 17:28:42,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1820384268, now seen corresponding path program 1 times [2020-10-27 17:28:42,878 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-27 17:28:42,879 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1465868393] [2020-10-27 17:28:42,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-27 17:28:43,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:28:43,065 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:28:43,465 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:28:43,465 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 26 [2020-10-27 17:28:43,465 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:28:43,465 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 434 [2020-10-27 17:28:43,472 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:28:43,472 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-10-27 17:28:43,472 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 5 [2020-10-27 17:28:43,472 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 17 [2020-10-27 17:28:43,473 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 7 [2020-10-27 17:28:43,706 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2020-10-27 17:28:43,707 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-27 17:28:43,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:28:43,739 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:28:43,777 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:28:43,782 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-27 17:28:43,782 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:28:43,783 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 48 [2020-10-27 17:28:43,783 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:28:43,783 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-27 17:28:43,783 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:28:43,784 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 2 [2020-10-27 17:28:43,784 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:28:43,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-27 17:28:43,805 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1465868393] [2020-10-27 17:28:43,807 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-27 17:28:43,808 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-27 17:28:43,809 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703578648] [2020-10-27 17:28:43,814 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-27 17:28:43,814 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-27 17:28:43,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-27 17:28:43,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-27 17:28:43,837 INFO L87 Difference]: Start difference. First operand 219 states. Second operand 4 states. [2020-10-27 17:28:43,999 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2020-10-27 17:28:46,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-27 17:28:46,820 INFO L93 Difference]: Finished difference Result 586 states and 1012 transitions. [2020-10-27 17:28:46,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-27 17:28:46,823 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-10-27 17:28:46,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-27 17:28:46,855 INFO L225 Difference]: With dead ends: 586 [2020-10-27 17:28:46,855 INFO L226 Difference]: Without dead ends: 303 [2020-10-27 17:28:46,863 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-27 17:28:46,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2020-10-27 17:28:46,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 299. [2020-10-27 17:28:46,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2020-10-27 17:28:46,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 396 transitions. [2020-10-27 17:28:46,969 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 396 transitions. Word has length 16 [2020-10-27 17:28:46,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-27 17:28:46,970 INFO L481 AbstractCegarLoop]: Abstraction has 299 states and 396 transitions. [2020-10-27 17:28:46,970 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-27 17:28:46,970 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 396 transitions. [2020-10-27 17:28:46,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-10-27 17:28:46,974 INFO L414 BasicCegarLoop]: Found error trace [2020-10-27 17:28:46,974 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-27 17:28:46,975 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-27 17:28:46,975 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-27 17:28:46,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-27 17:28:46,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1930199696, now seen corresponding path program 1 times [2020-10-27 17:28:46,976 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-27 17:28:46,976 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1115471198] [2020-10-27 17:28:46,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-27 17:28:47,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:28:47,050 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:28:47,116 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:28:47,704 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:28:47,704 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 98 [2020-10-27 17:28:47,705 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-27 17:28:47,705 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 678 [2020-10-27 17:28:47,706 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:28:47,706 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-27 17:28:47,706 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 80 [2020-10-27 17:28:47,707 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 14 [2020-10-27 17:28:47,707 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-27 17:28:47,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-27 17:28:47,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:28:47,860 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:28:47,867 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:28:47,868 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-27 17:28:47,868 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:28:47,868 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 8 [2020-10-27 17:28:47,868 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:28:47,868 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-27 17:28:47,869 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:28:47,869 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-27 17:28:47,869 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:28:47,902 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-27 17:28:47,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:28:47,932 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:28:47,993 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:28:47,994 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 71 [2020-10-27 17:28:47,994 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:28:47,994 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 73 [2020-10-27 17:28:47,994 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:28:47,994 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-27 17:28:47,995 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:28:47,995 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 65 [2020-10-27 17:28:47,995 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:28:48,041 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-27 17:28:48,042 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1115471198] [2020-10-27 17:28:48,042 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-27 17:28:48,042 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-10-27 17:28:48,042 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780853947] [2020-10-27 17:28:48,044 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-27 17:28:48,044 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-27 17:28:48,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-27 17:28:48,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-27 17:28:48,046 INFO L87 Difference]: Start difference. First operand 299 states and 396 transitions. Second operand 5 states. [2020-10-27 17:28:50,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-27 17:28:50,274 INFO L93 Difference]: Finished difference Result 596 states and 804 transitions. [2020-10-27 17:28:50,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-27 17:28:50,280 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2020-10-27 17:28:50,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-27 17:28:50,286 INFO L225 Difference]: With dead ends: 596 [2020-10-27 17:28:50,287 INFO L226 Difference]: Without dead ends: 593 [2020-10-27 17:28:50,288 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-27 17:28:50,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2020-10-27 17:28:50,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 444. [2020-10-27 17:28:50,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2020-10-27 17:28:50,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 621 transitions. [2020-10-27 17:28:50,345 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 621 transitions. Word has length 86 [2020-10-27 17:28:50,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-27 17:28:50,346 INFO L481 AbstractCegarLoop]: Abstraction has 444 states and 621 transitions. [2020-10-27 17:28:50,346 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-27 17:28:50,346 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 621 transitions. [2020-10-27 17:28:50,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2020-10-27 17:28:50,355 INFO L414 BasicCegarLoop]: Found error trace [2020-10-27 17:28:50,355 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-10-27 17:28:50,356 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-27 17:28:50,356 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-27 17:28:50,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-27 17:28:50,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1849339292, now seen corresponding path program 1 times [2020-10-27 17:28:50,359 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-27 17:28:50,359 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1742889749] [2020-10-27 17:28:50,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-27 17:28:50,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:28:50,433 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:28:50,743 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:28:50,889 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:28:51,379 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:28:51,379 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 101 [2020-10-27 17:28:51,379 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 3 [2020-10-27 17:28:51,380 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 967 [2020-10-27 17:28:51,380 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:28:51,380 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-27 17:28:51,380 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 83 [2020-10-27 17:28:51,381 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 12 [2020-10-27 17:28:51,381 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:28:51,632 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-27 17:28:51,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:28:51,643 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:28:51,648 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:28:51,649 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-27 17:28:51,649 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:28:51,649 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 10 [2020-10-27 17:28:51,649 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:28:51,650 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-27 17:28:51,650 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:28:51,650 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-27 17:28:51,650 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:28:51,674 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-27 17:28:51,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:28:51,713 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:28:51,797 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:28:51,798 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 74 [2020-10-27 17:28:51,798 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:28:51,798 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 98 [2020-10-27 17:28:51,798 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:28:51,799 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-27 17:28:51,799 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:28:51,799 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 68 [2020-10-27 17:28:51,799 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:28:51,899 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-27 17:28:51,902 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1742889749] [2020-10-27 17:28:51,903 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-27 17:28:51,903 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-10-27 17:28:51,904 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802973229] [2020-10-27 17:28:51,905 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-27 17:28:51,905 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-27 17:28:51,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-27 17:28:51,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-27 17:28:51,907 INFO L87 Difference]: Start difference. First operand 444 states and 621 transitions. Second operand 5 states. [2020-10-27 17:28:52,609 WARN L193 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2020-10-27 17:28:53,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-27 17:28:53,699 INFO L93 Difference]: Finished difference Result 895 states and 1261 transitions. [2020-10-27 17:28:53,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-27 17:28:53,701 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2020-10-27 17:28:53,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-27 17:28:53,706 INFO L225 Difference]: With dead ends: 895 [2020-10-27 17:28:53,706 INFO L226 Difference]: Without dead ends: 448 [2020-10-27 17:28:53,708 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-27 17:28:53,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2020-10-27 17:28:53,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 444. [2020-10-27 17:28:53,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2020-10-27 17:28:53,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 618 transitions. [2020-10-27 17:28:53,747 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 618 transitions. Word has length 89 [2020-10-27 17:28:53,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-27 17:28:53,748 INFO L481 AbstractCegarLoop]: Abstraction has 444 states and 618 transitions. [2020-10-27 17:28:53,748 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-27 17:28:53,748 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 618 transitions. [2020-10-27 17:28:53,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2020-10-27 17:28:53,750 INFO L414 BasicCegarLoop]: Found error trace [2020-10-27 17:28:53,751 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-27 17:28:53,751 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-27 17:28:53,751 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-27 17:28:53,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-27 17:28:53,752 INFO L82 PathProgramCache]: Analyzing trace with hash 2032011664, now seen corresponding path program 1 times [2020-10-27 17:28:53,752 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-27 17:28:53,752 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1739113292] [2020-10-27 17:28:53,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-27 17:28:53,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:28:53,804 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:28:54,002 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:28:54,002 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 107 [2020-10-27 17:28:54,004 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:28:54,004 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 217 [2020-10-27 17:28:54,004 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:28:54,004 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-27 17:28:54,011 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 89 [2020-10-27 17:28:54,011 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 14 [2020-10-27 17:28:54,011 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 7 [2020-10-27 17:28:54,145 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-27 17:28:54,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:28:54,156 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:28:54,163 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:28:54,164 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-27 17:28:54,165 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:28:54,165 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 13 [2020-10-27 17:28:54,166 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:28:54,166 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-27 17:28:54,166 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:28:54,166 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-27 17:28:54,166 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:28:54,190 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-27 17:28:54,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:28:54,223 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:28:54,294 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:28:54,294 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 80 [2020-10-27 17:28:54,295 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:28:54,295 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 83 [2020-10-27 17:28:54,295 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:28:54,296 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-27 17:28:54,296 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:28:54,296 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 74 [2020-10-27 17:28:54,297 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-27 17:28:54,362 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-27 17:28:54,363 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1739113292] [2020-10-27 17:28:54,363 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-27 17:28:54,363 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-10-27 17:28:54,364 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544932198] [2020-10-27 17:28:54,367 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-27 17:28:54,367 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-27 17:28:54,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-27 17:28:54,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-27 17:28:54,369 INFO L87 Difference]: Start difference. First operand 444 states and 618 transitions. Second operand 5 states. [2020-10-27 17:28:54,524 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2020-10-27 17:28:56,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-27 17:28:56,717 INFO L93 Difference]: Finished difference Result 1176 states and 1702 transitions. [2020-10-27 17:28:56,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-27 17:28:56,718 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2020-10-27 17:28:56,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-27 17:28:56,724 INFO L225 Difference]: With dead ends: 1176 [2020-10-27 17:28:56,725 INFO L226 Difference]: Without dead ends: 738 [2020-10-27 17:28:56,727 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-27 17:28:56,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2020-10-27 17:28:56,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 734. [2020-10-27 17:28:56,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 734 states. [2020-10-27 17:28:56,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1012 transitions. [2020-10-27 17:28:56,770 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 1012 transitions. Word has length 95 [2020-10-27 17:28:56,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-27 17:28:56,770 INFO L481 AbstractCegarLoop]: Abstraction has 734 states and 1012 transitions. [2020-10-27 17:28:56,770 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-27 17:28:56,771 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1012 transitions. [2020-10-27 17:28:56,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2020-10-27 17:28:56,777 INFO L414 BasicCegarLoop]: Found error trace [2020-10-27 17:28:56,777 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-27 17:28:56,777 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-27 17:28:56,777 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-27 17:28:56,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-27 17:28:56,778 INFO L82 PathProgramCache]: Analyzing trace with hash 814756076, now seen corresponding path program 1 times [2020-10-27 17:28:56,778 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-27 17:28:56,779 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2124573084] [2020-10-27 17:28:56,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-27 17:28:56,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:28:56,852 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:28:57,027 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:28:57,635 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:28:57,662 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:28:57,663 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 190 [2020-10-27 17:28:57,663 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 3 [2020-10-27 17:28:57,663 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 836 [2020-10-27 17:28:57,663 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:28:57,663 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-27 17:28:57,664 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 172 [2020-10-27 17:28:57,664 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 14 [2020-10-27 17:28:57,664 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:28:57,803 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-27 17:28:57,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:28:57,808 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:28:57,814 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:28:57,814 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-27 17:28:57,815 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:28:57,815 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 7 [2020-10-27 17:28:57,815 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:28:57,815 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-27 17:28:57,815 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:28:57,815 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-27 17:28:57,816 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:28:57,836 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-27 17:28:57,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:28:57,842 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:28:57,859 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:28:57,860 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 71 [2020-10-27 17:28:57,860 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:28:57,860 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 18 [2020-10-27 17:28:57,860 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:28:57,860 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-27 17:28:57,860 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:28:57,861 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-27 17:28:57,861 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:28:57,879 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2020-10-27 17:28:57,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:28:57,908 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:28:57,998 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:28:57,998 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 91 [2020-10-27 17:28:57,998 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:28:57,998 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 101 [2020-10-27 17:28:57,999 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:28:57,999 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-27 17:28:57,999 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:28:57,999 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 85 [2020-10-27 17:28:57,999 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:28:58,054 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 17 proven. 2 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2020-10-27 17:28:58,055 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2124573084] [2020-10-27 17:28:58,055 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-27 17:28:58,055 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-10-27 17:28:58,056 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411812742] [2020-10-27 17:28:58,056 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-27 17:28:58,056 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-27 17:28:58,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-27 17:28:58,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-27 17:28:58,057 INFO L87 Difference]: Start difference. First operand 734 states and 1012 transitions. Second operand 5 states. [2020-10-27 17:28:58,731 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2020-10-27 17:29:00,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-27 17:29:00,601 INFO L93 Difference]: Finished difference Result 1756 states and 2500 transitions. [2020-10-27 17:29:00,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-27 17:29:00,605 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 176 [2020-10-27 17:29:00,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-27 17:29:00,615 INFO L225 Difference]: With dead ends: 1756 [2020-10-27 17:29:00,615 INFO L226 Difference]: Without dead ends: 1028 [2020-10-27 17:29:00,618 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-27 17:29:00,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1028 states. [2020-10-27 17:29:00,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1028 to 1024. [2020-10-27 17:29:00,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1024 states. [2020-10-27 17:29:00,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1353 transitions. [2020-10-27 17:29:00,679 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1353 transitions. Word has length 176 [2020-10-27 17:29:00,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-27 17:29:00,681 INFO L481 AbstractCegarLoop]: Abstraction has 1024 states and 1353 transitions. [2020-10-27 17:29:00,681 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-27 17:29:00,681 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1353 transitions. [2020-10-27 17:29:00,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2020-10-27 17:29:00,686 INFO L414 BasicCegarLoop]: Found error trace [2020-10-27 17:29:00,686 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-27 17:29:00,687 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-27 17:29:00,687 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-27 17:29:00,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-27 17:29:00,689 INFO L82 PathProgramCache]: Analyzing trace with hash 2125115100, now seen corresponding path program 1 times [2020-10-27 17:29:00,689 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-27 17:29:00,691 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2112922310] [2020-10-27 17:29:00,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-27 17:29:00,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:29:00,773 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:29:01,000 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:29:01,717 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:29:01,718 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 198 [2020-10-27 17:29:01,718 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-27 17:29:01,718 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 973 [2020-10-27 17:29:01,718 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:29:01,718 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-27 17:29:01,718 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 180 [2020-10-27 17:29:01,719 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 14 [2020-10-27 17:29:01,719 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:29:01,881 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2020-10-27 17:29:01,882 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-27 17:29:01,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:29:01,887 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:29:01,894 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:29:01,894 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-27 17:29:01,894 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:29:01,894 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 8 [2020-10-27 17:29:01,895 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:29:01,895 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-27 17:29:01,895 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:29:01,895 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-27 17:29:01,895 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:29:01,917 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-27 17:29:01,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:29:01,923 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:29:01,938 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:29:01,939 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 71 [2020-10-27 17:29:01,939 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:29:01,939 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 16 [2020-10-27 17:29:01,939 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:29:01,939 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-27 17:29:01,939 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:29:01,940 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-27 17:29:01,940 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:29:01,955 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2020-10-27 17:29:01,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:29:01,988 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:29:02,054 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:29:02,054 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 99 [2020-10-27 17:29:02,055 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:29:02,055 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 79 [2020-10-27 17:29:02,055 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:29:02,055 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-27 17:29:02,056 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:29:02,056 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 93 [2020-10-27 17:29:02,056 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:29:02,149 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 17 proven. 2 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2020-10-27 17:29:02,149 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2112922310] [2020-10-27 17:29:02,151 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-27 17:29:02,151 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-10-27 17:29:02,152 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433572650] [2020-10-27 17:29:02,153 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-27 17:29:02,153 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-27 17:29:02,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-27 17:29:02,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-27 17:29:02,164 INFO L87 Difference]: Start difference. First operand 1024 states and 1353 transitions. Second operand 5 states. [2020-10-27 17:29:03,159 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2020-10-27 17:29:04,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-27 17:29:04,634 INFO L93 Difference]: Finished difference Result 2626 states and 3488 transitions. [2020-10-27 17:29:04,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-27 17:29:04,642 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 184 [2020-10-27 17:29:04,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-27 17:29:04,649 INFO L225 Difference]: With dead ends: 2626 [2020-10-27 17:29:04,650 INFO L226 Difference]: Without dead ends: 1028 [2020-10-27 17:29:04,654 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-27 17:29:04,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1028 states. [2020-10-27 17:29:04,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1028 to 1024. [2020-10-27 17:29:04,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1024 states. [2020-10-27 17:29:04,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1324 transitions. [2020-10-27 17:29:04,704 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1324 transitions. Word has length 184 [2020-10-27 17:29:04,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-27 17:29:04,704 INFO L481 AbstractCegarLoop]: Abstraction has 1024 states and 1324 transitions. [2020-10-27 17:29:04,704 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-27 17:29:04,705 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1324 transitions. [2020-10-27 17:29:04,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2020-10-27 17:29:04,709 INFO L414 BasicCegarLoop]: Found error trace [2020-10-27 17:29:04,709 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-27 17:29:04,710 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-27 17:29:04,710 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-27 17:29:04,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-27 17:29:04,711 INFO L82 PathProgramCache]: Analyzing trace with hash -256295664, now seen corresponding path program 1 times [2020-10-27 17:29:04,711 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-27 17:29:04,711 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [309786123] [2020-10-27 17:29:04,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-27 17:29:04,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:29:04,801 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:29:05,061 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:29:05,576 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:29:05,577 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 236 [2020-10-27 17:29:05,577 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-27 17:29:05,577 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 807 [2020-10-27 17:29:05,577 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:29:05,577 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-27 17:29:05,578 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 218 [2020-10-27 17:29:05,578 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 14 [2020-10-27 17:29:05,578 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:29:05,728 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-27 17:29:05,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:29:05,733 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:29:05,738 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:29:05,738 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-27 17:29:05,739 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:29:05,739 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 6 [2020-10-27 17:29:05,739 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:29:05,739 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-27 17:29:05,739 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:29:05,740 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-27 17:29:05,740 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:29:05,762 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-27 17:29:05,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:29:05,768 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:29:05,789 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:29:05,789 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 71 [2020-10-27 17:29:05,790 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:29:05,790 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 21 [2020-10-27 17:29:05,790 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:29:05,791 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-27 17:29:05,791 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:29:05,791 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-27 17:29:05,791 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:29:05,814 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2020-10-27 17:29:05,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:29:05,929 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:29:06,055 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:29:06,055 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 137 [2020-10-27 17:29:06,055 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:29:06,056 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 154 [2020-10-27 17:29:06,056 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:29:06,056 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-27 17:29:06,056 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:29:06,056 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 131 [2020-10-27 17:29:06,057 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:29:06,171 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 17 proven. 2 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2020-10-27 17:29:06,171 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [309786123] [2020-10-27 17:29:06,171 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-27 17:29:06,172 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-10-27 17:29:06,172 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331236122] [2020-10-27 17:29:06,172 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-27 17:29:06,173 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-27 17:29:06,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-27 17:29:06,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-27 17:29:06,174 INFO L87 Difference]: Start difference. First operand 1024 states and 1324 transitions. Second operand 5 states. [2020-10-27 17:29:07,356 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2020-10-27 17:29:08,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-27 17:29:08,768 INFO L93 Difference]: Finished difference Result 2481 states and 3251 transitions. [2020-10-27 17:29:08,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-27 17:29:08,775 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 222 [2020-10-27 17:29:08,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-27 17:29:08,785 INFO L225 Difference]: With dead ends: 2481 [2020-10-27 17:29:08,785 INFO L226 Difference]: Without dead ends: 1463 [2020-10-27 17:29:08,788 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-27 17:29:08,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1463 states. [2020-10-27 17:29:08,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1463 to 1314. [2020-10-27 17:29:08,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1314 states. [2020-10-27 17:29:08,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 1665 transitions. [2020-10-27 17:29:08,846 INFO L78 Accepts]: Start accepts. Automaton has 1314 states and 1665 transitions. Word has length 222 [2020-10-27 17:29:08,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-27 17:29:08,846 INFO L481 AbstractCegarLoop]: Abstraction has 1314 states and 1665 transitions. [2020-10-27 17:29:08,847 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-27 17:29:08,847 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1665 transitions. [2020-10-27 17:29:08,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2020-10-27 17:29:08,852 INFO L414 BasicCegarLoop]: Found error trace [2020-10-27 17:29:08,852 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-27 17:29:08,852 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-27 17:29:08,853 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-27 17:29:08,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-27 17:29:08,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1761018756, now seen corresponding path program 1 times [2020-10-27 17:29:08,853 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-27 17:29:08,854 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [633603114] [2020-10-27 17:29:08,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-27 17:29:08,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:29:08,941 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:29:09,233 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:29:09,791 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:29:09,792 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 242 [2020-10-27 17:29:09,792 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-27 17:29:09,792 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 882 [2020-10-27 17:29:09,792 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:29:09,792 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 11 [2020-10-27 17:29:09,793 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 80 [2020-10-27 17:29:09,793 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 143 [2020-10-27 17:29:09,793 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:29:10,099 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2020-10-27 17:29:10,100 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-27 17:29:10,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:29:10,106 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:29:10,113 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:29:10,113 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-27 17:29:10,114 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:29:10,114 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 7 [2020-10-27 17:29:10,114 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:29:10,114 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-27 17:29:10,116 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:29:10,116 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-27 17:29:10,116 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 2 [2020-10-27 17:29:10,148 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-27 17:29:10,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:29:10,168 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:29:10,208 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:29:10,208 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 71 [2020-10-27 17:29:10,208 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:29:10,209 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 48 [2020-10-27 17:29:10,209 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:29:10,209 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-27 17:29:10,209 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:29:10,209 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 65 [2020-10-27 17:29:10,209 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:29:10,243 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2020-10-27 17:29:10,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:29:10,301 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:29:10,527 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:29:11,027 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:29:11,027 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 143 [2020-10-27 17:29:11,027 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-27 17:29:11,028 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 746 [2020-10-27 17:29:11,028 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:29:11,028 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 10 [2020-10-27 17:29:11,028 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-27 17:29:11,028 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 143 [2020-10-27 17:29:11,028 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:29:11,395 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 40 [2020-10-27 17:29:11,563 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2020-10-27 17:29:11,770 WARN L193 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2020-10-27 17:29:12,525 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 83 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-27 17:29:12,525 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [633603114] [2020-10-27 17:29:12,526 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-27 17:29:12,526 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-10-27 17:29:12,526 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239875373] [2020-10-27 17:29:12,527 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-27 17:29:12,527 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-27 17:29:12,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-27 17:29:12,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2020-10-27 17:29:12,528 INFO L87 Difference]: Start difference. First operand 1314 states and 1665 transitions. Second operand 12 states. [2020-10-27 17:29:12,741 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2020-10-27 17:29:13,558 WARN L193 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 46 [2020-10-27 17:29:13,983 WARN L193 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 84 [2020-10-27 17:29:14,138 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2020-10-27 17:29:14,337 WARN L193 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2020-10-27 17:29:14,839 WARN L193 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 62 [2020-10-27 17:29:15,428 WARN L193 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 68 [2020-10-27 17:29:15,936 WARN L193 SmtUtils]: Spent 460.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 92 [2020-10-27 17:29:16,917 WARN L193 SmtUtils]: Spent 519.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 96 [2020-10-27 17:29:17,325 WARN L193 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 65 [2020-10-27 17:29:18,267 WARN L193 SmtUtils]: Spent 501.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 101 [2020-10-27 17:29:18,993 WARN L193 SmtUtils]: Spent 521.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 106 [2020-10-27 17:29:19,532 WARN L193 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 78 [2020-10-27 17:29:20,469 WARN L193 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 81 [2020-10-27 17:29:20,858 WARN L193 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 47 [2020-10-27 17:29:21,749 WARN L193 SmtUtils]: Spent 443.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 84 [2020-10-27 17:29:22,745 WARN L193 SmtUtils]: Spent 478.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 87 [2020-10-27 17:29:23,066 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 32 [2020-10-27 17:29:23,659 WARN L193 SmtUtils]: Spent 534.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 90 [2020-10-27 17:29:23,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-27 17:29:23,900 INFO L93 Difference]: Finished difference Result 2799 states and 3637 transitions. [2020-10-27 17:29:23,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-10-27 17:29:23,902 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 228 [2020-10-27 17:29:23,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-27 17:29:23,910 INFO L225 Difference]: With dead ends: 2799 [2020-10-27 17:29:23,910 INFO L226 Difference]: Without dead ends: 1486 [2020-10-27 17:29:23,914 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=240, Invalid=690, Unknown=0, NotChecked=0, Total=930 [2020-10-27 17:29:23,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1486 states. [2020-10-27 17:29:23,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1486 to 1468. [2020-10-27 17:29:23,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1468 states. [2020-10-27 17:29:23,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1468 states to 1468 states and 1847 transitions. [2020-10-27 17:29:23,963 INFO L78 Accepts]: Start accepts. Automaton has 1468 states and 1847 transitions. Word has length 228 [2020-10-27 17:29:23,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-27 17:29:23,963 INFO L481 AbstractCegarLoop]: Abstraction has 1468 states and 1847 transitions. [2020-10-27 17:29:23,963 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-27 17:29:23,964 INFO L276 IsEmpty]: Start isEmpty. Operand 1468 states and 1847 transitions. [2020-10-27 17:29:23,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2020-10-27 17:29:23,969 INFO L414 BasicCegarLoop]: Found error trace [2020-10-27 17:29:23,969 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-27 17:29:23,969 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-27 17:29:23,970 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-27 17:29:23,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-27 17:29:23,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1666297736, now seen corresponding path program 1 times [2020-10-27 17:29:23,971 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-27 17:29:23,971 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1660464473] [2020-10-27 17:29:23,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-27 17:29:24,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:29:24,025 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:29:24,101 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:29:26,784 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:29:29,019 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:29:29,020 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 249 [2020-10-27 17:29:29,020 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 3 [2020-10-27 17:29:29,020 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 5012 [2020-10-27 17:29:29,020 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:29:29,021 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-27 17:29:29,021 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 87 [2020-10-27 17:29:29,021 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 145 [2020-10-27 17:29:29,021 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:29:29,190 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2020-10-27 17:29:29,191 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-27 17:29:29,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:29:29,196 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:29:29,204 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:29:29,204 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-27 17:29:29,205 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:29:29,205 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 9 [2020-10-27 17:29:29,205 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:29:29,205 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-27 17:29:29,205 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:29:29,206 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-27 17:29:29,206 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:29:29,241 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-27 17:29:29,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:29:29,280 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:29:29,382 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:29:29,382 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 78 [2020-10-27 17:29:29,382 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:29:29,383 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 120 [2020-10-27 17:29:29,383 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:29:29,383 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-27 17:29:29,383 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:29:29,384 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 72 [2020-10-27 17:29:29,384 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-27 17:29:29,411 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2020-10-27 17:29:29,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:29:29,484 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:29:29,718 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:29:29,718 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 143 [2020-10-27 17:29:29,719 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:29:29,719 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 260 [2020-10-27 17:29:29,719 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:29:29,719 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-27 17:29:29,719 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-27 17:29:29,719 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 143 [2020-10-27 17:29:29,720 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:29:29,926 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 90 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-27 17:29:29,927 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1660464473] [2020-10-27 17:29:29,927 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-27 17:29:29,927 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-27 17:29:29,927 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026961926] [2020-10-27 17:29:29,930 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-27 17:29:29,930 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-27 17:29:29,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-27 17:29:29,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-27 17:29:29,931 INFO L87 Difference]: Start difference. First operand 1468 states and 1847 transitions. Second operand 7 states. [2020-10-27 17:29:30,629 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2020-10-27 17:29:32,489 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2020-10-27 17:29:33,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-27 17:29:33,227 INFO L93 Difference]: Finished difference Result 3099 states and 3997 transitions. [2020-10-27 17:29:33,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-27 17:29:33,229 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 235 [2020-10-27 17:29:33,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-27 17:29:33,240 INFO L225 Difference]: With dead ends: 3099 [2020-10-27 17:29:33,240 INFO L226 Difference]: Without dead ends: 1637 [2020-10-27 17:29:33,245 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-10-27 17:29:33,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1637 states. [2020-10-27 17:29:33,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1637 to 1478. [2020-10-27 17:29:33,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1478 states. [2020-10-27 17:29:33,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1478 states to 1478 states and 1875 transitions. [2020-10-27 17:29:33,308 INFO L78 Accepts]: Start accepts. Automaton has 1478 states and 1875 transitions. Word has length 235 [2020-10-27 17:29:33,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-27 17:29:33,309 INFO L481 AbstractCegarLoop]: Abstraction has 1478 states and 1875 transitions. [2020-10-27 17:29:33,309 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-27 17:29:33,309 INFO L276 IsEmpty]: Start isEmpty. Operand 1478 states and 1875 transitions. [2020-10-27 17:29:33,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2020-10-27 17:29:33,316 INFO L414 BasicCegarLoop]: Found error trace [2020-10-27 17:29:33,316 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-27 17:29:33,317 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-27 17:29:33,317 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-27 17:29:33,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-27 17:29:33,318 INFO L82 PathProgramCache]: Analyzing trace with hash -240177028, now seen corresponding path program 1 times [2020-10-27 17:29:33,318 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-27 17:29:33,318 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [12355309] [2020-10-27 17:29:33,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-27 17:29:33,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:29:33,383 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:29:33,664 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:29:34,098 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:29:36,809 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:29:36,810 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 255 [2020-10-27 17:29:36,810 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 3 [2020-10-27 17:29:36,810 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 3448 [2020-10-27 17:29:36,810 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:29:36,810 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-27 17:29:36,810 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 93 [2020-10-27 17:29:36,811 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 145 [2020-10-27 17:29:36,811 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:29:36,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-27 17:29:36,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:29:36,955 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:29:36,963 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:29:36,963 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-27 17:29:36,963 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:29:36,963 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 10 [2020-10-27 17:29:36,964 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:29:36,964 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-27 17:29:36,964 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:29:36,964 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-27 17:29:36,964 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:29:36,991 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-27 17:29:37,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:29:37,015 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:29:37,052 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:29:37,052 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 84 [2020-10-27 17:29:37,052 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:29:37,052 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 45 [2020-10-27 17:29:37,052 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:29:37,052 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-27 17:29:37,053 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:29:37,053 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 78 [2020-10-27 17:29:37,053 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:29:37,078 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-10-27 17:29:37,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:29:37,133 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:29:37,339 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:29:37,339 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 143 [2020-10-27 17:29:37,339 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:29:37,340 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 227 [2020-10-27 17:29:37,340 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:29:37,340 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-27 17:29:37,341 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-27 17:29:37,341 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 143 [2020-10-27 17:29:37,341 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-27 17:29:37,596 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 96 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-27 17:29:37,597 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [12355309] [2020-10-27 17:29:37,597 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-27 17:29:37,597 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-27 17:29:37,597 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041751069] [2020-10-27 17:29:37,599 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-27 17:29:37,599 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-27 17:29:37,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-27 17:29:37,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-27 17:29:37,600 INFO L87 Difference]: Start difference. First operand 1478 states and 1875 transitions. Second operand 7 states. [2020-10-27 17:29:37,818 WARN L193 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2020-10-27 17:29:39,997 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2020-10-27 17:29:40,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-27 17:29:40,442 INFO L93 Difference]: Finished difference Result 2966 states and 3800 transitions. [2020-10-27 17:29:40,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-27 17:29:40,444 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 241 [2020-10-27 17:29:40,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-27 17:29:40,452 INFO L225 Difference]: With dead ends: 2966 [2020-10-27 17:29:40,452 INFO L226 Difference]: Without dead ends: 1494 [2020-10-27 17:29:40,457 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-10-27 17:29:40,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1494 states. [2020-10-27 17:29:40,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1494 to 1476. [2020-10-27 17:29:40,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1476 states. [2020-10-27 17:29:40,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1476 states to 1476 states and 1826 transitions. [2020-10-27 17:29:40,501 INFO L78 Accepts]: Start accepts. Automaton has 1476 states and 1826 transitions. Word has length 241 [2020-10-27 17:29:40,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-27 17:29:40,502 INFO L481 AbstractCegarLoop]: Abstraction has 1476 states and 1826 transitions. [2020-10-27 17:29:40,502 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-27 17:29:40,502 INFO L276 IsEmpty]: Start isEmpty. Operand 1476 states and 1826 transitions. [2020-10-27 17:29:40,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2020-10-27 17:29:40,508 INFO L414 BasicCegarLoop]: Found error trace [2020-10-27 17:29:40,509 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-27 17:29:40,509 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-27 17:29:40,509 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-27 17:29:40,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-27 17:29:40,510 INFO L82 PathProgramCache]: Analyzing trace with hash -36678028, now seen corresponding path program 1 times [2020-10-27 17:29:40,510 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-27 17:29:40,510 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [520269245] [2020-10-27 17:29:40,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-27 17:29:40,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:29:40,561 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:29:40,691 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:29:43,019 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:29:45,391 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:29:45,392 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 259 [2020-10-27 17:29:45,392 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 3 [2020-10-27 17:29:45,392 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 4846 [2020-10-27 17:29:45,392 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:29:45,392 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-27 17:29:45,393 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 97 [2020-10-27 17:29:45,393 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 145 [2020-10-27 17:29:45,393 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:29:45,572 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-27 17:29:45,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:29:45,577 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:29:45,583 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:29:45,583 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-27 17:29:45,583 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:29:45,583 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 6 [2020-10-27 17:29:45,583 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:29:45,584 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-27 17:29:45,584 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:29:45,584 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-27 17:29:45,584 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:29:45,607 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-27 17:29:45,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:29:45,632 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:29:45,692 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:29:45,692 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 88 [2020-10-27 17:29:45,692 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:29:45,692 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 70 [2020-10-27 17:29:45,692 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:29:45,693 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-27 17:29:45,693 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:29:45,693 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 82 [2020-10-27 17:29:45,693 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:29:45,717 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2020-10-27 17:29:45,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:29:45,764 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:29:45,929 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:29:45,929 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 143 [2020-10-27 17:29:45,929 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:29:45,930 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 182 [2020-10-27 17:29:45,930 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:29:45,930 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-27 17:29:45,930 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-27 17:29:45,930 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 143 [2020-10-27 17:29:45,931 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:29:46,099 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 100 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-27 17:29:46,100 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [520269245] [2020-10-27 17:29:46,100 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-27 17:29:46,100 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-27 17:29:46,101 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888335289] [2020-10-27 17:29:46,102 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-27 17:29:46,105 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-27 17:29:46,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-27 17:29:46,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-27 17:29:46,106 INFO L87 Difference]: Start difference. First operand 1476 states and 1826 transitions. Second operand 7 states. [2020-10-27 17:29:46,952 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2020-10-27 17:29:48,136 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2020-10-27 17:29:49,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-27 17:29:49,697 INFO L93 Difference]: Finished difference Result 3911 states and 5132 transitions. [2020-10-27 17:29:49,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-27 17:29:49,704 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 245 [2020-10-27 17:29:49,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-27 17:29:49,719 INFO L225 Difference]: With dead ends: 3911 [2020-10-27 17:29:49,719 INFO L226 Difference]: Without dead ends: 2441 [2020-10-27 17:29:49,724 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2020-10-27 17:29:49,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2441 states. [2020-10-27 17:29:49,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2441 to 1643. [2020-10-27 17:29:49,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1643 states. [2020-10-27 17:29:49,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1643 states to 1643 states and 1972 transitions. [2020-10-27 17:29:49,805 INFO L78 Accepts]: Start accepts. Automaton has 1643 states and 1972 transitions. Word has length 245 [2020-10-27 17:29:49,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-27 17:29:49,805 INFO L481 AbstractCegarLoop]: Abstraction has 1643 states and 1972 transitions. [2020-10-27 17:29:49,806 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-27 17:29:49,806 INFO L276 IsEmpty]: Start isEmpty. Operand 1643 states and 1972 transitions. [2020-10-27 17:29:49,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2020-10-27 17:29:49,813 INFO L414 BasicCegarLoop]: Found error trace [2020-10-27 17:29:49,813 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-27 17:29:49,813 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-27 17:29:49,814 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-27 17:29:49,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-27 17:29:49,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1837720164, now seen corresponding path program 1 times [2020-10-27 17:29:49,815 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-27 17:29:49,815 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1621084741] [2020-10-27 17:29:49,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-27 17:29:49,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:29:49,877 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:29:49,936 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:29:52,333 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:29:54,569 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:29:54,569 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 267 [2020-10-27 17:29:54,569 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 3 [2020-10-27 17:29:54,569 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 4712 [2020-10-27 17:29:54,570 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:29:54,570 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-27 17:29:54,570 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 105 [2020-10-27 17:29:54,570 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 145 [2020-10-27 17:29:54,570 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:29:54,729 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2020-10-27 17:29:54,730 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-27 17:29:54,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:29:54,735 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:29:54,738 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:29:54,739 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-27 17:29:54,739 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:29:54,739 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 4 [2020-10-27 17:29:54,739 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:29:54,739 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-27 17:29:54,740 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:29:54,740 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-27 17:29:54,740 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:29:54,763 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-27 17:29:54,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:29:54,794 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:29:54,854 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:29:54,854 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 96 [2020-10-27 17:29:54,855 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:29:54,855 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 73 [2020-10-27 17:29:54,855 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:29:54,855 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-27 17:29:54,855 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:29:54,855 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 90 [2020-10-27 17:29:54,856 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:29:54,886 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2020-10-27 17:29:54,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:29:54,939 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:29:55,111 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:29:55,111 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 143 [2020-10-27 17:29:55,111 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:29:55,112 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 190 [2020-10-27 17:29:55,112 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:29:55,112 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-27 17:29:55,112 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-27 17:29:55,112 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 143 [2020-10-27 17:29:55,112 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:29:55,288 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 108 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-27 17:29:55,288 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1621084741] [2020-10-27 17:29:55,289 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-27 17:29:55,289 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-27 17:29:55,289 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103315327] [2020-10-27 17:29:55,290 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-27 17:29:55,290 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-27 17:29:55,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-27 17:29:55,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-27 17:29:55,291 INFO L87 Difference]: Start difference. First operand 1643 states and 1972 transitions. Second operand 7 states. [2020-10-27 17:29:56,094 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2020-10-27 17:29:58,279 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2020-10-27 17:29:58,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-27 17:29:58,490 INFO L93 Difference]: Finished difference Result 4089 states and 5254 transitions. [2020-10-27 17:29:58,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-27 17:29:58,491 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 253 [2020-10-27 17:29:58,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-27 17:29:58,504 INFO L225 Difference]: With dead ends: 4089 [2020-10-27 17:29:58,504 INFO L226 Difference]: Without dead ends: 2452 [2020-10-27 17:29:58,509 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2020-10-27 17:29:58,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2452 states. [2020-10-27 17:29:58,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2452 to 2376. [2020-10-27 17:29:58,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2376 states. [2020-10-27 17:29:58,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2376 states to 2376 states and 2791 transitions. [2020-10-27 17:29:58,602 INFO L78 Accepts]: Start accepts. Automaton has 2376 states and 2791 transitions. Word has length 253 [2020-10-27 17:29:58,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-27 17:29:58,603 INFO L481 AbstractCegarLoop]: Abstraction has 2376 states and 2791 transitions. [2020-10-27 17:29:58,603 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-27 17:29:58,603 INFO L276 IsEmpty]: Start isEmpty. Operand 2376 states and 2791 transitions. [2020-10-27 17:29:58,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2020-10-27 17:29:58,611 INFO L414 BasicCegarLoop]: Found error trace [2020-10-27 17:29:58,611 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-27 17:29:58,612 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-27 17:29:58,612 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-27 17:29:58,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-27 17:29:58,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1964254000, now seen corresponding path program 1 times [2020-10-27 17:29:58,613 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-27 17:29:58,613 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2117625688] [2020-10-27 17:29:58,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-27 17:29:58,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:29:58,671 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:29:59,124 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:29:59,124 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 268 [2020-10-27 17:29:59,125 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:29:59,125 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 471 [2020-10-27 17:29:59,125 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:29:59,125 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-10-27 17:29:59,125 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 5 [2020-10-27 17:29:59,125 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 102 [2020-10-27 17:29:59,125 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:29:59,248 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-27 17:29:59,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:29:59,255 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:29:59,264 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:29:59,264 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-27 17:29:59,264 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:29:59,265 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 10 [2020-10-27 17:29:59,265 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:29:59,265 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-27 17:29:59,265 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:29:59,265 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 2 [2020-10-27 17:29:59,265 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:29:59,299 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-27 17:29:59,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:29:59,338 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:29:59,450 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:29:59,450 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 97 [2020-10-27 17:29:59,450 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:29:59,451 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 124 [2020-10-27 17:29:59,451 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:29:59,451 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-27 17:29:59,451 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-27 17:29:59,451 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 97 [2020-10-27 17:29:59,451 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:29:59,546 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2020-10-27 17:29:59,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:29:59,592 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:29:59,646 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:29:59,646 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 143 [2020-10-27 17:29:59,646 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:29:59,646 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 71 [2020-10-27 17:29:59,647 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:29:59,647 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-27 17:29:59,647 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 140 [2020-10-27 17:29:59,647 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-27 17:29:59,647 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:29:59,783 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 16 proven. 91 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-27 17:29:59,783 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2117625688] [2020-10-27 17:29:59,784 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-27 17:29:59,784 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-27 17:29:59,784 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723743447] [2020-10-27 17:29:59,785 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-27 17:29:59,785 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-27 17:29:59,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-27 17:29:59,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-27 17:29:59,786 INFO L87 Difference]: Start difference. First operand 2376 states and 2791 transitions. Second operand 7 states. [2020-10-27 17:29:59,968 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2020-10-27 17:30:01,594 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2020-10-27 17:30:02,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-27 17:30:02,506 INFO L93 Difference]: Finished difference Result 4903 states and 5773 transitions. [2020-10-27 17:30:02,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-27 17:30:02,512 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 254 [2020-10-27 17:30:02,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-27 17:30:02,522 INFO L225 Difference]: With dead ends: 4903 [2020-10-27 17:30:02,522 INFO L226 Difference]: Without dead ends: 2533 [2020-10-27 17:30:02,528 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2020-10-27 17:30:02,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2533 states. [2020-10-27 17:30:02,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2533 to 2525. [2020-10-27 17:30:02,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2525 states. [2020-10-27 17:30:02,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2525 states to 2525 states and 2959 transitions. [2020-10-27 17:30:02,595 INFO L78 Accepts]: Start accepts. Automaton has 2525 states and 2959 transitions. Word has length 254 [2020-10-27 17:30:02,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-27 17:30:02,596 INFO L481 AbstractCegarLoop]: Abstraction has 2525 states and 2959 transitions. [2020-10-27 17:30:02,596 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-27 17:30:02,596 INFO L276 IsEmpty]: Start isEmpty. Operand 2525 states and 2959 transitions. [2020-10-27 17:30:02,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2020-10-27 17:30:02,606 INFO L414 BasicCegarLoop]: Found error trace [2020-10-27 17:30:02,606 INFO L422 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-27 17:30:02,606 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-27 17:30:02,607 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-27 17:30:02,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-27 17:30:02,607 INFO L82 PathProgramCache]: Analyzing trace with hash 857449300, now seen corresponding path program 1 times [2020-10-27 17:30:02,607 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-27 17:30:02,608 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1937696751] [2020-10-27 17:30:02,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-27 17:30:02,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:30:02,681 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:30:02,848 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:30:03,038 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:30:03,642 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:30:03,643 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 349 [2020-10-27 17:30:03,643 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 3 [2020-10-27 17:30:03,643 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 983 [2020-10-27 17:30:03,643 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:30:03,643 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-27 17:30:03,643 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 89 [2020-10-27 17:30:03,643 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 99 [2020-10-27 17:30:03,644 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:30:03,814 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2020-10-27 17:30:03,814 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-27 17:30:03,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:30:03,819 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:30:03,823 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:30:03,823 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-27 17:30:03,824 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:30:03,824 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 4 [2020-10-27 17:30:03,824 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:30:03,824 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-27 17:30:03,824 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:30:03,824 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-27 17:30:03,824 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:30:03,848 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-27 17:30:03,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:30:03,871 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:30:03,914 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:30:03,914 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 80 [2020-10-27 17:30:03,915 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:30:03,915 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 51 [2020-10-27 17:30:03,915 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:30:03,915 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-27 17:30:03,915 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:30:03,915 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 74 [2020-10-27 17:30:03,916 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:30:03,962 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-10-27 17:30:03,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:30:03,991 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:30:04,113 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:30:04,113 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 97 [2020-10-27 17:30:04,113 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:30:04,113 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 133 [2020-10-27 17:30:04,113 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:30:04,113 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-27 17:30:04,114 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-27 17:30:04,114 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 97 [2020-10-27 17:30:04,114 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:30:04,177 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2020-10-27 17:30:04,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:30:04,208 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:30:04,245 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:30:04,245 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 143 [2020-10-27 17:30:04,246 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:30:04,246 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 49 [2020-10-27 17:30:04,246 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:30:04,246 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-27 17:30:04,246 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 140 [2020-10-27 17:30:04,246 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-27 17:30:04,246 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:30:04,344 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 104 proven. 95 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2020-10-27 17:30:04,344 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1937696751] [2020-10-27 17:30:04,344 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-27 17:30:04,344 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-10-27 17:30:04,344 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188120041] [2020-10-27 17:30:04,345 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-27 17:30:04,345 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-27 17:30:04,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-27 17:30:04,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-27 17:30:04,346 INFO L87 Difference]: Start difference. First operand 2525 states and 2959 transitions. Second operand 8 states. [2020-10-27 17:30:05,102 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2020-10-27 17:30:05,398 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2020-10-27 17:30:05,817 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2020-10-27 17:30:10,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-27 17:30:10,457 INFO L93 Difference]: Finished difference Result 8420 states and 10272 transitions. [2020-10-27 17:30:10,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-27 17:30:10,458 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 333 [2020-10-27 17:30:10,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-27 17:30:10,479 INFO L225 Difference]: With dead ends: 8420 [2020-10-27 17:30:10,479 INFO L226 Difference]: Without dead ends: 5148 [2020-10-27 17:30:10,489 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2020-10-27 17:30:10,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5148 states. [2020-10-27 17:30:10,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5148 to 4996. [2020-10-27 17:30:10,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4996 states. [2020-10-27 17:30:10,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4996 states to 4996 states and 5770 transitions. [2020-10-27 17:30:10,635 INFO L78 Accepts]: Start accepts. Automaton has 4996 states and 5770 transitions. Word has length 333 [2020-10-27 17:30:10,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-27 17:30:10,636 INFO L481 AbstractCegarLoop]: Abstraction has 4996 states and 5770 transitions. [2020-10-27 17:30:10,636 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-27 17:30:10,636 INFO L276 IsEmpty]: Start isEmpty. Operand 4996 states and 5770 transitions. [2020-10-27 17:30:10,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2020-10-27 17:30:10,653 INFO L414 BasicCegarLoop]: Found error trace [2020-10-27 17:30:10,653 INFO L422 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-27 17:30:10,654 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-27 17:30:10,654 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-27 17:30:10,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-27 17:30:10,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1170636476, now seen corresponding path program 1 times [2020-10-27 17:30:10,655 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-27 17:30:10,655 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1273659655] [2020-10-27 17:30:10,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-27 17:30:10,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:30:10,716 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:30:10,897 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:30:12,455 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:30:12,456 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 357 [2020-10-27 17:30:12,456 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-27 17:30:12,456 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1757 [2020-10-27 17:30:12,457 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:30:12,457 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-27 17:30:12,457 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 105 [2020-10-27 17:30:12,457 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 91 [2020-10-27 17:30:12,457 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:30:12,619 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2020-10-27 17:30:12,620 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-27 17:30:12,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:30:12,624 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:30:12,628 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:30:12,628 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-27 17:30:12,628 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:30:12,629 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 5 [2020-10-27 17:30:12,629 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:30:12,629 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-27 17:30:12,629 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:30:12,629 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-27 17:30:12,629 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:30:12,652 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-27 17:30:12,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:30:12,675 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:30:12,713 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:30:12,714 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 96 [2020-10-27 17:30:12,714 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:30:12,714 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 44 [2020-10-27 17:30:12,714 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:30:12,714 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-27 17:30:12,714 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:30:12,714 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 90 [2020-10-27 17:30:12,714 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:30:12,733 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2020-10-27 17:30:12,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:30:12,755 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:30:12,816 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:30:12,816 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 89 [2020-10-27 17:30:12,817 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:30:12,817 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 70 [2020-10-27 17:30:12,817 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:30:12,817 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-27 17:30:12,817 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-27 17:30:12,817 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 89 [2020-10-27 17:30:12,817 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:30:12,904 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2020-10-27 17:30:12,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:30:12,935 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:30:12,967 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:30:12,968 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 143 [2020-10-27 17:30:12,968 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:30:12,968 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 45 [2020-10-27 17:30:12,968 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:30:12,968 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-27 17:30:12,968 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 140 [2020-10-27 17:30:12,968 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-27 17:30:12,968 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:30:13,099 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 113 proven. 87 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2020-10-27 17:30:13,099 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1273659655] [2020-10-27 17:30:13,099 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-27 17:30:13,099 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-27 17:30:13,100 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792784317] [2020-10-27 17:30:13,100 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-27 17:30:13,100 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-27 17:30:13,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-27 17:30:13,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-27 17:30:13,101 INFO L87 Difference]: Start difference. First operand 4996 states and 5770 transitions. Second operand 7 states. [2020-10-27 17:30:14,071 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2020-10-27 17:30:15,320 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2020-10-27 17:30:16,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-27 17:30:16,225 INFO L93 Difference]: Finished difference Result 9863 states and 11434 transitions. [2020-10-27 17:30:16,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-27 17:30:16,232 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 341 [2020-10-27 17:30:16,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-27 17:30:16,253 INFO L225 Difference]: With dead ends: 9863 [2020-10-27 17:30:16,254 INFO L226 Difference]: Without dead ends: 5016 [2020-10-27 17:30:16,265 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-10-27 17:30:16,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5016 states. [2020-10-27 17:30:16,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5016 to 4996. [2020-10-27 17:30:16,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4996 states. [2020-10-27 17:30:16,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4996 states to 4996 states and 5750 transitions. [2020-10-27 17:30:16,421 INFO L78 Accepts]: Start accepts. Automaton has 4996 states and 5750 transitions. Word has length 341 [2020-10-27 17:30:16,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-27 17:30:16,422 INFO L481 AbstractCegarLoop]: Abstraction has 4996 states and 5750 transitions. [2020-10-27 17:30:16,422 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-27 17:30:16,422 INFO L276 IsEmpty]: Start isEmpty. Operand 4996 states and 5750 transitions. [2020-10-27 17:30:16,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2020-10-27 17:30:16,436 INFO L414 BasicCegarLoop]: Found error trace [2020-10-27 17:30:16,437 INFO L422 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-27 17:30:16,437 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-27 17:30:16,437 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-27 17:30:16,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-27 17:30:16,438 INFO L82 PathProgramCache]: Analyzing trace with hash -328984308, now seen corresponding path program 1 times [2020-10-27 17:30:16,438 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-27 17:30:16,438 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1186282236] [2020-10-27 17:30:16,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-27 17:30:16,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:30:16,601 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:30:17,131 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:30:17,131 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 385 [2020-10-27 17:30:17,132 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:30:17,132 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 578 [2020-10-27 17:30:17,132 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:30:17,132 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-27 17:30:17,132 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 125 [2020-10-27 17:30:17,133 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 99 [2020-10-27 17:30:17,133 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:30:17,348 WARN L193 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2020-10-27 17:30:17,349 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-27 17:30:17,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:30:17,353 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:30:17,356 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:30:17,356 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-27 17:30:17,356 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:30:17,356 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 3 [2020-10-27 17:30:17,356 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:30:17,356 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-27 17:30:17,357 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:30:17,357 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-27 17:30:17,357 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:30:17,379 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-27 17:30:17,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:30:17,414 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:30:17,481 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:30:17,482 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 116 [2020-10-27 17:30:17,482 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:30:17,482 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 81 [2020-10-27 17:30:17,482 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:30:17,482 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-27 17:30:17,482 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:30:17,482 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 110 [2020-10-27 17:30:17,483 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:30:17,535 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2020-10-27 17:30:17,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:30:17,561 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:30:17,646 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:30:17,646 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 97 [2020-10-27 17:30:17,646 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:30:17,647 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 93 [2020-10-27 17:30:17,647 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:30:17,647 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-27 17:30:17,647 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-27 17:30:17,647 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 97 [2020-10-27 17:30:17,647 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:30:17,765 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2020-10-27 17:30:17,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:30:17,799 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:30:17,834 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:30:17,834 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 143 [2020-10-27 17:30:17,834 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:30:17,834 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 47 [2020-10-27 17:30:17,834 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:30:17,834 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-27 17:30:17,834 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 140 [2020-10-27 17:30:17,835 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-27 17:30:17,835 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:30:17,983 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 121 proven. 95 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2020-10-27 17:30:17,984 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1186282236] [2020-10-27 17:30:17,984 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-27 17:30:17,984 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-10-27 17:30:17,984 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702770851] [2020-10-27 17:30:17,985 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-27 17:30:17,985 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-27 17:30:17,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-27 17:30:17,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-27 17:30:17,986 INFO L87 Difference]: Start difference. First operand 4996 states and 5750 transitions. Second operand 8 states. [2020-10-27 17:30:19,284 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2020-10-27 17:30:21,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-27 17:30:21,580 INFO L93 Difference]: Finished difference Result 10298 states and 11869 transitions. [2020-10-27 17:30:21,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-27 17:30:21,582 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 369 [2020-10-27 17:30:21,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-27 17:30:21,602 INFO L225 Difference]: With dead ends: 10298 [2020-10-27 17:30:21,602 INFO L226 Difference]: Without dead ends: 5451 [2020-10-27 17:30:21,614 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2020-10-27 17:30:21,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5451 states. [2020-10-27 17:30:21,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5451 to 5447. [2020-10-27 17:30:21,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5447 states. [2020-10-27 17:30:21,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5447 states to 5447 states and 6242 transitions. [2020-10-27 17:30:21,762 INFO L78 Accepts]: Start accepts. Automaton has 5447 states and 6242 transitions. Word has length 369 [2020-10-27 17:30:21,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-27 17:30:21,763 INFO L481 AbstractCegarLoop]: Abstraction has 5447 states and 6242 transitions. [2020-10-27 17:30:21,763 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-27 17:30:21,763 INFO L276 IsEmpty]: Start isEmpty. Operand 5447 states and 6242 transitions. [2020-10-27 17:30:21,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2020-10-27 17:30:21,781 INFO L414 BasicCegarLoop]: Found error trace [2020-10-27 17:30:21,781 INFO L422 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1] [2020-10-27 17:30:21,782 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-27 17:30:21,782 INFO L429 AbstractCegarLoop]: === Iteration 17 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-27 17:30:21,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-27 17:30:21,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1072516052, now seen corresponding path program 1 times [2020-10-27 17:30:21,783 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-27 17:30:21,783 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [16385526] [2020-10-27 17:30:21,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-27 17:30:21,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-27 17:30:21,867 INFO L173 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-10-27 17:30:21,867 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-27 17:30:21,875 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-27 17:30:21,964 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.10 05:30:21 BoogieIcfgContainer [2020-10-27 17:30:21,964 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-27 17:30:21,966 INFO L168 Benchmark]: Toolchain (without parser) took 101913.61 ms. Allocated memory was 125.8 MB in the beginning and 1.0 GB in the end (delta: 892.3 MB). Free memory was 99.4 MB in the beginning and 706.6 MB in the end (delta: -607.3 MB). Peak memory consumption was 285.9 MB. Max. memory is 8.0 GB. [2020-10-27 17:30:21,968 INFO L168 Benchmark]: CDTParser took 0.66 ms. Allocated memory is still 125.8 MB. Free memory is still 99.9 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-10-27 17:30:21,969 INFO L168 Benchmark]: CACSL2BoogieTranslator took 808.94 ms. Allocated memory was 125.8 MB in the beginning and 156.2 MB in the end (delta: 30.4 MB). Free memory was 98.8 MB in the beginning and 133.9 MB in the end (delta: -35.1 MB). Peak memory consumption was 27.7 MB. Max. memory is 8.0 GB. [2020-10-27 17:30:21,970 INFO L168 Benchmark]: Boogie Preprocessor took 154.97 ms. Allocated memory is still 156.2 MB. Free memory was 133.9 MB in the beginning and 129.1 MB in the end (delta: 4.7 MB). Peak memory consumption was 5.2 MB. Max. memory is 8.0 GB. [2020-10-27 17:30:21,973 INFO L168 Benchmark]: RCFGBuilder took 1727.38 ms. Allocated memory is still 156.2 MB. Free memory was 129.1 MB in the beginning and 133.2 MB in the end (delta: -4.0 MB). Peak memory consumption was 61.1 MB. Max. memory is 8.0 GB. [2020-10-27 17:30:21,974 INFO L168 Benchmark]: TraceAbstraction took 99204.75 ms. Allocated memory was 156.2 MB in the beginning and 1.0 GB in the end (delta: 861.9 MB). Free memory was 132.7 MB in the beginning and 706.6 MB in the end (delta: -574.0 MB). Peak memory consumption was 288.5 MB. Max. memory is 8.0 GB. [2020-10-27 17:30:21,979 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.66 ms. Allocated memory is still 125.8 MB. Free memory is still 99.9 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 808.94 ms. Allocated memory was 125.8 MB in the beginning and 156.2 MB in the end (delta: 30.4 MB). Free memory was 98.8 MB in the beginning and 133.9 MB in the end (delta: -35.1 MB). Peak memory consumption was 27.7 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 154.97 ms. Allocated memory is still 156.2 MB. Free memory was 133.9 MB in the beginning and 129.1 MB in the end (delta: 4.7 MB). Peak memory consumption was 5.2 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1727.38 ms. Allocated memory is still 156.2 MB. Free memory was 129.1 MB in the beginning and 133.2 MB in the end (delta: -4.0 MB). Peak memory consumption was 61.1 MB. Max. memory is 8.0 GB. * TraceAbstraction took 99204.75 ms. Allocated memory was 156.2 MB in the beginning and 1.0 GB in the end (delta: 861.9 MB). Free memory was 132.7 MB in the beginning and 706.6 MB in the end (delta: -574.0 MB). Peak memory consumption was 288.5 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 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 TRUE (((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9)) [L338] a1 = ((((((a1 / 5) % 25)+ 13) * 5) % 25)- -12) [L339] a10 = 4 [L341] return 22; [L592] RET, EXPR calculate_output(input) [L592] output = calculate_output(input) [L584] COND TRUE 1 [L587] int input; [L588] input = __VERIFIER_nondet_int() [L589] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L592] CALL, EXPR calculate_output(input) [L23] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L26] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L29] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L32] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L35] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L38] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L41] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L44] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L47] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L50] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L53] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L56] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L59] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L62] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L65] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L68] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L71] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L74] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L77] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L80] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L83] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L86] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L89] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L92] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L95] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L98] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L101] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L104] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L107] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L110] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L113] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L116] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L119] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L122] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L125] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L128] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L131] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L134] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L137] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L140] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L143] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L146] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L149] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L152] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L155] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L158] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L161] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L164] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L167] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L170] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L173] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L176] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L179] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L182] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L185] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L188] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L191] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L194] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L197] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L200] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L203] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L207] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L212] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) [L217] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) [L222] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) [L227] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) [L233] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) [L238] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) [L241] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) [L246] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) [L251] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) [L256] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) [L262] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) [L267] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) [L273] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) [L279] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) [L285] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) [L288] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) [L293] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) [L298] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) [L303] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) [L308] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) [L314] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) [L319] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) [L322] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) [L325] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) [L328] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) [L331] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) [L337] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) [L342] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) [L347] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) [L353] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) [L356] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) [L359] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) [L362] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) [L367] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0))))) [L372] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) [L377] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) [L380] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) [L385] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) [L390] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0))))) [L395] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) [L400] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) [L405] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14))) [L410] COND FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))) [L416] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14))) [L421] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10)))))) [L427] COND FALSE !(((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0))) [L432] COND FALSE !((((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 6)) && (a19==10))) && (a12==0))) [L438] COND FALSE !(((a19==9) && ((((input == 4) && (( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 ))) && (a12==0)) && (a4==14)))) [L444] COND FALSE !((((a19==10) && ((a12==0) && ((((a10==1) && a1 <= -13 ) || (( ((38 < a1) && (218 >= a1)) && (a10==0)) || ((a10==0) && 218 < a1 ))) && (input == 3)))) && (a4==14))) [L450] COND FALSE !(((a19==9) && (((a4==14) && ((((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4))) && (input == 5))) && (a12==0)))) [L456] COND FALSE !((((a12==0) && ((((input == 5) && (a19==10)) && ((38 < a1) && (218 >= a1)) ) && (a4==14))) && (a10==1))) [L462] COND FALSE !(((a19==9) && ((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3)) && (a10==1)) && (a12==0))))) [L467] COND FALSE !(((a10==0) && ((a12==0) && ((((input == 5) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a4==14))))) [L473] COND FALSE !(( 218 < a1 && (((((input == 3) && (a10==1)) && (a12==0)) && (a4==14)) && (a19==10)))) [L478] COND FALSE !((((a12==0) && ((a19==9) && (((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a4==14)))) && (a10==3))) [L483] COND FALSE !((((((a4==14) && ( ((38 < a1) && (218 >= a1)) && (input == 2))) && (a12==0)) && (a10==1)) && (a19==10))) [L489] COND FALSE !((((a19==10) && ((a10==1) && ((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (input == 5))))) && (a4==14))) [L495] COND FALSE !(((((a10==1) && (((input == 5) && 218 < a1 ) && (a4==14))) && (a19==10)) && (a12==0))) [L501] COND FALSE !((((a4==14) && ((a19==9) && ((input == 2) && (((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 ))))) && (a12==0))) [L506] COND FALSE !((((a4==14) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 2))) && (a12==0))) && (a10==4))) [L511] COND FALSE !(((a4==14) && (((a19==9) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 6)) && (a10==3))) && (a12==0)))) [L516] COND FALSE !((((a4==14) && ((((input == 6) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a12==0))) && (a10==0))) [L519] COND FALSE !(((a12==0) && ((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 2)) && (a19==10))))) [L525] COND FALSE !((((a12==0) && ((a19==9) && ((a10==2) && ((input == 6) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))))) && (a4==14))) [L528] COND FALSE !(((a4==14) && ((a19==9) && ((a12==0) && (((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)))))) [L531] COND FALSE !(((a19==9) && (((a10==1) && ((a12==0) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )))) && (a4==14)))) [L536] COND FALSE !(((a19==9) && ((a4==14) && ((a10==1) && (((input == 5) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a12==0)))))) [L542] COND FALSE !(((a12==0) && (((((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a19==9)) && (a4==14)) && (a10==0)))) [L547] COND FALSE !(((a4==14) && (((a12==0) && ((a19==9) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )))) && (a10==4)))) [L550] COND FALSE !(((((( ((38 < a1) && (218 >= a1)) && (input == 3)) && (a10==1)) && (a12==0)) && (a4==14)) && (a19==10))) [L556] COND FALSE !((((a4==14) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 4)) && (a12==0)) && (a19==9))) && (a10==2))) [L559] COND FALSE !(((a12==0) && ((( 218 < a1 && ((a19==9) && (input == 5))) && (a10==1)) && (a4==14)))) [L565] COND TRUE ((a4==14) && ((((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a12==0)) && (a19==9)) && (a10==4))) [L566] a1 = (((a1 + 566454) + 1842) + 23814) [L567] a10 = 2 [L568] a19 = 8 [L570] 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 TRUE (((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8)) [L33] CALL reach_error() [L4] __assert_fail("0", "Problem10_label50.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: 99.0s, OverallIterations: 17, TraceHistogramMax: 4, AutomataDifference: 57.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 470 SDtfs, 6126 SDslu, 585 SDs, 0 SdLazy, 15875 SolverSat, 1767 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 35.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 273 GetRequests, 134 SyntacticMatches, 4 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 14.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5447occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 1571 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 38.1s InterpolantComputationTime, 3755 NumberOfCodeBlocks, 3755 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 3351 ConstructedInterpolants, 0 QuantifiedInterpolants, 3286395 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 1 PerfectInterpolantSequences, 1403/1790 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...