/usr/bin/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/transmitter.02.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 22:24:45,715 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 22:24:45,718 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 22:24:45,734 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 22:24:45,734 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 22:24:45,735 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 22:24:45,737 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 22:24:45,739 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 22:24:45,750 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 22:24:45,751 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 22:24:45,752 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 22:24:45,754 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 22:24:45,755 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 22:24:45,755 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 22:24:45,758 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 22:24:45,760 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 22:24:45,761 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 22:24:45,761 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 22:24:45,763 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 22:24:45,765 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 22:24:45,767 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 22:24:45,768 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 22:24:45,769 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 22:24:45,769 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 22:24:45,772 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 22:24:45,772 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 22:24:45,772 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 22:24:45,773 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 22:24:45,773 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 22:24:45,774 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 22:24:45,775 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 22:24:45,775 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 22:24:45,776 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 22:24:45,777 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 22:24:45,778 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 22:24:45,778 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 22:24:45,779 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 22:24:45,779 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 22:24:45,779 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 22:24:45,780 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 22:24:45,781 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 22:24:45,782 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-11-06 22:24:45,807 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 22:24:45,807 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 22:24:45,809 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 22:24:45,810 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 22:24:45,810 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 22:24:45,810 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 22:24:45,810 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 22:24:45,811 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 22:24:45,811 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 22:24:45,811 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 22:24:45,812 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 22:24:45,812 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 22:24:45,813 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 22:24:45,813 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 22:24:45,813 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 22:24:45,813 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 22:24:45,814 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 22:24:45,814 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 22:24:45,814 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 22:24:45,814 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 22:24:45,815 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 22:24:45,815 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 22:24:45,815 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 22:24:45,815 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 22:24:45,815 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 22:24:45,815 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 22:24:45,816 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 22:24:45,816 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 22:24:45,816 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-06 22:24:46,090 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 22:24:46,109 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 22:24:46,112 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 22:24:46,114 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 22:24:46,114 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 22:24:46,115 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/transmitter.02.cil.c [2019-11-06 22:24:46,191 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ceee808ce/e0a576ceac07446893687a9eccc45da6/FLAG7cf13fcc6 [2019-11-06 22:24:46,740 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 22:24:46,741 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/transmitter.02.cil.c [2019-11-06 22:24:46,751 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ceee808ce/e0a576ceac07446893687a9eccc45da6/FLAG7cf13fcc6 [2019-11-06 22:24:47,108 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ceee808ce/e0a576ceac07446893687a9eccc45da6 [2019-11-06 22:24:47,118 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 22:24:47,121 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 22:24:47,122 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 22:24:47,122 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 22:24:47,127 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 22:24:47,128 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:24:47" (1/1) ... [2019-11-06 22:24:47,131 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60924fff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:47, skipping insertion in model container [2019-11-06 22:24:47,131 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:24:47" (1/1) ... [2019-11-06 22:24:47,140 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 22:24:47,183 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 22:24:47,408 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:24:47,416 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 22:24:47,552 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:24:47,574 INFO L192 MainTranslator]: Completed translation [2019-11-06 22:24:47,575 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:47 WrapperNode [2019-11-06 22:24:47,575 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 22:24:47,576 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 22:24:47,576 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 22:24:47,576 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 22:24:47,587 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:47" (1/1) ... [2019-11-06 22:24:47,587 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:47" (1/1) ... [2019-11-06 22:24:47,595 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:47" (1/1) ... [2019-11-06 22:24:47,595 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:47" (1/1) ... [2019-11-06 22:24:47,604 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:47" (1/1) ... [2019-11-06 22:24:47,616 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:47" (1/1) ... [2019-11-06 22:24:47,619 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:47" (1/1) ... [2019-11-06 22:24:47,623 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 22:24:47,623 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 22:24:47,624 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 22:24:47,624 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 22:24:47,625 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:47" (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-11-06 22:24:47,677 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 22:24:47,678 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 22:24:47,678 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-11-06 22:24:47,678 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2019-11-06 22:24:47,678 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2019-11-06 22:24:47,678 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2019-11-06 22:24:47,678 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2019-11-06 22:24:47,679 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2019-11-06 22:24:47,679 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2019-11-06 22:24:47,679 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-11-06 22:24:47,679 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-11-06 22:24:47,679 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-11-06 22:24:47,680 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-11-06 22:24:47,680 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-11-06 22:24:47,680 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-11-06 22:24:47,680 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-11-06 22:24:47,680 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-11-06 22:24:47,680 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-11-06 22:24:47,681 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-11-06 22:24:47,681 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-11-06 22:24:47,681 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-11-06 22:24:47,681 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-11-06 22:24:47,681 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 22:24:47,681 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 22:24:47,682 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-06 22:24:47,682 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-11-06 22:24:47,682 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2019-11-06 22:24:47,682 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2019-11-06 22:24:47,682 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2019-11-06 22:24:47,682 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-11-06 22:24:47,683 INFO L130 BoogieDeclarations]: Found specification of procedure master [2019-11-06 22:24:47,683 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2019-11-06 22:24:47,683 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2019-11-06 22:24:47,683 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-11-06 22:24:47,683 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-11-06 22:24:47,683 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-11-06 22:24:47,683 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-11-06 22:24:47,684 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-11-06 22:24:47,684 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-11-06 22:24:47,684 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-11-06 22:24:47,684 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-11-06 22:24:47,684 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-11-06 22:24:47,684 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-11-06 22:24:47,685 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-11-06 22:24:47,685 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-11-06 22:24:47,685 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 22:24:47,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 22:24:47,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 22:24:48,225 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 22:24:48,226 INFO L284 CfgBuilder]: Removed 6 assume(true) statements. [2019-11-06 22:24:48,227 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:24:48 BoogieIcfgContainer [2019-11-06 22:24:48,227 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 22:24:48,229 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 22:24:48,229 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 22:24:48,232 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 22:24:48,232 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:24:47" (1/3) ... [2019-11-06 22:24:48,233 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44fb9aad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:24:48, skipping insertion in model container [2019-11-06 22:24:48,233 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:47" (2/3) ... [2019-11-06 22:24:48,234 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44fb9aad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:24:48, skipping insertion in model container [2019-11-06 22:24:48,234 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:24:48" (3/3) ... [2019-11-06 22:24:48,236 INFO L109 eAbstractionObserver]: Analyzing ICFG transmitter.02.cil.c [2019-11-06 22:24:48,246 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 22:24:48,254 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-06 22:24:48,266 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-06 22:24:48,291 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 22:24:48,291 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 22:24:48,291 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 22:24:48,291 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 22:24:48,292 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 22:24:48,292 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 22:24:48,292 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 22:24:48,292 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 22:24:48,316 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states. [2019-11-06 22:24:48,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-06 22:24:48,328 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:24:48,329 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:24:48,331 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:24:48,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:24:48,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1996614335, now seen corresponding path program 1 times [2019-11-06 22:24:48,348 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:24:48,348 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529688070] [2019-11-06 22:24:48,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:24:48,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:48,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:48,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:48,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:48,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:48,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:48,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:48,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:48,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:48,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:48,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:48,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:48,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:24:48,881 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529688070] [2019-11-06 22:24:48,881 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:24:48,892 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-06 22:24:48,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738801429] [2019-11-06 22:24:48,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-06 22:24:48,904 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:24:48,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-06 22:24:48,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-06 22:24:48,921 INFO L87 Difference]: Start difference. First operand 169 states. Second operand 8 states. [2019-11-06 22:24:50,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:24:50,573 INFO L93 Difference]: Finished difference Result 412 states and 626 transitions. [2019-11-06 22:24:50,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-06 22:24:50,575 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 90 [2019-11-06 22:24:50,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:24:50,592 INFO L225 Difference]: With dead ends: 412 [2019-11-06 22:24:50,593 INFO L226 Difference]: Without dead ends: 247 [2019-11-06 22:24:50,602 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2019-11-06 22:24:50,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-11-06 22:24:50,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 160. [2019-11-06 22:24:50,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-11-06 22:24:50,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 212 transitions. [2019-11-06 22:24:50,678 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 212 transitions. Word has length 90 [2019-11-06 22:24:50,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:24:50,679 INFO L462 AbstractCegarLoop]: Abstraction has 160 states and 212 transitions. [2019-11-06 22:24:50,679 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-06 22:24:50,679 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 212 transitions. [2019-11-06 22:24:50,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-06 22:24:50,683 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:24:50,684 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:24:50,684 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:24:50,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:24:50,685 INFO L82 PathProgramCache]: Analyzing trace with hash -387310403, now seen corresponding path program 1 times [2019-11-06 22:24:50,685 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:24:50,685 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58927756] [2019-11-06 22:24:50,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:24:50,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:50,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:50,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:50,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:50,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:50,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:50,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:50,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:50,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:50,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:50,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:50,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:50,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:24:50,986 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58927756] [2019-11-06 22:24:50,993 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:24:50,993 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-06 22:24:50,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208940927] [2019-11-06 22:24:50,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-06 22:24:50,996 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:24:50,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-06 22:24:50,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-06 22:24:50,996 INFO L87 Difference]: Start difference. First operand 160 states and 212 transitions. Second operand 9 states. [2019-11-06 22:24:53,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:24:53,083 INFO L93 Difference]: Finished difference Result 579 states and 839 transitions. [2019-11-06 22:24:53,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-06 22:24:53,083 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 90 [2019-11-06 22:24:53,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:24:53,093 INFO L225 Difference]: With dead ends: 579 [2019-11-06 22:24:53,093 INFO L226 Difference]: Without dead ends: 439 [2019-11-06 22:24:53,095 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2019-11-06 22:24:53,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2019-11-06 22:24:53,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 294. [2019-11-06 22:24:53,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-11-06 22:24:53,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 393 transitions. [2019-11-06 22:24:53,171 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 393 transitions. Word has length 90 [2019-11-06 22:24:53,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:24:53,172 INFO L462 AbstractCegarLoop]: Abstraction has 294 states and 393 transitions. [2019-11-06 22:24:53,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-06 22:24:53,172 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 393 transitions. [2019-11-06 22:24:53,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-06 22:24:53,182 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:24:53,182 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:24:53,183 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:24:53,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:24:53,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1952833149, now seen corresponding path program 1 times [2019-11-06 22:24:53,185 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:24:53,185 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317278909] [2019-11-06 22:24:53,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:24:53,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:53,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:53,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:53,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:53,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:53,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:53,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:53,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:53,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:53,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:53,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:53,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:53,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:24:53,520 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317278909] [2019-11-06 22:24:53,521 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:24:53,521 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-06 22:24:53,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96541111] [2019-11-06 22:24:53,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-06 22:24:53,524 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:24:53,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-06 22:24:53,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-06 22:24:53,525 INFO L87 Difference]: Start difference. First operand 294 states and 393 transitions. Second operand 10 states. [2019-11-06 22:24:54,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:24:54,694 INFO L93 Difference]: Finished difference Result 704 states and 993 transitions. [2019-11-06 22:24:54,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-06 22:24:54,695 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 90 [2019-11-06 22:24:54,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:24:54,699 INFO L225 Difference]: With dead ends: 704 [2019-11-06 22:24:54,700 INFO L226 Difference]: Without dead ends: 430 [2019-11-06 22:24:54,701 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2019-11-06 22:24:54,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2019-11-06 22:24:54,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 294. [2019-11-06 22:24:54,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-11-06 22:24:54,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 386 transitions. [2019-11-06 22:24:54,763 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 386 transitions. Word has length 90 [2019-11-06 22:24:54,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:24:54,765 INFO L462 AbstractCegarLoop]: Abstraction has 294 states and 386 transitions. [2019-11-06 22:24:54,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-06 22:24:54,765 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 386 transitions. [2019-11-06 22:24:54,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-06 22:24:54,770 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:24:54,770 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:24:54,770 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:24:54,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:24:54,770 INFO L82 PathProgramCache]: Analyzing trace with hash 227206333, now seen corresponding path program 1 times [2019-11-06 22:24:54,771 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:24:54,771 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844296617] [2019-11-06 22:24:54,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:24:54,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:54,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:54,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:54,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:54,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:54,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:54,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:54,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:54,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:54,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:54,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:54,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:54,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:24:54,943 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844296617] [2019-11-06 22:24:54,943 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:24:54,943 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-06 22:24:54,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140227929] [2019-11-06 22:24:54,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-06 22:24:54,944 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:24:54,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-06 22:24:54,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-06 22:24:54,945 INFO L87 Difference]: Start difference. First operand 294 states and 386 transitions. Second operand 10 states. [2019-11-06 22:24:56,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:24:56,242 INFO L93 Difference]: Finished difference Result 700 states and 971 transitions. [2019-11-06 22:24:56,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-06 22:24:56,243 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 90 [2019-11-06 22:24:56,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:24:56,246 INFO L225 Difference]: With dead ends: 700 [2019-11-06 22:24:56,247 INFO L226 Difference]: Without dead ends: 426 [2019-11-06 22:24:56,248 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2019-11-06 22:24:56,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2019-11-06 22:24:56,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 294. [2019-11-06 22:24:56,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-11-06 22:24:56,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 379 transitions. [2019-11-06 22:24:56,282 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 379 transitions. Word has length 90 [2019-11-06 22:24:56,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:24:56,283 INFO L462 AbstractCegarLoop]: Abstraction has 294 states and 379 transitions. [2019-11-06 22:24:56,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-06 22:24:56,283 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 379 transitions. [2019-11-06 22:24:56,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-06 22:24:56,284 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:24:56,285 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:24:56,285 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:24:56,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:24:56,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1418466941, now seen corresponding path program 1 times [2019-11-06 22:24:56,286 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:24:56,286 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772055062] [2019-11-06 22:24:56,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:24:56,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:56,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:56,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:56,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:56,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:56,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:56,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:56,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:56,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:56,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:56,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:56,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:56,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:24:56,468 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772055062] [2019-11-06 22:24:56,469 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:24:56,469 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-06 22:24:56,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591428986] [2019-11-06 22:24:56,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-06 22:24:56,471 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:24:56,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-06 22:24:56,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-06 22:24:56,472 INFO L87 Difference]: Start difference. First operand 294 states and 379 transitions. Second operand 10 states. [2019-11-06 22:24:58,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:24:58,249 INFO L93 Difference]: Finished difference Result 855 states and 1230 transitions. [2019-11-06 22:24:58,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-06 22:24:58,250 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 90 [2019-11-06 22:24:58,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:24:58,256 INFO L225 Difference]: With dead ends: 855 [2019-11-06 22:24:58,257 INFO L226 Difference]: Without dead ends: 581 [2019-11-06 22:24:58,258 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=297, Unknown=0, NotChecked=0, Total=420 [2019-11-06 22:24:58,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2019-11-06 22:24:58,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 366. [2019-11-06 22:24:58,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2019-11-06 22:24:58,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 457 transitions. [2019-11-06 22:24:58,305 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 457 transitions. Word has length 90 [2019-11-06 22:24:58,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:24:58,305 INFO L462 AbstractCegarLoop]: Abstraction has 366 states and 457 transitions. [2019-11-06 22:24:58,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-06 22:24:58,306 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 457 transitions. [2019-11-06 22:24:58,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-06 22:24:58,307 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:24:58,307 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:24:58,307 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:24:58,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:24:58,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1504622653, now seen corresponding path program 1 times [2019-11-06 22:24:58,308 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:24:58,308 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152792900] [2019-11-06 22:24:58,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:24:58,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:58,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:58,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:58,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:58,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:58,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:58,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:58,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:58,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:58,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:58,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:58,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:58,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:24:58,490 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152792900] [2019-11-06 22:24:58,491 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:24:58,491 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-06 22:24:58,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856359315] [2019-11-06 22:24:58,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-06 22:24:58,493 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:24:58,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-06 22:24:58,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-11-06 22:24:58,493 INFO L87 Difference]: Start difference. First operand 366 states and 457 transitions. Second operand 10 states. [2019-11-06 22:25:00,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:25:00,214 INFO L93 Difference]: Finished difference Result 877 states and 1164 transitions. [2019-11-06 22:25:00,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-06 22:25:00,214 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 90 [2019-11-06 22:25:00,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:25:00,219 INFO L225 Difference]: With dead ends: 877 [2019-11-06 22:25:00,220 INFO L226 Difference]: Without dead ends: 532 [2019-11-06 22:25:00,222 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2019-11-06 22:25:00,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2019-11-06 22:25:00,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 376. [2019-11-06 22:25:00,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2019-11-06 22:25:00,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 465 transitions. [2019-11-06 22:25:00,265 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 465 transitions. Word has length 90 [2019-11-06 22:25:00,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:25:00,266 INFO L462 AbstractCegarLoop]: Abstraction has 376 states and 465 transitions. [2019-11-06 22:25:00,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-06 22:25:00,266 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 465 transitions. [2019-11-06 22:25:00,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-06 22:25:00,267 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:25:00,268 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:25:00,268 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:25:00,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:25:00,268 INFO L82 PathProgramCache]: Analyzing trace with hash -523963457, now seen corresponding path program 1 times [2019-11-06 22:25:00,269 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:25:00,269 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166565746] [2019-11-06 22:25:00,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:25:00,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:00,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:00,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:00,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:00,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:00,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:00,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:00,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:00,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:00,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:00,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:00,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:00,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:25:00,476 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166565746] [2019-11-06 22:25:00,476 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:25:00,477 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-06 22:25:00,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623532807] [2019-11-06 22:25:00,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-06 22:25:00,477 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:25:00,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-06 22:25:00,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-11-06 22:25:00,478 INFO L87 Difference]: Start difference. First operand 376 states and 465 transitions. Second operand 10 states. [2019-11-06 22:25:02,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:25:02,298 INFO L93 Difference]: Finished difference Result 915 states and 1208 transitions. [2019-11-06 22:25:02,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-06 22:25:02,299 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 90 [2019-11-06 22:25:02,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:25:02,309 INFO L225 Difference]: With dead ends: 915 [2019-11-06 22:25:02,309 INFO L226 Difference]: Without dead ends: 560 [2019-11-06 22:25:02,311 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2019-11-06 22:25:02,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2019-11-06 22:25:02,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 396. [2019-11-06 22:25:02,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2019-11-06 22:25:02,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 485 transitions. [2019-11-06 22:25:02,356 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 485 transitions. Word has length 90 [2019-11-06 22:25:02,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:25:02,357 INFO L462 AbstractCegarLoop]: Abstraction has 396 states and 485 transitions. [2019-11-06 22:25:02,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-06 22:25:02,357 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 485 transitions. [2019-11-06 22:25:02,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-06 22:25:02,358 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:25:02,359 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:25:02,359 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:25:02,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:25:02,359 INFO L82 PathProgramCache]: Analyzing trace with hash -275816963, now seen corresponding path program 1 times [2019-11-06 22:25:02,359 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:25:02,360 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204529797] [2019-11-06 22:25:02,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:25:02,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:02,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:02,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:02,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:02,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:02,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:02,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:02,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:02,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:02,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:02,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:02,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25: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-11-06 22:25:02,589 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204529797] [2019-11-06 22:25:02,589 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:25:02,589 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-06 22:25:02,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915427096] [2019-11-06 22:25:02,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-06 22:25:02,590 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:25:02,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-06 22:25:02,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-11-06 22:25:02,591 INFO L87 Difference]: Start difference. First operand 396 states and 485 transitions. Second operand 10 states. [2019-11-06 22:25:04,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:25:04,323 INFO L93 Difference]: Finished difference Result 939 states and 1222 transitions. [2019-11-06 22:25:04,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-06 22:25:04,324 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 90 [2019-11-06 22:25:04,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:25:04,328 INFO L225 Difference]: With dead ends: 939 [2019-11-06 22:25:04,329 INFO L226 Difference]: Without dead ends: 564 [2019-11-06 22:25:04,330 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2019-11-06 22:25:04,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2019-11-06 22:25:04,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 406. [2019-11-06 22:25:04,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2019-11-06 22:25:04,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 493 transitions. [2019-11-06 22:25:04,370 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 493 transitions. Word has length 90 [2019-11-06 22:25:04,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:25:04,370 INFO L462 AbstractCegarLoop]: Abstraction has 406 states and 493 transitions. [2019-11-06 22:25:04,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-06 22:25:04,370 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 493 transitions. [2019-11-06 22:25:04,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-06 22:25:04,372 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:25:04,372 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:25:04,372 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:25:04,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:25:04,373 INFO L82 PathProgramCache]: Analyzing trace with hash -348203521, now seen corresponding path program 1 times [2019-11-06 22:25:04,373 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:25:04,373 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969002795] [2019-11-06 22:25:04,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:25:04,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:04,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:04,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:04,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:04,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:04,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:04,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:04,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:04,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:04,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:04,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:04,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:04,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:25:04,532 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969002795] [2019-11-06 22:25:04,533 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:25:04,533 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-06 22:25:04,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077998846] [2019-11-06 22:25:04,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-06 22:25:04,534 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:25:04,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-06 22:25:04,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-06 22:25:04,535 INFO L87 Difference]: Start difference. First operand 406 states and 493 transitions. Second operand 10 states. [2019-11-06 22:25:06,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:25:06,362 INFO L93 Difference]: Finished difference Result 1144 states and 1493 transitions. [2019-11-06 22:25:06,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-06 22:25:06,363 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 90 [2019-11-06 22:25:06,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:25:06,368 INFO L225 Difference]: With dead ends: 1144 [2019-11-06 22:25:06,369 INFO L226 Difference]: Without dead ends: 758 [2019-11-06 22:25:06,371 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=161, Invalid=439, Unknown=0, NotChecked=0, Total=600 [2019-11-06 22:25:06,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2019-11-06 22:25:06,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 467. [2019-11-06 22:25:06,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 467 states. [2019-11-06 22:25:06,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 547 transitions. [2019-11-06 22:25:06,414 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 547 transitions. Word has length 90 [2019-11-06 22:25:06,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:25:06,415 INFO L462 AbstractCegarLoop]: Abstraction has 467 states and 547 transitions. [2019-11-06 22:25:06,415 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-06 22:25:06,415 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 547 transitions. [2019-11-06 22:25:06,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-06 22:25:06,416 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:25:06,416 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:25:06,417 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:25:06,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:25:06,417 INFO L82 PathProgramCache]: Analyzing trace with hash -286163907, now seen corresponding path program 1 times [2019-11-06 22:25:06,417 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:25:06,418 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492933720] [2019-11-06 22:25:06,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:25:06,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:06,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:06,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:06,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:06,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:06,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:06,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:06,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:06,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:06,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:06,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:06,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:06,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:25:06,524 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492933720] [2019-11-06 22:25:06,524 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:25:06,524 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-06 22:25:06,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048073188] [2019-11-06 22:25:06,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-06 22:25:06,525 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:25:06,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-06 22:25:06,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-06 22:25:06,526 INFO L87 Difference]: Start difference. First operand 467 states and 547 transitions. Second operand 7 states. [2019-11-06 22:25:08,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:25:08,088 INFO L93 Difference]: Finished difference Result 1503 states and 1877 transitions. [2019-11-06 22:25:08,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-06 22:25:08,089 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 90 [2019-11-06 22:25:08,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:25:08,096 INFO L225 Difference]: With dead ends: 1503 [2019-11-06 22:25:08,096 INFO L226 Difference]: Without dead ends: 1058 [2019-11-06 22:25:08,099 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2019-11-06 22:25:08,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1058 states. [2019-11-06 22:25:08,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1058 to 847. [2019-11-06 22:25:08,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 847 states. [2019-11-06 22:25:08,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1018 transitions. [2019-11-06 22:25:08,177 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1018 transitions. Word has length 90 [2019-11-06 22:25:08,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:25:08,177 INFO L462 AbstractCegarLoop]: Abstraction has 847 states and 1018 transitions. [2019-11-06 22:25:08,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-06 22:25:08,177 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1018 transitions. [2019-11-06 22:25:08,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-06 22:25:08,179 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:25:08,179 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:25:08,180 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:25:08,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:25:08,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1417763379, now seen corresponding path program 1 times [2019-11-06 22:25:08,180 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:25:08,181 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518249236] [2019-11-06 22:25:08,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:25:08,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:08,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:08,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:08,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:08,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:08,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:08,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:08,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:08,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:08,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:08,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:08,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:08,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:25:08,344 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518249236] [2019-11-06 22:25:08,344 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:25:08,344 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-06 22:25:08,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530491628] [2019-11-06 22:25:08,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-06 22:25:08,345 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:25:08,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-06 22:25:08,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-06 22:25:08,346 INFO L87 Difference]: Start difference. First operand 847 states and 1018 transitions. Second operand 7 states. [2019-11-06 22:25:09,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:25:09,937 INFO L93 Difference]: Finished difference Result 2813 states and 3701 transitions. [2019-11-06 22:25:09,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-06 22:25:09,938 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2019-11-06 22:25:09,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:25:09,949 INFO L225 Difference]: With dead ends: 2813 [2019-11-06 22:25:09,950 INFO L226 Difference]: Without dead ends: 1993 [2019-11-06 22:25:09,954 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2019-11-06 22:25:09,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1993 states. [2019-11-06 22:25:10,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1993 to 1710. [2019-11-06 22:25:10,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1710 states. [2019-11-06 22:25:10,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1710 states to 1710 states and 2141 transitions. [2019-11-06 22:25:10,117 INFO L78 Accepts]: Start accepts. Automaton has 1710 states and 2141 transitions. Word has length 91 [2019-11-06 22:25:10,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:25:10,118 INFO L462 AbstractCegarLoop]: Abstraction has 1710 states and 2141 transitions. [2019-11-06 22:25:10,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-06 22:25:10,118 INFO L276 IsEmpty]: Start isEmpty. Operand 1710 states and 2141 transitions. [2019-11-06 22:25:10,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-06 22:25:10,122 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:25:10,122 INFO L410 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, 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-11-06 22:25:10,122 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:25:10,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:25:10,123 INFO L82 PathProgramCache]: Analyzing trace with hash 36587625, now seen corresponding path program 1 times [2019-11-06 22:25:10,123 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:25:10,123 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223429323] [2019-11-06 22:25:10,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:25:10,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:10,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:10,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:10,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:10,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:10,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:10,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:10,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:10,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:10,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:10,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:10,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:10,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:10,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:10,302 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-06 22:25:10,302 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223429323] [2019-11-06 22:25:10,302 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:25:10,303 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-06 22:25:10,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832521723] [2019-11-06 22:25:10,304 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-06 22:25:10,304 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:25:10,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-06 22:25:10,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-06 22:25:10,305 INFO L87 Difference]: Start difference. First operand 1710 states and 2141 transitions. Second operand 8 states. [2019-11-06 22:25:12,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:25:12,556 INFO L93 Difference]: Finished difference Result 5783 states and 7853 transitions. [2019-11-06 22:25:12,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-06 22:25:12,556 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 111 [2019-11-06 22:25:12,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:25:12,599 INFO L225 Difference]: With dead ends: 5783 [2019-11-06 22:25:12,599 INFO L226 Difference]: Without dead ends: 3127 [2019-11-06 22:25:12,610 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=236, Unknown=0, NotChecked=0, Total=342 [2019-11-06 22:25:12,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3127 states. [2019-11-06 22:25:12,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3127 to 2795. [2019-11-06 22:25:12,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2795 states. [2019-11-06 22:25:12,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2795 states to 2795 states and 3657 transitions. [2019-11-06 22:25:12,958 INFO L78 Accepts]: Start accepts. Automaton has 2795 states and 3657 transitions. Word has length 111 [2019-11-06 22:25:12,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:25:12,958 INFO L462 AbstractCegarLoop]: Abstraction has 2795 states and 3657 transitions. [2019-11-06 22:25:12,959 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-06 22:25:12,959 INFO L276 IsEmpty]: Start isEmpty. Operand 2795 states and 3657 transitions. [2019-11-06 22:25:12,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-11-06 22:25:12,967 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:25:12,967 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:25:12,968 INFO L410 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:25:12,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:25:12,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1328978533, now seen corresponding path program 1 times [2019-11-06 22:25:12,968 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:25:12,969 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290470423] [2019-11-06 22:25:12,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:25:12,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:13,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:13,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:13,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:13,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:13,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:13,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:13,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:13,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:13,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:13,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:13,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:13,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:13,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:13,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:13,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:13,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:13,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:13,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:13,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:13,159 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-11-06 22:25:13,159 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290470423] [2019-11-06 22:25:13,159 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:25:13,160 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-06 22:25:13,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090598429] [2019-11-06 22:25:13,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-06 22:25:13,161 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:25:13,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-06 22:25:13,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-06 22:25:13,162 INFO L87 Difference]: Start difference. First operand 2795 states and 3657 transitions. Second operand 10 states. [2019-11-06 22:25:14,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:25:14,761 INFO L93 Difference]: Finished difference Result 5893 states and 7833 transitions. [2019-11-06 22:25:14,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-06 22:25:14,762 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 155 [2019-11-06 22:25:14,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:25:14,785 INFO L225 Difference]: With dead ends: 5893 [2019-11-06 22:25:14,786 INFO L226 Difference]: Without dead ends: 3120 [2019-11-06 22:25:14,801 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2019-11-06 22:25:14,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3120 states. [2019-11-06 22:25:15,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3120 to 2788. [2019-11-06 22:25:15,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2788 states. [2019-11-06 22:25:15,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2788 states to 2788 states and 3646 transitions. [2019-11-06 22:25:15,237 INFO L78 Accepts]: Start accepts. Automaton has 2788 states and 3646 transitions. Word has length 155 [2019-11-06 22:25:15,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:25:15,238 INFO L462 AbstractCegarLoop]: Abstraction has 2788 states and 3646 transitions. [2019-11-06 22:25:15,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-06 22:25:15,238 INFO L276 IsEmpty]: Start isEmpty. Operand 2788 states and 3646 transitions. [2019-11-06 22:25:15,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-11-06 22:25:15,241 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:25:15,242 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:25:15,242 INFO L410 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:25:15,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:25:15,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1178118941, now seen corresponding path program 1 times [2019-11-06 22:25:15,243 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:25:15,243 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901802688] [2019-11-06 22:25:15,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:25:15,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:15,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:15,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:15,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:15,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:15,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:15,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:15,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:15,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:15,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:15,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:15,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:15,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:15,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:15,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:15,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:15,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:15,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:15,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:15,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:15,422 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-11-06 22:25:15,422 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901802688] [2019-11-06 22:25:15,422 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:25:15,423 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-06 22:25:15,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646805224] [2019-11-06 22:25:15,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-06 22:25:15,423 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:25:15,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-06 22:25:15,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-06 22:25:15,425 INFO L87 Difference]: Start difference. First operand 2788 states and 3646 transitions. Second operand 9 states. [2019-11-06 22:25:18,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:25:18,055 INFO L93 Difference]: Finished difference Result 8089 states and 11637 transitions. [2019-11-06 22:25:18,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-06 22:25:18,056 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 155 [2019-11-06 22:25:18,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:25:18,100 INFO L225 Difference]: With dead ends: 8089 [2019-11-06 22:25:18,100 INFO L226 Difference]: Without dead ends: 5323 [2019-11-06 22:25:18,127 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2019-11-06 22:25:18,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5323 states. [2019-11-06 22:25:19,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5323 to 4852. [2019-11-06 22:25:19,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4852 states. [2019-11-06 22:25:19,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4852 states to 4852 states and 6633 transitions. [2019-11-06 22:25:19,087 INFO L78 Accepts]: Start accepts. Automaton has 4852 states and 6633 transitions. Word has length 155 [2019-11-06 22:25:19,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:25:19,087 INFO L462 AbstractCegarLoop]: Abstraction has 4852 states and 6633 transitions. [2019-11-06 22:25:19,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-06 22:25:19,088 INFO L276 IsEmpty]: Start isEmpty. Operand 4852 states and 6633 transitions. [2019-11-06 22:25:19,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-06 22:25:19,096 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:25:19,097 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:25:19,097 INFO L410 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:25:19,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:25:19,097 INFO L82 PathProgramCache]: Analyzing trace with hash -390866386, now seen corresponding path program 1 times [2019-11-06 22:25:19,098 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:25:19,098 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014998128] [2019-11-06 22:25:19,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:25:19,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:19,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:19,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:19,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:19,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:19,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:19,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:19,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:19,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:19,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:19,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:19,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:19,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:19,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:19,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:19,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:19,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:19,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:19,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:19,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:19,430 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-11-06 22:25:19,431 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014998128] [2019-11-06 22:25:19,431 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:25:19,432 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-06 22:25:19,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948340143] [2019-11-06 22:25:19,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-06 22:25:19,433 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:25:19,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-06 22:25:19,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-06 22:25:19,435 INFO L87 Difference]: Start difference. First operand 4852 states and 6633 transitions. Second operand 10 states.