java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/systemc/pc_sfifo_1.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 23:49:55,110 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 23:49:55,114 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 23:49:55,133 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 23:49:55,133 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 23:49:55,135 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 23:49:55,137 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 23:49:55,145 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 23:49:55,147 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 23:49:55,150 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 23:49:55,151 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 23:49:55,152 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 23:49:55,152 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 23:49:55,153 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 23:49:55,154 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 23:49:55,155 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 23:49:55,156 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 23:49:55,157 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 23:49:55,158 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 23:49:55,160 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 23:49:55,162 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 23:49:55,163 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 23:49:55,164 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 23:49:55,165 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 23:49:55,167 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 23:49:55,167 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 23:49:55,167 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 23:49:55,168 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 23:49:55,168 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 23:49:55,170 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 23:49:55,170 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 23:49:55,171 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 23:49:55,171 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 23:49:55,172 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 23:49:55,173 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 23:49:55,173 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 23:49:55,174 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 23:49:55,174 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 23:49:55,174 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 23:49:55,175 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 23:49:55,176 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 23:49:55,177 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-14 23:49:55,191 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 23:49:55,191 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 23:49:55,193 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 23:49:55,193 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 23:49:55,193 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 23:49:55,194 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 23:49:55,194 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 23:49:55,194 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 23:49:55,194 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 23:49:55,194 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 23:49:55,195 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 23:49:55,195 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 23:49:55,195 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 23:49:55,195 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 23:49:55,195 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 23:49:55,196 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 23:49:55,196 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 23:49:55,196 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 23:49:55,196 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 23:49:55,196 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 23:49:55,197 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 23:49:55,197 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:49:55,197 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 23:49:55,197 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 23:49:55,198 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 23:49:55,198 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 23:49:55,198 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 23:49:55,198 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 23:49:55,198 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 23:49:55,543 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 23:49:55,568 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 23:49:55,572 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 23:49:55,574 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 23:49:55,574 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 23:49:55,575 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/pc_sfifo_1.cil-2.c [2019-10-14 23:49:55,655 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44537d10e/148d9c52d1f04d5daf0872ecae4aaa8b/FLAGaad22c832 [2019-10-14 23:49:56,144 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 23:49:56,145 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/pc_sfifo_1.cil-2.c [2019-10-14 23:49:56,155 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44537d10e/148d9c52d1f04d5daf0872ecae4aaa8b/FLAGaad22c832 [2019-10-14 23:49:56,521 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44537d10e/148d9c52d1f04d5daf0872ecae4aaa8b [2019-10-14 23:49:56,531 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 23:49:56,533 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 23:49:56,534 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 23:49:56,534 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 23:49:56,538 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 23:49:56,539 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:49:56" (1/1) ... [2019-10-14 23:49:56,542 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c32a846 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:56, skipping insertion in model container [2019-10-14 23:49:56,542 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:49:56" (1/1) ... [2019-10-14 23:49:56,551 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 23:49:56,595 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 23:49:56,861 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:49:56,868 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 23:49:56,902 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:49:57,010 INFO L192 MainTranslator]: Completed translation [2019-10-14 23:49:57,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:57 WrapperNode [2019-10-14 23:49:57,012 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 23:49:57,013 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 23:49:57,013 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 23:49:57,013 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 23:49:57,024 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:57" (1/1) ... [2019-10-14 23:49:57,025 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:57" (1/1) ... [2019-10-14 23:49:57,032 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:57" (1/1) ... [2019-10-14 23:49:57,032 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:57" (1/1) ... [2019-10-14 23:49:57,044 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:57" (1/1) ... [2019-10-14 23:49:57,053 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:57" (1/1) ... [2019-10-14 23:49:57,057 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:57" (1/1) ... [2019-10-14 23:49:57,060 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 23:49:57,061 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 23:49:57,061 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 23:49:57,061 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 23:49:57,062 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:57" (1/1) ... No working directory specified, using /storage/repos/ultimate/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 [2019-10-14 23:49:57,114 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 23:49:57,115 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 23:49:57,115 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-10-14 23:49:57,115 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2019-10-14 23:49:57,115 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2019-10-14 23:49:57,115 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2019-10-14 23:49:57,115 INFO L138 BoogieDeclarations]: Found implementation of procedure do_write_p [2019-10-14 23:49:57,116 INFO L138 BoogieDeclarations]: Found implementation of procedure do_read_c [2019-10-14 23:49:57,116 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-10-14 23:49:57,116 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-10-14 23:49:57,116 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-10-14 23:49:57,116 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-10-14 23:49:57,116 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-10-14 23:49:57,117 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-10-14 23:49:57,117 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 23:49:57,117 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 23:49:57,117 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-14 23:49:57,117 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-10-14 23:49:57,118 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2019-10-14 23:49:57,118 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2019-10-14 23:49:57,118 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2019-10-14 23:49:57,118 INFO L130 BoogieDeclarations]: Found specification of procedure do_write_p [2019-10-14 23:49:57,118 INFO L130 BoogieDeclarations]: Found specification of procedure do_read_c [2019-10-14 23:49:57,118 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-10-14 23:49:57,119 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-10-14 23:49:57,119 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-10-14 23:49:57,119 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-10-14 23:49:57,119 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-10-14 23:49:57,119 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-10-14 23:49:57,120 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 23:49:57,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 23:49:57,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 23:49:57,586 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 23:49:57,586 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-14 23:49:57,589 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:49:57 BoogieIcfgContainer [2019-10-14 23:49:57,589 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 23:49:57,592 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 23:49:57,593 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 23:49:57,597 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 23:49:57,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:49:56" (1/3) ... [2019-10-14 23:49:57,598 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b6693bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:49:57, skipping insertion in model container [2019-10-14 23:49:57,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:57" (2/3) ... [2019-10-14 23:49:57,599 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b6693bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:49:57, skipping insertion in model container [2019-10-14 23:49:57,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:49:57" (3/3) ... [2019-10-14 23:49:57,605 INFO L109 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2.c [2019-10-14 23:49:57,615 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 23:49:57,623 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 23:49:57,635 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 23:49:57,667 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 23:49:57,667 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 23:49:57,667 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 23:49:57,667 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 23:49:57,668 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 23:49:57,668 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 23:49:57,668 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 23:49:57,668 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 23:49:57,691 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states. [2019-10-14 23:49:57,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-14 23:49:57,700 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:57,702 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:57,704 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:57,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:57,710 INFO L82 PathProgramCache]: Analyzing trace with hash 800633075, now seen corresponding path program 1 times [2019-10-14 23:49:57,719 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:57,719 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844880456] [2019-10-14 23:49:57,720 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:57,720 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:57,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:57,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:58,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:58,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:58,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:58,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:58,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:58,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:58,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:58,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:49:58,259 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844880456] [2019-10-14 23:49:58,261 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:58,261 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 23:49:58,262 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262720564] [2019-10-14 23:49:58,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:49:58,269 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:58,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:49:58,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:49:58,288 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 6 states. [2019-10-14 23:49:59,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:59,484 INFO L93 Difference]: Finished difference Result 356 states and 554 transitions. [2019-10-14 23:49:59,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-14 23:49:59,486 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-10-14 23:49:59,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:59,504 INFO L225 Difference]: With dead ends: 356 [2019-10-14 23:49:59,504 INFO L226 Difference]: Without dead ends: 248 [2019-10-14 23:49:59,512 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-14 23:49:59,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-10-14 23:49:59,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 185. [2019-10-14 23:49:59,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-10-14 23:49:59,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 246 transitions. [2019-10-14 23:49:59,607 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 246 transitions. Word has length 65 [2019-10-14 23:49:59,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:59,608 INFO L462 AbstractCegarLoop]: Abstraction has 185 states and 246 transitions. [2019-10-14 23:49:59,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:49:59,609 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 246 transitions. [2019-10-14 23:49:59,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-14 23:49:59,613 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:59,614 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:59,614 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:59,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:59,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1537976919, now seen corresponding path program 1 times [2019-10-14 23:49:59,615 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:59,615 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980025269] [2019-10-14 23:49:59,615 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:59,616 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:59,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:59,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:59,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:59,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:59,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:59,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:59,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:59,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:59,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:59,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:49:59,837 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980025269] [2019-10-14 23:49:59,837 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:59,837 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-14 23:49:59,837 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244662127] [2019-10-14 23:49:59,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-14 23:49:59,840 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:59,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-14 23:49:59,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-14 23:49:59,840 INFO L87 Difference]: Start difference. First operand 185 states and 246 transitions. Second operand 7 states. [2019-10-14 23:50:00,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:00,512 INFO L93 Difference]: Finished difference Result 406 states and 562 transitions. [2019-10-14 23:50:00,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-14 23:50:00,513 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-10-14 23:50:00,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:00,517 INFO L225 Difference]: With dead ends: 406 [2019-10-14 23:50:00,517 INFO L226 Difference]: Without dead ends: 238 [2019-10-14 23:50:00,520 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-10-14 23:50:00,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2019-10-14 23:50:00,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 182. [2019-10-14 23:50:00,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-10-14 23:50:00,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 241 transitions. [2019-10-14 23:50:00,568 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 241 transitions. Word has length 66 [2019-10-14 23:50:00,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:00,568 INFO L462 AbstractCegarLoop]: Abstraction has 182 states and 241 transitions. [2019-10-14 23:50:00,568 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-14 23:50:00,569 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 241 transitions. [2019-10-14 23:50:00,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-14 23:50:00,572 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:00,572 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:00,573 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:00,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:00,573 INFO L82 PathProgramCache]: Analyzing trace with hash -478173211, now seen corresponding path program 1 times [2019-10-14 23:50:00,573 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:00,574 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106443918] [2019-10-14 23:50:00,574 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:00,574 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:00,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:00,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:00,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:00,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:00,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:00,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:00,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:00,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:00,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:00,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:00,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:50:00,877 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106443918] [2019-10-14 23:50:00,877 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:00,878 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-14 23:50:00,878 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901326841] [2019-10-14 23:50:00,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-14 23:50:00,879 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:00,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-14 23:50:00,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-10-14 23:50:00,880 INFO L87 Difference]: Start difference. First operand 182 states and 241 transitions. Second operand 9 states. [2019-10-14 23:50:02,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:02,183 INFO L93 Difference]: Finished difference Result 582 states and 869 transitions. [2019-10-14 23:50:02,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-14 23:50:02,184 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 72 [2019-10-14 23:50:02,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:02,189 INFO L225 Difference]: With dead ends: 582 [2019-10-14 23:50:02,190 INFO L226 Difference]: Without dead ends: 417 [2019-10-14 23:50:02,191 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2019-10-14 23:50:02,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2019-10-14 23:50:02,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 336. [2019-10-14 23:50:02,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-10-14 23:50:02,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 490 transitions. [2019-10-14 23:50:02,268 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 490 transitions. Word has length 72 [2019-10-14 23:50:02,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:02,268 INFO L462 AbstractCegarLoop]: Abstraction has 336 states and 490 transitions. [2019-10-14 23:50:02,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-14 23:50:02,269 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 490 transitions. [2019-10-14 23:50:02,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-10-14 23:50:02,272 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:02,272 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:02,273 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:02,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:02,273 INFO L82 PathProgramCache]: Analyzing trace with hash -2098500188, now seen corresponding path program 1 times [2019-10-14 23:50:02,274 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:02,274 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653184163] [2019-10-14 23:50:02,274 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:02,275 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:02,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:02,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:02,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:02,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:02,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:02,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:02,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:02,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:02,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:02,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:02,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:50:02,589 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653184163] [2019-10-14 23:50:02,589 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:02,589 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-14 23:50:02,590 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358321982] [2019-10-14 23:50:02,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-14 23:50:02,592 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:02,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-14 23:50:02,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-10-14 23:50:02,594 INFO L87 Difference]: Start difference. First operand 336 states and 490 transitions. Second operand 12 states. [2019-10-14 23:50:05,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:05,731 INFO L93 Difference]: Finished difference Result 873 states and 1358 transitions. [2019-10-14 23:50:05,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-10-14 23:50:05,732 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 73 [2019-10-14 23:50:05,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:05,738 INFO L225 Difference]: With dead ends: 873 [2019-10-14 23:50:05,739 INFO L226 Difference]: Without dead ends: 554 [2019-10-14 23:50:05,742 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=278, Invalid=912, Unknown=0, NotChecked=0, Total=1190 [2019-10-14 23:50:05,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2019-10-14 23:50:05,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 211. [2019-10-14 23:50:05,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-10-14 23:50:05,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 276 transitions. [2019-10-14 23:50:05,789 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 276 transitions. Word has length 73 [2019-10-14 23:50:05,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:05,789 INFO L462 AbstractCegarLoop]: Abstraction has 211 states and 276 transitions. [2019-10-14 23:50:05,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-14 23:50:05,789 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 276 transitions. [2019-10-14 23:50:05,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-14 23:50:05,791 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:05,791 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:05,791 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:05,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:05,792 INFO L82 PathProgramCache]: Analyzing trace with hash -708931582, now seen corresponding path program 1 times [2019-10-14 23:50:05,792 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:05,792 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321711132] [2019-10-14 23:50:05,792 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:05,793 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:05,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:05,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:05,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:05,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:05,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:05,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:05,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:05,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:05,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:06,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:50:06,001 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321711132] [2019-10-14 23:50:06,001 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:06,001 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-14 23:50:06,002 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127909357] [2019-10-14 23:50:06,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-14 23:50:06,008 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:06,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-14 23:50:06,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-14 23:50:06,009 INFO L87 Difference]: Start difference. First operand 211 states and 276 transitions. Second operand 8 states. [2019-10-14 23:50:07,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:07,149 INFO L93 Difference]: Finished difference Result 612 states and 874 transitions. [2019-10-14 23:50:07,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-14 23:50:07,150 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2019-10-14 23:50:07,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:07,155 INFO L225 Difference]: With dead ends: 612 [2019-10-14 23:50:07,155 INFO L226 Difference]: Without dead ends: 418 [2019-10-14 23:50:07,157 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2019-10-14 23:50:07,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2019-10-14 23:50:07,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 323. [2019-10-14 23:50:07,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2019-10-14 23:50:07,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 419 transitions. [2019-10-14 23:50:07,206 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 419 transitions. Word has length 66 [2019-10-14 23:50:07,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:07,208 INFO L462 AbstractCegarLoop]: Abstraction has 323 states and 419 transitions. [2019-10-14 23:50:07,208 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-14 23:50:07,208 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 419 transitions. [2019-10-14 23:50:07,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-14 23:50:07,210 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:07,210 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:07,211 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:07,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:07,211 INFO L82 PathProgramCache]: Analyzing trace with hash -822318239, now seen corresponding path program 1 times [2019-10-14 23:50:07,211 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:07,212 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729801040] [2019-10-14 23:50:07,212 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:07,212 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:07,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:07,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:07,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:07,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:07,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:07,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:07,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:07,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:07,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:07,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:50:07,417 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729801040] [2019-10-14 23:50:07,418 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:07,418 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-14 23:50:07,418 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365334543] [2019-10-14 23:50:07,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-14 23:50:07,419 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:07,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-14 23:50:07,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-14 23:50:07,420 INFO L87 Difference]: Start difference. First operand 323 states and 419 transitions. Second operand 9 states. [2019-10-14 23:50:08,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:08,490 INFO L93 Difference]: Finished difference Result 727 states and 1002 transitions. [2019-10-14 23:50:08,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-14 23:50:08,491 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-10-14 23:50:08,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:08,496 INFO L225 Difference]: With dead ends: 727 [2019-10-14 23:50:08,497 INFO L226 Difference]: Without dead ends: 421 [2019-10-14 23:50:08,498 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-10-14 23:50:08,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2019-10-14 23:50:08,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 341. [2019-10-14 23:50:08,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-10-14 23:50:08,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 437 transitions. [2019-10-14 23:50:08,540 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 437 transitions. Word has length 66 [2019-10-14 23:50:08,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:08,540 INFO L462 AbstractCegarLoop]: Abstraction has 341 states and 437 transitions. [2019-10-14 23:50:08,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-14 23:50:08,541 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 437 transitions. [2019-10-14 23:50:08,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-14 23:50:08,543 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:08,543 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:08,543 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:08,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:08,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1843386593, now seen corresponding path program 1 times [2019-10-14 23:50:08,545 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:08,545 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34386637] [2019-10-14 23:50:08,545 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:08,545 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:08,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:08,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:08,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:08,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:08,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:08,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:08,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:08,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:08,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:08,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:50:08,737 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34386637] [2019-10-14 23:50:08,737 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:08,738 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-14 23:50:08,738 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759998077] [2019-10-14 23:50:08,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-14 23:50:08,739 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:08,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-14 23:50:08,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-14 23:50:08,739 INFO L87 Difference]: Start difference. First operand 341 states and 437 transitions. Second operand 9 states. [2019-10-14 23:50:11,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:11,338 INFO L93 Difference]: Finished difference Result 1164 states and 1617 transitions. [2019-10-14 23:50:11,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-14 23:50:11,339 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-10-14 23:50:11,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:11,346 INFO L225 Difference]: With dead ends: 1164 [2019-10-14 23:50:11,347 INFO L226 Difference]: Without dead ends: 840 [2019-10-14 23:50:11,350 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=200, Invalid=730, Unknown=0, NotChecked=0, Total=930 [2019-10-14 23:50:11,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2019-10-14 23:50:11,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 643. [2019-10-14 23:50:11,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2019-10-14 23:50:11,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 815 transitions. [2019-10-14 23:50:11,427 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 815 transitions. Word has length 66 [2019-10-14 23:50:11,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:11,427 INFO L462 AbstractCegarLoop]: Abstraction has 643 states and 815 transitions. [2019-10-14 23:50:11,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-14 23:50:11,428 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 815 transitions. [2019-10-14 23:50:11,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-14 23:50:11,429 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:11,429 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:11,429 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:11,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:11,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1172255968, now seen corresponding path program 1 times [2019-10-14 23:50:11,430 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:11,430 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806714924] [2019-10-14 23:50:11,430 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:11,430 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:11,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:11,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:11,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:11,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:11,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:11,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:11,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:11,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:11,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:11,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:50:11,630 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806714924] [2019-10-14 23:50:11,631 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:11,631 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-14 23:50:11,631 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243039550] [2019-10-14 23:50:11,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-14 23:50:11,632 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:11,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-14 23:50:11,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-14 23:50:11,632 INFO L87 Difference]: Start difference. First operand 643 states and 815 transitions. Second operand 9 states. [2019-10-14 23:50:12,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:12,561 INFO L93 Difference]: Finished difference Result 1352 states and 1804 transitions. [2019-10-14 23:50:12,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-14 23:50:12,561 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-10-14 23:50:12,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:12,567 INFO L225 Difference]: With dead ends: 1352 [2019-10-14 23:50:12,567 INFO L226 Difference]: Without dead ends: 764 [2019-10-14 23:50:12,571 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-10-14 23:50:12,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2019-10-14 23:50:12,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 669. [2019-10-14 23:50:12,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 669 states. [2019-10-14 23:50:12,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 834 transitions. [2019-10-14 23:50:12,638 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 834 transitions. Word has length 66 [2019-10-14 23:50:12,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:12,639 INFO L462 AbstractCegarLoop]: Abstraction has 669 states and 834 transitions. [2019-10-14 23:50:12,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-14 23:50:12,639 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 834 transitions. [2019-10-14 23:50:12,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-14 23:50:12,645 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:12,645 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:12,646 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:12,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:12,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1347703966, now seen corresponding path program 1 times [2019-10-14 23:50:12,646 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:12,646 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445465228] [2019-10-14 23:50:12,647 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:12,647 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:12,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:12,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:12,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:12,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:12,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:12,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:12,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:12,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:12,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:12,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:50:12,869 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445465228] [2019-10-14 23:50:12,869 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:12,870 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-14 23:50:12,871 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836553548] [2019-10-14 23:50:12,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-14 23:50:12,872 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:12,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-14 23:50:12,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-14 23:50:12,874 INFO L87 Difference]: Start difference. First operand 669 states and 834 transitions. Second operand 7 states. [2019-10-14 23:50:13,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:13,731 INFO L93 Difference]: Finished difference Result 857 states and 1123 transitions. [2019-10-14 23:50:13,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-14 23:50:13,732 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-10-14 23:50:13,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:13,738 INFO L225 Difference]: With dead ends: 857 [2019-10-14 23:50:13,738 INFO L226 Difference]: Without dead ends: 854 [2019-10-14 23:50:13,739 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2019-10-14 23:50:13,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2019-10-14 23:50:13,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 745. [2019-10-14 23:50:13,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 745 states. [2019-10-14 23:50:13,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 951 transitions. [2019-10-14 23:50:13,812 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 951 transitions. Word has length 66 [2019-10-14 23:50:13,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:13,812 INFO L462 AbstractCegarLoop]: Abstraction has 745 states and 951 transitions. [2019-10-14 23:50:13,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-14 23:50:13,813 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 951 transitions. [2019-10-14 23:50:13,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-14 23:50:13,814 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:13,814 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:13,814 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:13,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:13,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1170545691, now seen corresponding path program 1 times [2019-10-14 23:50:13,815 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:13,815 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307339726] [2019-10-14 23:50:13,815 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:13,816 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:13,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:13,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:13,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:13,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:13,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:13,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:13,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:13,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:13,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:13,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:50:13,936 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307339726] [2019-10-14 23:50:13,936 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:13,936 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 23:50:13,937 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34721050] [2019-10-14 23:50:13,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:50:13,937 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:13,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:50:13,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:50:13,938 INFO L87 Difference]: Start difference. First operand 745 states and 951 transitions. Second operand 6 states. [2019-10-14 23:50:14,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:14,643 INFO L93 Difference]: Finished difference Result 1413 states and 1890 transitions. [2019-10-14 23:50:14,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-14 23:50:14,644 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-10-14 23:50:14,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:14,650 INFO L225 Difference]: With dead ends: 1413 [2019-10-14 23:50:14,650 INFO L226 Difference]: Without dead ends: 889 [2019-10-14 23:50:14,653 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-14 23:50:14,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 889 states. [2019-10-14 23:50:14,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 889 to 707. [2019-10-14 23:50:14,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 707 states. [2019-10-14 23:50:14,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 894 transitions. [2019-10-14 23:50:14,723 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 894 transitions. Word has length 67 [2019-10-14 23:50:14,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:14,724 INFO L462 AbstractCegarLoop]: Abstraction has 707 states and 894 transitions. [2019-10-14 23:50:14,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:50:14,724 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 894 transitions. [2019-10-14 23:50:14,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-10-14 23:50:14,726 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:14,726 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-14 23:50:14,727 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:14,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:14,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1338277302, now seen corresponding path program 1 times [2019-10-14 23:50:14,727 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:14,728 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132206825] [2019-10-14 23:50:14,728 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:14,728 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:14,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:14,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:14,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:14,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:14,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:14,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:14,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:14,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:14,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:14,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:14,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:14,931 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-14 23:50:14,931 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132206825] [2019-10-14 23:50:14,932 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1352210974] [2019-10-14 23:50:14,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:50:15,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:15,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-14 23:50:15,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:50:15,187 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:50:15,187 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-14 23:50:15,188 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 10 [2019-10-14 23:50:15,188 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395376729] [2019-10-14 23:50:15,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:50:15,189 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:15,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:50:15,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:50:15,190 INFO L87 Difference]: Start difference. First operand 707 states and 894 transitions. Second operand 3 states. [2019-10-14 23:50:15,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:15,437 INFO L93 Difference]: Finished difference Result 1672 states and 2205 transitions. [2019-10-14 23:50:15,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:50:15,438 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2019-10-14 23:50:15,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:15,446 INFO L225 Difference]: With dead ends: 1672 [2019-10-14 23:50:15,446 INFO L226 Difference]: Without dead ends: 811 [2019-10-14 23:50:15,452 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:50:15,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2019-10-14 23:50:15,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 811. [2019-10-14 23:50:15,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 811 states. [2019-10-14 23:50:15,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1031 transitions. [2019-10-14 23:50:15,586 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1031 transitions. Word has length 87 [2019-10-14 23:50:15,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:15,586 INFO L462 AbstractCegarLoop]: Abstraction has 811 states and 1031 transitions. [2019-10-14 23:50:15,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:50:15,586 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1031 transitions. [2019-10-14 23:50:15,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-14 23:50:15,589 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:15,589 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:15,802 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:50:15,803 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:15,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:15,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1396688396, now seen corresponding path program 1 times [2019-10-14 23:50:15,804 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:15,804 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837337391] [2019-10-14 23:50:15,804 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:15,805 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:15,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:15,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:15,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:15,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:15,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:15,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:16,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:16,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:16,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:16,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:16,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:16,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:16,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:16,070 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-14 23:50:16,071 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837337391] [2019-10-14 23:50:16,071 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1298909669] [2019-10-14 23:50:16,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:50:16,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:16,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 33 conjunts are in the unsatisfiable core [2019-10-14 23:50:16,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:50:16,328 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:50:16,329 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:50:16,329 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2019-10-14 23:50:16,329 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892757565] [2019-10-14 23:50:16,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-14 23:50:16,330 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:16,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-14 23:50:16,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2019-10-14 23:50:16,331 INFO L87 Difference]: Start difference. First operand 811 states and 1031 transitions. Second operand 16 states. [2019-10-14 23:50:20,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:20,799 INFO L93 Difference]: Finished difference Result 2540 states and 3915 transitions. [2019-10-14 23:50:20,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-10-14 23:50:20,799 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 99 [2019-10-14 23:50:20,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:20,818 INFO L225 Difference]: With dead ends: 2540 [2019-10-14 23:50:20,818 INFO L226 Difference]: Without dead ends: 2537 [2019-10-14 23:50:20,821 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 126 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=306, Invalid=1674, Unknown=0, NotChecked=0, Total=1980 [2019-10-14 23:50:20,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2537 states. [2019-10-14 23:50:21,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2537 to 2338. [2019-10-14 23:50:21,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2338 states. [2019-10-14 23:50:21,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2338 states to 2338 states and 3577 transitions. [2019-10-14 23:50:21,146 INFO L78 Accepts]: Start accepts. Automaton has 2338 states and 3577 transitions. Word has length 99 [2019-10-14 23:50:21,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:21,147 INFO L462 AbstractCegarLoop]: Abstraction has 2338 states and 3577 transitions. [2019-10-14 23:50:21,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-14 23:50:21,147 INFO L276 IsEmpty]: Start isEmpty. Operand 2338 states and 3577 transitions. [2019-10-14 23:50:21,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-10-14 23:50:21,156 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:21,156 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:21,369 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:50:21,369 INFO L410 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:21,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:21,370 INFO L82 PathProgramCache]: Analyzing trace with hash 83738947, now seen corresponding path program 2 times [2019-10-14 23:50:21,370 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:21,370 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740426830] [2019-10-14 23:50:21,371 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:21,371 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:21,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:21,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:21,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:21,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:21,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:21,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:21,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:21,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:21,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:21,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:21,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:21,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:21,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:21,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:21,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:21,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:21,569 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-10-14 23:50:21,570 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740426830] [2019-10-14 23:50:21,570 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:21,570 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-14 23:50:21,570 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474166917] [2019-10-14 23:50:21,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-14 23:50:21,571 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:21,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-14 23:50:21,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-14 23:50:21,572 INFO L87 Difference]: Start difference. First operand 2338 states and 3577 transitions. Second operand 7 states. [2019-10-14 23:50:22,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:22,429 INFO L93 Difference]: Finished difference Result 3773 states and 6055 transitions. [2019-10-14 23:50:22,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-14 23:50:22,430 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 125 [2019-10-14 23:50:22,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:22,445 INFO L225 Difference]: With dead ends: 3773 [2019-10-14 23:50:22,445 INFO L226 Difference]: Without dead ends: 2107 [2019-10-14 23:50:22,459 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:50:22,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2107 states. [2019-10-14 23:50:22,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2107 to 2006. [2019-10-14 23:50:22,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2006 states. [2019-10-14 23:50:22,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2006 states to 2006 states and 2998 transitions. [2019-10-14 23:50:22,687 INFO L78 Accepts]: Start accepts. Automaton has 2006 states and 2998 transitions. Word has length 125 [2019-10-14 23:50:22,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:22,688 INFO L462 AbstractCegarLoop]: Abstraction has 2006 states and 2998 transitions. [2019-10-14 23:50:22,688 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-14 23:50:22,688 INFO L276 IsEmpty]: Start isEmpty. Operand 2006 states and 2998 transitions. [2019-10-14 23:50:22,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-14 23:50:22,694 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:22,694 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:22,694 INFO L410 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:22,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:22,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1218823465, now seen corresponding path program 1 times [2019-10-14 23:50:22,695 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:22,695 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495618257] [2019-10-14 23:50:22,695 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:22,696 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:22,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:22,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:22,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:22,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:22,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:22,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:22,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:22,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:22,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:22,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:22,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:22,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:22,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:22,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:22,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:22,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:22,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:22,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:22,930 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-10-14 23:50:22,930 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495618257] [2019-10-14 23:50:22,931 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [388381364] [2019-10-14 23:50:22,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:50:23,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:23,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 739 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-14 23:50:23,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:50:23,081 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-14 23:50:23,082 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-14 23:50:23,082 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 11 [2019-10-14 23:50:23,083 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393904719] [2019-10-14 23:50:23,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:50:23,084 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:23,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:50:23,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-10-14 23:50:23,085 INFO L87 Difference]: Start difference. First operand 2006 states and 2998 transitions. Second operand 3 states. [2019-10-14 23:50:23,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:23,180 INFO L93 Difference]: Finished difference Result 2401 states and 3609 transitions. [2019-10-14 23:50:23,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:50:23,180 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 142 [2019-10-14 23:50:23,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:23,182 INFO L225 Difference]: With dead ends: 2401 [2019-10-14 23:50:23,182 INFO L226 Difference]: Without dead ends: 0 [2019-10-14 23:50:23,195 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 169 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-10-14 23:50:23,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-14 23:50:23,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-14 23:50:23,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-14 23:50:23,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-14 23:50:23,196 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 142 [2019-10-14 23:50:23,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:23,197 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-14 23:50:23,197 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:50:23,197 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-14 23:50:23,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-14 23:50:23,401 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:50:23,408 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-14 23:50:23,955 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 101