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 --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/systemc/transmitter.04.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 17:16:17,041 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 17:16:17,045 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 17:16:17,061 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 17:16:17,061 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 17:16:17,063 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 17:16:17,064 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 17:16:17,073 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 17:16:17,075 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 17:16:17,077 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 17:16:17,078 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 17:16:17,080 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 17:16:17,081 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 17:16:17,084 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 17:16:17,087 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 17:16:17,088 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 17:16:17,089 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 17:16:17,089 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 17:16:17,091 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 17:16:17,093 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 17:16:17,094 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 17:16:17,095 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 17:16:17,096 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 17:16:17,096 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 17:16:17,098 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 17:16:17,099 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 17:16:17,099 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 17:16:17,100 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 17:16:17,100 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 17:16:17,101 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 17:16:17,101 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 17:16:17,102 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 17:16:17,102 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 17:16:17,103 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 17:16:17,104 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 17:16:17,104 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 17:16:17,105 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 17:16:17,105 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 17:16:17,105 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 17:16:17,106 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 17:16:17,107 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 17:16:17,107 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-07 17:16:17,121 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 17:16:17,121 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 17:16:17,122 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 17:16:17,123 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 17:16:17,123 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 17:16:17,123 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 17:16:17,123 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 17:16:17,123 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 17:16:17,124 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 17:16:17,124 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 17:16:17,124 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 17:16:17,124 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 17:16:17,124 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 17:16:17,125 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 17:16:17,125 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 17:16:17,125 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 17:16:17,125 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 17:16:17,125 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 17:16:17,126 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 17:16:17,126 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 17:16:17,126 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 17:16:17,126 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 17:16:17,126 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 17:16:17,126 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 17:16:17,127 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 17:16:17,127 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 17:16:17,127 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 17:16:17,127 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 17:16:17,127 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-07 17:16:17,393 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 17:16:17,415 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 17:16:17,418 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 17:16:17,420 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 17:16:17,420 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 17:16:17,421 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/transmitter.04.cil.c [2019-10-07 17:16:17,494 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d9641806/15fb31b1a6c24d73bb3d0a3ff9ebf8fe/FLAG604c9f68c [2019-10-07 17:16:18,001 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 17:16:18,003 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/transmitter.04.cil.c [2019-10-07 17:16:18,034 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d9641806/15fb31b1a6c24d73bb3d0a3ff9ebf8fe/FLAG604c9f68c [2019-10-07 17:16:18,330 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d9641806/15fb31b1a6c24d73bb3d0a3ff9ebf8fe [2019-10-07 17:16:18,339 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 17:16:18,341 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 17:16:18,342 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 17:16:18,342 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 17:16:18,345 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 17:16:18,346 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 05:16:18" (1/1) ... [2019-10-07 17:16:18,349 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f82b407 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:16:18, skipping insertion in model container [2019-10-07 17:16:18,349 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 05:16:18" (1/1) ... [2019-10-07 17:16:18,357 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 17:16:18,402 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 17:16:18,628 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 17:16:18,635 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 17:16:18,794 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 17:16:18,819 INFO L192 MainTranslator]: Completed translation [2019-10-07 17:16:18,819 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:16:18 WrapperNode [2019-10-07 17:16:18,820 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 17:16:18,820 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 17:16:18,820 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 17:16:18,821 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 17:16:18,831 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:16:18" (1/1) ... [2019-10-07 17:16:18,831 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:16:18" (1/1) ... [2019-10-07 17:16:18,840 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:16:18" (1/1) ... [2019-10-07 17:16:18,840 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:16:18" (1/1) ... [2019-10-07 17:16:18,853 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:16:18" (1/1) ... [2019-10-07 17:16:18,872 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:16:18" (1/1) ... [2019-10-07 17:16:18,875 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:16:18" (1/1) ... [2019-10-07 17:16:18,882 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 17:16:18,883 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 17:16:18,883 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 17:16:18,883 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 17:16:18,884 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:16:18" (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-07 17:16:18,934 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 17:16:18,934 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 17:16:18,934 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-10-07 17:16:18,934 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2019-10-07 17:16:18,934 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2019-10-07 17:16:18,934 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2019-10-07 17:16:18,935 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit3 [2019-10-07 17:16:18,935 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit4 [2019-10-07 17:16:18,935 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2019-10-07 17:16:18,935 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2019-10-07 17:16:18,935 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2019-10-07 17:16:18,935 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit3_triggered [2019-10-07 17:16:18,936 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit4_triggered [2019-10-07 17:16:18,936 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-10-07 17:16:18,936 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-10-07 17:16:18,936 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-10-07 17:16:18,936 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-10-07 17:16:18,936 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-10-07 17:16:18,937 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-10-07 17:16:18,937 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-10-07 17:16:18,937 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-10-07 17:16:18,937 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-10-07 17:16:18,937 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-10-07 17:16:18,937 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-10-07 17:16:18,938 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-10-07 17:16:18,938 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-10-07 17:16:18,938 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 17:16:18,938 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 17:16:18,938 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 17:16:18,938 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-10-07 17:16:18,938 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2019-10-07 17:16:18,939 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2019-10-07 17:16:18,939 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2019-10-07 17:16:18,939 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit3_triggered [2019-10-07 17:16:18,939 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit4_triggered [2019-10-07 17:16:18,939 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-10-07 17:16:18,939 INFO L130 BoogieDeclarations]: Found specification of procedure master [2019-10-07 17:16:18,939 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2019-10-07 17:16:18,939 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2019-10-07 17:16:18,939 INFO L130 BoogieDeclarations]: Found specification of procedure transmit3 [2019-10-07 17:16:18,940 INFO L130 BoogieDeclarations]: Found specification of procedure transmit4 [2019-10-07 17:16:18,940 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-10-07 17:16:18,940 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-10-07 17:16:18,940 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-10-07 17:16:18,940 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-10-07 17:16:18,940 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-10-07 17:16:18,940 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-10-07 17:16:18,940 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-10-07 17:16:18,940 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-10-07 17:16:18,940 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-10-07 17:16:18,941 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-10-07 17:16:18,941 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-10-07 17:16:18,941 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-10-07 17:16:18,941 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 17:16:18,941 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 17:16:18,941 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 17:16:20,167 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 17:16:20,167 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-10-07 17:16:20,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 05:16:20 BoogieIcfgContainer [2019-10-07 17:16:20,169 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 17:16:20,170 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 17:16:20,170 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 17:16:20,173 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 17:16:20,174 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 05:16:18" (1/3) ... [2019-10-07 17:16:20,174 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d56c7c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 05:16:20, skipping insertion in model container [2019-10-07 17:16:20,175 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:16:18" (2/3) ... [2019-10-07 17:16:20,175 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d56c7c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 05:16:20, skipping insertion in model container [2019-10-07 17:16:20,175 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 05:16:20" (3/3) ... [2019-10-07 17:16:20,177 INFO L109 eAbstractionObserver]: Analyzing ICFG transmitter.04.cil.c [2019-10-07 17:16:20,188 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 17:16:20,197 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 17:16:20,208 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 17:16:20,236 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 17:16:20,236 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 17:16:20,236 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 17:16:20,236 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 17:16:20,237 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 17:16:20,237 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 17:16:20,237 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 17:16:20,237 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 17:16:20,260 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states. [2019-10-07 17:16:20,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-10-07 17:16:20,271 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:16:20,272 INFO L385 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] [2019-10-07 17:16:20,274 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:16:20,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:16:20,280 INFO L82 PathProgramCache]: Analyzing trace with hash 278306888, now seen corresponding path program 1 times [2019-10-07 17:16:20,289 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:16:20,290 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:16:20,290 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:16:20,290 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:16:20,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:16:20,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:16:20,672 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-07 17:16:20,673 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:16:20,673 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 17:16:20,674 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 17:16:20,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 17:16:20,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 17:16:20,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 17:16:20,702 INFO L87 Difference]: Start difference. First operand 157 states. Second operand 4 states. [2019-10-07 17:16:21,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 17:16:21,091 INFO L93 Difference]: Finished difference Result 432 states and 596 transitions. [2019-10-07 17:16:21,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 17:16:21,093 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-10-07 17:16:21,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 17:16:21,109 INFO L225 Difference]: With dead ends: 432 [2019-10-07 17:16:21,110 INFO L226 Difference]: Without dead ends: 279 [2019-10-07 17:16:21,116 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 17:16:21,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-10-07 17:16:21,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 275. [2019-10-07 17:16:21,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2019-10-07 17:16:21,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 351 transitions. [2019-10-07 17:16:21,261 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 351 transitions. Word has length 80 [2019-10-07 17:16:21,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 17:16:21,262 INFO L462 AbstractCegarLoop]: Abstraction has 275 states and 351 transitions. [2019-10-07 17:16:21,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 17:16:21,263 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 351 transitions. [2019-10-07 17:16:21,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-10-07 17:16:21,267 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:16:21,267 INFO L385 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] [2019-10-07 17:16:21,268 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:16:21,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:16:21,268 INFO L82 PathProgramCache]: Analyzing trace with hash -2118130103, now seen corresponding path program 1 times [2019-10-07 17:16:21,269 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:16:21,269 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:16:21,269 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:16:21,269 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:16:21,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:16:21,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:16:21,435 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-07 17:16:21,436 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:16:21,436 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 17:16:21,436 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 17:16:21,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 17:16:21,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 17:16:21,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 17:16:21,440 INFO L87 Difference]: Start difference. First operand 275 states and 351 transitions. Second operand 4 states. [2019-10-07 17:16:21,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 17:16:21,753 INFO L93 Difference]: Finished difference Result 784 states and 1055 transitions. [2019-10-07 17:16:21,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 17:16:21,756 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-10-07 17:16:21,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 17:16:21,765 INFO L225 Difference]: With dead ends: 784 [2019-10-07 17:16:21,766 INFO L226 Difference]: Without dead ends: 525 [2019-10-07 17:16:21,773 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 17:16:21,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2019-10-07 17:16:21,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 520. [2019-10-07 17:16:21,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2019-10-07 17:16:21,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 660 transitions. [2019-10-07 17:16:21,855 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 660 transitions. Word has length 80 [2019-10-07 17:16:21,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 17:16:21,855 INFO L462 AbstractCegarLoop]: Abstraction has 520 states and 660 transitions. [2019-10-07 17:16:21,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 17:16:21,856 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 660 transitions. [2019-10-07 17:16:21,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-10-07 17:16:21,864 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:16:21,865 INFO L385 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] [2019-10-07 17:16:21,865 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:16:21,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:16:21,866 INFO L82 PathProgramCache]: Analyzing trace with hash 412020584, now seen corresponding path program 1 times [2019-10-07 17:16:21,866 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:16:21,866 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:16:21,866 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:16:21,866 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:16:21,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:16:21,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:16:22,029 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-07 17:16:22,029 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:16:22,030 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 17:16:22,030 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 17:16:22,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 17:16:22,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 17:16:22,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 17:16:22,031 INFO L87 Difference]: Start difference. First operand 520 states and 660 transitions. Second operand 4 states. [2019-10-07 17:16:22,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 17:16:22,337 INFO L93 Difference]: Finished difference Result 1512 states and 2034 transitions. [2019-10-07 17:16:22,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 17:16:22,337 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-10-07 17:16:22,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 17:16:22,345 INFO L225 Difference]: With dead ends: 1512 [2019-10-07 17:16:22,345 INFO L226 Difference]: Without dead ends: 1008 [2019-10-07 17:16:22,348 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 17:16:22,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008 states. [2019-10-07 17:16:22,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008 to 999. [2019-10-07 17:16:22,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 999 states. [2019-10-07 17:16:22,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 999 states and 1261 transitions. [2019-10-07 17:16:22,415 INFO L78 Accepts]: Start accepts. Automaton has 999 states and 1261 transitions. Word has length 80 [2019-10-07 17:16:22,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 17:16:22,416 INFO L462 AbstractCegarLoop]: Abstraction has 999 states and 1261 transitions. [2019-10-07 17:16:22,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 17:16:22,416 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 1261 transitions. [2019-10-07 17:16:22,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-07 17:16:22,419 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:16:22,421 INFO L385 BasicCegarLoop]: trace histogram [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] [2019-10-07 17:16:22,421 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:16:22,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:16:22,422 INFO L82 PathProgramCache]: Analyzing trace with hash -131310214, now seen corresponding path program 1 times [2019-10-07 17:16:22,422 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:16:22,422 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:16:22,422 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:16:22,422 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:16:22,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:16:22,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:16:22,516 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-07 17:16:22,516 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:16:22,516 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 17:16:22,517 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 17:16:22,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 17:16:22,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 17:16:22,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 17:16:22,520 INFO L87 Difference]: Start difference. First operand 999 states and 1261 transitions. Second operand 4 states. [2019-10-07 17:16:22,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 17:16:22,717 INFO L93 Difference]: Finished difference Result 3057 states and 3972 transitions. [2019-10-07 17:16:22,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 17:16:22,718 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-10-07 17:16:22,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 17:16:22,733 INFO L225 Difference]: With dead ends: 3057 [2019-10-07 17:16:22,734 INFO L226 Difference]: Without dead ends: 2075 [2019-10-07 17:16:22,739 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 17:16:22,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2075 states. [2019-10-07 17:16:22,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2075 to 1389. [2019-10-07 17:16:22,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1389 states. [2019-10-07 17:16:22,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1389 states to 1389 states and 1848 transitions. [2019-10-07 17:16:22,887 INFO L78 Accepts]: Start accepts. Automaton has 1389 states and 1848 transitions. Word has length 96 [2019-10-07 17:16:22,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 17:16:22,887 INFO L462 AbstractCegarLoop]: Abstraction has 1389 states and 1848 transitions. [2019-10-07 17:16:22,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 17:16:22,888 INFO L276 IsEmpty]: Start isEmpty. Operand 1389 states and 1848 transitions. [2019-10-07 17:16:22,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-07 17:16:22,893 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:16:22,894 INFO L385 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, 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] [2019-10-07 17:16:22,894 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:16:22,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:16:22,895 INFO L82 PathProgramCache]: Analyzing trace with hash -427602276, now seen corresponding path program 1 times [2019-10-07 17:16:22,895 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:16:22,895 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:16:22,895 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:16:22,895 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:16:22,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:16:22,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:16:22,972 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-07 17:16:22,973 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:16:22,973 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 17:16:22,973 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 17:16:22,974 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 17:16:22,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 17:16:22,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 17:16:22,974 INFO L87 Difference]: Start difference. First operand 1389 states and 1848 transitions. Second operand 3 states. [2019-10-07 17:16:23,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 17:16:23,108 INFO L93 Difference]: Finished difference Result 3601 states and 4907 transitions. [2019-10-07 17:16:23,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 17:16:23,109 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 144 [2019-10-07 17:16:23,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 17:16:23,126 INFO L225 Difference]: With dead ends: 3601 [2019-10-07 17:16:23,126 INFO L226 Difference]: Without dead ends: 2229 [2019-10-07 17:16:23,136 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 17:16:23,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2229 states. [2019-10-07 17:16:23,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2229 to 1917. [2019-10-07 17:16:23,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1917 states. [2019-10-07 17:16:23,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1917 states to 1917 states and 2616 transitions. [2019-10-07 17:16:23,267 INFO L78 Accepts]: Start accepts. Automaton has 1917 states and 2616 transitions. Word has length 144 [2019-10-07 17:16:23,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 17:16:23,271 INFO L462 AbstractCegarLoop]: Abstraction has 1917 states and 2616 transitions. [2019-10-07 17:16:23,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 17:16:23,271 INFO L276 IsEmpty]: Start isEmpty. Operand 1917 states and 2616 transitions. [2019-10-07 17:16:23,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-07 17:16:23,279 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:16:23,280 INFO L385 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, 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] [2019-10-07 17:16:23,280 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:16:23,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:16:23,280 INFO L82 PathProgramCache]: Analyzing trace with hash 232824637, now seen corresponding path program 1 times [2019-10-07 17:16:23,288 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:16:23,289 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:16:23,289 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:16:23,289 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:16:23,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:16:23,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:16:23,467 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-07 17:16:23,467 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:16:23,467 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 17:16:23,468 INFO L95 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-07 17:16:23,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:16:23,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 917 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-07 17:16:23,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 17:16:23,694 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-07 17:16:23,694 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 17:16:23,893 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-07 17:16:23,893 INFO L211 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-07 17:16:23,894 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [6] total 7 [2019-10-07 17:16:23,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 17:16:23,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 17:16:23,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-07 17:16:23,895 INFO L87 Difference]: Start difference. First operand 1917 states and 2616 transitions. Second operand 4 states. [2019-10-07 17:16:24,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 17:16:24,370 INFO L93 Difference]: Finished difference Result 5662 states and 8096 transitions. [2019-10-07 17:16:24,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 17:16:24,371 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2019-10-07 17:16:24,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 17:16:24,398 INFO L225 Difference]: With dead ends: 5662 [2019-10-07 17:16:24,398 INFO L226 Difference]: Without dead ends: 3761 [2019-10-07 17:16:24,416 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-07 17:16:24,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3761 states. [2019-10-07 17:16:24,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3761 to 3701. [2019-10-07 17:16:24,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3701 states. [2019-10-07 17:16:24,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3701 states to 3701 states and 5024 transitions. [2019-10-07 17:16:24,654 INFO L78 Accepts]: Start accepts. Automaton has 3701 states and 5024 transitions. Word has length 145 [2019-10-07 17:16:24,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 17:16:24,655 INFO L462 AbstractCegarLoop]: Abstraction has 3701 states and 5024 transitions. [2019-10-07 17:16:24,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 17:16:24,655 INFO L276 IsEmpty]: Start isEmpty. Operand 3701 states and 5024 transitions. [2019-10-07 17:16:24,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-07 17:16:24,666 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:16:24,666 INFO L385 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, 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] [2019-10-07 17:16:24,871 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 17:16:24,872 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:16:24,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:16:24,872 INFO L82 PathProgramCache]: Analyzing trace with hash -2106707675, now seen corresponding path program 1 times [2019-10-07 17:16:24,873 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:16:24,873 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:16:24,873 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:16:24,873 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:16:24,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:16:24,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:16:25,031 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-07 17:16:25,031 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:16:25,031 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 17:16:25,031 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 17:16:25,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 17:16:25,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 17:16:25,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 17:16:25,033 INFO L87 Difference]: Start difference. First operand 3701 states and 5024 transitions. Second operand 3 states. [2019-10-07 17:16:25,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 17:16:25,360 INFO L93 Difference]: Finished difference Result 9555 states and 13238 transitions. [2019-10-07 17:16:25,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 17:16:25,360 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 146 [2019-10-07 17:16:25,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 17:16:25,394 INFO L225 Difference]: With dead ends: 9555 [2019-10-07 17:16:25,394 INFO L226 Difference]: Without dead ends: 5871 [2019-10-07 17:16:25,419 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 17:16:25,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5871 states. [2019-10-07 17:16:25,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5871 to 5395. [2019-10-07 17:16:25,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5395 states. [2019-10-07 17:16:25,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5395 states to 5395 states and 7378 transitions. [2019-10-07 17:16:25,804 INFO L78 Accepts]: Start accepts. Automaton has 5395 states and 7378 transitions. Word has length 146 [2019-10-07 17:16:25,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 17:16:25,805 INFO L462 AbstractCegarLoop]: Abstraction has 5395 states and 7378 transitions. [2019-10-07 17:16:25,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 17:16:25,805 INFO L276 IsEmpty]: Start isEmpty. Operand 5395 states and 7378 transitions. [2019-10-07 17:16:25,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-07 17:16:25,817 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:16:25,818 INFO L385 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 17:16:25,818 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:16:25,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:16:25,819 INFO L82 PathProgramCache]: Analyzing trace with hash 659427717, now seen corresponding path program 1 times [2019-10-07 17:16:25,819 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:16:25,819 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:16:25,819 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:16:25,819 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:16:25,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:16:25,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:16:25,946 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-07 17:16:25,946 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:16:25,946 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 17:16:25,947 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-07 17:16:25,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-07 17:16:25,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-07 17:16:25,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-07 17:16:25,948 INFO L87 Difference]: Start difference. First operand 5395 states and 7378 transitions. Second operand 8 states. [2019-10-07 17:16:27,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 17:16:27,407 INFO L93 Difference]: Finished difference Result 14473 states and 20739 transitions. [2019-10-07 17:16:27,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-07 17:16:27,408 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 147 [2019-10-07 17:16:27,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 17:16:27,486 INFO L225 Difference]: With dead ends: 14473 [2019-10-07 17:16:27,486 INFO L226 Difference]: Without dead ends: 9095 [2019-10-07 17:16:27,550 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2019-10-07 17:16:27,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9095 states. [2019-10-07 17:16:28,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9095 to 9024. [2019-10-07 17:16:28,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9024 states. [2019-10-07 17:16:28,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9024 states to 9024 states and 12956 transitions. [2019-10-07 17:16:28,291 INFO L78 Accepts]: Start accepts. Automaton has 9024 states and 12956 transitions. Word has length 147 [2019-10-07 17:16:28,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 17:16:28,292 INFO L462 AbstractCegarLoop]: Abstraction has 9024 states and 12956 transitions. [2019-10-07 17:16:28,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-07 17:16:28,293 INFO L276 IsEmpty]: Start isEmpty. Operand 9024 states and 12956 transitions. [2019-10-07 17:16:28,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-07 17:16:28,312 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:16:28,312 INFO L385 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, 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] [2019-10-07 17:16:28,312 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:16:28,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:16:28,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1200881990, now seen corresponding path program 1 times [2019-10-07 17:16:28,313 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:16:28,313 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:16:28,314 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:16:28,314 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:16:28,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:16:28,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:16:28,413 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-07 17:16:28,414 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:16:28,414 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 17:16:28,414 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 17:16:28,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 17:16:28,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 17:16:28,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 17:16:28,415 INFO L87 Difference]: Start difference. First operand 9024 states and 12956 transitions. Second operand 4 states. [2019-10-07 17:16:29,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 17:16:29,281 INFO L93 Difference]: Finished difference Result 14932 states and 21245 transitions. [2019-10-07 17:16:29,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 17:16:29,281 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 146 [2019-10-07 17:16:29,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 17:16:29,361 INFO L225 Difference]: With dead ends: 14932 [2019-10-07 17:16:29,361 INFO L226 Difference]: Without dead ends: 11100 [2019-10-07 17:16:29,388 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 17:16:29,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11100 states. [2019-10-07 17:16:30,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11100 to 11024. [2019-10-07 17:16:30,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11024 states. [2019-10-07 17:16:30,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11024 states to 11024 states and 15154 transitions. [2019-10-07 17:16:30,822 INFO L78 Accepts]: Start accepts. Automaton has 11024 states and 15154 transitions. Word has length 146 [2019-10-07 17:16:30,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 17:16:30,824 INFO L462 AbstractCegarLoop]: Abstraction has 11024 states and 15154 transitions. [2019-10-07 17:16:30,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 17:16:30,824 INFO L276 IsEmpty]: Start isEmpty. Operand 11024 states and 15154 transitions. [2019-10-07 17:16:30,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-07 17:16:30,844 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:16:30,844 INFO L385 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, 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] [2019-10-07 17:16:30,845 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:16:30,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:16:30,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1049664021, now seen corresponding path program 1 times [2019-10-07 17:16:30,845 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:16:30,845 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:16:30,846 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:16:30,846 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:16:30,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:16:30,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:16:30,990 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-07 17:16:30,990 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:16:30,991 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 17:16:30,991 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-07 17:16:30,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-07 17:16:30,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-07 17:16:30,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-07 17:16:30,992 INFO L87 Difference]: Start difference. First operand 11024 states and 15154 transitions. Second operand 9 states. [2019-10-07 17:16:33,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 17:16:33,368 INFO L93 Difference]: Finished difference Result 34615 states and 49495 transitions. [2019-10-07 17:16:33,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-07 17:16:33,368 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 147 [2019-10-07 17:16:33,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 17:16:33,479 INFO L225 Difference]: With dead ends: 34615 [2019-10-07 17:16:33,479 INFO L226 Difference]: Without dead ends: 19246 [2019-10-07 17:16:33,580 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2019-10-07 17:16:33,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19246 states. [2019-10-07 17:16:34,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19246 to 17938. [2019-10-07 17:16:34,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17938 states. [2019-10-07 17:16:34,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17938 states to 17938 states and 24931 transitions. [2019-10-07 17:16:34,901 INFO L78 Accepts]: Start accepts. Automaton has 17938 states and 24931 transitions. Word has length 147 [2019-10-07 17:16:34,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 17:16:34,902 INFO L462 AbstractCegarLoop]: Abstraction has 17938 states and 24931 transitions. [2019-10-07 17:16:34,902 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-07 17:16:34,902 INFO L276 IsEmpty]: Start isEmpty. Operand 17938 states and 24931 transitions. [2019-10-07 17:16:34,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-07 17:16:34,920 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:16:34,920 INFO L385 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, 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] [2019-10-07 17:16:34,920 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:16:34,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:16:34,921 INFO L82 PathProgramCache]: Analyzing trace with hash 432632579, now seen corresponding path program 1 times [2019-10-07 17:16:34,921 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:16:34,921 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:16:34,921 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:16:34,921 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:16:34,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:16:34,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:16:34,994 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-07 17:16:34,994 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:16:34,994 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 17:16:34,994 INFO L95 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-07 17:16:35,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:16:35,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 957 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-07 17:16:35,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 17:16:35,238 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 17:16:35,238 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 17:16:35,430 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-07 17:16:35,430 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-07 17:16:35,431 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 3] total 6 [2019-10-07 17:16:35,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 17:16:35,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 17:16:35,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-07 17:16:35,432 INFO L87 Difference]: Start difference. First operand 17938 states and 24931 transitions. Second operand 3 states. [2019-10-07 17:16:37,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 17:16:37,181 INFO L93 Difference]: Finished difference Result 34041 states and 49118 transitions. [2019-10-07 17:16:37,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 17:16:37,181 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2019-10-07 17:16:37,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 17:16:37,320 INFO L225 Difference]: With dead ends: 34041 [2019-10-07 17:16:37,320 INFO L226 Difference]: Without dead ends: 24031 [2019-10-07 17:16:37,387 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-07 17:16:37,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24031 states. [2019-10-07 17:16:38,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24031 to 21251. [2019-10-07 17:16:38,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21251 states. [2019-10-07 17:16:39,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21251 states to 21251 states and 29982 transitions. [2019-10-07 17:16:39,138 INFO L78 Accepts]: Start accepts. Automaton has 21251 states and 29982 transitions. Word has length 149 [2019-10-07 17:16:39,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 17:16:39,138 INFO L462 AbstractCegarLoop]: Abstraction has 21251 states and 29982 transitions. [2019-10-07 17:16:39,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 17:16:39,139 INFO L276 IsEmpty]: Start isEmpty. Operand 21251 states and 29982 transitions. [2019-10-07 17:16:39,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-10-07 17:16:39,169 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:16:39,169 INFO L385 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-07 17:16:39,383 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 17:16:39,383 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:16:39,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:16:39,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1641123869, now seen corresponding path program 1 times [2019-10-07 17:16:39,385 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:16:39,385 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:16:39,385 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:16:39,385 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:16:39,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:16:39,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:16:39,901 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 21 proven. 14 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-10-07 17:16:39,901 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:16:39,901 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 17:16:39,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 17:16:40,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:16:40,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 1058 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-07 17:16:40,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 17:16:41,164 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-07 17:16:41,165 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 17:16:41,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:16:41,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:16:41,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:16:41,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:16:41,545 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 23 proven. 12 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-10-07 17:16:41,546 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-07 17:16:41,546 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [21, 8] total 34 [2019-10-07 17:16:41,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-07 17:16:41,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-07 17:16:41,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=987, Unknown=0, NotChecked=0, Total=1122 [2019-10-07 17:16:41,549 INFO L87 Difference]: Start difference. First operand 21251 states and 29982 transitions. Second operand 11 states. [2019-10-07 17:16:45,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 17:16:45,851 INFO L93 Difference]: Finished difference Result 79763 states and 138390 transitions. [2019-10-07 17:16:45,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-07 17:16:45,851 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 170 [2019-10-07 17:16:45,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 17:16:46,249 INFO L225 Difference]: With dead ends: 79763 [2019-10-07 17:16:46,249 INFO L226 Difference]: Without dead ends: 58529 [2019-10-07 17:16:46,511 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 332 SyntacticMatches, 4 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 631 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=295, Invalid=1961, Unknown=0, NotChecked=0, Total=2256 [2019-10-07 17:16:46,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58529 states. [2019-10-07 17:16:52,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58529 to 54871. [2019-10-07 17:16:52,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54871 states. [2019-10-07 17:16:52,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54871 states to 54871 states and 90096 transitions. [2019-10-07 17:16:52,646 INFO L78 Accepts]: Start accepts. Automaton has 54871 states and 90096 transitions. Word has length 170 [2019-10-07 17:16:52,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 17:16:52,647 INFO L462 AbstractCegarLoop]: Abstraction has 54871 states and 90096 transitions. [2019-10-07 17:16:52,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-07 17:16:52,647 INFO L276 IsEmpty]: Start isEmpty. Operand 54871 states and 90096 transitions. [2019-10-07 17:16:52,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-10-07 17:16:52,715 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:16:52,716 INFO L385 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-07 17:16:52,919 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 17:16:52,920 INFO L410 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:16:52,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:16:52,920 INFO L82 PathProgramCache]: Analyzing trace with hash -123231825, now seen corresponding path program 1 times [2019-10-07 17:16:52,920 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:16:52,920 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:16:52,921 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:16:52,921 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:16:52,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:16:52,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:16:53,088 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 21 proven. 11 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-10-07 17:16:53,088 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:16:53,089 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 17:16:53,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 17:16:53,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:16:53,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 1072 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-07 17:16:53,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 17:16:53,392 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-07 17:16:53,393 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 17:16:53,794 WARN L191 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 31 [2019-10-07 17:16:54,227 WARN L191 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 31 [2019-10-07 17:16:54,342 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 25 proven. 3 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-10-07 17:16:54,343 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-07 17:16:54,343 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11, 6] total 18 [2019-10-07 17:16:54,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 17:16:54,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 17:16:54,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2019-10-07 17:16:54,345 INFO L87 Difference]: Start difference. First operand 54871 states and 90096 transitions. Second operand 6 states. [2019-10-07 17:16:59,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 17:16:59,531 INFO L93 Difference]: Finished difference Result 113357 states and 184614 transitions. [2019-10-07 17:16:59,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-07 17:16:59,532 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 172 [2019-10-07 17:16:59,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 17:16:59,827 INFO L225 Difference]: With dead ends: 113357 [2019-10-07 17:16:59,828 INFO L226 Difference]: Without dead ends: 58503 [2019-10-07 17:17:00,198 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 340 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2019-10-07 17:17:00,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58503 states. [2019-10-07 17:17:02,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58503 to 44461. [2019-10-07 17:17:02,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44461 states. [2019-10-07 17:17:02,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44461 states to 44461 states and 65605 transitions. [2019-10-07 17:17:02,986 INFO L78 Accepts]: Start accepts. Automaton has 44461 states and 65605 transitions. Word has length 172 [2019-10-07 17:17:02,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 17:17:02,987 INFO L462 AbstractCegarLoop]: Abstraction has 44461 states and 65605 transitions. [2019-10-07 17:17:02,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 17:17:02,987 INFO L276 IsEmpty]: Start isEmpty. Operand 44461 states and 65605 transitions. [2019-10-07 17:17:03,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-10-07 17:17:03,043 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:17:03,043 INFO L385 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 17:17:03,247 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 17:17:03,251 INFO L410 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:17:03,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:17:03,251 INFO L82 PathProgramCache]: Analyzing trace with hash -526571907, now seen corresponding path program 1 times [2019-10-07 17:17:03,251 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:17:03,251 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:17:03,251 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:17:03,251 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:17:03,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:17:03,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:17:03,337 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 19 proven. 17 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-10-07 17:17:03,337 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:17:03,337 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 17:17:03,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 17:17:03,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:17:03,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 1104 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-07 17:17:03,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 17:17:03,567 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-07 17:17:03,567 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 17:17:03,682 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-10-07 17:17:03,682 INFO L211 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-07 17:17:03,682 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [5] total 6 [2019-10-07 17:17:03,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 17:17:03,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 17:17:03,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-07 17:17:03,684 INFO L87 Difference]: Start difference. First operand 44461 states and 65605 transitions. Second operand 4 states. [2019-10-07 17:17:06,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 17:17:06,360 INFO L93 Difference]: Finished difference Result 93643 states and 145718 transitions. [2019-10-07 17:17:06,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 17:17:06,360 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 177 [2019-10-07 17:17:06,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 17:17:06,575 INFO L225 Difference]: With dead ends: 93643 [2019-10-07 17:17:06,575 INFO L226 Difference]: Without dead ends: 49200 [2019-10-07 17:17:06,989 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 356 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-07 17:17:07,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49200 states. [2019-10-07 17:17:11,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49200 to 48354. [2019-10-07 17:17:11,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48354 states. [2019-10-07 17:17:11,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48354 states to 48354 states and 67958 transitions. [2019-10-07 17:17:11,475 INFO L78 Accepts]: Start accepts. Automaton has 48354 states and 67958 transitions. Word has length 177 [2019-10-07 17:17:11,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 17:17:11,476 INFO L462 AbstractCegarLoop]: Abstraction has 48354 states and 67958 transitions. [2019-10-07 17:17:11,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 17:17:11,476 INFO L276 IsEmpty]: Start isEmpty. Operand 48354 states and 67958 transitions. [2019-10-07 17:17:11,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-10-07 17:17:11,498 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:17:11,498 INFO L385 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-07 17:17:11,702 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 17:17:11,703 INFO L410 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:17:11,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:17:11,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1991957322, now seen corresponding path program 1 times [2019-10-07 17:17:11,704 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:17:11,704 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:17:11,704 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:17:11,704 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:17:11,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:17:11,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:17:12,099 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 15 proven. 8 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-10-07 17:17:12,101 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:17:12,101 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 17:17:12,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 17:17:12,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:17:12,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 1147 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-07 17:17:12,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 17:17:12,394 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-10-07 17:17:12,394 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 17:17:12,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:17:12,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:17:12,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:17:12,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:17:12,773 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-10-07 17:17:12,774 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-07 17:17:12,774 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [4, 7] total 14 [2019-10-07 17:17:12,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-07 17:17:12,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-07 17:17:12,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2019-10-07 17:17:12,776 INFO L87 Difference]: Start difference. First operand 48354 states and 67958 transitions. Second operand 9 states. [2019-10-07 17:17:16,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 17:17:16,154 INFO L93 Difference]: Finished difference Result 90330 states and 130066 transitions. [2019-10-07 17:17:16,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-07 17:17:16,154 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 200 [2019-10-07 17:17:16,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 17:17:16,275 INFO L225 Difference]: With dead ends: 90330 [2019-10-07 17:17:16,276 INFO L226 Difference]: Without dead ends: 42923 [2019-10-07 17:17:16,419 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 393 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2019-10-07 17:17:16,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42923 states. [2019-10-07 17:17:18,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42923 to 41006. [2019-10-07 17:17:18,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41006 states. [2019-10-07 17:17:18,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41006 states to 41006 states and 58693 transitions. [2019-10-07 17:17:18,323 INFO L78 Accepts]: Start accepts. Automaton has 41006 states and 58693 transitions. Word has length 200 [2019-10-07 17:17:18,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 17:17:18,323 INFO L462 AbstractCegarLoop]: Abstraction has 41006 states and 58693 transitions. [2019-10-07 17:17:18,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-07 17:17:18,323 INFO L276 IsEmpty]: Start isEmpty. Operand 41006 states and 58693 transitions. [2019-10-07 17:17:18,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-10-07 17:17:18,344 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:17:18,344 INFO L385 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-07 17:17:18,546 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 17:17:18,547 INFO L410 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:17:18,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:17:18,548 INFO L82 PathProgramCache]: Analyzing trace with hash 372412008, now seen corresponding path program 1 times [2019-10-07 17:17:18,548 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:17:18,549 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:17:18,549 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:17:18,549 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:17:18,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:17:18,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:17:20,818 WARN L191 SmtUtils]: Spent 2.18 s on a formula simplification. DAG size of input: 12 DAG size of output: 4 [2019-10-07 17:17:20,850 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 16 proven. 8 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-10-07 17:17:20,850 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:17:20,850 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 17:17:20,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 17:17:21,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:17:21,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 1161 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-07 17:17:21,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 17:17:21,284 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-10-07 17:17:21,284 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 17:17:21,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:17:21,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:17:21,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:17:21,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:17:21,718 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 10 proven. 24 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-10-07 17:17:21,719 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-07 17:17:21,720 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [4, 7] total 14 [2019-10-07 17:17:21,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-07 17:17:21,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-07 17:17:21,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2019-10-07 17:17:21,721 INFO L87 Difference]: Start difference. First operand 41006 states and 58693 transitions. Second operand 9 states. [2019-10-07 17:17:26,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 17:17:26,292 INFO L93 Difference]: Finished difference Result 113320 states and 184823 transitions. [2019-10-07 17:17:26,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-07 17:17:26,292 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 202 [2019-10-07 17:17:26,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 17:17:26,536 INFO L225 Difference]: With dead ends: 113320 [2019-10-07 17:17:26,536 INFO L226 Difference]: Without dead ends: 72498 [2019-10-07 17:17:26,843 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 397 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2019-10-07 17:17:26,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72498 states. [2019-10-07 17:17:34,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72498 to 69063. [2019-10-07 17:17:34,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69063 states. [2019-10-07 17:17:34,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69063 states to 69063 states and 105891 transitions. [2019-10-07 17:17:34,795 INFO L78 Accepts]: Start accepts. Automaton has 69063 states and 105891 transitions. Word has length 202 [2019-10-07 17:17:34,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 17:17:34,795 INFO L462 AbstractCegarLoop]: Abstraction has 69063 states and 105891 transitions. [2019-10-07 17:17:34,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-07 17:17:34,796 INFO L276 IsEmpty]: Start isEmpty. Operand 69063 states and 105891 transitions. [2019-10-07 17:17:34,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-10-07 17:17:34,823 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:17:34,823 INFO L385 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-07 17:17:35,023 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 17:17:35,024 INFO L410 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:17:35,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:17:35,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1799586198, now seen corresponding path program 1 times [2019-10-07 17:17:35,025 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:17:35,025 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:17:35,026 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:17:35,026 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:17:35,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:17:35,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:17:35,118 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 17 proven. 8 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-10-07 17:17:35,119 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:17:35,119 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 17:17:35,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 17:17:35,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:17:35,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 1175 conjuncts, 41 conjunts are in the unsatisfiable core [2019-10-07 17:17:35,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 17:17:35,551 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 70 proven. 40 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-07 17:17:35,551 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 17:17:35,983 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-10-07 17:17:35,984 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-07 17:17:35,984 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 8] total 12 [2019-10-07 17:17:35,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 17:17:35,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 17:17:35,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-10-07 17:17:35,986 INFO L87 Difference]: Start difference. First operand 69063 states and 105891 transitions. Second operand 4 states. [2019-10-07 17:17:39,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 17:17:39,620 INFO L93 Difference]: Finished difference Result 125636 states and 201878 transitions. [2019-10-07 17:17:39,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 17:17:39,620 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 204 [2019-10-07 17:17:39,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 17:17:39,811 INFO L225 Difference]: With dead ends: 125636 [2019-10-07 17:17:39,811 INFO L226 Difference]: Without dead ends: 62911 [2019-10-07 17:17:40,271 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 400 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-10-07 17:17:40,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62911 states. [2019-10-07 17:17:43,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62911 to 61481. [2019-10-07 17:17:43,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61481 states. [2019-10-07 17:17:48,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61481 states to 61481 states and 87352 transitions. [2019-10-07 17:17:48,112 INFO L78 Accepts]: Start accepts. Automaton has 61481 states and 87352 transitions. Word has length 204 [2019-10-07 17:17:48,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 17:17:48,113 INFO L462 AbstractCegarLoop]: Abstraction has 61481 states and 87352 transitions. [2019-10-07 17:17:48,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 17:17:48,113 INFO L276 IsEmpty]: Start isEmpty. Operand 61481 states and 87352 transitions. [2019-10-07 17:17:48,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-10-07 17:17:48,128 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:17:48,128 INFO L385 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-07 17:17:48,328 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 17:17:48,329 INFO L410 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:17:48,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:17:48,331 INFO L82 PathProgramCache]: Analyzing trace with hash 994226908, now seen corresponding path program 1 times [2019-10-07 17:17:48,332 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:17:48,332 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:17:48,332 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:17:48,332 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:17:48,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:17:48,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:17:48,432 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 17 proven. 8 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2019-10-07 17:17:48,432 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:17:48,432 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 17:17:48,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 17:17:48,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:17:48,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 1174 conjuncts, 45 conjunts are in the unsatisfiable core [2019-10-07 17:17:48,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 17:17:48,840 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 87 proven. 25 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-07 17:17:48,840 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 17:17:49,252 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 17 proven. 8 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2019-10-07 17:17:49,252 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 17:17:49,280 INFO L162 IcfgInterpreter]: Started Sifa with 108 locations of interest [2019-10-07 17:17:49,280 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 17:17:49,289 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 17:17:49,299 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 17:17:49,300 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 17:17:49,646 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 73 for LOIs [2019-10-07 17:17:49,688 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 119 for LOIs [2019-10-07 17:17:50,266 INFO L199 IcfgInterpreter]: Interpreting procedure init_model with input of size 75 for LOIs [2019-10-07 17:17:50,352 INFO L199 IcfgInterpreter]: Interpreting procedure start_simulation with input of size 124 for LOIs [2019-10-07 17:17:51,769 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-10-07 17:17:51,823 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-10-07 17:17:52,414 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 17:17:52,415 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: ε at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:177) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:133) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: ε at de.uni_freiburg.informatik.ultimate.lib.sifa.PriorityWorklist.add(PriorityWorklist.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.lambda$2(DagInterpreter.java:135) at java.lang.Iterable.forEach(Iterable.java:75) at java.util.Collections$UnmodifiableCollection.forEach(Collections.java:1080) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:135) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:104) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.TopInputCallSummarizer.computeTopSummary(TopInputCallSummarizer.java:78) at java.util.HashMap.computeIfAbsent(HashMap.java:1127) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.TopInputCallSummarizer.summarize(TopInputCallSummarizer.java:67) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretCallReturnSummary(DagInterpreter.java:230) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:214) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:197) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:166) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:130) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:104) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.TopInputCallSummarizer.computeTopSummary(TopInputCallSummarizer.java:78) at java.util.HashMap.computeIfAbsent(HashMap.java:1127) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.TopInputCallSummarizer.summarize(TopInputCallSummarizer.java:67) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretCallReturnSummary(DagInterpreter.java:230) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:214) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:197) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:166) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:130) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:139) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:99) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:99) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:287) ... 21 more [2019-10-07 17:17:52,425 INFO L168 Benchmark]: Toolchain (without parser) took 94082.64 ms. Allocated memory was 138.4 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 101.8 MB in the beginning and 2.8 GB in the end (delta: -2.7 GB). Peak memory consumption was 851.4 MB. Max. memory is 7.1 GB. [2019-10-07 17:17:52,426 INFO L168 Benchmark]: CDTParser took 1.28 ms. Allocated memory is still 138.4 MB. Free memory was 120.4 MB in the beginning and 120.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-07 17:17:52,427 INFO L168 Benchmark]: CACSL2BoogieTranslator took 478.30 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 101.6 MB in the beginning and 178.2 MB in the end (delta: -76.6 MB). Peak memory consumption was 26.7 MB. Max. memory is 7.1 GB. [2019-10-07 17:17:52,428 INFO L168 Benchmark]: Boogie Preprocessor took 62.32 ms. Allocated memory is still 202.9 MB. Free memory was 178.2 MB in the beginning and 175.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-10-07 17:17:52,429 INFO L168 Benchmark]: RCFGBuilder took 1285.75 ms. Allocated memory was 202.9 MB in the beginning and 235.9 MB in the end (delta: 33.0 MB). Free memory was 175.5 MB in the beginning and 191.5 MB in the end (delta: -16.0 MB). Peak memory consumption was 90.5 MB. Max. memory is 7.1 GB. [2019-10-07 17:17:52,429 INFO L168 Benchmark]: TraceAbstraction took 92251.70 ms. Allocated memory was 235.9 MB in the beginning and 3.7 GB in the end (delta: 3.4 GB). Free memory was 190.1 MB in the beginning and 2.8 GB in the end (delta: -2.6 GB). Peak memory consumption was 842.2 MB. Max. memory is 7.1 GB. [2019-10-07 17:17:52,433 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.28 ms. Allocated memory is still 138.4 MB. Free memory was 120.4 MB in the beginning and 120.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 478.30 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 101.6 MB in the beginning and 178.2 MB in the end (delta: -76.6 MB). Peak memory consumption was 26.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 62.32 ms. Allocated memory is still 202.9 MB. Free memory was 178.2 MB in the beginning and 175.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1285.75 ms. Allocated memory was 202.9 MB in the beginning and 235.9 MB in the end (delta: 33.0 MB). Free memory was 175.5 MB in the beginning and 191.5 MB in the end (delta: -16.0 MB). Peak memory consumption was 90.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 92251.70 ms. Allocated memory was 235.9 MB in the beginning and 3.7 GB in the end (delta: 3.4 GB). Free memory was 190.1 MB in the beginning and 2.8 GB in the end (delta: -2.6 GB). Peak memory consumption was 842.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: ε de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: ε: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:295) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...