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-f4eb214f-m [2019-10-13 19:51:22,907 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 19:51:22,910 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 19:51:22,925 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 19:51:22,925 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 19:51:22,926 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 19:51:22,928 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 19:51:22,929 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 19:51:22,931 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 19:51:22,932 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 19:51:22,933 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 19:51:22,934 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 19:51:22,935 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 19:51:22,936 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 19:51:22,937 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 19:51:22,938 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 19:51:22,938 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 19:51:22,940 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 19:51:22,941 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 19:51:22,944 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 19:51:22,945 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 19:51:22,946 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 19:51:22,947 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 19:51:22,948 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 19:51:22,951 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 19:51:22,951 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 19:51:22,951 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 19:51:22,952 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 19:51:22,952 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 19:51:22,953 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 19:51:22,953 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 19:51:22,954 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 19:51:22,955 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 19:51:22,956 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 19:51:22,957 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 19:51:22,957 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 19:51:22,957 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 19:51:22,958 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 19:51:22,958 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 19:51:22,959 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 19:51:22,960 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 19:51:22,960 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-13 19:51:22,975 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 19:51:22,975 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 19:51:22,976 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 19:51:22,977 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 19:51:22,977 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 19:51:22,977 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 19:51:22,977 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 19:51:22,977 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 19:51:22,978 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 19:51:22,978 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 19:51:22,978 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 19:51:22,978 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 19:51:22,978 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 19:51:22,979 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 19:51:22,979 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 19:51:22,979 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 19:51:22,979 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 19:51:22,979 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 19:51:22,980 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 19:51:22,980 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 19:51:22,980 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 19:51:22,980 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 19:51:22,981 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 19:51:22,981 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 19:51:22,981 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 19:51:22,981 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 19:51:22,981 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 19:51:22,981 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 19:51:22,982 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-13 19:51:23,272 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 19:51:23,284 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 19:51:23,288 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 19:51:23,289 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 19:51:23,290 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 19:51:23,291 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-13 19:51:23,356 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40319c518/1a7a3ef4dd10419085f31d3c4af2d132/FLAG2b4ef22e9 [2019-10-13 19:51:23,913 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 19:51:23,913 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.02.cil-2.c [2019-10-13 19:51:23,924 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40319c518/1a7a3ef4dd10419085f31d3c4af2d132/FLAG2b4ef22e9 [2019-10-13 19:51:24,214 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40319c518/1a7a3ef4dd10419085f31d3c4af2d132 [2019-10-13 19:51:24,223 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 19:51:24,224 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 19:51:24,225 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 19:51:24,226 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 19:51:24,229 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 19:51:24,230 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:51:24" (1/1) ... [2019-10-13 19:51:24,233 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69ecaa57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:51:24, skipping insertion in model container [2019-10-13 19:51:24,234 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:51:24" (1/1) ... [2019-10-13 19:51:24,242 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 19:51:24,299 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 19:51:24,641 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:51:24,647 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 19:51:24,809 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:51:24,838 INFO L192 MainTranslator]: Completed translation [2019-10-13 19:51:24,838 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:51:24 WrapperNode [2019-10-13 19:51:24,839 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 19:51:24,839 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 19:51:24,839 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 19:51:24,839 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 19:51:24,851 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:51:24" (1/1) ... [2019-10-13 19:51:24,851 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:51:24" (1/1) ... [2019-10-13 19:51:24,859 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:51:24" (1/1) ... [2019-10-13 19:51:24,859 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:51:24" (1/1) ... [2019-10-13 19:51:24,870 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:51:24" (1/1) ... [2019-10-13 19:51:24,882 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:51:24" (1/1) ... [2019-10-13 19:51:24,885 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:51:24" (1/1) ... [2019-10-13 19:51:24,889 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 19:51:24,890 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 19:51:24,890 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 19:51:24,890 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 19:51:24,891 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:51:24" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 19:51:24,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 19:51:24,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 19:51:24,959 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-10-13 19:51:24,960 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2019-10-13 19:51:24,960 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2019-10-13 19:51:24,960 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2019-10-13 19:51:24,960 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2019-10-13 19:51:24,960 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2019-10-13 19:51:24,960 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2019-10-13 19:51:24,961 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-10-13 19:51:24,961 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-10-13 19:51:24,961 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-10-13 19:51:24,961 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-10-13 19:51:24,961 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-10-13 19:51:24,961 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-10-13 19:51:24,962 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-10-13 19:51:24,962 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-10-13 19:51:24,962 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-10-13 19:51:24,962 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-10-13 19:51:24,962 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-10-13 19:51:24,963 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-10-13 19:51:24,963 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-10-13 19:51:24,963 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 19:51:24,963 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 19:51:24,963 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-10-13 19:51:24,964 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2019-10-13 19:51:24,964 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2019-10-13 19:51:24,964 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2019-10-13 19:51:24,964 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-10-13 19:51:24,964 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 19:51:24,964 INFO L130 BoogieDeclarations]: Found specification of procedure master [2019-10-13 19:51:24,965 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2019-10-13 19:51:24,965 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2019-10-13 19:51:24,965 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-10-13 19:51:24,965 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-10-13 19:51:24,965 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-10-13 19:51:24,965 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-10-13 19:51:24,966 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-10-13 19:51:24,966 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-10-13 19:51:24,966 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-10-13 19:51:24,966 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-10-13 19:51:24,966 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-10-13 19:51:24,966 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-10-13 19:51:24,966 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-10-13 19:51:24,967 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-10-13 19:51:24,967 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 19:51:24,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 19:51:24,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 19:51:25,593 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 19:51:25,594 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-10-13 19:51:25,595 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:51:25 BoogieIcfgContainer [2019-10-13 19:51:25,595 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 19:51:25,597 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 19:51:25,597 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 19:51:25,600 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 19:51:25,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 07:51:24" (1/3) ... [2019-10-13 19:51:25,601 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@530d14a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:51:25, skipping insertion in model container [2019-10-13 19:51:25,601 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:51:24" (2/3) ... [2019-10-13 19:51:25,602 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@530d14a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:51:25, skipping insertion in model container [2019-10-13 19:51:25,602 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:51:25" (3/3) ... [2019-10-13 19:51:25,603 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.02.cil-2.c [2019-10-13 19:51:25,613 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 19:51:25,621 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 19:51:25,631 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 19:51:25,659 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 19:51:25,659 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 19:51:25,660 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 19:51:25,660 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 19:51:25,660 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 19:51:25,660 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 19:51:25,661 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 19:51:25,661 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 19:51:25,688 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states. [2019-10-13 19:51:25,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-13 19:51:25,704 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:25,705 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-13 19:51:25,708 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:25,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:25,714 INFO L82 PathProgramCache]: Analyzing trace with hash -67309704, now seen corresponding path program 1 times [2019-10-13 19:51:25,727 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:25,727 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302156464] [2019-10-13 19:51:25,728 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:25,728 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:25,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:25,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:26,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:26,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:26,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:26,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:26,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:26,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:26,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:26,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:26,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:26,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:26,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:26,405 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-13 19:51:26,406 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302156464] [2019-10-13 19:51:26,407 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:26,407 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 19:51:26,407 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141476635] [2019-10-13 19:51:26,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 19:51:26,413 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:26,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 19:51:26,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-13 19:51:26,430 INFO L87 Difference]: Start difference. First operand 181 states. Second operand 10 states. [2019-10-13 19:51:28,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:28,432 INFO L93 Difference]: Finished difference Result 436 states and 678 transitions. [2019-10-13 19:51:28,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-13 19:51:28,434 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 92 [2019-10-13 19:51:28,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:28,451 INFO L225 Difference]: With dead ends: 436 [2019-10-13 19:51:28,451 INFO L226 Difference]: Without dead ends: 263 [2019-10-13 19:51:28,457 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-13 19:51:28,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2019-10-13 19:51:28,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 172. [2019-10-13 19:51:28,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-10-13 19:51:28,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 232 transitions. [2019-10-13 19:51:28,539 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 232 transitions. Word has length 92 [2019-10-13 19:51:28,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:28,540 INFO L462 AbstractCegarLoop]: Abstraction has 172 states and 232 transitions. [2019-10-13 19:51:28,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 19:51:28,540 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 232 transitions. [2019-10-13 19:51:28,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-13 19:51:28,544 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:28,545 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-13 19:51:28,545 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:28,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:28,545 INFO L82 PathProgramCache]: Analyzing trace with hash -559935878, now seen corresponding path program 1 times [2019-10-13 19:51:28,546 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:28,546 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800260606] [2019-10-13 19:51:28,546 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:28,546 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:28,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:28,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:28,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:28,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:28,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:28,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:28,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:28,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:28,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:28,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:28,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:28,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:28,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:28,853 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-13 19:51:28,854 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800260606] [2019-10-13 19:51:28,855 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:28,855 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 19:51:28,855 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520292547] [2019-10-13 19:51:28,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 19:51:28,860 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:28,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 19:51:28,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-13 19:51:28,861 INFO L87 Difference]: Start difference. First operand 172 states and 232 transitions. Second operand 10 states. [2019-10-13 19:51:30,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:30,432 INFO L93 Difference]: Finished difference Result 415 states and 600 transitions. [2019-10-13 19:51:30,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 19:51:30,433 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 92 [2019-10-13 19:51:30,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:30,437 INFO L225 Difference]: With dead ends: 415 [2019-10-13 19:51:30,437 INFO L226 Difference]: Without dead ends: 263 [2019-10-13 19:51:30,441 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-13 19:51:30,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2019-10-13 19:51:30,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 172. [2019-10-13 19:51:30,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-10-13 19:51:30,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 229 transitions. [2019-10-13 19:51:30,488 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 229 transitions. Word has length 92 [2019-10-13 19:51:30,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:30,489 INFO L462 AbstractCegarLoop]: Abstraction has 172 states and 229 transitions. [2019-10-13 19:51:30,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 19:51:30,489 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 229 transitions. [2019-10-13 19:51:30,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-13 19:51:30,493 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:30,494 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-13 19:51:30,494 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:30,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:30,497 INFO L82 PathProgramCache]: Analyzing trace with hash -115468810, now seen corresponding path program 1 times [2019-10-13 19:51:30,497 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:30,498 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435390347] [2019-10-13 19:51:30,498 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:30,498 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:30,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:30,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:30,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:30,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:30,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:30,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:30,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:30,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:30,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:30,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:30,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:30,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:30,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:30,748 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-13 19:51:30,749 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435390347] [2019-10-13 19:51:30,749 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:30,749 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 19:51:30,750 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291482926] [2019-10-13 19:51:30,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 19:51:30,751 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:30,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 19:51:30,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-13 19:51:30,751 INFO L87 Difference]: Start difference. First operand 172 states and 229 transitions. Second operand 10 states. [2019-10-13 19:51:32,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:32,779 INFO L93 Difference]: Finished difference Result 494 states and 737 transitions. [2019-10-13 19:51:32,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-13 19:51:32,781 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 92 [2019-10-13 19:51:32,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:32,787 INFO L225 Difference]: With dead ends: 494 [2019-10-13 19:51:32,787 INFO L226 Difference]: Without dead ends: 342 [2019-10-13 19:51:32,788 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-13 19:51:32,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-10-13 19:51:32,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 208. [2019-10-13 19:51:32,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-10-13 19:51:32,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 269 transitions. [2019-10-13 19:51:32,825 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 269 transitions. Word has length 92 [2019-10-13 19:51:32,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:32,825 INFO L462 AbstractCegarLoop]: Abstraction has 208 states and 269 transitions. [2019-10-13 19:51:32,825 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 19:51:32,826 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 269 transitions. [2019-10-13 19:51:32,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-13 19:51:32,828 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:32,828 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-13 19:51:32,828 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:32,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:32,829 INFO L82 PathProgramCache]: Analyzing trace with hash -550041895, now seen corresponding path program 1 times [2019-10-13 19:51:32,829 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:32,829 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417129838] [2019-10-13 19:51:32,829 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:32,830 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:32,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:32,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:32,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:32,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:32,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:32,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:32,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:33,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:33,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:33,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:33,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:33,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:33,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:33,042 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-13 19:51:33,043 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417129838] [2019-10-13 19:51:33,043 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:33,043 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 19:51:33,044 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603744191] [2019-10-13 19:51:33,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 19:51:33,045 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:33,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 19:51:33,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-13 19:51:33,046 INFO L87 Difference]: Start difference. First operand 208 states and 269 transitions. Second operand 10 states. [2019-10-13 19:51:34,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:34,940 INFO L93 Difference]: Finished difference Result 576 states and 830 transitions. [2019-10-13 19:51:34,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-13 19:51:34,941 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 92 [2019-10-13 19:51:34,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:34,945 INFO L225 Difference]: With dead ends: 576 [2019-10-13 19:51:34,946 INFO L226 Difference]: Without dead ends: 388 [2019-10-13 19:51:34,947 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-13 19:51:34,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2019-10-13 19:51:35,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 244. [2019-10-13 19:51:35,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2019-10-13 19:51:35,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 307 transitions. [2019-10-13 19:51:35,011 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 307 transitions. Word has length 92 [2019-10-13 19:51:35,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:35,011 INFO L462 AbstractCegarLoop]: Abstraction has 244 states and 307 transitions. [2019-10-13 19:51:35,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 19:51:35,012 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 307 transitions. [2019-10-13 19:51:35,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-13 19:51:35,014 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:35,014 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-13 19:51:35,014 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:35,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:35,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1219969707, now seen corresponding path program 1 times [2019-10-13 19:51:35,015 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:35,015 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403982034] [2019-10-13 19:51:35,015 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:35,015 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:35,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:35,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:35,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:35,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:35,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:35,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:35,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:35,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:35,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:35,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:35,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:35,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:35,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:35,211 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-13 19:51:35,212 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403982034] [2019-10-13 19:51:35,212 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:35,212 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 19:51:35,212 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172191403] [2019-10-13 19:51:35,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 19:51:35,213 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:35,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 19:51:35,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-13 19:51:35,214 INFO L87 Difference]: Start difference. First operand 244 states and 307 transitions. Second operand 10 states. [2019-10-13 19:51:37,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:37,050 INFO L93 Difference]: Finished difference Result 653 states and 912 transitions. [2019-10-13 19:51:37,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-13 19:51:37,051 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 92 [2019-10-13 19:51:37,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:37,056 INFO L225 Difference]: With dead ends: 653 [2019-10-13 19:51:37,056 INFO L226 Difference]: Without dead ends: 429 [2019-10-13 19:51:37,057 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-13 19:51:37,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2019-10-13 19:51:37,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 277. [2019-10-13 19:51:37,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-10-13 19:51:37,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 340 transitions. [2019-10-13 19:51:37,101 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 340 transitions. Word has length 92 [2019-10-13 19:51:37,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:37,101 INFO L462 AbstractCegarLoop]: Abstraction has 277 states and 340 transitions. [2019-10-13 19:51:37,101 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 19:51:37,101 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 340 transitions. [2019-10-13 19:51:37,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-13 19:51:37,104 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:37,105 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-13 19:51:37,105 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:37,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:37,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1929357560, now seen corresponding path program 1 times [2019-10-13 19:51:37,106 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:37,106 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750674614] [2019-10-13 19:51:37,106 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:37,106 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:37,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:37,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:37,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:37,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:37,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:37,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:37,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:37,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:37,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:37,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:37,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:37,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:37,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:37,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:51:37,345 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750674614] [2019-10-13 19:51:37,346 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:37,346 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 19:51:37,346 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703678664] [2019-10-13 19:51:37,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 19:51:37,347 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:37,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 19:51:37,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-10-13 19:51:37,348 INFO L87 Difference]: Start difference. First operand 277 states and 340 transitions. Second operand 10 states. [2019-10-13 19:51:39,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:39,315 INFO L93 Difference]: Finished difference Result 664 states and 867 transitions. [2019-10-13 19:51:39,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-13 19:51:39,316 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 92 [2019-10-13 19:51:39,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:39,320 INFO L225 Difference]: With dead ends: 664 [2019-10-13 19:51:39,320 INFO L226 Difference]: Without dead ends: 408 [2019-10-13 19:51:39,322 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-13 19:51:39,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2019-10-13 19:51:39,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 282. [2019-10-13 19:51:39,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-10-13 19:51:39,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 342 transitions. [2019-10-13 19:51:39,353 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 342 transitions. Word has length 92 [2019-10-13 19:51:39,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:39,353 INFO L462 AbstractCegarLoop]: Abstraction has 282 states and 342 transitions. [2019-10-13 19:51:39,353 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 19:51:39,354 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 342 transitions. [2019-10-13 19:51:39,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-13 19:51:39,355 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:39,355 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-13 19:51:39,355 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:39,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:39,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1031964282, now seen corresponding path program 1 times [2019-10-13 19:51:39,356 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:39,356 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849217874] [2019-10-13 19:51:39,357 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:39,357 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:39,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:39,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:39,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:39,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:39,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:39,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:39,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:39,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:39,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:39,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:39,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:39,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:39,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:39,567 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-13 19:51:39,568 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849217874] [2019-10-13 19:51:39,568 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:39,568 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 19:51:39,568 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266292035] [2019-10-13 19:51:39,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 19:51:39,569 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:39,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 19:51:39,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-13 19:51:39,570 INFO L87 Difference]: Start difference. First operand 282 states and 342 transitions. Second operand 10 states. [2019-10-13 19:51:42,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:42,026 INFO L93 Difference]: Finished difference Result 1053 states and 1335 transitions. [2019-10-13 19:51:42,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-13 19:51:42,027 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 92 [2019-10-13 19:51:42,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:42,035 INFO L225 Difference]: With dead ends: 1053 [2019-10-13 19:51:42,035 INFO L226 Difference]: Without dead ends: 791 [2019-10-13 19:51:42,037 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-13 19:51:42,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2019-10-13 19:51:42,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 581. [2019-10-13 19:51:42,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 581 states. [2019-10-13 19:51:42,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 697 transitions. [2019-10-13 19:51:42,161 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 697 transitions. Word has length 92 [2019-10-13 19:51:42,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:42,162 INFO L462 AbstractCegarLoop]: Abstraction has 581 states and 697 transitions. [2019-10-13 19:51:42,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 19:51:42,162 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 697 transitions. [2019-10-13 19:51:42,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-13 19:51:42,164 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:42,164 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-13 19:51:42,165 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:42,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:42,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1054596536, now seen corresponding path program 1 times [2019-10-13 19:51:42,166 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:42,166 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358731875] [2019-10-13 19:51:42,166 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:42,167 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:42,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:42,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:42,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:42,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:42,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:42,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:42,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:42,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:42,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:42,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:42,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:42,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:42,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:42,369 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-13 19:51:42,370 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358731875] [2019-10-13 19:51:42,370 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:42,370 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 19:51:42,370 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333764740] [2019-10-13 19:51:42,371 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 19:51:42,371 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:42,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 19:51:42,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-13 19:51:42,372 INFO L87 Difference]: Start difference. First operand 581 states and 697 transitions. Second operand 7 states. [2019-10-13 19:51:44,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:44,273 INFO L93 Difference]: Finished difference Result 2031 states and 2618 transitions. [2019-10-13 19:51:44,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-13 19:51:44,274 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2019-10-13 19:51:44,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:44,286 INFO L225 Difference]: With dead ends: 2031 [2019-10-13 19:51:44,286 INFO L226 Difference]: Without dead ends: 1471 [2019-10-13 19:51:44,289 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-13 19:51:44,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1471 states. [2019-10-13 19:51:44,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1471 to 1197. [2019-10-13 19:51:44,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1197 states. [2019-10-13 19:51:44,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1197 states to 1197 states and 1485 transitions. [2019-10-13 19:51:44,405 INFO L78 Accepts]: Start accepts. Automaton has 1197 states and 1485 transitions. Word has length 92 [2019-10-13 19:51:44,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:44,406 INFO L462 AbstractCegarLoop]: Abstraction has 1197 states and 1485 transitions. [2019-10-13 19:51:44,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 19:51:44,406 INFO L276 IsEmpty]: Start isEmpty. Operand 1197 states and 1485 transitions. [2019-10-13 19:51:44,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-13 19:51:44,409 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:44,409 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-13 19:51:44,410 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:44,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:44,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1357284192, now seen corresponding path program 1 times [2019-10-13 19:51:44,410 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:44,410 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245748129] [2019-10-13 19:51:44,411 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:44,411 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:44,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:44,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:44,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:44,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:44,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:44,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:44,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:44,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:44,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:44,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:44,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:44,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:44,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:44,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:44,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:44,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:44,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:44,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:44,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:44,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:44,622 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-13 19:51:44,623 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245748129] [2019-10-13 19:51:44,623 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:44,623 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 19:51:44,623 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426107796] [2019-10-13 19:51:44,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 19:51:44,624 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:44,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 19:51:44,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-10-13 19:51:44,625 INFO L87 Difference]: Start difference. First operand 1197 states and 1485 transitions. Second operand 9 states. [2019-10-13 19:51:47,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:47,603 INFO L93 Difference]: Finished difference Result 3830 states and 4957 transitions. [2019-10-13 19:51:47,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-13 19:51:47,604 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 147 [2019-10-13 19:51:47,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:47,621 INFO L225 Difference]: With dead ends: 3830 [2019-10-13 19:51:47,621 INFO L226 Difference]: Without dead ends: 2655 [2019-10-13 19:51:47,627 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2019-10-13 19:51:47,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2655 states. [2019-10-13 19:51:47,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2655 to 2287. [2019-10-13 19:51:47,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2287 states. [2019-10-13 19:51:47,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2287 states to 2287 states and 2924 transitions. [2019-10-13 19:51:47,876 INFO L78 Accepts]: Start accepts. Automaton has 2287 states and 2924 transitions. Word has length 147 [2019-10-13 19:51:47,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:47,876 INFO L462 AbstractCegarLoop]: Abstraction has 2287 states and 2924 transitions. [2019-10-13 19:51:47,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 19:51:47,877 INFO L276 IsEmpty]: Start isEmpty. Operand 2287 states and 2924 transitions. [2019-10-13 19:51:47,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-10-13 19:51:47,883 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:47,884 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-13 19:51:47,884 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:47,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:47,884 INFO L82 PathProgramCache]: Analyzing trace with hash 674078602, now seen corresponding path program 1 times [2019-10-13 19:51:47,885 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:47,885 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291385572] [2019-10-13 19:51:47,885 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:47,885 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:47,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:47,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:47,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:47,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:47,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:48,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:48,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:48,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:48,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:48,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:48,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:48,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:48,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:48,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:48,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:48,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:48,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:48,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:48,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:48,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:48,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:48,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:48,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:48,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:48,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:48,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:48,308 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-13 19:51:48,308 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291385572] [2019-10-13 19:51:48,309 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:48,309 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 19:51:48,309 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540109269] [2019-10-13 19:51:48,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 19:51:48,310 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:48,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 19:51:48,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-10-13 19:51:48,310 INFO L87 Difference]: Start difference. First operand 2287 states and 2924 transitions. Second operand 10 states. [2019-10-13 19:51:51,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:51,100 INFO L93 Difference]: Finished difference Result 6869 states and 9575 transitions. [2019-10-13 19:51:51,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-13 19:51:51,100 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 191 [2019-10-13 19:51:51,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:51,128 INFO L225 Difference]: With dead ends: 6869 [2019-10-13 19:51:51,128 INFO L226 Difference]: Without dead ends: 4609 [2019-10-13 19:51:51,143 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 52 SyntacticMatches, 9 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2019-10-13 19:51:51,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4609 states. [2019-10-13 19:51:51,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4609 to 4189. [2019-10-13 19:51:51,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4189 states. [2019-10-13 19:51:51,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4189 states to 4189 states and 5324 transitions. [2019-10-13 19:51:51,640 INFO L78 Accepts]: Start accepts. Automaton has 4189 states and 5324 transitions. Word has length 191 [2019-10-13 19:51:51,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:51,640 INFO L462 AbstractCegarLoop]: Abstraction has 4189 states and 5324 transitions. [2019-10-13 19:51:51,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 19:51:51,641 INFO L276 IsEmpty]: Start isEmpty. Operand 4189 states and 5324 transitions. [2019-10-13 19:51:51,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-10-13 19:51:51,651 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:51,651 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-13 19:51:51,652 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:51,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:51,652 INFO L82 PathProgramCache]: Analyzing trace with hash -635516700, now seen corresponding path program 1 times [2019-10-13 19:51:51,652 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:51,653 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005313582] [2019-10-13 19:51:51,653 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:51,653 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:51,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:51,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:51,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:51,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:51,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:51,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:51,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:51,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:51,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:51,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:51,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:51,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:51,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:51,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:51,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:51,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:51,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:51,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:51,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:51,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:51,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:51,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:51,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:51,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:51,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:51,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:51,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:51,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:51,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:51,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:51,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:51,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:51,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:51,982 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-13 19:51:51,982 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005313582] [2019-10-13 19:51:51,982 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:51,983 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 19:51:51,983 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040566555] [2019-10-13 19:51:51,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 19:51:51,984 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:51,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 19:51:51,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-10-13 19:51:51,984 INFO L87 Difference]: Start difference. First operand 4189 states and 5324 transitions. Second operand 10 states. [2019-10-13 19:51:53,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:53,807 INFO L93 Difference]: Finished difference Result 8734 states and 11180 transitions. [2019-10-13 19:51:53,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-13 19:51:53,807 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 249 [2019-10-13 19:51:53,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:53,832 INFO L225 Difference]: With dead ends: 8734 [2019-10-13 19:51:53,832 INFO L226 Difference]: Without dead ends: 4566 [2019-10-13 19:51:53,845 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-13 19:51:53,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4566 states. [2019-10-13 19:51:54,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4566 to 4182. [2019-10-13 19:51:54,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4182 states. [2019-10-13 19:51:54,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4182 states to 4182 states and 5310 transitions. [2019-10-13 19:51:54,276 INFO L78 Accepts]: Start accepts. Automaton has 4182 states and 5310 transitions. Word has length 249 [2019-10-13 19:51:54,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:54,277 INFO L462 AbstractCegarLoop]: Abstraction has 4182 states and 5310 transitions. [2019-10-13 19:51:54,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 19:51:54,277 INFO L276 IsEmpty]: Start isEmpty. Operand 4182 states and 5310 transitions. [2019-10-13 19:51:54,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-10-13 19:51:54,283 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:54,283 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-13 19:51:54,284 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:54,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:54,284 INFO L82 PathProgramCache]: Analyzing trace with hash -2111585836, now seen corresponding path program 1 times [2019-10-13 19:51:54,285 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:54,285 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23839676] [2019-10-13 19:51:54,285 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:54,285 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:54,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:54,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:54,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:54,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:54,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:54,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:54,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:54,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:54,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:54,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:54,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:54,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:54,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:54,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:54,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:54,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:54,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:54,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:54,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:54,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:54,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:54,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:54,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:54,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:54,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:54,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:54,638 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-13 19:51:54,639 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23839676] [2019-10-13 19:51:54,639 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1586550958] [2019-10-13 19:51:54,639 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-13 19:51:54,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:54,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 847 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 19:51:54,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:51:54,959 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-13 19:51:54,960 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-13 19:51:54,960 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [13] total 14 [2019-10-13 19:51:54,960 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997912411] [2019-10-13 19:51:54,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:51:54,961 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:54,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:51:54,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-10-13 19:51:54,962 INFO L87 Difference]: Start difference. First operand 4182 states and 5310 transitions. Second operand 3 states. [2019-10-13 19:51:55,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:55,685 INFO L93 Difference]: Finished difference Result 11525 states and 15788 transitions. [2019-10-13 19:51:55,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:51:55,685 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 192 [2019-10-13 19:51:55,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:55,733 INFO L225 Difference]: With dead ends: 11525 [2019-10-13 19:51:55,733 INFO L226 Difference]: Without dead ends: 7365 [2019-10-13 19:51:55,757 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-13 19:51:55,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7365 states. [2019-10-13 19:51:56,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7365 to 7345. [2019-10-13 19:51:56,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7345 states. [2019-10-13 19:51:56,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7345 states to 7345 states and 9588 transitions. [2019-10-13 19:51:56,523 INFO L78 Accepts]: Start accepts. Automaton has 7345 states and 9588 transitions. Word has length 192 [2019-10-13 19:51:56,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:56,524 INFO L462 AbstractCegarLoop]: Abstraction has 7345 states and 9588 transitions. [2019-10-13 19:51:56,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:51:56,524 INFO L276 IsEmpty]: Start isEmpty. Operand 7345 states and 9588 transitions. [2019-10-13 19:51:56,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-10-13 19:51:56,533 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:56,534 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, 1, 1] [2019-10-13 19:51:56,740 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:51:56,741 INFO L410 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:56,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:56,741 INFO L82 PathProgramCache]: Analyzing trace with hash -942091271, now seen corresponding path program 1 times [2019-10-13 19:51:56,741 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:56,741 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793713014] [2019-10-13 19:51:56,741 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:56,742 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:56,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:56,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:56,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:56,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:56,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:56,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:56,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:56,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:56,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:56,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:56,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:56,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:56,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:56,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:56,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:56,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:56,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:56,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:56,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:56,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:56,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:56,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:56,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:57,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:57,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:57,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:57,075 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-13 19:51:57,075 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793713014] [2019-10-13 19:51:57,076 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257106030] [2019-10-13 19:51:57,076 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-13 19:51:57,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:57,318 INFO L256 TraceCheckSpWp]: Trace formula consists of 849 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-13 19:51:57,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:51:57,496 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 14 proven. 63 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-13 19:51:57,496 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:51:57,497 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5] total 16 [2019-10-13 19:51:57,497 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774084277] [2019-10-13 19:51:57,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-13 19:51:57,499 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:57,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-13 19:51:57,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-10-13 19:51:57,500 INFO L87 Difference]: Start difference. First operand 7345 states and 9588 transitions. Second operand 16 states.