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.02.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 23:50:21,153 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 23:50:21,155 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 23:50:21,166 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 23:50:21,166 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 23:50:21,167 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 23:50:21,169 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 23:50:21,170 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 23:50:21,172 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 23:50:21,173 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 23:50:21,173 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 23:50:21,175 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 23:50:21,175 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 23:50:21,176 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 23:50:21,177 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 23:50:21,178 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 23:50:21,178 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 23:50:21,179 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 23:50:21,181 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 23:50:21,183 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 23:50:21,185 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 23:50:21,186 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 23:50:21,187 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 23:50:21,188 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 23:50:21,190 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 23:50:21,190 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 23:50:21,191 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 23:50:21,191 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 23:50:21,192 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 23:50:21,193 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 23:50:21,193 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 23:50:21,194 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 23:50:21,195 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 23:50:21,196 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 23:50:21,197 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 23:50:21,197 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 23:50:21,197 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 23:50:21,198 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 23:50:21,198 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 23:50:21,199 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 23:50:21,199 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 23:50:21,200 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:21,215 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 23:50:21,216 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 23:50:21,218 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 23:50:21,218 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 23:50:21,218 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 23:50:21,219 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 23:50:21,219 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 23:50:21,219 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 23:50:21,219 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 23:50:21,219 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 23:50:21,220 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 23:50:21,220 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 23:50:21,220 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 23:50:21,220 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 23:50:21,220 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 23:50:21,220 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 23:50:21,221 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 23:50:21,221 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 23:50:21,221 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 23:50:21,221 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 23:50:21,221 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 23:50:21,222 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:50:21,222 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 23:50:21,223 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 23:50:21,224 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 23:50:21,224 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 23:50:21,224 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 23:50:21,224 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 23:50:21,224 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 23:50:21,475 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 23:50:21,493 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 23:50:21,496 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 23:50:21,497 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 23:50:21,498 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 23:50:21,498 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.02.cil-2.c [2019-10-14 23:50:21,571 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ce00d9fe/db05c1d1b3f14b44b0a513ae3bfc0fe9/FLAG087061ec7 [2019-10-14 23:50:22,004 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 23:50:22,005 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.02.cil-2.c [2019-10-14 23:50:22,014 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ce00d9fe/db05c1d1b3f14b44b0a513ae3bfc0fe9/FLAG087061ec7 [2019-10-14 23:50:22,394 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ce00d9fe/db05c1d1b3f14b44b0a513ae3bfc0fe9 [2019-10-14 23:50:22,404 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 23:50:22,405 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 23:50:22,409 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 23:50:22,409 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 23:50:22,412 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 23:50:22,413 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:50:22" (1/1) ... [2019-10-14 23:50:22,416 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f33695a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:22, skipping insertion in model container [2019-10-14 23:50:22,416 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:50:22" (1/1) ... [2019-10-14 23:50:22,424 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 23:50:22,482 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 23:50:22,708 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:50:22,713 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 23:50:22,851 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:50:22,871 INFO L192 MainTranslator]: Completed translation [2019-10-14 23:50:22,871 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:22 WrapperNode [2019-10-14 23:50:22,871 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 23:50:22,872 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 23:50:22,872 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 23:50:22,872 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 23:50:22,882 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:22" (1/1) ... [2019-10-14 23:50:22,882 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:22" (1/1) ... [2019-10-14 23:50:22,889 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:22" (1/1) ... [2019-10-14 23:50:22,890 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:22" (1/1) ... [2019-10-14 23:50:22,899 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:22" (1/1) ... [2019-10-14 23:50:22,911 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:22" (1/1) ... [2019-10-14 23:50:22,914 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:22" (1/1) ... [2019-10-14 23:50:22,917 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 23:50:22,918 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 23:50:22,918 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 23:50:22,918 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 23:50:22,919 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:22" (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:22,968 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 23:50:22,968 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 23:50:22,968 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-10-14 23:50:22,968 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2019-10-14 23:50:22,969 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2019-10-14 23:50:22,969 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2019-10-14 23:50:22,969 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2019-10-14 23:50:22,969 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2019-10-14 23:50:22,969 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2019-10-14 23:50:22,970 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-10-14 23:50:22,970 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-10-14 23:50:22,970 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-10-14 23:50:22,970 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-10-14 23:50:22,970 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-10-14 23:50:22,970 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-10-14 23:50:22,971 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-10-14 23:50:22,971 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-10-14 23:50:22,971 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-10-14 23:50:22,971 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-10-14 23:50:22,971 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-10-14 23:50:22,971 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-10-14 23:50:22,972 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-10-14 23:50:22,972 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 23:50:22,972 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 23:50:22,972 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-10-14 23:50:22,972 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2019-10-14 23:50:22,972 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2019-10-14 23:50:22,973 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2019-10-14 23:50:22,973 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-10-14 23:50:22,973 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-14 23:50:22,973 INFO L130 BoogieDeclarations]: Found specification of procedure master [2019-10-14 23:50:22,973 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2019-10-14 23:50:22,973 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2019-10-14 23:50:22,974 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-10-14 23:50:22,974 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-10-14 23:50:22,974 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-10-14 23:50:22,974 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-10-14 23:50:22,974 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-10-14 23:50:22,974 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-10-14 23:50:22,975 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-10-14 23:50:22,975 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-10-14 23:50:22,975 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-10-14 23:50:22,975 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-10-14 23:50:22,975 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-10-14 23:50:22,975 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-10-14 23:50:22,976 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 23:50:22,976 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 23:50:22,976 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 23:50:23,589 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 23:50:23,591 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-10-14 23:50:23,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:50:23 BoogieIcfgContainer [2019-10-14 23:50:23,594 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 23:50:23,596 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 23:50:23,596 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 23:50:23,599 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 23:50:23,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:50:22" (1/3) ... [2019-10-14 23:50:23,601 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ecb085a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:50:23, skipping insertion in model container [2019-10-14 23:50:23,601 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:22" (2/3) ... [2019-10-14 23:50:23,602 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ecb085a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:50:23, skipping insertion in model container [2019-10-14 23:50:23,602 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:50:23" (3/3) ... [2019-10-14 23:50:23,607 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.02.cil-2.c [2019-10-14 23:50:23,618 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 23:50:23,628 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 23:50:23,641 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 23:50:23,671 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 23:50:23,672 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 23:50:23,672 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 23:50:23,672 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 23:50:23,672 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 23:50:23,672 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 23:50:23,673 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 23:50:23,673 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 23:50:23,697 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states. [2019-10-14 23:50:23,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-14 23:50:23,708 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:23,709 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] [2019-10-14 23:50:23,710 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:23,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:23,717 INFO L82 PathProgramCache]: Analyzing trace with hash -67309704, now seen corresponding path program 1 times [2019-10-14 23:50:23,726 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:23,727 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261794134] [2019-10-14 23:50:23,727 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:23,728 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:23,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:23,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:24,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:24,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:24,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:24,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:24,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:24,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:24,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:24,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:24,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:24,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:24,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:24,351 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:24,352 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261794134] [2019-10-14 23:50:24,353 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:24,353 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-14 23:50:24,354 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698921972] [2019-10-14 23:50:24,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 23:50:24,360 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:24,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 23:50:24,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:50:24,378 INFO L87 Difference]: Start difference. First operand 181 states. Second operand 10 states. [2019-10-14 23:50:26,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:26,166 INFO L93 Difference]: Finished difference Result 436 states and 678 transitions. [2019-10-14 23:50:26,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-14 23:50:26,168 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 92 [2019-10-14 23:50:26,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:26,183 INFO L225 Difference]: With dead ends: 436 [2019-10-14 23:50:26,183 INFO L226 Difference]: Without dead ends: 263 [2019-10-14 23:50:26,189 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2019-10-14 23:50:26,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2019-10-14 23:50:26,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 172. [2019-10-14 23:50:26,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-10-14 23:50:26,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 232 transitions. [2019-10-14 23:50:26,271 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 232 transitions. Word has length 92 [2019-10-14 23:50:26,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:26,272 INFO L462 AbstractCegarLoop]: Abstraction has 172 states and 232 transitions. [2019-10-14 23:50:26,272 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 23:50:26,272 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 232 transitions. [2019-10-14 23:50:26,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-14 23:50:26,276 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:26,277 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] [2019-10-14 23:50:26,277 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:26,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:26,277 INFO L82 PathProgramCache]: Analyzing trace with hash -559935878, now seen corresponding path program 1 times [2019-10-14 23:50:26,278 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:26,278 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181013239] [2019-10-14 23:50:26,278 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:26,278 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:26,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:26,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:26,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:26,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:26,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:26,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:26,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:26,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:26,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:26,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:26,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:26,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:26,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:26,543 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:26,543 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181013239] [2019-10-14 23:50:26,544 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:26,544 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-14 23:50:26,544 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092071748] [2019-10-14 23:50:26,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 23:50:26,546 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:26,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 23:50:26,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:50:26,547 INFO L87 Difference]: Start difference. First operand 172 states and 232 transitions. Second operand 10 states. [2019-10-14 23:50:27,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:27,902 INFO L93 Difference]: Finished difference Result 415 states and 600 transitions. [2019-10-14 23:50:27,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-14 23:50:27,903 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 92 [2019-10-14 23:50:27,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:27,907 INFO L225 Difference]: With dead ends: 415 [2019-10-14 23:50:27,907 INFO L226 Difference]: Without dead ends: 263 [2019-10-14 23:50:27,909 INFO L600 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-10-14 23:50:27,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2019-10-14 23:50:27,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 172. [2019-10-14 23:50:27,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-10-14 23:50:27,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 229 transitions. [2019-10-14 23:50:27,943 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 229 transitions. Word has length 92 [2019-10-14 23:50:27,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:27,943 INFO L462 AbstractCegarLoop]: Abstraction has 172 states and 229 transitions. [2019-10-14 23:50:27,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 23:50:27,943 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 229 transitions. [2019-10-14 23:50:27,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-14 23:50:27,945 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:27,946 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] [2019-10-14 23:50:27,946 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:27,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:27,946 INFO L82 PathProgramCache]: Analyzing trace with hash -115468810, now seen corresponding path program 1 times [2019-10-14 23:50:27,947 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:27,947 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729481847] [2019-10-14 23:50:27,947 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:27,947 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:27,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:27,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:28,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:28,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:28,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:28,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:28,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:28,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:28,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:28,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:28,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:28,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:28,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:28,176 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:28,177 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729481847] [2019-10-14 23:50:28,177 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:28,177 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-14 23:50:28,178 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215495739] [2019-10-14 23:50:28,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 23:50:28,178 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:28,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 23:50:28,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:50:28,179 INFO L87 Difference]: Start difference. First operand 172 states and 229 transitions. Second operand 10 states. [2019-10-14 23:50:30,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:30,113 INFO L93 Difference]: Finished difference Result 494 states and 737 transitions. [2019-10-14 23:50:30,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-14 23:50:30,114 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 92 [2019-10-14 23:50:30,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:30,118 INFO L225 Difference]: With dead ends: 494 [2019-10-14 23:50:30,119 INFO L226 Difference]: Without dead ends: 342 [2019-10-14 23:50:30,120 INFO L600 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-10-14 23:50:30,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-10-14 23:50:30,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 208. [2019-10-14 23:50:30,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-10-14 23:50:30,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 269 transitions. [2019-10-14 23:50:30,172 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 269 transitions. Word has length 92 [2019-10-14 23:50:30,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:30,172 INFO L462 AbstractCegarLoop]: Abstraction has 208 states and 269 transitions. [2019-10-14 23:50:30,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 23:50:30,173 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 269 transitions. [2019-10-14 23:50:30,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-14 23:50:30,180 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:30,181 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] [2019-10-14 23:50:30,181 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:30,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:30,181 INFO L82 PathProgramCache]: Analyzing trace with hash -550041895, now seen corresponding path program 1 times [2019-10-14 23:50:30,182 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:30,182 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824527008] [2019-10-14 23:50:30,182 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:30,182 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:30,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:30,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:30,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:30,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:30,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:30,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:30,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:30,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:30,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:30,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:30,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:30,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:30,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:30,381 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:30,381 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824527008] [2019-10-14 23:50:30,382 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:30,383 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-14 23:50:30,383 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247902987] [2019-10-14 23:50:30,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 23:50:30,384 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:30,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 23:50:30,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:50:30,385 INFO L87 Difference]: Start difference. First operand 208 states and 269 transitions. Second operand 10 states. [2019-10-14 23:50:32,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:32,089 INFO L93 Difference]: Finished difference Result 576 states and 830 transitions. [2019-10-14 23:50:32,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-14 23:50:32,090 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 92 [2019-10-14 23:50:32,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:32,094 INFO L225 Difference]: With dead ends: 576 [2019-10-14 23:50:32,094 INFO L226 Difference]: Without dead ends: 388 [2019-10-14 23:50:32,096 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2019-10-14 23:50:32,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2019-10-14 23:50:32,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 244. [2019-10-14 23:50:32,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2019-10-14 23:50:32,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 307 transitions. [2019-10-14 23:50:32,130 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 307 transitions. Word has length 92 [2019-10-14 23:50:32,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:32,131 INFO L462 AbstractCegarLoop]: Abstraction has 244 states and 307 transitions. [2019-10-14 23:50:32,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 23:50:32,131 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 307 transitions. [2019-10-14 23:50:32,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-14 23:50:32,133 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:32,133 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] [2019-10-14 23:50:32,133 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:32,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:32,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1219969707, now seen corresponding path program 1 times [2019-10-14 23:50:32,134 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:32,134 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064863117] [2019-10-14 23:50:32,134 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:32,134 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:32,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:32,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:32,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:32,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:32,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:32,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:32,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:32,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:32,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:32,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:32,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:32,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:32,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:32,300 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,300 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064863117] [2019-10-14 23:50:32,300 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:32,301 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-14 23:50:32,301 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251536536] [2019-10-14 23:50:32,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 23:50:32,302 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:32,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 23:50:32,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:50:32,302 INFO L87 Difference]: Start difference. First operand 244 states and 307 transitions. Second operand 10 states. [2019-10-14 23:50:34,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:34,080 INFO L93 Difference]: Finished difference Result 653 states and 912 transitions. [2019-10-14 23:50:34,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-14 23:50:34,081 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 92 [2019-10-14 23:50:34,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:34,088 INFO L225 Difference]: With dead ends: 653 [2019-10-14 23:50:34,088 INFO L226 Difference]: Without dead ends: 429 [2019-10-14 23:50:34,093 INFO L600 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-10-14 23:50:34,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2019-10-14 23:50:34,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 277. [2019-10-14 23:50:34,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-10-14 23:50:34,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 340 transitions. [2019-10-14 23:50:34,149 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 340 transitions. Word has length 92 [2019-10-14 23:50:34,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:34,149 INFO L462 AbstractCegarLoop]: Abstraction has 277 states and 340 transitions. [2019-10-14 23:50:34,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 23:50:34,149 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 340 transitions. [2019-10-14 23:50:34,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-14 23:50:34,151 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:34,151 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] [2019-10-14 23:50:34,152 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:34,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:34,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1929357560, now seen corresponding path program 1 times [2019-10-14 23:50:34,152 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:34,153 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628946394] [2019-10-14 23:50:34,153 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:34,153 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:34,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:34,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:34,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:34,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:34,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:34,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:34,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:34,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:34,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:34,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:34,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:34,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:34,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:34,360 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,361 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628946394] [2019-10-14 23:50:34,361 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:34,361 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-14 23:50:34,362 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366303691] [2019-10-14 23:50:34,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 23:50:34,362 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:34,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 23:50:34,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:50:34,363 INFO L87 Difference]: Start difference. First operand 277 states and 340 transitions. Second operand 10 states. [2019-10-14 23:50:36,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:36,271 INFO L93 Difference]: Finished difference Result 664 states and 867 transitions. [2019-10-14 23:50:36,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-14 23:50:36,271 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 92 [2019-10-14 23:50:36,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:36,275 INFO L225 Difference]: With dead ends: 664 [2019-10-14 23:50:36,276 INFO L226 Difference]: Without dead ends: 408 [2019-10-14 23:50:36,277 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2019-10-14 23:50:36,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2019-10-14 23:50:36,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 282. [2019-10-14 23:50:36,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-10-14 23:50:36,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 342 transitions. [2019-10-14 23:50:36,306 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 342 transitions. Word has length 92 [2019-10-14 23:50:36,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:36,306 INFO L462 AbstractCegarLoop]: Abstraction has 282 states and 342 transitions. [2019-10-14 23:50:36,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 23:50:36,307 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 342 transitions. [2019-10-14 23:50:36,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-14 23:50:36,308 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:36,308 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] [2019-10-14 23:50:36,308 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:36,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:36,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1031964282, now seen corresponding path program 1 times [2019-10-14 23:50:36,309 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:36,309 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390788677] [2019-10-14 23:50:36,309 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:36,310 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:36,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:36,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:36,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:36,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:36,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:36,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:36,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:36,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:36,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:36,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:36,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:36,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:36,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:36,507 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:36,507 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390788677] [2019-10-14 23:50:36,507 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:36,507 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-14 23:50:36,508 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536196235] [2019-10-14 23:50:36,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 23:50:36,508 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:36,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 23:50:36,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:50:36,509 INFO L87 Difference]: Start difference. First operand 282 states and 342 transitions. Second operand 10 states. [2019-10-14 23:50:38,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:38,774 INFO L93 Difference]: Finished difference Result 1053 states and 1335 transitions. [2019-10-14 23:50:38,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-14 23:50:38,774 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 92 [2019-10-14 23:50:38,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:38,781 INFO L225 Difference]: With dead ends: 1053 [2019-10-14 23:50:38,781 INFO L226 Difference]: Without dead ends: 791 [2019-10-14 23:50:38,783 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2019-10-14 23:50:38,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2019-10-14 23:50:38,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 581. [2019-10-14 23:50:38,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 581 states. [2019-10-14 23:50:38,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 697 transitions. [2019-10-14 23:50:38,868 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 697 transitions. Word has length 92 [2019-10-14 23:50:38,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:38,869 INFO L462 AbstractCegarLoop]: Abstraction has 581 states and 697 transitions. [2019-10-14 23:50:38,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 23:50:38,869 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 697 transitions. [2019-10-14 23:50:38,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-14 23:50:38,871 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:38,871 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] [2019-10-14 23:50:38,871 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:38,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:38,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1054596536, now seen corresponding path program 1 times [2019-10-14 23:50:38,872 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:38,872 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008136151] [2019-10-14 23:50:38,873 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:38,873 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:38,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:38,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:38,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:38,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:38,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:38,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:39,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:39,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:39,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:39,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:39,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:39,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:39,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:39,068 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:39,068 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008136151] [2019-10-14 23:50:39,069 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:39,069 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-14 23:50:39,069 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137348726] [2019-10-14 23:50:39,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-14 23:50:39,070 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:39,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-14 23:50:39,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-14 23:50:39,070 INFO L87 Difference]: Start difference. First operand 581 states and 697 transitions. Second operand 7 states. [2019-10-14 23:50:40,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:40,814 INFO L93 Difference]: Finished difference Result 2031 states and 2618 transitions. [2019-10-14 23:50:40,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-14 23:50:40,814 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2019-10-14 23:50:40,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:40,823 INFO L225 Difference]: With dead ends: 2031 [2019-10-14 23:50:40,824 INFO L226 Difference]: Without dead ends: 1471 [2019-10-14 23:50:40,826 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2019-10-14 23:50:40,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1471 states. [2019-10-14 23:50:40,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1471 to 1197. [2019-10-14 23:50:40,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1197 states. [2019-10-14 23:50:40,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1197 states to 1197 states and 1485 transitions. [2019-10-14 23:50:40,937 INFO L78 Accepts]: Start accepts. Automaton has 1197 states and 1485 transitions. Word has length 92 [2019-10-14 23:50:40,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:40,937 INFO L462 AbstractCegarLoop]: Abstraction has 1197 states and 1485 transitions. [2019-10-14 23:50:40,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-14 23:50:40,938 INFO L276 IsEmpty]: Start isEmpty. Operand 1197 states and 1485 transitions. [2019-10-14 23:50:40,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-14 23:50:40,940 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:40,940 INFO L380 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:40,941 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:40,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:40,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1357284192, now seen corresponding path program 1 times [2019-10-14 23:50:40,941 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:40,942 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920619035] [2019-10-14 23:50:40,942 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:40,942 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:40,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:40,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:41,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:41,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:41,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:41,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:41,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:41,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:41,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:41,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:41,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:41,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:41,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:41,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:41,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:41,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:41,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:41,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:41,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:41,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:41,136 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-14 23:50:41,136 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920619035] [2019-10-14 23:50:41,138 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:41,138 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-14 23:50:41,138 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030718505] [2019-10-14 23:50:41,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-14 23:50:41,139 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:41,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-14 23:50:41,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-10-14 23:50:41,140 INFO L87 Difference]: Start difference. First operand 1197 states and 1485 transitions. Second operand 9 states. [2019-10-14 23:50:43,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:43,704 INFO L93 Difference]: Finished difference Result 3830 states and 4957 transitions. [2019-10-14 23:50:43,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-14 23:50:43,705 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 147 [2019-10-14 23:50:43,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:43,720 INFO L225 Difference]: With dead ends: 3830 [2019-10-14 23:50:43,720 INFO L226 Difference]: Without dead ends: 2655 [2019-10-14 23:50:43,725 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2019-10-14 23:50:43,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2655 states. [2019-10-14 23:50:43,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2655 to 2287. [2019-10-14 23:50:43,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2287 states. [2019-10-14 23:50:43,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2287 states to 2287 states and 2924 transitions. [2019-10-14 23:50:43,931 INFO L78 Accepts]: Start accepts. Automaton has 2287 states and 2924 transitions. Word has length 147 [2019-10-14 23:50:43,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:43,932 INFO L462 AbstractCegarLoop]: Abstraction has 2287 states and 2924 transitions. [2019-10-14 23:50:43,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-14 23:50:43,932 INFO L276 IsEmpty]: Start isEmpty. Operand 2287 states and 2924 transitions. [2019-10-14 23:50:43,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-10-14 23:50:43,937 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:43,937 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43,938 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:43,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:43,938 INFO L82 PathProgramCache]: Analyzing trace with hash 674078602, now seen corresponding path program 1 times [2019-10-14 23:50:43,938 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:43,939 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487715109] [2019-10-14 23:50:43,939 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:43,939 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:43,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:43,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:44,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:44,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:44,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:44,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:44,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:44,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:44,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:44,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:44,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:44,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:44,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:44,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:44,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:44,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:44,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:44,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:44,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:44,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:44,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:44,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:44,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:44,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:44,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:44,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:44,267 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-10-14 23:50:44,268 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487715109] [2019-10-14 23:50:44,268 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:44,268 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-14 23:50:44,268 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199747956] [2019-10-14 23:50:44,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 23:50:44,269 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:44,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 23:50:44,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:50:44,270 INFO L87 Difference]: Start difference. First operand 2287 states and 2924 transitions. Second operand 10 states. [2019-10-14 23:50:46,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:46,935 INFO L93 Difference]: Finished difference Result 6869 states and 9575 transitions. [2019-10-14 23:50:46,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-14 23:50:46,935 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 191 [2019-10-14 23:50:46,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:46,962 INFO L225 Difference]: With dead ends: 6869 [2019-10-14 23:50:46,962 INFO L226 Difference]: Without dead ends: 4609 [2019-10-14 23:50:46,978 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 52 SyntacticMatches, 9 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2019-10-14 23:50:46,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4609 states. [2019-10-14 23:50:47,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4609 to 4189. [2019-10-14 23:50:47,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4189 states. [2019-10-14 23:50:47,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4189 states to 4189 states and 5324 transitions. [2019-10-14 23:50:47,522 INFO L78 Accepts]: Start accepts. Automaton has 4189 states and 5324 transitions. Word has length 191 [2019-10-14 23:50:47,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:47,523 INFO L462 AbstractCegarLoop]: Abstraction has 4189 states and 5324 transitions. [2019-10-14 23:50:47,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 23:50:47,523 INFO L276 IsEmpty]: Start isEmpty. Operand 4189 states and 5324 transitions. [2019-10-14 23:50:47,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-10-14 23:50:47,530 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:47,530 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47,531 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:47,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:47,531 INFO L82 PathProgramCache]: Analyzing trace with hash -635516700, now seen corresponding path program 1 times [2019-10-14 23:50:47,531 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:47,532 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989733807] [2019-10-14 23:50:47,532 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:47,532 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:47,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:47,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:47,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:47,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:47,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:47,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:47,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:47,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:47,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:47,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:47,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:47,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:47,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:47,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:47,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:47,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:47,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:47,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:47,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:47,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:47,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:47,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:47,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:47,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:47,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:47,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:47,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:47,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:47,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:47,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:47,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:47,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:47,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:47,848 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2019-10-14 23:50:47,848 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989733807] [2019-10-14 23:50:47,849 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:47,849 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-14 23:50:47,849 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983064992] [2019-10-14 23:50:47,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 23:50:47,850 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:47,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 23:50:47,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:50:47,850 INFO L87 Difference]: Start difference. First operand 4189 states and 5324 transitions. Second operand 10 states. [2019-10-14 23:50:49,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:49,462 INFO L93 Difference]: Finished difference Result 8734 states and 11180 transitions. [2019-10-14 23:50:49,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-14 23:50:49,463 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 249 [2019-10-14 23:50:49,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:49,487 INFO L225 Difference]: With dead ends: 8734 [2019-10-14 23:50:49,487 INFO L226 Difference]: Without dead ends: 4566 [2019-10-14 23:50:49,500 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2019-10-14 23:50:49,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4566 states. [2019-10-14 23:50:50,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4566 to 4182. [2019-10-14 23:50:50,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4182 states. [2019-10-14 23:50:50,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4182 states to 4182 states and 5310 transitions. [2019-10-14 23:50:50,075 INFO L78 Accepts]: Start accepts. Automaton has 4182 states and 5310 transitions. Word has length 249 [2019-10-14 23:50:50,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:50,076 INFO L462 AbstractCegarLoop]: Abstraction has 4182 states and 5310 transitions. [2019-10-14 23:50:50,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 23:50:50,076 INFO L276 IsEmpty]: Start isEmpty. Operand 4182 states and 5310 transitions. [2019-10-14 23:50:50,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-10-14 23:50:50,083 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:50,083 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50,084 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:50,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:50,084 INFO L82 PathProgramCache]: Analyzing trace with hash -2111585836, now seen corresponding path program 1 times [2019-10-14 23:50:50,084 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:50,085 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022325744] [2019-10-14 23:50:50,085 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:50,085 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:50,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:50,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:50,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:50,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:50,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:50,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:50,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:50,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:50,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:50,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:50,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:50,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:50,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:50,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:50,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:50,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:50,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:50,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:50,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:50,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:50,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:50,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:50,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:50,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:50,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:50,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:50,413 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 37 proven. 8 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-10-14 23:50:50,414 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022325744] [2019-10-14 23:50:50,414 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [420147656] [2019-10-14 23:50:50,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:50:50,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:50,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 847 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-14 23:50:50,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:50:50,657 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-14 23:50:50,658 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-14 23:50:50,658 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [13] total 14 [2019-10-14 23:50:50,659 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454560105] [2019-10-14 23:50:50,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:50:50,659 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:50,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:50:50,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-10-14 23:50:50,660 INFO L87 Difference]: Start difference. First operand 4182 states and 5310 transitions. Second operand 3 states. [2019-10-14 23:50:51,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:51,539 INFO L93 Difference]: Finished difference Result 11525 states and 15788 transitions. [2019-10-14 23:50:51,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:50:51,540 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 192 [2019-10-14 23:50:51,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:51,577 INFO L225 Difference]: With dead ends: 11525 [2019-10-14 23:50:51,577 INFO L226 Difference]: Without dead ends: 7365 [2019-10-14 23:50:51,600 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-10-14 23:50:51,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7365 states. [2019-10-14 23:50:52,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7365 to 7345. [2019-10-14 23:50:52,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7345 states. [2019-10-14 23:50:52,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7345 states to 7345 states and 9588 transitions. [2019-10-14 23:50:52,464 INFO L78 Accepts]: Start accepts. Automaton has 7345 states and 9588 transitions. Word has length 192 [2019-10-14 23:50:52,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:52,465 INFO L462 AbstractCegarLoop]: Abstraction has 7345 states and 9588 transitions. [2019-10-14 23:50:52,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:50:52,465 INFO L276 IsEmpty]: Start isEmpty. Operand 7345 states and 9588 transitions. [2019-10-14 23:50:52,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-10-14 23:50:52,477 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:52,477 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52,682 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:50:52,683 INFO L410 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:52,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:52,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1815131615, now seen corresponding path program 1 times [2019-10-14 23:50:52,683 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:52,684 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283746977] [2019-10-14 23:50:52,684 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:52,684 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:52,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:52,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:52,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:52,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:52,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:52,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:52,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:52,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:52,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:52,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:52,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:52,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:52,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:52,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:52,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:52,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:52,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:52,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:52,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:52,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:52,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:52,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:52,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:52,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:52,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:52,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:52,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:52,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:52,943 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-10-14 23:50:52,943 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283746977] [2019-10-14 23:50:52,943 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1329046315] [2019-10-14 23:50:52,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:50:53,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:53,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 917 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-14 23:50:53,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:50:53,137 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-10-14 23:50:53,137 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-14 23:50:53,138 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 9 [2019-10-14 23:50:53,138 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927522283] [2019-10-14 23:50:53,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:50:53,139 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:53,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:50:53,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-14 23:50:53,139 INFO L87 Difference]: Start difference. First operand 7345 states and 9588 transitions. Second operand 3 states. [2019-10-14 23:50:54,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:54,055 INFO L93 Difference]: Finished difference Result 15051 states and 19971 transitions. [2019-10-14 23:50:54,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:50:54,055 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 212 [2019-10-14 23:50:54,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:54,114 INFO L225 Difference]: With dead ends: 15051 [2019-10-14 23:50:54,114 INFO L226 Difference]: Without dead ends: 7729 [2019-10-14 23:50:54,150 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-14 23:50:54,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7729 states. [2019-10-14 23:50:55,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7729 to 7313. [2019-10-14 23:50:55,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7313 states. [2019-10-14 23:50:55,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7313 states to 7313 states and 9472 transitions. [2019-10-14 23:50:55,214 INFO L78 Accepts]: Start accepts. Automaton has 7313 states and 9472 transitions. Word has length 212 [2019-10-14 23:50:55,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:55,215 INFO L462 AbstractCegarLoop]: Abstraction has 7313 states and 9472 transitions. [2019-10-14 23:50:55,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:50:55,215 INFO L276 IsEmpty]: Start isEmpty. Operand 7313 states and 9472 transitions. [2019-10-14 23:50:55,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-10-14 23:50:55,223 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:55,223 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55,431 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:50:55,431 INFO L410 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:55,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:55,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1391086419, now seen corresponding path program 1 times [2019-10-14 23:50:55,433 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:55,433 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023133120] [2019-10-14 23:50:55,433 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:55,434 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:55,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:55,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:55,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:55,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:55,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:55,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:55,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:55,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:55,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:55,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:55,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:55,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:55,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:55,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:55,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:55,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:55,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:55,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:55,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:55,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:55,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:55,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:55,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:55,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:55,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:55,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:55,703 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 2 proven. 23 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-10-14 23:50:55,704 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023133120] [2019-10-14 23:50:55,704 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1034671374] [2019-10-14 23:50:55,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:50:55,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:55,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 855 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-14 23:50:55,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:50:55,911 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-10-14 23:50:55,912 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-14 23:50:55,912 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 11 [2019-10-14 23:50:55,912 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850149336] [2019-10-14 23:50:55,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:50:55,915 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:55,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:50:55,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-10-14 23:50:55,916 INFO L87 Difference]: Start difference. First operand 7313 states and 9472 transitions. Second operand 3 states.