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/token_ring.03.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 23:50:22,098 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 23:50:22,101 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 23:50:22,119 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 23:50:22,119 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 23:50:22,122 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 23:50:22,124 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 23:50:22,137 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 23:50:22,139 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 23:50:22,141 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 23:50:22,144 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 23:50:22,145 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 23:50:22,146 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 23:50:22,149 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 23:50:22,150 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 23:50:22,151 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 23:50:22,154 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 23:50:22,155 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 23:50:22,157 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 23:50:22,159 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 23:50:22,160 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 23:50:22,161 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 23:50:22,162 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 23:50:22,163 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 23:50:22,165 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 23:50:22,165 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 23:50:22,166 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 23:50:22,167 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 23:50:22,167 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 23:50:22,168 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 23:50:22,168 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 23:50:22,169 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 23:50:22,170 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 23:50:22,171 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 23:50:22,172 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 23:50:22,172 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 23:50:22,173 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 23:50:22,173 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 23:50:22,173 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 23:50:22,174 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 23:50:22,175 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 23:50:22,176 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-14 23:50:22,192 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 23:50:22,193 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 23:50:22,195 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 23:50:22,195 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 23:50:22,196 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 23:50:22,196 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 23:50:22,196 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 23:50:22,196 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 23:50:22,196 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 23:50:22,197 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 23:50:22,198 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 23:50:22,198 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 23:50:22,198 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 23:50:22,199 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 23:50:22,199 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 23:50:22,199 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 23:50:22,199 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 23:50:22,200 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 23:50:22,200 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 23:50:22,200 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 23:50:22,200 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 23:50:22,201 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:50:22,201 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 23:50:22,201 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 23:50:22,201 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 23:50:22,202 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 23:50:22,202 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 23:50:22,202 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 23:50:22,202 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 23:50:22,498 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 23:50:22,514 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 23:50:22,518 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 23:50:22,519 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 23:50:22,520 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 23:50:22,521 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.03.cil-1.c [2019-10-14 23:50:22,599 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2cf47df35/f93fcb9896e14082bd8ba56c792ff4d1/FLAG340fc4332 [2019-10-14 23:50:23,141 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 23:50:23,144 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.03.cil-1.c [2019-10-14 23:50:23,165 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2cf47df35/f93fcb9896e14082bd8ba56c792ff4d1/FLAG340fc4332 [2019-10-14 23:50:23,491 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2cf47df35/f93fcb9896e14082bd8ba56c792ff4d1 [2019-10-14 23:50:23,502 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 23:50:23,503 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 23:50:23,504 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 23:50:23,504 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 23:50:23,508 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 23:50:23,509 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:50:23" (1/1) ... [2019-10-14 23:50:23,512 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@354e775 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:23, skipping insertion in model container [2019-10-14 23:50:23,512 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:50:23" (1/1) ... [2019-10-14 23:50:23,520 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 23:50:23,580 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 23:50:23,826 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:50:23,832 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 23:50:23,977 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:50:24,002 INFO L192 MainTranslator]: Completed translation [2019-10-14 23:50:24,003 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:24 WrapperNode [2019-10-14 23:50:24,003 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 23:50:24,004 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 23:50:24,004 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 23:50:24,004 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 23:50:24,015 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:24" (1/1) ... [2019-10-14 23:50:24,015 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:24" (1/1) ... [2019-10-14 23:50:24,023 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:24" (1/1) ... [2019-10-14 23:50:24,023 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:24" (1/1) ... [2019-10-14 23:50:24,034 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:24" (1/1) ... [2019-10-14 23:50:24,049 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:24" (1/1) ... [2019-10-14 23:50:24,052 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:24" (1/1) ... [2019-10-14 23:50:24,057 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 23:50:24,058 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 23:50:24,058 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 23:50:24,058 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 23:50:24,059 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:24" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:50:24,127 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 23:50:24,127 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 23:50:24,127 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-10-14 23:50:24,127 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2019-10-14 23:50:24,127 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2019-10-14 23:50:24,128 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2019-10-14 23:50:24,128 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit3 [2019-10-14 23:50:24,129 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2019-10-14 23:50:24,129 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2019-10-14 23:50:24,129 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2019-10-14 23:50:24,129 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit3_triggered [2019-10-14 23:50:24,129 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-10-14 23:50:24,130 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-10-14 23:50:24,130 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-10-14 23:50:24,131 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-10-14 23:50:24,131 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-10-14 23:50:24,133 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-10-14 23:50:24,134 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-10-14 23:50:24,134 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-10-14 23:50:24,134 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-10-14 23:50:24,134 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-10-14 23:50:24,134 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-10-14 23:50:24,134 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-10-14 23:50:24,134 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-10-14 23:50:24,135 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 23:50:24,135 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 23:50:24,135 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-10-14 23:50:24,135 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2019-10-14 23:50:24,136 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2019-10-14 23:50:24,137 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2019-10-14 23:50:24,137 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit3_triggered [2019-10-14 23:50:24,137 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-10-14 23:50:24,137 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-14 23:50:24,137 INFO L130 BoogieDeclarations]: Found specification of procedure master [2019-10-14 23:50:24,138 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2019-10-14 23:50:24,138 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2019-10-14 23:50:24,138 INFO L130 BoogieDeclarations]: Found specification of procedure transmit3 [2019-10-14 23:50:24,138 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-10-14 23:50:24,138 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-10-14 23:50:24,138 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-10-14 23:50:24,139 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-10-14 23:50:24,139 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-10-14 23:50:24,139 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-10-14 23:50:24,139 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-10-14 23:50:24,139 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-10-14 23:50:24,140 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-10-14 23:50:24,140 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-10-14 23:50:24,140 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-10-14 23:50:24,140 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-10-14 23:50:24,140 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 23:50:24,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 23:50:24,141 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 23:50:24,840 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 23:50:24,840 INFO L284 CfgBuilder]: Removed 6 assume(true) statements. [2019-10-14 23:50:24,842 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:50:24 BoogieIcfgContainer [2019-10-14 23:50:24,842 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 23:50:24,844 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 23:50:24,844 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 23:50:24,848 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 23:50:24,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:50:23" (1/3) ... [2019-10-14 23:50:24,849 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e67f1fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:50:24, skipping insertion in model container [2019-10-14 23:50:24,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:24" (2/3) ... [2019-10-14 23:50:24,850 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e67f1fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:50:24, skipping insertion in model container [2019-10-14 23:50:24,850 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:50:24" (3/3) ... [2019-10-14 23:50:24,852 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.03.cil-1.c [2019-10-14 23:50:24,863 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 23:50:24,873 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 23:50:24,886 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 23:50:24,917 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 23:50:24,917 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 23:50:24,917 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 23:50:24,917 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 23:50:24,917 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 23:50:24,918 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 23:50:24,918 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 23:50:24,918 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 23:50:24,946 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states. [2019-10-14 23:50:24,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-14 23:50:24,960 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:24,961 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:24,963 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:24,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:24,970 INFO L82 PathProgramCache]: Analyzing trace with hash -604727244, now seen corresponding path program 1 times [2019-10-14 23:50:24,980 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:24,980 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396554785] [2019-10-14 23:50:24,981 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:24,981 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:24,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:25,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:25,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:25,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:25,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:25,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:25,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:25,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:25,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:25,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:25,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:25,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:25,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:25,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:25,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:50:25,692 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396554785] [2019-10-14 23:50:25,693 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:25,693 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-14 23:50:25,694 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507080560] [2019-10-14 23:50:25,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-14 23:50:25,699 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:25,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-14 23:50:25,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-10-14 23:50:25,716 INFO L87 Difference]: Start difference. First operand 211 states. Second operand 9 states. [2019-10-14 23:50:29,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:29,475 INFO L93 Difference]: Finished difference Result 778 states and 1234 transitions. [2019-10-14 23:50:29,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-14 23:50:29,477 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 106 [2019-10-14 23:50:29,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:29,500 INFO L225 Difference]: With dead ends: 778 [2019-10-14 23:50:29,500 INFO L226 Difference]: Without dead ends: 569 [2019-10-14 23:50:29,508 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2019-10-14 23:50:29,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2019-10-14 23:50:29,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 379. [2019-10-14 23:50:29,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2019-10-14 23:50:29,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 534 transitions. [2019-10-14 23:50:29,643 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 534 transitions. Word has length 106 [2019-10-14 23:50:29,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:29,643 INFO L462 AbstractCegarLoop]: Abstraction has 379 states and 534 transitions. [2019-10-14 23:50:29,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-14 23:50:29,644 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 534 transitions. [2019-10-14 23:50:29,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-14 23:50:29,648 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:29,648 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:29,648 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:29,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:29,649 INFO L82 PathProgramCache]: Analyzing trace with hash 994888564, now seen corresponding path program 1 times [2019-10-14 23:50:29,649 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:29,649 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858522266] [2019-10-14 23:50:29,649 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:29,650 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:29,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:29,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:29,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:29,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:29,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:29,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:29,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:29,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:29,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:29,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:29,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:29,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:29,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:29,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:29,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:50:29,966 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858522266] [2019-10-14 23:50:29,967 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:29,967 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-14 23:50:29,967 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846033845] [2019-10-14 23:50:29,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 23:50:29,970 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:29,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 23:50:29,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:50:29,970 INFO L87 Difference]: Start difference. First operand 379 states and 534 transitions. Second operand 10 states. [2019-10-14 23:50:31,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:31,805 INFO L93 Difference]: Finished difference Result 917 states and 1348 transitions. [2019-10-14 23:50:31,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-14 23:50:31,806 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 106 [2019-10-14 23:50:31,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:31,814 INFO L225 Difference]: With dead ends: 917 [2019-10-14 23:50:31,815 INFO L226 Difference]: Without dead ends: 559 [2019-10-14 23:50:31,821 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2019-10-14 23:50:31,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2019-10-14 23:50:31,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 379. [2019-10-14 23:50:31,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2019-10-14 23:50:31,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 527 transitions. [2019-10-14 23:50:31,892 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 527 transitions. Word has length 106 [2019-10-14 23:50:31,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:31,894 INFO L462 AbstractCegarLoop]: Abstraction has 379 states and 527 transitions. [2019-10-14 23:50:31,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 23:50:31,894 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 527 transitions. [2019-10-14 23:50:31,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-14 23:50:31,904 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:31,904 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:31,905 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:31,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:31,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1031720908, now seen corresponding path program 1 times [2019-10-14 23:50:31,905 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:31,905 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825355608] [2019-10-14 23:50:31,906 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:31,906 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:31,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:31,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:32,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:32,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:32,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:32,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:32,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:32,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:32,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:32,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:32,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:32,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:32,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:32,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:32,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:50:32,253 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825355608] [2019-10-14 23:50:32,254 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:32,254 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-14 23:50:32,254 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61800566] [2019-10-14 23:50:32,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 23:50:32,260 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:32,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 23:50:32,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:50:32,262 INFO L87 Difference]: Start difference. First operand 379 states and 527 transitions. Second operand 10 states. [2019-10-14 23:50:34,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:34,314 INFO L93 Difference]: Finished difference Result 913 states and 1326 transitions. [2019-10-14 23:50:34,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-14 23:50:34,314 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 106 [2019-10-14 23:50:34,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:34,319 INFO L225 Difference]: With dead ends: 913 [2019-10-14 23:50:34,319 INFO L226 Difference]: Without dead ends: 555 [2019-10-14 23:50:34,321 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2019-10-14 23:50:34,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2019-10-14 23:50:34,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 379. [2019-10-14 23:50:34,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2019-10-14 23:50:34,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 520 transitions. [2019-10-14 23:50:34,381 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 520 transitions. Word has length 106 [2019-10-14 23:50:34,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:34,381 INFO L462 AbstractCegarLoop]: Abstraction has 379 states and 520 transitions. [2019-10-14 23:50:34,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 23:50:34,382 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 520 transitions. [2019-10-14 23:50:34,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-14 23:50:34,384 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:34,384 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:34,384 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:34,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:34,385 INFO L82 PathProgramCache]: Analyzing trace with hash -2066926732, now seen corresponding path program 1 times [2019-10-14 23:50:34,385 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:34,385 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198100497] [2019-10-14 23:50:34,385 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:34,385 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:34,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:34,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:34,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:34,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:34,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:34,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:34,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:34,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:34,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:34,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:34,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:34,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:34,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:34,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:34,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:50:34,621 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198100497] [2019-10-14 23:50:34,622 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:34,622 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-14 23:50:34,622 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044026384] [2019-10-14 23:50:34,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 23:50:34,624 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:34,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 23:50:34,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:50:34,625 INFO L87 Difference]: Start difference. First operand 379 states and 520 transitions. Second operand 10 states. [2019-10-14 23:50:37,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:37,225 INFO L93 Difference]: Finished difference Result 1100 states and 1650 transitions. [2019-10-14 23:50:37,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-14 23:50:37,226 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 106 [2019-10-14 23:50:37,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:37,238 INFO L225 Difference]: With dead ends: 1100 [2019-10-14 23:50:37,238 INFO L226 Difference]: Without dead ends: 742 [2019-10-14 23:50:37,241 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=123, Invalid=297, Unknown=0, NotChecked=0, Total=420 [2019-10-14 23:50:37,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2019-10-14 23:50:37,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 471. [2019-10-14 23:50:37,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2019-10-14 23:50:37,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 625 transitions. [2019-10-14 23:50:37,329 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 625 transitions. Word has length 106 [2019-10-14 23:50:37,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:37,330 INFO L462 AbstractCegarLoop]: Abstraction has 471 states and 625 transitions. [2019-10-14 23:50:37,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 23:50:37,330 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 625 transitions. [2019-10-14 23:50:37,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-14 23:50:37,332 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:37,333 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:37,333 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:37,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:37,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1958807220, now seen corresponding path program 1 times [2019-10-14 23:50:37,334 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:37,335 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641911240] [2019-10-14 23:50:37,335 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:37,336 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:37,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:37,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:37,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:37,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:37,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:37,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:37,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:37,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:37,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:37,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:37,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:37,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:37,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:37,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:37,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:50:37,629 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641911240] [2019-10-14 23:50:37,630 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:37,630 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-14 23:50:37,630 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960212206] [2019-10-14 23:50:37,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 23:50:37,631 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:37,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 23:50:37,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:50:37,632 INFO L87 Difference]: Start difference. First operand 471 states and 625 transitions. Second operand 10 states. [2019-10-14 23:50:40,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:40,065 INFO L93 Difference]: Finished difference Result 1310 states and 1898 transitions. [2019-10-14 23:50:40,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-14 23:50:40,066 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 106 [2019-10-14 23:50:40,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:40,072 INFO L225 Difference]: With dead ends: 1310 [2019-10-14 23:50:40,072 INFO L226 Difference]: Without dead ends: 860 [2019-10-14 23:50:40,074 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2019-10-14 23:50:40,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2019-10-14 23:50:40,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 563. [2019-10-14 23:50:40,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2019-10-14 23:50:40,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 726 transitions. [2019-10-14 23:50:40,133 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 726 transitions. Word has length 106 [2019-10-14 23:50:40,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:40,133 INFO L462 AbstractCegarLoop]: Abstraction has 563 states and 726 transitions. [2019-10-14 23:50:40,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 23:50:40,134 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 726 transitions. [2019-10-14 23:50:40,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-14 23:50:40,135 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:40,135 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:40,136 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:40,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:40,136 INFO L82 PathProgramCache]: Analyzing trace with hash 426101620, now seen corresponding path program 1 times [2019-10-14 23:50:40,136 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:40,136 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993537766] [2019-10-14 23:50:40,137 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:40,137 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:40,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:40,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:40,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:40,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:40,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:40,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:40,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:40,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:40,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:40,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:40,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:40,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:40,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:40,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:40,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:50:40,348 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993537766] [2019-10-14 23:50:40,349 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:40,349 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-14 23:50:40,349 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391094971] [2019-10-14 23:50:40,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 23:50:40,350 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:40,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 23:50:40,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:50:40,351 INFO L87 Difference]: Start difference. First operand 563 states and 726 transitions. Second operand 10 states. [2019-10-14 23:50:42,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:42,661 INFO L93 Difference]: Finished difference Result 1520 states and 2136 transitions. [2019-10-14 23:50:42,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-14 23:50:42,662 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 106 [2019-10-14 23:50:42,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:42,669 INFO L225 Difference]: With dead ends: 1520 [2019-10-14 23:50:42,669 INFO L226 Difference]: Without dead ends: 978 [2019-10-14 23:50:42,672 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=123, Invalid=297, Unknown=0, NotChecked=0, Total=420 [2019-10-14 23:50:42,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2019-10-14 23:50:42,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 655. [2019-10-14 23:50:42,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 655 states. [2019-10-14 23:50:42,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 823 transitions. [2019-10-14 23:50:42,755 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 823 transitions. Word has length 106 [2019-10-14 23:50:42,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:42,756 INFO L462 AbstractCegarLoop]: Abstraction has 655 states and 823 transitions. [2019-10-14 23:50:42,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 23:50:42,756 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 823 transitions. [2019-10-14 23:50:42,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-14 23:50:42,757 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:42,758 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:42,758 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:42,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:42,758 INFO L82 PathProgramCache]: Analyzing trace with hash 453167222, now seen corresponding path program 1 times [2019-10-14 23:50:42,758 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:42,759 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326046789] [2019-10-14 23:50:42,759 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:42,759 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:42,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:42,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:42,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:42,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:42,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:42,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:42,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:42,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:42,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:42,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:42,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:42,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:42,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:42,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:42,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:50:42,979 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326046789] [2019-10-14 23:50:42,980 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:42,980 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-14 23:50:42,980 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101365736] [2019-10-14 23:50:42,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 23:50:42,981 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:42,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 23:50:42,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:50:42,982 INFO L87 Difference]: Start difference. First operand 655 states and 823 transitions. Second operand 10 states. [2019-10-14 23:50:45,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:45,490 INFO L93 Difference]: Finished difference Result 1720 states and 2354 transitions. [2019-10-14 23:50:45,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-14 23:50:45,491 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 106 [2019-10-14 23:50:45,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:45,497 INFO L225 Difference]: With dead ends: 1720 [2019-10-14 23:50:45,498 INFO L226 Difference]: Without dead ends: 1086 [2019-10-14 23:50:45,500 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=123, Invalid=297, Unknown=0, NotChecked=0, Total=420 [2019-10-14 23:50:45,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1086 states. [2019-10-14 23:50:45,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1086 to 741. [2019-10-14 23:50:45,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 741 states. [2019-10-14 23:50:45,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 910 transitions. [2019-10-14 23:50:45,574 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 910 transitions. Word has length 106 [2019-10-14 23:50:45,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:45,575 INFO L462 AbstractCegarLoop]: Abstraction has 741 states and 910 transitions. [2019-10-14 23:50:45,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 23:50:45,575 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 910 transitions. [2019-10-14 23:50:45,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-14 23:50:45,576 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:45,576 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:45,577 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:45,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:45,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1483621066, now seen corresponding path program 1 times [2019-10-14 23:50:45,577 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:45,577 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592643068] [2019-10-14 23:50:45,578 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:45,578 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:45,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:45,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:45,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:45,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:45,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:45,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:45,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:45,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:45,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:45,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:45,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:45,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:45,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:45,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:45,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:50:45,837 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592643068] [2019-10-14 23:50:45,838 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:45,838 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-14 23:50:45,838 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111447028] [2019-10-14 23:50:45,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 23:50:45,839 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:45,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 23:50:45,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:50:45,839 INFO L87 Difference]: Start difference. First operand 741 states and 910 transitions. Second operand 10 states. [2019-10-14 23:50:48,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:48,534 INFO L93 Difference]: Finished difference Result 1738 states and 2239 transitions. [2019-10-14 23:50:48,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-14 23:50:48,535 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 106 [2019-10-14 23:50:48,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:48,540 INFO L225 Difference]: With dead ends: 1738 [2019-10-14 23:50:48,541 INFO L226 Difference]: Without dead ends: 1019 [2019-10-14 23:50:48,545 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2019-10-14 23:50:48,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2019-10-14 23:50:48,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 751. [2019-10-14 23:50:48,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 751 states. [2019-10-14 23:50:48,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 912 transitions. [2019-10-14 23:50:48,625 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 912 transitions. Word has length 106 [2019-10-14 23:50:48,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:48,626 INFO L462 AbstractCegarLoop]: Abstraction has 751 states and 912 transitions. [2019-10-14 23:50:48,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 23:50:48,626 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 912 transitions. [2019-10-14 23:50:48,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-14 23:50:48,628 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:48,628 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:48,629 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:48,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:48,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1901017672, now seen corresponding path program 1 times [2019-10-14 23:50:48,629 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:48,630 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741077361] [2019-10-14 23:50:48,630 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:48,630 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:48,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:48,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:48,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:48,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:48,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:48,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:48,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:48,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:48,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:48,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:49,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:49,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:49,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:49,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:49,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:50:49,039 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741077361] [2019-10-14 23:50:49,041 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:49,041 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-14 23:50:49,042 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196206818] [2019-10-14 23:50:49,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 23:50:49,042 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:49,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 23:50:49,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:50:49,043 INFO L87 Difference]: Start difference. First operand 751 states and 912 transitions. Second operand 10 states. [2019-10-14 23:50:51,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:51,655 INFO L93 Difference]: Finished difference Result 1734 states and 2203 transitions. [2019-10-14 23:50:51,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-14 23:50:51,656 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 106 [2019-10-14 23:50:51,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:51,663 INFO L225 Difference]: With dead ends: 1734 [2019-10-14 23:50:51,663 INFO L226 Difference]: Without dead ends: 1005 [2019-10-14 23:50:51,666 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2019-10-14 23:50:51,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1005 states. [2019-10-14 23:50:51,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1005 to 761. [2019-10-14 23:50:51,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 761 states. [2019-10-14 23:50:51,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 914 transitions. [2019-10-14 23:50:51,744 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 914 transitions. Word has length 106 [2019-10-14 23:50:51,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:51,744 INFO L462 AbstractCegarLoop]: Abstraction has 761 states and 914 transitions. [2019-10-14 23:50:51,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 23:50:51,745 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 914 transitions. [2019-10-14 23:50:51,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-14 23:50:51,746 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:51,746 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:51,746 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:51,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:51,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1024998666, now seen corresponding path program 1 times [2019-10-14 23:50:51,747 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:51,747 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150584648] [2019-10-14 23:50:51,747 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:51,748 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:51,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:51,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:51,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:51,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:51,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:51,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:51,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:51,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:51,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:51,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:51,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:51,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:51,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:51,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:51,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:50:51,946 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150584648] [2019-10-14 23:50:51,946 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:51,946 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-14 23:50:51,946 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097617767] [2019-10-14 23:50:51,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 23:50:51,947 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:51,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 23:50:51,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:50:51,948 INFO L87 Difference]: Start difference. First operand 761 states and 914 transitions. Second operand 10 states. [2019-10-14 23:50:54,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:54,299 INFO L93 Difference]: Finished difference Result 1736 states and 2175 transitions. [2019-10-14 23:50:54,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-14 23:50:54,299 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 106 [2019-10-14 23:50:54,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:54,305 INFO L225 Difference]: With dead ends: 1736 [2019-10-14 23:50:54,305 INFO L226 Difference]: Without dead ends: 997 [2019-10-14 23:50:54,307 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2019-10-14 23:50:54,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2019-10-14 23:50:54,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 771. [2019-10-14 23:50:54,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2019-10-14 23:50:54,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 916 transitions. [2019-10-14 23:50:54,379 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 916 transitions. Word has length 106 [2019-10-14 23:50:54,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:54,380 INFO L462 AbstractCegarLoop]: Abstraction has 771 states and 916 transitions. [2019-10-14 23:50:54,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 23:50:54,380 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 916 transitions. [2019-10-14 23:50:54,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-14 23:50:54,381 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:54,382 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:54,382 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:54,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:54,382 INFO L82 PathProgramCache]: Analyzing trace with hash -131512328, now seen corresponding path program 1 times [2019-10-14 23:50:54,382 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:54,383 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933636449] [2019-10-14 23:50:54,383 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:54,383 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:54,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:54,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:54,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:54,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:54,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:54,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:54,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:54,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:54,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:54,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:54,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:54,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:54,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:54,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:54,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:50:54,628 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933636449] [2019-10-14 23:50:54,628 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:54,628 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-14 23:50:54,628 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415929473] [2019-10-14 23:50:54,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 23:50:54,629 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:54,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 23:50:54,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:50:54,630 INFO L87 Difference]: Start difference. First operand 771 states and 916 transitions. Second operand 10 states. [2019-10-14 23:50:57,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:57,004 INFO L93 Difference]: Finished difference Result 1748 states and 2163 transitions. [2019-10-14 23:50:57,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-14 23:50:57,004 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 106 [2019-10-14 23:50:57,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:57,008 INFO L225 Difference]: With dead ends: 1748 [2019-10-14 23:50:57,009 INFO L226 Difference]: Without dead ends: 999 [2019-10-14 23:50:57,011 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2019-10-14 23:50:57,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2019-10-14 23:50:57,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 781. [2019-10-14 23:50:57,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2019-10-14 23:50:57,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 918 transitions. [2019-10-14 23:50:57,086 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 918 transitions. Word has length 106 [2019-10-14 23:50:57,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:57,086 INFO L462 AbstractCegarLoop]: Abstraction has 781 states and 918 transitions. [2019-10-14 23:50:57,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 23:50:57,086 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 918 transitions. [2019-10-14 23:50:57,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-14 23:50:57,088 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:57,088 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:57,088 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:57,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:57,089 INFO L82 PathProgramCache]: Analyzing trace with hash -525879114, now seen corresponding path program 1 times [2019-10-14 23:50:57,089 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:57,089 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443663394] [2019-10-14 23:50:57,089 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:57,089 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:57,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:57,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:57,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:57,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:57,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:57,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:57,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:57,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:57,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:57,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:57,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:57,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:57,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:57,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:57,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:50:57,322 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443663394] [2019-10-14 23:50:57,322 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:57,323 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-14 23:50:57,323 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14285904] [2019-10-14 23:50:57,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 23:50:57,323 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:57,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 23:50:57,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:50:57,324 INFO L87 Difference]: Start difference. First operand 781 states and 918 transitions. Second operand 10 states.