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/token_ring.06.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 17:15:00,246 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 17:15:00,249 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 17:15:00,267 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 17:15:00,267 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 17:15:00,269 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 17:15:00,271 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 17:15:00,280 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 17:15:00,285 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 17:15:00,289 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 17:15:00,290 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 17:15:00,291 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 17:15:00,291 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 17:15:00,292 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 17:15:00,293 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 17:15:00,293 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 17:15:00,294 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 17:15:00,295 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 17:15:00,296 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 17:15:00,298 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 17:15:00,299 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 17:15:00,300 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 17:15:00,301 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 17:15:00,301 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 17:15:00,303 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 17:15:00,303 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 17:15:00,304 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 17:15:00,304 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 17:15:00,305 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 17:15:00,306 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 17:15:00,306 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 17:15:00,307 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 17:15:00,308 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 17:15:00,309 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 17:15:00,310 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 17:15:00,310 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 17:15:00,310 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 17:15:00,311 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 17:15:00,311 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 17:15:00,312 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 17:15:00,314 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 17:15:00,315 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:15:00,335 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 17:15:00,339 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 17:15:00,341 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 17:15:00,341 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 17:15:00,341 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 17:15:00,341 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 17:15:00,342 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 17:15:00,342 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 17:15:00,342 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 17:15:00,342 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 17:15:00,342 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 17:15:00,342 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 17:15:00,343 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 17:15:00,343 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 17:15:00,343 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 17:15:00,343 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 17:15:00,343 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 17:15:00,344 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 17:15:00,344 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 17:15:00,344 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 17:15:00,344 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 17:15:00,344 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 17:15:00,345 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 17:15:00,345 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 17:15:00,345 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 17:15:00,345 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 17:15:00,345 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 17:15:00,346 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 17:15:00,346 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:15:00,627 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 17:15:00,638 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 17:15:00,641 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 17:15:00,642 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 17:15:00,643 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 17:15:00,643 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.06.cil-1.c [2019-10-07 17:15:00,700 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a48612d4d/23a8f187b3d44b17a008a840be25ace5/FLAG00369644d [2019-10-07 17:15:01,110 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 17:15:01,111 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.06.cil-1.c [2019-10-07 17:15:01,126 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a48612d4d/23a8f187b3d44b17a008a840be25ace5/FLAG00369644d [2019-10-07 17:15:01,451 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a48612d4d/23a8f187b3d44b17a008a840be25ace5 [2019-10-07 17:15:01,460 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 17:15:01,461 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 17:15:01,462 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 17:15:01,462 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 17:15:01,465 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 17:15:01,466 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 05:15:01" (1/1) ... [2019-10-07 17:15:01,469 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58b77c00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:15:01, skipping insertion in model container [2019-10-07 17:15:01,470 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 05:15:01" (1/1) ... [2019-10-07 17:15:01,477 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 17:15:01,537 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 17:15:01,794 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 17:15:01,801 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 17:15:01,958 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 17:15:01,983 INFO L192 MainTranslator]: Completed translation [2019-10-07 17:15:01,983 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:15:01 WrapperNode [2019-10-07 17:15:01,983 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 17:15:01,984 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 17:15:01,984 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 17:15:01,984 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 17:15:01,996 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:15:01" (1/1) ... [2019-10-07 17:15:01,996 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:15:01" (1/1) ... [2019-10-07 17:15:02,007 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:15:01" (1/1) ... [2019-10-07 17:15:02,007 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:15:01" (1/1) ... [2019-10-07 17:15:02,024 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:15:01" (1/1) ... [2019-10-07 17:15:02,054 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:15:01" (1/1) ... [2019-10-07 17:15:02,065 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:15:01" (1/1) ... [2019-10-07 17:15:02,074 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 17:15:02,075 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 17:15:02,075 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 17:15:02,075 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 17:15:02,076 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:15:01" (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:15:02,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 17:15:02,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 17:15:02,143 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-10-07 17:15:02,143 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2019-10-07 17:15:02,144 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2019-10-07 17:15:02,145 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2019-10-07 17:15:02,145 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit3 [2019-10-07 17:15:02,146 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit4 [2019-10-07 17:15:02,146 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit5 [2019-10-07 17:15:02,146 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit6 [2019-10-07 17:15:02,146 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2019-10-07 17:15:02,147 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2019-10-07 17:15:02,147 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2019-10-07 17:15:02,148 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit3_triggered [2019-10-07 17:15:02,148 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit4_triggered [2019-10-07 17:15:02,148 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit5_triggered [2019-10-07 17:15:02,151 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit6_triggered [2019-10-07 17:15:02,151 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-10-07 17:15:02,151 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-10-07 17:15:02,152 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-10-07 17:15:02,152 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-10-07 17:15:02,152 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-10-07 17:15:02,152 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-10-07 17:15:02,152 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-10-07 17:15:02,152 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-10-07 17:15:02,153 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-10-07 17:15:02,153 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-10-07 17:15:02,153 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-10-07 17:15:02,153 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-10-07 17:15:02,153 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-10-07 17:15:02,153 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 17:15:02,154 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 17:15:02,154 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-10-07 17:15:02,154 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2019-10-07 17:15:02,154 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2019-10-07 17:15:02,154 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2019-10-07 17:15:02,154 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit3_triggered [2019-10-07 17:15:02,154 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit4_triggered [2019-10-07 17:15:02,155 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit5_triggered [2019-10-07 17:15:02,155 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit6_triggered [2019-10-07 17:15:02,155 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-10-07 17:15:02,155 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 17:15:02,155 INFO L130 BoogieDeclarations]: Found specification of procedure master [2019-10-07 17:15:02,155 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2019-10-07 17:15:02,155 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2019-10-07 17:15:02,156 INFO L130 BoogieDeclarations]: Found specification of procedure transmit3 [2019-10-07 17:15:02,156 INFO L130 BoogieDeclarations]: Found specification of procedure transmit4 [2019-10-07 17:15:02,156 INFO L130 BoogieDeclarations]: Found specification of procedure transmit5 [2019-10-07 17:15:02,156 INFO L130 BoogieDeclarations]: Found specification of procedure transmit6 [2019-10-07 17:15:02,156 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-10-07 17:15:02,156 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-10-07 17:15:02,156 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-10-07 17:15:02,157 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-10-07 17:15:02,157 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-10-07 17:15:02,157 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-10-07 17:15:02,157 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-10-07 17:15:02,157 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-10-07 17:15:02,157 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-10-07 17:15:02,157 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-10-07 17:15:02,158 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-10-07 17:15:02,158 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-10-07 17:15:02,158 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 17:15:02,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 17:15:02,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 17:15:03,997 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 17:15:03,997 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-10-07 17:15:03,999 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 05:15:03 BoogieIcfgContainer [2019-10-07 17:15:03,999 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 17:15:04,000 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 17:15:04,001 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 17:15:04,004 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 17:15:04,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 05:15:01" (1/3) ... [2019-10-07 17:15:04,005 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41a49166 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 05:15:04, skipping insertion in model container [2019-10-07 17:15:04,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:15:01" (2/3) ... [2019-10-07 17:15:04,006 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41a49166 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 05:15:04, skipping insertion in model container [2019-10-07 17:15:04,007 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 05:15:03" (3/3) ... [2019-10-07 17:15:04,016 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.06.cil-1.c [2019-10-07 17:15:04,028 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 17:15:04,038 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 17:15:04,050 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 17:15:04,084 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 17:15:04,084 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 17:15:04,084 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 17:15:04,084 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 17:15:04,087 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 17:15:04,088 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 17:15:04,088 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 17:15:04,088 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 17:15:04,123 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-10-07 17:15:04,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-07 17:15:04,134 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:15:04,135 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 17:15:04,137 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:15:04,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:15:04,143 INFO L82 PathProgramCache]: Analyzing trace with hash -158174915, now seen corresponding path program 1 times [2019-10-07 17:15:04,152 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:15:04,152 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:15:04,152 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:15:04,153 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:15:04,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:15:04,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:15:04,595 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:15:04,596 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:15:04,596 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 17:15:04,597 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 17:15:04,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 17:15:04,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 17:15:04,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 17:15:04,623 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 4 states. [2019-10-07 17:15:05,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 17:15:05,237 INFO L93 Difference]: Finished difference Result 555 states and 786 transitions. [2019-10-07 17:15:05,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 17:15:05,239 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-10-07 17:15:05,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 17:15:05,258 INFO L225 Difference]: With dead ends: 555 [2019-10-07 17:15:05,258 INFO L226 Difference]: Without dead ends: 361 [2019-10-07 17:15:05,271 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:15:05,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2019-10-07 17:15:05,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 356. [2019-10-07 17:15:05,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-10-07 17:15:05,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 470 transitions. [2019-10-07 17:15:05,422 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 470 transitions. Word has length 92 [2019-10-07 17:15:05,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 17:15:05,423 INFO L462 AbstractCegarLoop]: Abstraction has 356 states and 470 transitions. [2019-10-07 17:15:05,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 17:15:05,425 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 470 transitions. [2019-10-07 17:15:05,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-07 17:15:05,430 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:15:05,430 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 17:15:05,430 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:15:05,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:15:05,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1661551004, now seen corresponding path program 1 times [2019-10-07 17:15:05,431 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:15:05,431 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:15:05,432 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:15:05,432 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:15:05,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:15:05,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:15:05,582 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:15:05,583 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:15:05,583 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 17:15:05,583 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 17:15:05,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 17:15:05,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 17:15:05,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 17:15:05,587 INFO L87 Difference]: Start difference. First operand 356 states and 470 transitions. Second operand 4 states. [2019-10-07 17:15:05,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 17:15:05,985 INFO L93 Difference]: Finished difference Result 1027 states and 1436 transitions. [2019-10-07 17:15:05,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 17:15:05,986 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-10-07 17:15:05,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 17:15:05,992 INFO L225 Difference]: With dead ends: 1027 [2019-10-07 17:15:05,992 INFO L226 Difference]: Without dead ends: 687 [2019-10-07 17:15:05,995 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:15:05,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2019-10-07 17:15:06,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 681. [2019-10-07 17:15:06,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 681 states. [2019-10-07 17:15:06,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 897 transitions. [2019-10-07 17:15:06,042 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 897 transitions. Word has length 92 [2019-10-07 17:15:06,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 17:15:06,042 INFO L462 AbstractCegarLoop]: Abstraction has 681 states and 897 transitions. [2019-10-07 17:15:06,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 17:15:06,043 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 897 transitions. [2019-10-07 17:15:06,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-07 17:15:06,045 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:15:06,045 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 17:15:06,045 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:15:06,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:15:06,046 INFO L82 PathProgramCache]: Analyzing trace with hash 553422365, now seen corresponding path program 1 times [2019-10-07 17:15:06,046 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:15:06,046 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:15:06,046 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:15:06,046 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:15:06,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:15:06,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:15:06,164 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:15:06,164 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:15:06,164 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 17:15:06,165 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 17:15:06,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 17:15:06,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 17:15:06,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 17:15:06,167 INFO L87 Difference]: Start difference. First operand 681 states and 897 transitions. Second operand 4 states. [2019-10-07 17:15:06,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 17:15:06,567 INFO L93 Difference]: Finished difference Result 1994 states and 2783 transitions. [2019-10-07 17:15:06,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 17:15:06,567 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-10-07 17:15:06,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 17:15:06,581 INFO L225 Difference]: With dead ends: 1994 [2019-10-07 17:15:06,581 INFO L226 Difference]: Without dead ends: 1329 [2019-10-07 17:15:06,585 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:15:06,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1329 states. [2019-10-07 17:15:06,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1329 to 1321. [2019-10-07 17:15:06,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1321 states. [2019-10-07 17:15:06,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1321 states and 1735 transitions. [2019-10-07 17:15:06,715 INFO L78 Accepts]: Start accepts. Automaton has 1321 states and 1735 transitions. Word has length 92 [2019-10-07 17:15:06,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 17:15:06,716 INFO L462 AbstractCegarLoop]: Abstraction has 1321 states and 1735 transitions. [2019-10-07 17:15:06,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 17:15:06,716 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 1735 transitions. [2019-10-07 17:15:06,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-07 17:15:06,723 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:15:06,723 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 17:15:06,723 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:15:06,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:15:06,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1986257084, now seen corresponding path program 1 times [2019-10-07 17:15:06,724 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:15:06,724 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:15:06,724 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:15:06,724 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:15:06,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:15:06,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:15:06,847 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:15:06,847 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:15:06,848 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 17:15:06,848 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 17:15:06,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 17:15:06,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 17:15:06,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 17:15:06,850 INFO L87 Difference]: Start difference. First operand 1321 states and 1735 transitions. Second operand 4 states. [2019-10-07 17:15:07,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 17:15:07,318 INFO L93 Difference]: Finished difference Result 3898 states and 5439 transitions. [2019-10-07 17:15:07,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 17:15:07,318 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-10-07 17:15:07,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 17:15:07,379 INFO L225 Difference]: With dead ends: 3898 [2019-10-07 17:15:07,379 INFO L226 Difference]: Without dead ends: 2593 [2019-10-07 17:15:07,389 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:15:07,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2593 states. [2019-10-07 17:15:07,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2593 to 2581. [2019-10-07 17:15:07,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2581 states. [2019-10-07 17:15:07,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2581 states to 2581 states and 3385 transitions. [2019-10-07 17:15:07,573 INFO L78 Accepts]: Start accepts. Automaton has 2581 states and 3385 transitions. Word has length 92 [2019-10-07 17:15:07,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 17:15:07,574 INFO L462 AbstractCegarLoop]: Abstraction has 2581 states and 3385 transitions. [2019-10-07 17:15:07,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 17:15:07,574 INFO L276 IsEmpty]: Start isEmpty. Operand 2581 states and 3385 transitions. [2019-10-07 17:15:07,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-07 17:15:07,581 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:15:07,581 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 17:15:07,582 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:15:07,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:15:07,582 INFO L82 PathProgramCache]: Analyzing trace with hash 313739453, now seen corresponding path program 1 times [2019-10-07 17:15:07,582 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:15:07,582 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:15:07,583 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:15:07,583 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:15:07,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:15:07,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:15:07,675 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:15:07,675 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:15:07,676 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 17:15:07,676 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 17:15:07,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 17:15:07,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 17:15:07,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 17:15:07,678 INFO L87 Difference]: Start difference. First operand 2581 states and 3385 transitions. Second operand 3 states. [2019-10-07 17:15:08,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 17:15:08,003 INFO L93 Difference]: Finished difference Result 7594 states and 10709 transitions. [2019-10-07 17:15:08,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 17:15:08,003 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2019-10-07 17:15:08,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 17:15:08,053 INFO L225 Difference]: With dead ends: 7594 [2019-10-07 17:15:08,054 INFO L226 Difference]: Without dead ends: 5029 [2019-10-07 17:15:08,074 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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:15:08,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5029 states. [2019-10-07 17:15:08,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5029 to 5013. [2019-10-07 17:15:08,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5013 states. [2019-10-07 17:15:08,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5013 states to 5013 states and 6892 transitions. [2019-10-07 17:15:08,410 INFO L78 Accepts]: Start accepts. Automaton has 5013 states and 6892 transitions. Word has length 92 [2019-10-07 17:15:08,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 17:15:08,411 INFO L462 AbstractCegarLoop]: Abstraction has 5013 states and 6892 transitions. [2019-10-07 17:15:08,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 17:15:08,420 INFO L276 IsEmpty]: Start isEmpty. Operand 5013 states and 6892 transitions. [2019-10-07 17:15:08,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-10-07 17:15:08,431 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:15:08,431 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, 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] [2019-10-07 17:15:08,431 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:15:08,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:15:08,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1840732258, now seen corresponding path program 1 times [2019-10-07 17:15:08,432 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:15:08,433 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:15:08,433 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:15:08,433 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:15:08,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:15:08,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:15:08,559 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-10-07 17:15:08,560 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:15:08,560 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 17:15:08,560 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 17:15:08,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 17:15:08,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 17:15:08,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 17:15:08,562 INFO L87 Difference]: Start difference. First operand 5013 states and 6892 transitions. Second operand 4 states. [2019-10-07 17:15:09,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 17:15:09,198 INFO L93 Difference]: Finished difference Result 13417 states and 19773 transitions. [2019-10-07 17:15:09,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 17:15:09,198 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 168 [2019-10-07 17:15:09,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 17:15:09,283 INFO L225 Difference]: With dead ends: 13417 [2019-10-07 17:15:09,284 INFO L226 Difference]: Without dead ends: 8421 [2019-10-07 17:15:09,328 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:15:09,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8421 states. [2019-10-07 17:15:09,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8421 to 7423. [2019-10-07 17:15:09,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7423 states. [2019-10-07 17:15:10,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7423 states to 7423 states and 10809 transitions. [2019-10-07 17:15:10,027 INFO L78 Accepts]: Start accepts. Automaton has 7423 states and 10809 transitions. Word has length 168 [2019-10-07 17:15:10,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 17:15:10,028 INFO L462 AbstractCegarLoop]: Abstraction has 7423 states and 10809 transitions. [2019-10-07 17:15:10,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 17:15:10,028 INFO L276 IsEmpty]: Start isEmpty. Operand 7423 states and 10809 transitions. [2019-10-07 17:15:10,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-10-07 17:15:10,061 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:15:10,062 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:10,062 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:15:10,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:15:10,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1640947664, now seen corresponding path program 1 times [2019-10-07 17:15:10,063 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:15:10,063 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:15:10,064 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:15:10,064 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:15:10,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:15:10,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:15:10,319 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2019-10-07 17:15:10,319 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:15:10,320 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 17:15:10,320 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:15:10,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:15:10,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 1558 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-07 17:15:10,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 17:15:10,682 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-10-07 17:15:10,682 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 17:15:11,097 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2019-10-07 17:15:11,097 INFO L211 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-07 17:15:11,098 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [5] total 6 [2019-10-07 17:15:11,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 17:15:11,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 17:15:11,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-07 17:15:11,099 INFO L87 Difference]: Start difference. First operand 7423 states and 10809 transitions. Second operand 4 states. [2019-10-07 17:15:12,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 17:15:12,341 INFO L93 Difference]: Finished difference Result 21996 states and 35516 transitions. [2019-10-07 17:15:12,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 17:15:12,342 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 230 [2019-10-07 17:15:12,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 17:15:12,442 INFO L225 Difference]: With dead ends: 21996 [2019-10-07 17:15:12,442 INFO L226 Difference]: Without dead ends: 14589 [2019-10-07 17:15:12,555 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 461 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:15:12,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14589 states. [2019-10-07 17:15:14,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14589 to 14447. [2019-10-07 17:15:14,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14447 states. [2019-10-07 17:15:14,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14447 states to 14447 states and 21173 transitions. [2019-10-07 17:15:14,319 INFO L78 Accepts]: Start accepts. Automaton has 14447 states and 21173 transitions. Word has length 230 [2019-10-07 17:15:14,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 17:15:14,320 INFO L462 AbstractCegarLoop]: Abstraction has 14447 states and 21173 transitions. [2019-10-07 17:15:14,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 17:15:14,320 INFO L276 IsEmpty]: Start isEmpty. Operand 14447 states and 21173 transitions. [2019-10-07 17:15:14,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-10-07 17:15:14,375 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:15:14,376 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:14,583 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 17:15:14,584 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:15:14,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:15:14,584 INFO L82 PathProgramCache]: Analyzing trace with hash 995342055, now seen corresponding path program 1 times [2019-10-07 17:15:14,584 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:15:14,585 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:15:14,585 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:15:14,585 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:15:14,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:15:14,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:15:14,758 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 9 proven. 18 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2019-10-07 17:15:14,758 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:15:14,759 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 17:15:14,759 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:15:15,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:15:15,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 1558 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-07 17:15:15,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 17:15:15,095 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-10-07 17:15:15,095 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 17:15:15,529 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-10-07 17:15:15,529 INFO L211 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-07 17:15:15,530 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [5] total 6 [2019-10-07 17:15:15,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 17:15:15,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 17:15:15,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-07 17:15:15,533 INFO L87 Difference]: Start difference. First operand 14447 states and 21173 transitions. Second operand 4 states. [2019-10-07 17:15:17,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 17:15:17,352 INFO L93 Difference]: Finished difference Result 42827 states and 70668 transitions. [2019-10-07 17:15:17,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 17:15:17,353 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 230 [2019-10-07 17:15:17,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 17:15:17,524 INFO L225 Difference]: With dead ends: 42827 [2019-10-07 17:15:17,524 INFO L226 Difference]: Without dead ends: 28396 [2019-10-07 17:15:17,690 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 461 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:15:17,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28396 states. [2019-10-07 17:15:19,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28396 to 28126. [2019-10-07 17:15:19,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28126 states. [2019-10-07 17:15:19,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28126 states to 28126 states and 41971 transitions. [2019-10-07 17:15:19,608 INFO L78 Accepts]: Start accepts. Automaton has 28126 states and 41971 transitions. Word has length 230 [2019-10-07 17:15:19,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 17:15:19,609 INFO L462 AbstractCegarLoop]: Abstraction has 28126 states and 41971 transitions. [2019-10-07 17:15:19,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 17:15:19,610 INFO L276 IsEmpty]: Start isEmpty. Operand 28126 states and 41971 transitions. [2019-10-07 17:15:19,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-10-07 17:15:19,791 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:15:19,791 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 17:15:20,004 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 17:15:20,005 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:15:20,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:15:20,006 INFO L82 PathProgramCache]: Analyzing trace with hash -527420944, now seen corresponding path program 1 times [2019-10-07 17:15:20,006 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:15:20,006 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:15:20,007 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:15:20,007 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:15:20,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:15:20,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:15:21,176 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 21 proven. 9 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2019-10-07 17:15:21,177 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:15:21,177 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 17:15:21,177 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:15:21,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:15:21,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 1638 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-07 17:15:21,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 17:15:21,502 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-10-07 17:15:21,502 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 17:15:21,762 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 27 proven. 1 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2019-10-07 17:15:21,762 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-07 17:15:21,762 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8, 3] total 10 [2019-10-07 17:15:21,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 17:15:21,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 17:15:21,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-10-07 17:15:21,765 INFO L87 Difference]: Start difference. First operand 28126 states and 41971 transitions. Second operand 3 states. [2019-10-07 17:15:24,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 17:15:24,248 INFO L93 Difference]: Finished difference Result 53541 states and 83204 transitions. [2019-10-07 17:15:24,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 17:15:24,249 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 248 [2019-10-07 17:15:24,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 17:15:24,511 INFO L225 Difference]: With dead ends: 53541 [2019-10-07 17:15:24,512 INFO L226 Difference]: Without dead ends: 39505 [2019-10-07 17:15:24,698 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 503 GetRequests, 495 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-10-07 17:15:24,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39505 states. [2019-10-07 17:15:27,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39505 to 33138. [2019-10-07 17:15:27,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33138 states. [2019-10-07 17:15:27,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33138 states to 33138 states and 49725 transitions. [2019-10-07 17:15:27,871 INFO L78 Accepts]: Start accepts. Automaton has 33138 states and 49725 transitions. Word has length 248 [2019-10-07 17:15:27,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 17:15:27,873 INFO L462 AbstractCegarLoop]: Abstraction has 33138 states and 49725 transitions. [2019-10-07 17:15:27,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 17:15:27,874 INFO L276 IsEmpty]: Start isEmpty. Operand 33138 states and 49725 transitions. [2019-10-07 17:15:28,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2019-10-07 17:15:28,111 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:15:28,111 INFO L385 BasicCegarLoop]: trace histogram [6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 17:15:28,317 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 17:15:28,317 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:15:28,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:15:28,318 INFO L82 PathProgramCache]: Analyzing trace with hash -532704514, now seen corresponding path program 1 times [2019-10-07 17:15:28,319 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:15:28,319 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:15:28,319 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:15:28,320 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:15:28,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:15:28,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:15:30,014 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 54 proven. 39 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2019-10-07 17:15:30,015 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:15:30,015 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 17:15:30,015 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:15:30,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:15:30,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 2158 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-07 17:15:30,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 17:15:30,584 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 190 proven. 0 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2019-10-07 17:15:30,585 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 17:15:30,987 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2019-10-07 17:15:30,987 INFO L211 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-07 17:15:30,988 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [7] total 9 [2019-10-07 17:15:30,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 17:15:30,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 17:15:30,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-07 17:15:30,990 INFO L87 Difference]: Start difference. First operand 33138 states and 49725 transitions. Second operand 4 states. [2019-10-07 17:15:32,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 17:15:32,710 INFO L93 Difference]: Finished difference Result 56832 states and 86261 transitions. [2019-10-07 17:15:32,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 17:15:32,710 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 341 [2019-10-07 17:15:32,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 17:15:32,915 INFO L225 Difference]: With dead ends: 56832 [2019-10-07 17:15:32,916 INFO L226 Difference]: Without dead ends: 40492 [2019-10-07 17:15:33,250 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 695 GetRequests, 682 SyntacticMatches, 6 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-07 17:15:33,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40492 states. [2019-10-07 17:15:35,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40492 to 40492. [2019-10-07 17:15:35,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40492 states. [2019-10-07 17:15:35,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40492 states to 40492 states and 57526 transitions. [2019-10-07 17:15:35,766 INFO L78 Accepts]: Start accepts. Automaton has 40492 states and 57526 transitions. Word has length 341 [2019-10-07 17:15:35,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 17:15:35,767 INFO L462 AbstractCegarLoop]: Abstraction has 40492 states and 57526 transitions. [2019-10-07 17:15:35,767 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 17:15:35,767 INFO L276 IsEmpty]: Start isEmpty. Operand 40492 states and 57526 transitions. [2019-10-07 17:15:35,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-10-07 17:15:35,903 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:15:35,904 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 17:15:36,109 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 17:15:36,109 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:15:36,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:15:36,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1310481245, now seen corresponding path program 1 times [2019-10-07 17:15:36,111 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:15:36,111 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:15:36,111 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:15:36,112 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:15:36,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:15:36,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:15:36,381 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 29 proven. 9 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2019-10-07 17:15:36,382 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:15:36,382 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 17:15:36,383 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:15:37,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:15:37,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 1648 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-07 17:15:37,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 17:15:37,372 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-10-07 17:15:37,373 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 17:15:37,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:15:37,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:15:37,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:15:37,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:15:37,778 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 15 proven. 32 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2019-10-07 17:15:37,779 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-07 17:15:37,779 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [7, 7] total 17 [2019-10-07 17:15:37,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-07 17:15:37,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-07 17:15:37,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2019-10-07 17:15:37,783 INFO L87 Difference]: Start difference. First operand 40492 states and 57526 transitions. Second operand 9 states. [2019-10-07 17:15:44,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 17:15:44,237 INFO L93 Difference]: Finished difference Result 112884 states and 186517 transitions. [2019-10-07 17:15:44,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-07 17:15:44,238 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 249 [2019-10-07 17:15:44,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 17:15:44,576 INFO L225 Difference]: With dead ends: 112884 [2019-10-07 17:15:44,577 INFO L226 Difference]: Without dead ends: 72409 [2019-10-07 17:15:44,926 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 517 GetRequests, 493 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=142, Invalid=508, Unknown=0, NotChecked=0, Total=650 [2019-10-07 17:15:44,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72409 states. [2019-10-07 17:15:51,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72409 to 70965. [2019-10-07 17:15:51,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70965 states. [2019-10-07 17:15:51,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70965 states to 70965 states and 113058 transitions. [2019-10-07 17:15:51,941 INFO L78 Accepts]: Start accepts. Automaton has 70965 states and 113058 transitions. Word has length 249 [2019-10-07 17:15:51,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 17:15:51,941 INFO L462 AbstractCegarLoop]: Abstraction has 70965 states and 113058 transitions. [2019-10-07 17:15:51,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-07 17:15:51,942 INFO L276 IsEmpty]: Start isEmpty. Operand 70965 states and 113058 transitions. [2019-10-07 17:15:52,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2019-10-07 17:15:52,354 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:15:52,354 INFO L385 BasicCegarLoop]: trace histogram [6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 17:15:52,559 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 17:15:52,559 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:15:52,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:15:52,560 INFO L82 PathProgramCache]: Analyzing trace with hash 198784880, now seen corresponding path program 1 times [2019-10-07 17:15:52,560 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:15:52,560 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:15:52,560 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:15:52,560 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:15:52,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:15:53,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:15:53,290 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 34 proven. 13 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2019-10-07 17:15:53,290 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:15:53,290 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 17:15:53,291 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:15:53,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:15:53,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 2107 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-07 17:15:53,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 17:15:53,802 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 317 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2019-10-07 17:15:53,803 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 17:15:54,190 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 48 proven. 6 refuted. 0 times theorem prover too weak. 331 trivial. 0 not checked. [2019-10-07 17:15:54,190 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-07 17:15:54,191 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10, 4] total 15 [2019-10-07 17:15:54,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 17:15:54,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 17:15:54,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2019-10-07 17:15:54,192 INFO L87 Difference]: Start difference. First operand 70965 states and 113058 transitions. Second operand 6 states. [2019-10-07 17:16:00,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 17:16:00,294 INFO L93 Difference]: Finished difference Result 115679 states and 191313 transitions. [2019-10-07 17:16:00,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-07 17:16:00,294 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 338 [2019-10-07 17:16:00,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 17:16:00,671 INFO L225 Difference]: With dead ends: 115679 [2019-10-07 17:16:00,671 INFO L226 Difference]: Without dead ends: 77255 [2019-10-07 17:16:01,538 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 692 GetRequests, 676 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2019-10-07 17:16:01,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77255 states. [2019-10-07 17:16:04,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77255 to 77255. [2019-10-07 17:16:04,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77255 states. [2019-10-07 17:16:05,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77255 states to 77255 states and 119582 transitions. [2019-10-07 17:16:05,710 INFO L78 Accepts]: Start accepts. Automaton has 77255 states and 119582 transitions. Word has length 338 [2019-10-07 17:16:05,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 17:16:05,711 INFO L462 AbstractCegarLoop]: Abstraction has 77255 states and 119582 transitions. [2019-10-07 17:16:05,711 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 17:16:05,711 INFO L276 IsEmpty]: Start isEmpty. Operand 77255 states and 119582 transitions. [2019-10-07 17:16:06,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2019-10-07 17:16:06,114 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:16:06,115 INFO L385 BasicCegarLoop]: trace histogram [6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 17:16:06,316 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 17:16:06,316 INFO L410 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:16:06,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:16:06,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1254029008, now seen corresponding path program 1 times [2019-10-07 17:16:06,318 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:16:06,318 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:16:06,318 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:16:06,318 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:16:06,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:16:06,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:16:06,637 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 34 proven. 13 refuted. 0 times theorem prover too weak. 344 trivial. 0 not checked. [2019-10-07 17:16:06,637 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:16:06,637 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 17:16:06,638 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:16:07,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:16:07,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 2104 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-07 17:16:07,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 17:16:07,266 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 207 proven. 4 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-10-07 17:16:07,266 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 17:16:10,174 WARN L191 SmtUtils]: Spent 2.83 s on a formula simplification that was a NOOP. DAG size: 1 [2019-10-07 17:16:10,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:16:10,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:16:10,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:16:10,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:16:10,566 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 36 proven. 48 refuted. 0 times theorem prover too weak. 307 trivial. 0 not checked. [2019-10-07 17:16:10,567 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 17:16:10,597 INFO L162 IcfgInterpreter]: Started Sifa with 136 locations of interest [2019-10-07 17:16:10,597 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 17:16:10,604 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 17:16:10,615 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 17:16:10,615 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 17:16:11,211 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 112 for LOIs [2019-10-07 17:16:11,289 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 183 for LOIs [2019-10-07 17:16:11,527 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 299 [2019-10-07 17:16:11,800 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 299 [2019-10-07 17:16:12,251 WARN L191 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 300 [2019-10-07 17:16:12,581 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 300 [2019-10-07 17:16:12,853 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 300 [2019-10-07 17:16:12,874 INFO L199 IcfgInterpreter]: Interpreting procedure init_model with input of size 107 for LOIs [2019-10-07 17:16:13,030 INFO L199 IcfgInterpreter]: Interpreting procedure start_simulation with input of size 190 for LOIs [2019-10-07 17:16:18,249 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2019-10-07 17:16:18,293 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2019-10-07 17:16:18,944 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 14 [2019-10-07 17:16:19,128 WARN L177 XnfTransformerHelper]: Simplifying disjunction of 16384 conjuctions. This might take some time... [2019-10-07 17:16:48,528 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 14 [2019-10-07 17:16:48,615 WARN L177 XnfTransformerHelper]: Simplifying disjunction of 16384 conjuctions. This might take some time... [2019-10-07 17:17:16,802 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 17:17:16,804 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:16,809 INFO L168 Benchmark]: Toolchain (without parser) took 135348.24 ms. Allocated memory was 145.8 MB in the beginning and 3.4 GB in the end (delta: 3.3 GB). Free memory was 102.0 MB in the beginning and 2.7 GB in the end (delta: -2.6 GB). Peak memory consumption was 694.8 MB. Max. memory is 7.1 GB. [2019-10-07 17:17:16,810 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 145.8 MB. Free memory is still 120.5 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-10-07 17:17:16,811 INFO L168 Benchmark]: CACSL2BoogieTranslator took 521.92 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 101.5 MB in the beginning and 176.8 MB in the end (delta: -75.3 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. [2019-10-07 17:17:16,812 INFO L168 Benchmark]: Boogie Preprocessor took 90.60 ms. Allocated memory is still 203.4 MB. Free memory was 176.8 MB in the beginning and 173.6 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2019-10-07 17:17:16,813 INFO L168 Benchmark]: RCFGBuilder took 1924.13 ms. Allocated memory was 203.4 MB in the beginning and 234.4 MB in the end (delta: 30.9 MB). Free memory was 173.6 MB in the beginning and 135.0 MB in the end (delta: 38.6 MB). Peak memory consumption was 86.9 MB. Max. memory is 7.1 GB. [2019-10-07 17:17:16,814 INFO L168 Benchmark]: TraceAbstraction took 132807.29 ms. Allocated memory was 234.4 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 135.0 MB in the beginning and 2.7 GB in the end (delta: -2.5 GB). Peak memory consumption was 639.2 MB. Max. memory is 7.1 GB. [2019-10-07 17:17:16,818 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 145.8 MB. Free memory is still 120.5 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 521.92 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 101.5 MB in the beginning and 176.8 MB in the end (delta: -75.3 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 90.60 ms. Allocated memory is still 203.4 MB. Free memory was 176.8 MB in the beginning and 173.6 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1924.13 ms. Allocated memory was 203.4 MB in the beginning and 234.4 MB in the end (delta: 30.9 MB). Free memory was 173.6 MB in the beginning and 135.0 MB in the end (delta: 38.6 MB). Peak memory consumption was 86.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 132807.29 ms. Allocated memory was 234.4 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 135.0 MB in the beginning and 2.7 GB in the end (delta: -2.5 GB). Peak memory consumption was 639.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...